An efficient distributed channel allocation strategy based on a threshold scheme for mobile cellular networks

We propose a distributed channel allocation algorithm based on a threshold scheme, called D-CAT, for cellular mobile networks. The algorithm employs two thresholds to determine whether a cell is heavy, i.e., overloaded, and the optimal number of free channels as well as the cell(s) from where it needs to import in order 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