Impact of mobility on distributed computations
ACM SIGOPS Operating Systems Review
Efficient fault-tolerant algorithms for distributed resource allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed dynamic channel allocation for mobile computing
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Wireless Networks - Special issue: mobile computing and networking: selected papers from MobiCom '96
On the parallel simulation of fixed channel allocation algorithms
Mobile Networks and Applications
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed Operating Systems: Concepts and Design
Distributed Operating Systems: Concepts and Design
Discrete Mathematics
Mobile Cellular Telecommunications Systems
Mobile Cellular Telecommunications Systems
Introduction to Simulation: Programming Techniques and Methods Analysis
Introduction to Simulation: Programming Techniques and Methods Analysis
A Fault-Tolerant Distributed Channel Allocation Scheme for Cellular Networks
IEEE Transactions on Computers
Performance Comparison of Two Channel Allocation Strategies in Cellular Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Recent demand for mobile telephone service have been growing rapidly while the electro-magnetic spectrum of frequencies allocated for this purpose remain limited. Any solution to the channel assignment problem is subject to this limitation, as well as the interference constraints between adjacent channels in the spectrum. Channel allocation schemes provide a flexible and efficient access to bandwith in wireless and mobile communication systems.In this paper, we present an efficient distributed algorithm for dynamic channel allocation based upon multual 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 describe the algorithm, and report its performance several channel systems using different types of call arrival patterns. Our results indicate that significant low denial rate, low message complexity and low acquisition time can be obtained using our algorithm.