D-CAT: A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks

Authors:
Yongbing Zhang;Xiaohua Jia;Sajal K. Das
Affiliations:
Institute of Policy and Planning Sciences, University of Tsukuba, Japan;Department of Computer Science, City University of Hong Kong, Hong Kong;Department of Computer Science, and Engineering, University of Texas at Arlington, Texas
Venue:
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Year:
2001

Citing 3
Cited 0

Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Efficient Distributed Channel Allocation for Mobile Cellular Networks

IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
An efficient load-balancing algorithm based on a two-threshold cell selection scheme in mobile cellular networks

Computer Communications

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 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. The D-CAT algorithm determines the optimal number of free channels as well as the cell(s) from where a heavy cell should import to satisfy its channel demand.