An efficient approach for distributed channel allocation in cellular mobile networks
Yongbing Zhang, Xiaohua Jia, Sajal Kumar Das · 2001
We propose a distributed channel allocation algorithm based on a threshold scheme, called D-CAT, for cellular mobile networks. The D-CAT algorithm employs two thresholds: (i) a heavy threshold used for determining whether a cell is heavy, i.e., overloaded, and for triggering the channel allocation algorithm; and (ii) a target threshold used for indicating the target number of free channels that a heavy cell intends to acquire. We determine the optimal number of free channels as well as the cell(s) from where a heavy cell should import to satisfy its channel demand. Simulation experiments and analyses show that the D-CAT algorithm incurs lower overhead for channel allocation and is more efficient in terms of channel utilization than other distributed channel allocation algorithms. It also outperforms other centralized and distributed algorithms in terms of call blocking probability.