A fast constructive algorithm for fixed channel assignment problem
With limited frequency spectrum and an increasing demand for mobile communication services, the problem of channel assignment becomes increasingly important. It has been shown that this problem is equivalent to the graph-coloring problem, which is an NP-hard problem. In this work, a fast constructiv...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | article |
| منشور في: |
2001
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/14165/1/14165_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14165/2/14165_2.doc |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | With limited frequency spectrum and an increasing demand for mobile communication services, the problem of channel assignment becomes increasingly important. It has been shown that this problem is equivalent to the graph-coloring problem, which is an NP-hard problem. In this work, a fast constructive algorithm is introduced to solve the problem. The objective of the algorithm is to obtain a conflict free channel assignment to cells which satisfies traffic demand requirements. The algorithm was tested on several benchmark problems, and conflict free results were obtained a within one second. Moreover, the quality of solution obtained was always same or better than the other reported techniques |
|---|