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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2001 IEEE International Symposium on Circuits and Systems Ročník 5; s. 65 - 68 vol. 5
Hlavní autori: Khan, J.A., Sait, S.M., Khan, S.A.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 2001
Predmet:
Benchmark testing
Cellular phones
Electromagnetic compatibility
Frequency domain analysis
Minerals
Mobile communication
NP-hard problem
Petroleum
Utility programs
ISBN:9780780366855, 0780366859
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISBN:9780780366855
0780366859
DOI:10.1109/ISCAS.2001.921986