Distributed dynamic channel allocation for mobile communication systems

We present 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 cannot 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_nlogN_n) messages, where N _g is the number of groups and N_n is the number of neighbors. This is compared to Choy's (1995) algorithm which requires O(N_g²*N_n), where N_g is the number of groups. Our simulation experiments indicate that the 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 the previous algorithm