By Topic

Distributed dynamic channel allocation for mobile communication systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Boukerche, A. ; Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA ; Sungbum Hong ; Jacob, T.

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(Ng*NnlogNn) messages, where N g is the number of groups and Nn is the number of neighbors. This is compared to Choy's (1995) algorithm which requires O(Ng2*Nn), where Ng 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

Published in:

Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2000. Proceedings. 8th International Symposium on

Date of Conference: