Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 578-587 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Mobile Computing |
| Volume | 4 |
| Issue number | 6 |
| DOIs | |
| State | Published - Nov 2005 |
Bibliographical note
Funding Information:The authors thank the anonymous referees for their valuable comments which helped in improving the content and presentation of the paper. The authors also thank Guohong Cao and Mukesh Singhal for sharing their simulator. This research was supported in part by the US National Science Foundation, CAREER Award # CCR-9983584 and a matching grant from the Department of Computer Science at University of Kentucky.
Keywords
- Cellular networks
- Distributed channel allocation
- Fault tolerance
- Resource planning
ASJC Scopus subject areas
- Software
- Computer Networks and Communications
- Electrical and Electronic Engineering