A fast constructive algorithm for fixed channel assignment problem

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

Full description

Saved in:
Bibliographic Details
Published in:2001 IEEE International Symposium on Circuits and Systems Vol. 5; pp. 65 - 68 vol. 5
Main Authors: Khan, J.A., Sait, S.M., Khan, S.A.
Format: Conference Proceeding
Language:English
Published: IEEE 2001
Subjects:
Benchmark testing
Cellular phones
Electromagnetic compatibility
Frequency domain analysis
Minerals
Mobile communication
NP-hard problem
Petroleum
Utility programs
ISBN:9780780366855, 0780366859
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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.
AbstractList 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, J.A.
Khan, S.A.
Sait, S.M.
Author_xml – sequence: 1
  givenname: J.A.
  surname: Khan
  fullname: Khan, J.A.
  organization: King Fahd Univ. of Pet. & Miner., Dhahran, Saudi Arabia
– sequence: 2
  givenname: S.M.
  surname: Sait
  fullname: Sait, S.M.
– sequence: 3
  givenname: S.A.
  surname: Khan
  fullname: Khan, S.A.
BookMark eNotj8tKAzEYRgMqqHUeQFd5ganJ5DLJchy0Fgou2n3J5U8bmcmUZBR9ewv148DZHfju0XWaEiD0SMmSUqKf19u-2y4bQuhSN1QreYUq3SpyhkmphLhFVSmf5DwuOOfsDr10OJgyYzelMucvN8dvwGY4TDnOxxGHKeMQf8BjdzQpwYBNKfGQRkgzPuXJDjA-oJtghgLVvxdo9_a669_rzcdq3XebOqp2rp0B3zJhwDjNuRSNtpJRryhriCCutc457kIA64W0itjASCCeOK9bD5qxBXq6ZCMA7E85jib_7i8_2R8UQEwH
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ISCAS.2001.921986
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EndPage 68 vol. 5
ExternalDocumentID 921986
GroupedDBID 6IE
6IH
6IK
6IL
AAJGR
AAVQY
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-i87t-caed735aeac9446529b631d8132050c7bccc4cffebd56b80bf30f0d0cd97de933
IEDL.DBID RIE
ISBN 9780780366855
0780366859
IngestDate Tue Aug 26 18:56:38 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i87t-caed735aeac9446529b631d8132050c7bccc4cffebd56b80bf30f0d0cd97de933
ParticipantIDs ieee_primary_921986
PublicationCentury 2000
PublicationDate 20010000
PublicationDateYYYYMMDD 2001-01-01
PublicationDate_xml – year: 2001
  text: 20010000
PublicationDecade 2000
PublicationTitle 2001 IEEE International Symposium on Circuits and Systems
PublicationTitleAbbrev ISCAS
PublicationYear 2001
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000454443
Score 1.2957652
Snippet With limited frequency spectrum and an increasing demand for mobile communication services, the problem of channel assignment becomes increasingly important....
SourceID ieee
SourceType Publisher
StartPage 65
SubjectTerms Benchmark testing
Cellular phones
Electromagnetic compatibility
Frequency domain analysis
Minerals
Mobile communication
NP-hard problem
Petroleum
Utility programs
Title A fast constructive algorithm for fixed channel assignment problem
URI https://ieeexplore.ieee.org/document/921986
Volume 5
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ07a8MwEMdFEzp06iulbzR0deKXXmMaGlooIZAM2YIep9SQOiVxQz9-JdlJKXQpeLA9GB9CutPp_r9D6MF51Vi7sCLSjIgol5RGykM_tRIEiKRMqUDXf2WjEZ_NxLjhbActDACE4jPo-ttwlm9W-tOnynrCTS9OW6jFGK2lWvt0iifJ5XkWNubcrcqUE9HwdXbPpDnUTGLRe5kM-hO_O0y69Ud_NVcJvmV4_K-_OkGdH40eHu-9zyk6gPIcPfaxlZsK69UODLsFLJeL1bqo3t6xC1CxLb7AYK_3LWGJXehcLEJBAG5ay3TQdPg0HTxHTZeEqOCsirQEwzIi3QIqPPwsFYpmieFeGk3cMCitda6tBWUIVTxWNottbGJtBDMgsuwCtctVCZcIh5SohSRNE5knHtttFU9NzEHYWBh5hc689fOPmoMxrw2__vPtDTqqq7X8dYvazma4Q4d6WxWb9X0Yu28zMJiM
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PS8MwFMeDTkFP_pr42xy8dkt_pE2OcygbzjHYDruNJnmZhdnKVod_vknaTQQvQg9tD6WPkLyXl_f9PIQejFcl0oQVnkwo96I0jj1hoZ9ScAo0jRMhHF1_kAyHbDrlo5qz7bQwAOCKz6Blb91Zvirkp02VtbmZXizeRXs0igJSibW2CRXLkoui0G3NmVmXY0Z5TdjZPNP6WNMnvN0fdztjuz_0W9Vnf7VXcd7l-ehf_3WMmj8qPTza-p8TtAP5GXrsYJ2uSiyLDRp2DThdzItlVr69YxOiYp19gcJW8ZvDApvgOZu7kgBcN5dposnz06Tb8-o-CV7GktKTKagkpKlZQrnFnwVcxKGvmBVHUzMQQkoZSa1BKBoLRoQOiSaKSMUTBTwMz1EjL3K4QNglRTX4QeCnkW_B3VqwQBEGXBOu0kt0aq2ffVQkjFll-NWfb-_RQW_yOpgN-sOXa3RY1W7Z6wY1jP1wi_blusxWyzs3jt9VNpvT
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2001+IEEE+International+Symposium+on+Circuits+and+Systems&rft.atitle=A+fast+constructive+algorithm+for+fixed+channel+assignment+problem&rft.au=Khan%2C+J.A.&rft.au=Sait%2C+S.M.&rft.au=Khan%2C+S.A.&rft.date=2001-01-01&rft.pub=IEEE&rft.isbn=9780780366855&rft.volume=5&rft.spage=65&rft.epage=68+vol.+5&rft_id=info:doi/10.1109%2FISCAS.2001.921986&rft.externalDocID=921986
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780366855/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780366855/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780366855/sc.gif&client=summon&freeimage=true