Distributed dynamic channel allocation for mobile communication systems

This paper presents an efficient distributed dynamic channel allocation algorithm for mobile communications systems. The algorithm is based upon the mutual exclusion model, where the channels are grouped by the number of cells in a cluster and each group of channels can not be shared concurrently within the cluster. We discuss the algorithm and prove its correctness. We also show that the algorithm requires at most (worst case) O(N-g * N(n)logN(n)) messages, where N-g is the number of groups and N-n is the number of neighbors. This is compared to Choy's algorithm which requires O(N-g(2) * N-n), where N-g is the number of groups. Our simulations experiments indicate that DDRA algorithm outperforms previous schemes. A 5% reduction in the denial rate, and a 10-30% reduction in the acquisition time channel were obtained using our algorithm when compared to previous algorithm.