(2001) A fast constructive algorithm for fixed channel assignment problem. Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on, 5.

Preview	PDF 14165_1.pdf Download (18kB) | Preview
	Microsoft Word 14165_2.doc Download (26kB)

Abstract

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

Item Type:	Article
Subjects:	Computer
Department:	College of Computing and Mathematics > Computer Engineering
Depositing User:	Mr. Admin Admin
Date Deposited:	24 Jun 2008 13:25
Last Modified:	01 Nov 2019 14:04
URI:	http://eprints.kfupm.edu.sa/id/eprint/14165