KFUPM ePrints

A Fast Constructive Algorithm For Fixed Channel Assignment Problem

Khan, Junaid A. and Sait, Sadiq M. and Khan, Salman (2001) A Fast Constructive Algorithm For Fixed Channel Assignment Problem. In: IEEE 2001 International Symposium on Circuits and Systems, Sydney, Australia.

[img]
Preview
PDF
460Kb

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)
Date:May 2001
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Khan, Junaid A. and Sait, Sadiq M. and Khan, Salman
Email:UNSPECIFIED, sadiq@kfupm.edu.sa, UNSPECIFIED
ID Code:114
Deposited By:AbdulRahman
Deposited On:25 Feb 2008 15:42
Last Modified:12 Apr 2011 13:06

Repository Staff Only: item control page