Distributed dynamic fault-tolerant channel allocation for cellularnetworks

摘要

Efficient allocation of communication channels is critical for thenperformance of cellular systems. The centralized channel allocationnalgorithms proposed in literature are neither robust nor scalable.nSeveral of these algorithms are unable to dynamically adjust to spatialnand temporal fluctuations in channel demand (load). We present andistributed dynamic channel allocation (DCA) algorithm in which heavilynloaded regions acquire a large number of communication channels, whilentheir lightly loaded neighbors get assigned fewer channels. As thenspatial distribution of channel demand changes with time, the spatialndistribution of allocated channels adjusts accordingly. The algorithmndescribed in this paper requires minimal involvement of the mobilennodes, thus conserving their limited energy supply. The algorithm isnproved to be deadlock free, starvation free, and fair. It preventsncochannel interference and can tolerate the failure of mobile as well asnstatic nodes without any significant degradation in service. Simulationnexperiments demonstrate that the performance of the proposed distributedndynamic algorithm is comparable to, and for some metrics, better thannthat of efficient centralized dynamic algorithms where the centralnswitch has complete and latest information about channel availability.nThe major advantages of the proposed algorithm over its dynamicncentralized counterparts are its scalability, flexibility, and lowncomputation and communication overheads