Introduction to algorithms
Resource allocation in wireless networks
Journal of High Speed Networks - Special issue: wireless networks
Improved access to optical bandwidth in trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Cellular channel assignment: a new localized and distributed strategy
Mobile Networks and Applications - Dial m for mobility: discrete algorithms and methods for mobile computing and communication
Channel assignment and graph multicoloring
Handbook of wireless networks and mobile computing
Worst-case analysis of a dynamic channel assignment strategy
Discrete Applied Mathematics
Dynamic channel assignment with cumulative co-channel interference
ACM SIGMOBILE Mobile Computing and Communications Review
Fixed channel assignment using new dynamic programming approach in cellular radio networks
Computers and Electrical Engineering
A recursive algorithm for bandwidth partitioning
IEEE Transactions on Communications
Frequency assignment and multicoloring powers of square and triangular meshes
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |
Many cellular channel assignment policies have been proposed to improve efficiency beyond that resulting from fixed channel allocation. The performance of these policies, however, has rarely been compared due to a lack of formal metrics, particularly under nonhomogeneous call distributions. In this paper, we introduce two such metrics: the worst-case number of channels required to accommodate all possible configurations of N calls in a cell cluster, and the set of cell states that can be accommodated with M channels. We first measure two extreme policies, fixed channel allocation and maximum packing, under these metrics. We then prove a new lower bound, under the first metric, on any channel assignment policy. Next, we introduce three intermediate channel assignment policies, based on commonly used ideas of channel ordering, hybrid assignment, and partitioning. Finally, these policies are used to demonstrate the tradeoff between the performance and the complexity of a channel allocation policy.