A channel allocation algorithm includes a channel acquisition algorithm and a channel selection algorithm. Most of the previous work concentrates on the channel selection algorithm since early channel allocation algorithms simply use a centralized channel acquisition algorithm, which depends on a mo
Dynamic Carrier Allocation Strategies for Mobile Cellular Networks
β Scribed by Xuefeng Dong; Ten H. Lai
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 367 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
β¦ Synopsis
Dynamic carrier allocation (DCA) refers to the paradigm of dynamically allocating carriers to cells in cellular networks. Many strategies have been proposed. In most of the strategies, each carrier is assigned a priority. Depending on how priorities are assigned, DCA strategies are classified into three categories: static-priority, dynamic-priority, and hybrid-priority strategies. In this paper, we investigate the concept of optimal reuse pattern, propose a model for resource planning, and propose three guidelines for priority assignment in static-and hybrid-priority DCA strategies. These theoretical results shed light on the strength and weakness of existing DCA strategies and lead us to develop more efficient strategies. Specifically, we propose three DCA strategies: column-wise static-priority, column-wise hybridpriority, and two-step dynamic-priority. We study their performances by simulation under both uniform and nonuniform traffic distributions.
π SIMILAR VOLUMES
## Abstract It is expected that future IMTβAdvanced systems will operate packetβswitched due to the dominance of data services. However, it is inherent to packetβswitched systems to not cope well with voice services as periodic resource usage patterns are not signalled efficiently. In this paper, w
Channel allocation schemes in a mobile computing (wireless) environment can be either static or dynamic. Static allocation offers negligible channel acquisition time and zero message complexity and works well at a low system load; the performance steadily decreases as system load increases since man