Distributed dynamic fault-tolerant channel allocation for cellular networks

• Published in: IEEE transactions on vehicular technology Vol. 48; no. 6; pp. 1874 - 1888
• Main Authors: Prakash, R., Shivaratri, N.G., Singhal, M.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.11.1999; Institute of Electrical and Electronics Engineers
• Subjects: Algorithms; Allocations; Applied sciences; Cellular; Channel allocation; Channels; Communication channels; Degradation; Demand; Dynamics; Exact sciences and technology; Fault tolerance; Fluctuations; Heuristic algorithms; Interchannel interference; Radiocommunications; Robustness; Spatial distribution; Switches; System recovery; Telecommunications; Telecommunications and information theory; Waveform; Mobile radiocommunication; Experimental result; Dynamic allocation; Algorithm performance; Transmission channel; Numerical simulation; Cell network; Mutual exclusion; Distributed system; Data structure; Modeling
• ISSN: 0018-9545; 1939-9359
• DOI: 10.1109/25.806780

Efficient allocation of communication channels is critical for the performance of cellular systems. The centralized channel allocation algorithms proposed in literature are neither robust nor scalable. Several of these algorithms are unable to dynamically adjust to spatial and temporal fluctuations in channel demand (load). We present a distributed dynamic channel allocation (DCA) algorithm in which heavily loaded regions acquire a large number of communication channels, while their lightly loaded neighbors get assigned fewer channels. As the spatial distribution of channel demand changes with time, the spatial distribution of allocated channels adjusts accordingly. The algorithm described in this paper requires minimal involvement of the mobile nodes, thus conserving their limited energy supply. The algorithm is proved to be deadlock free, starvation free, and fair. It prevents cochannel interference and can tolerate the failure of mobile as well as static nodes without any significant degradation in service. Simulation experiments demonstrate that the performance of the proposed distributed dynamic algorithm is comparable to, and for some metrics, better than that of efficient centralized dynamic algorithms where the central switch has complete and latest information about channel availability. The major advantages of the proposed algorithm over its dynamic centralized counterparts are its scalability, flexibility, and low computation and communication overheads.