KFUPM ePrints

A fast constructive algorithm for fixed channel assignment problem

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

[img]
Preview
PDF
18Kb
[img]Microsoft Word
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
Date:2001
Date Type:Publication
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Khan, J.A. and Sait, Sadiq M. and Khan, S.A.
Email:UNSPECIFIED, sadiq@kfupm.edu.sa, UNSPECIFIED
ID Code:14165
Deposited By:KFUPM ePrints Admin
Deposited On:24 Jun 2008 16:25
Last Modified:12 Apr 2011 13:14

Repository Staff Only: item control page