File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A heuristic algorithm for channel assignment in cellular mobile systems

TitleA heuristic algorithm for channel assignment in cellular mobile systems
Authors
Thavarajah, AILam, WH
KeywordsTransportation
Automobiles
Issue Date1998
PublisherIEEE.
Citation
The 48th IEEE VTS Vehicular Technology Conference, Ottawa, ON., Canada, 18-21 May 1998. In IEEEVTS Vehicular Technology Conference Proceedings, 1998, v. 3, p. 1690-1694 How to Cite?
DOI: http://dx.doi.org/10.1109/VETEC.1998.686044
AbstractThis paper describes an efficient heuristic algorithm for the channel assignment problem (CAP) in cellular mobile systems. The channel assignment scheme proposed here is based on repetitive ordering of requirements in sequences. The performance of the proposed algorithm is verified by several benchmark problems and found to be superior than other existing methods. The study show that the proposed algorithm yields optimal assignment in most of the cases and near-optimal assignment in other cases.
Persistent Identifierhttp://hdl.handle.net/10722/46039
ISSN
1550-2252
2020 SCImago Journal Rankings: 0.277

 

DC FieldValueLanguage
dc.contributor.authorThavarajah, AIen_HK
dc.contributor.authorLam, WHen_HK
dc.date.accessioned2007-10-30T06:41:13Z-
dc.date.available2007-10-30T06:41:13Z-
dc.date.issued1998en_HK
dc.identifier.citationThe 48th IEEE VTS Vehicular Technology Conference, Ottawa, ON., Canada, 18-21 May 1998. In IEEEVTS Vehicular Technology Conference Proceedings, 1998, v. 3, p. 1690-1694en_HK
dc.identifier.issn1550-2252en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46039-
dc.description.abstractThis paper describes an efficient heuristic algorithm for the channel assignment problem (CAP) in cellular mobile systems. The channel assignment scheme proposed here is based on repetitive ordering of requirements in sequences. The performance of the proposed algorithm is verified by several benchmark problems and found to be superior than other existing methods. The study show that the proposed algorithm yields optimal assignment in most of the cases and near-optimal assignment in other cases.en_HK
dc.format.extent535190 bytes-
dc.format.extent3954 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofIEEEVTS Vehicular Technology Conference Proceedings-
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.-
dc.subjectTransportationen_HK
dc.subjectAutomobilesen_HK
dc.titleA heuristic algorithm for channel assignment in cellular mobile systemsen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1550-2252&volume=3&spage=1690&epage=1694&date=1998&atitle=A+heuristic+algorithm+for+channel+assignment+in+cellular+mobile+systemsen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/VETEC.1998.686044en_HK
dc.identifier.hkuros34018-
dc.identifier.volume3-
dc.identifier.spage1690-
dc.identifier.epage1694-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats