File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/VETECF.1999.797357
- Find via
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: A quasi-static cluster-computing approach for dynamic channelassignment in cellular mobile communication systems
Title | A quasi-static cluster-computing approach for dynamic channelassignment in cellular mobile communication systems |
---|---|
Authors | |
Keywords | Cellular communications dynamic channel assignment genetic algorithms local search parallel algorithms |
Issue Date | 1999 |
Publisher | IEEE. |
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? |
Abstract | Efficient 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 Identifier | http://hdl.handle.net/10722/46207 |
ISSN | 2020 SCImago Journal Rankings: 0.277 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kwok, YK | en_HK |
dc.date.accessioned | 2007-10-30T06:44:48Z | - |
dc.date.available | 2007-10-30T06:44:48Z | - |
dc.date.issued | 1999 | en_HK |
dc.identifier.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 | en_HK |
dc.identifier.issn | 1550-2252 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/46207 | - |
dc.description.abstract | Efficient 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.extent | 428343 bytes | - |
dc.format.extent | 10776 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | IEEE. | en_HK |
dc.relation.ispartof | IEEEVTS 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. | - |
dc.subject | Cellular communications | en_HK |
dc.subject | dynamic channel assignment | en_HK |
dc.subject | genetic algorithms | en_HK |
dc.subject | local search | en_HK |
dc.subject | parallel algorithms | en_HK |
dc.title | A quasi-static cluster-computing approach for dynamic channelassignment in cellular mobile communication systems | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://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+systems | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/VETECF.1999.797357 | en_HK |
dc.identifier.hkuros | 53886 | - |
dc.identifier.spage | 2243 | - |
dc.identifier.epage | 2247 | - |