Name
Abstract | ||
|---|---|---|
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 hybrid- priority , and two-step dynamic-priority . We study their performances by simulation under both uniform and nonuniform traffic distributions. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1006/jpdc.2000.1721 | Journal of Parallel and Distributed Computing - Special issue on wireless networks |
Keywords | Field | DocType |
mobile cellular network,handoff,carrier allocation,mobile host,dynamic carrier allocation strategy,base station,cellular network | Telephone network,Resource planning,Base station,Cellular radio,Telecommunications network,Reuse,Computer science,Cellular network,Handover,Distributed computing | Journal |
Volume | Issue | ISSN |
61 | 7 | 0743-7315 |
Citations | PageRank | References |
3 | 1.42 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xuefeng Dong | 1 | 76 | 7.24 |
| Ten H. Lai | 2 | 1336 | 73.26 |