(2001) A Fast Constructive Algorithm For Fixed Channel Assignment Problem. In: IEEE 2001 International Symposium on Circuits and Systems, Sydney, Australia.
|
PDF
Khan_ISCAS_May2001.pdf Download (471kB) | Preview |
Abstract
With limited frequency spectrum and an increasing demand for mobile communication services, the problem of channel assignment becoems increasingly important. It has been shown that this problem is equivalent to the graph coloring problem, which is an NP-hard problem [1]. 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 benchmarks problem, and conflict free results were obtained within one second. More, the quality of solution obtained was always same or better than the other reported techniques.
| Item Type: | Conference or Workshop Item (Other) |
|---|---|
| Subjects: | Computer |
| Department: | College of Computing and Mathematics > Computer Engineering |
| Depositing User: | AbdulRahman |
| Date Deposited: | 25 Feb 2008 12:42 |
| Last Modified: | 01 Nov 2019 13:22 |
| URI: | http://eprints.kfupm.edu.sa/id/eprint/114 |