File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fixed channel assignment in cellular radio networks using a modified genetic algorithm

TitleFixed channel assignment in cellular radio networks using a modified genetic algorithm
Authors
KeywordsCellular network
Channel assignment
Generic algorithm
Wireless communication
Issue Date1998
PublisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=25
Citation
Ieee Transactions On Vehicular Technology, 1998, v. 47 n. 1, p. 163-172 How to Cite?
AbstractWith the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict-free channel assignment with the minimum channel span is NP hard. Therefore, we formulate the problem by assuming a given channel span. Our objective is to obtain a conflict-free channel assignment among the cells, which satisfies both the electromagnetic compatibility (EMC) constraints and traffic demand requirements. We propose an approach based on a modified genetic algorithm (GA). The approach consists of a genetic-fix algorithm that generates and manipulates individuals with fixed size (i.e., in binary representation, the number of ones is fixed) and a minimum-separation encoding scheme that eliminates redundant zeros in the solution representation. Using these two strategies, the search space can be reduced substantially. Simulations on the first four benchmark problems showed that this algorithm could achieve at least 80%, if not 100%, convergence to solutions within reasonable time. In the fifth benchmark problem, our algorithm found better solutions with shorter channel span than any existing algorithms. Such significant results indicate that our approach is indeed a good method for solving the channel-assignment problem. © 1998 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/42772
ISSN
2015 Impact Factor: 2.243
2015 SCImago Journal Rankings: 1.203
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorNgo, CYen_HK
dc.contributor.authorLi, VOKen_HK
dc.date.accessioned2007-03-23T04:31:53Z-
dc.date.available2007-03-23T04:31:53Z-
dc.date.issued1998en_HK
dc.identifier.citationIeee Transactions On Vehicular Technology, 1998, v. 47 n. 1, p. 163-172en_HK
dc.identifier.issn0018-9545en_HK
dc.identifier.urihttp://hdl.handle.net/10722/42772-
dc.description.abstractWith the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict-free channel assignment with the minimum channel span is NP hard. Therefore, we formulate the problem by assuming a given channel span. Our objective is to obtain a conflict-free channel assignment among the cells, which satisfies both the electromagnetic compatibility (EMC) constraints and traffic demand requirements. We propose an approach based on a modified genetic algorithm (GA). The approach consists of a genetic-fix algorithm that generates and manipulates individuals with fixed size (i.e., in binary representation, the number of ones is fixed) and a minimum-separation encoding scheme that eliminates redundant zeros in the solution representation. Using these two strategies, the search space can be reduced substantially. Simulations on the first four benchmark problems showed that this algorithm could achieve at least 80%, if not 100%, convergence to solutions within reasonable time. In the fifth benchmark problem, our algorithm found better solutions with shorter channel span than any existing algorithms. Such significant results indicate that our approach is indeed a good method for solving the channel-assignment problem. © 1998 IEEE.en_HK
dc.format.extent154946 bytes-
dc.format.extent158720 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/msword-
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=25en_HK
dc.relation.ispartofIEEE Transactions on Vehicular Technologyen_HK
dc.rights©1998 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectCellular networken_HK
dc.subjectChannel assignmenten_HK
dc.subjectGeneric algorithmen_HK
dc.subjectWireless communicationen_HK
dc.titleFixed channel assignment in cellular radio networks using a modified genetic algorithmen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0018-9545&volume=47&issue=1&spage=163&epage=172&date=1998&atitle=Fixed+channel+assignment+in+cellular+radio+networks+using+a+modified+genetic+algorithmen_HK
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/25.661043en_HK
dc.identifier.scopuseid_2-s2.0-0000554158en_HK
dc.identifier.hkuros34358-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0000554158&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume47en_HK
dc.identifier.issue1en_HK
dc.identifier.spage163en_HK
dc.identifier.epage172en_HK
dc.identifier.isiWOS:000072007200018-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridNgo, CY=7005184328en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats