File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A quasi-static cluster-computing approach for dynamic channelassignment in cellular mobile communication systems

TitleA quasi-static cluster-computing approach for dynamic channelassignment in cellular mobile communication systems
Authors
KeywordsCellular communications
dynamic channel assignment
genetic algorithms
local search
parallel algorithms
Issue Date1999
PublisherIEEE.
Citation
The 50th IEEE VTS Vehicular Technology Conference, Amsterdam, The Netherlands, 19-22 September 1999. In IEEEVTS Vehicular Technology Conference Proceedings, 1999, v. 4, p. 2343-2347 How to Cite?
AbstractEfficient management of the radio spectrum can be accomplished by making use of channel assignment techniques, which work by allocating different channels of the spectrum to the cells of the network in a conflict-free manner (i.e., the co-channel interference is minimized). The problem of dynamically reallocating the channels in response to change in user location patterns, which occurs frequently for a microcell network architecture, is even more difficult to tackle in a timely manner. Most existing approaches use various sequential search-based heuristics which cannot produce high-quality allocation fast enough to cope with the frequent traffic requirement variations. In this paper, we propose a quasi-static approach which combines the merits of both static and dynamic schemes. The static component of our approach uses a parallel genetic algorithm to generate a suite of representative assignments based on a set of different estimated traffic scenarios. At on-line time, the dynamic component observes the actual traffic requirement and retrieves the representative assignment of the closest scenario from the off-line table. The retrieved assignment is then quickly refined by using a fast parallel local search algorithm. Our extensive simulation experiments have indicated that the proposed quasi-static system outperforms other dynamic channel assignment techniques significantly in terms of both blocking probabilities and computational overhead.
Persistent Identifierhttp://hdl.handle.net/10722/46207
ISSN

 

DC FieldValueLanguage
dc.contributor.authorKwok, YKen_HK
dc.date.accessioned2007-10-30T06:44:48Z-
dc.date.available2007-10-30T06:44:48Z-
dc.date.issued1999en_HK
dc.identifier.citationThe 50th IEEE VTS Vehicular Technology Conference, Amsterdam, The Netherlands, 19-22 September 1999. In IEEEVTS Vehicular Technology Conference Proceedings, 1999, v. 4, p. 2343-2347en_HK
dc.identifier.issn1550-2252en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46207-
dc.description.abstractEfficient management of the radio spectrum can be accomplished by making use of channel assignment techniques, which work by allocating different channels of the spectrum to the cells of the network in a conflict-free manner (i.e., the co-channel interference is minimized). The problem of dynamically reallocating the channels in response to change in user location patterns, which occurs frequently for a microcell network architecture, is even more difficult to tackle in a timely manner. Most existing approaches use various sequential search-based heuristics which cannot produce high-quality allocation fast enough to cope with the frequent traffic requirement variations. In this paper, we propose a quasi-static approach which combines the merits of both static and dynamic schemes. The static component of our approach uses a parallel genetic algorithm to generate a suite of representative assignments based on a set of different estimated traffic scenarios. At on-line time, the dynamic component observes the actual traffic requirement and retrieves the representative assignment of the closest scenario from the off-line table. The retrieved assignment is then quickly refined by using a fast parallel local search algorithm. Our extensive simulation experiments have indicated that the proposed quasi-static system outperforms other dynamic channel assignment techniques significantly in terms of both blocking probabilities and computational overhead.en_HK
dc.format.extent428343 bytes-
dc.format.extent10776 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©1999 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 communicationsen_HK
dc.subjectdynamic channel assignmenten_HK
dc.subjectgenetic algorithmsen_HK
dc.subjectlocal searchen_HK
dc.subjectparallel algorithmsen_HK
dc.titleA quasi-static cluster-computing approach for dynamic channelassignment in cellular mobile communication systemsen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1550-2252&volume=4&spage=2343&epage=2347&date=1999&atitle=A+quasi-static+cluster-computing+approach+for+dynamic+channelassignment+in+cellular+mobile+communication+systemsen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/VETECF.1999.797357en_HK
dc.identifier.hkuros53886-
dc.identifier.spage2243-
dc.identifier.epage2247-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats