The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Improved algorithms for distributed resource allocation
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
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
Discrete Mathematics
Mobile Cellular Telecommunications Systems
Mobile Cellular Telecommunications Systems
Simulation for Decision Making
Simulation for Decision Making
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast Algorithms for Distributed Resource Allocation
IEEE Transactions on Parallel and Distributed Systems
Distributed Resource Allocation Algorithms (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
A modular drinking philosophers algorithm
Distributed Computing
An Efficient Synchronization Scheme of Multimedia Streams in Wireless and Mobile Systems
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the second international workshop on Mobility management & wireless access protocols
Dynamic channel assignment with cumulative co-channel interference
ACM SIGMOBILE Mobile Computing and Communications Review
A Fault-Tolerant Distributed Channel Allocation Scheme for Cellular Networks
IEEE Transactions on Computers
A fault tolerant mutual exclusion algorithm for mobile ad hoc networks
Pervasive and Mobile Computing
An overview of Channel Assignment methods for multi-radio multi-channel wireless mesh networks
Journal of Parallel and Distributed Computing
Performance Comparison of Two Channel Allocation Strategies in Cellular Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.02 |
Recent demand for mobile telephone service has been growing rapidly while the electro-magnetic spectrum of frequencies allocated for this purpose remains limited. Any solution to the channel assignment problem is subject to this limitation, as well as the interference constraint between adjacent channels in the spectrum. Channel allocation schemes provide a flexible and efficient access to bandwidth in wireless and mobile communication systems. In this paper, we present an efficient distributed algorithm for dynamic channel allocation based upon 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 · Nn log Nn) messages, where Ng is the number of groups and Nn is the number of neighbors. This is compared to Choy's algorithm which requires O(Ng2 · Nn), where Ng is the number of groups and Nn is the number of neighboring cells in the system. We report our algorithm's performance with 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.