A fast constructive algorithm for fixed channel assignment problem

Junaid A. Khan; Sadiq M. Sait; Salman A. Khan

doi:10.1109/iscas.2001.921986

A fast constructive algorithm for fixed channel assignment problem

Junaid A. Khan
, Sadiq M. Sait
, Salman A. Khan

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

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.

Original language	English
Title of host publication	ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings
Publisher	IEEE Computer Society
Pages	65-68
Number of pages	4
ISBN (Print)	0780366859, 9780780366855
DOIs	https://doi.org/10.1109/iscas.2001.921986
State	Published - 2001

Publication series

Name	ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings
Volume	5

ASJC Scopus subject areas

Electrical and Electronic Engineering
Hardware and Architecture
Electronic, Optical and Magnetic Materials

Access to Document

10.1109/iscas.2001.921986

Cite this

Khan, J. A., Sait, S. M., & Khan, S. A. (2001). A fast constructive algorithm for fixed channel assignment problem. In ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings (pp. 65-68). Article 921986 (ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings; Vol. 5). IEEE Computer Society. https://doi.org/10.1109/iscas.2001.921986

@inproceedings{c27c7ab710344cefab1558f2528f730f,

title = "A fast constructive algorithm for fixed channel assignment problem",

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

author = "Khan, \{Junaid A.\} and Sait, \{Sadiq M.\} and Khan, \{Salman A.\}",

year = "2001",

doi = "10.1109/iscas.2001.921986",

language = "English",

isbn = "0780366859",

series = "ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings",

publisher = "IEEE Computer Society",

pages = "65--68",

booktitle = "ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings",

address = "United States",

}

Khan, JA, Sait, SM & Khan, SA 2001, A fast constructive algorithm for fixed channel assignment problem. in ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings., 921986, ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings, vol. 5, IEEE Computer Society, pp. 65-68. https://doi.org/10.1109/iscas.2001.921986

A fast constructive algorithm for fixed channel assignment problem. / Khan, Junaid A.; Sait, Sadiq M.; Khan, Salman A.
ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings. IEEE Computer Society, 2001. p. 65-68 921986 (ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings; Vol. 5).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A fast constructive algorithm for fixed channel assignment problem

AU - Khan, Junaid A.

AU - Sait, Sadiq M.

AU - Khan, Salman A.

PY - 2001

Y1 - 2001

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

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

UR - https://www.scopus.com/pages/publications/0034996601

U2 - 10.1109/iscas.2001.921986

DO - 10.1109/iscas.2001.921986

M3 - Conference contribution

AN - SCOPUS:0034996601

SN - 0780366859

SN - 9780780366855

T3 - ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings

SP - 65

EP - 68

BT - ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings

PB - IEEE Computer Society

ER -

A fast constructive algorithm for fixed channel assignment problem

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this