Wireless Networks - Special issue: mobile computing and networking: selected papers from MobiCom '96
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
Advanced Concepts in Operating Systems
Advanced Concepts in Operating Systems
An Efficient Priority-Based Dynamic Channel Allocation Strategy for Mobile Cellular Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Distributed dynamic carrier allocations in mobile cellular networks: search vs. update
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
A structured channel borrowing scheme for dynamic load balancing in cellular networks
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Efficient distributed channel allocation for cellular networks
Computer Communications
Distributed fault-tolerant channel allocation for cellular networks
IEEE Journal on Selected Areas in Communications
Exploiting parallel networks using dynamic channel scheduling
Proceedings of the 4th Annual International Conference on Wireless Internet
An experimental analysis of biased parallel greedy approximation for combinatorial auctions
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.00 |
A channel allocation algorithm in a cellular network consists of two parts: a channel acquisition algorithm and a channel selection algorithm. Some of the previous works in this field focused on centralized approaches to allocating channels. But, centralized approaches are neither scalable nor reliable. Recently, distributed dynamic channel allocation algorithms have been proposed, and they have gained a lot of attention due to their high reliability and scalability. But, in most of the algorithms, the cell that wants to borrow a channel has to wait for replies from all its interference neighbors and, hence, is not fault-tolerant. In this paper, we propose a new algorithm that is fault-tolerant and makes full use of the available channels. It can tolerate the failure of mobile nodes as well as static nodes without any significant degradation in service.