The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
An adaptive distributed channel allocation strategy for mobile cellular networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile computing and communications
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A distributed algorithm for dynamic channel allocation
Mobile Networks and Applications - Analysis and Design of Multi-Service Wireless Networks
| Hi-index | 0.00 |
Communication channels are the most important resources in mobile cellular networks. However, with the increasing needs of mobile users and the limited and scare bandwidth available to cellular networks, resource management is crucial to allocate these communication channels efficiently. Several channel allocation protocols based upon a mutual exclusion paradigm have been developed. However, very little data have been reported to compare these protocols. In this paper, we review four of the best known distributed dynamic channel and resource allocation algorithms. The first channel allocation scheme (known as a DDRA) adopts the co-group interference, while the other three algorithms (Cao-Singhal, Choy-Singh and Prakash-Shivaratri-Singhal) are based upon the co-channel interference. We present an extensive set of simulation experiments to compare these four schemes, and report on their performance evaluation. Our results indicate clearly DDRA algorithm has shown the shortest response time and highest blocking rate among all of the four channel allocation protocols. Cao-Singhal algorithm exhibits a better blocking rate when compared to the three other schemes. This is due to the fact that it re-uses communication channels optimally.