Distributed Dynamic Channel Allocation for Mobile Communication Systems

Authors:
Azzedine Boukerche;Sungbum Hong;Tom Jacob
Affiliations:
-;-;-
Venue:
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Year:
2000

Citing 0
Cited 4

SWiMNet: a scalable parallel simulation testbed for wireless and mobile networks

Wireless Networks
An Efficient Synchronization Scheme of Multimedia Streams in Wireless and Mobile Systems

IEEE Transactions on Parallel and Distributed Systems
A Synchronization Scheme for Distributed Multimedia Servers and Mobile Clients using Quasi-Sink

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A Distributed Synchronization Scheme for Multimedia Streams in Mobile Systems: Proof and Correctness

LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 number of cells in a cluster groups the channels 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 Ng is the number of groups and Nn is the number of neighbors. This is compared to Choy's algorithm, which requires \math, where Ng is the number of groups. Our simulation experiments indicate that DDRA algorithm out performs 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.