Efficient distributed algorithms for dynamic channel assignment

Abstract

The efficiency of channel assignment in a cellular telephone system is considered using the measures of successful channel assignment ratio as well as response time. Existing paradigms of mutual exclusion and dining philosophers from distributed systems are used to synthesize new algorithms that optimize both measures. The results are verified by extensive simulations.