D-CAT: an efficient algorithm for distributed channel allocation in cellular mobile networks

  • Authors:

  • Yongbing Zhang;Sajal K. Das;Xiaohua Jia

  • Affiliations:

  • Institute of Policy and Planning Sciences, University of Tsukuba, Tsukuba Science City, Ibaraki 305-8573, Japan;Department of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX;Department of Computer Science, City University of Hong Kong, Hong Kong, China

  • Venue:
  • Mobile Networks and Applications
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a distributed channel allocation algorithm based on a threshold scheme, called D-CAT, for cellular mobile networks. The algorithm employs two thresholds: (i) a heavy threshold for determining whether a cell is heavy, or overloaded, and for triggering the channel allocation algorithm; and (ii) a target threshold for indicating the target number of free channels that a heavy cell intends to acquire. Based on the two-threshold scheme, the D-CAT algorithm can determine the optimal number of free channels as well as the cell(s) from where a heavy cell should import channels in order to satisfy the required channel demand. Simulation experiments and analyses show that the proposed 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.