TY - GEN
T1 - Distributed fault-tolerant channel allocation for mobile cellular networks
AU - Cao, Guohong
AU - Singhal, Mukesh
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 1999
Y1 - 1999
N2 - Distributed channel allocation algorithms have received considerable attention due to their high reliability, and scalability. However, in these algorithms, a borrower needs to consult with its interference neighbors in order to borrow a channel. Thus, a borrower fails to borrow channels when it cannot communicate with anyone of its interference neighbors. In real-life networks, under heavy traffic load, a cell has a large probability to experience an intermittent network congestion or even a communication link failure. In these algorithms, since a cell has to consult with a large number of interference neighbors to borrow a channel. The failure rate will be much higher under heavy traffic load. In this paper, we first propose a fault-tolerant channel acquisition algorithm which tolerates communication link failures and node (MH or MSS) failures. Then, we present a channel selection algorithm and integrate it into the distributed acquisition algorithm. Simulation results show that our algorithm significantly reduces the failure rate under network congestion, communication link failures, and node failures compared to non-fault-tolerant channel allocation algorithms.
AB - Distributed channel allocation algorithms have received considerable attention due to their high reliability, and scalability. However, in these algorithms, a borrower needs to consult with its interference neighbors in order to borrow a channel. Thus, a borrower fails to borrow channels when it cannot communicate with anyone of its interference neighbors. In real-life networks, under heavy traffic load, a cell has a large probability to experience an intermittent network congestion or even a communication link failure. In these algorithms, since a cell has to consult with a large number of interference neighbors to borrow a channel. The failure rate will be much higher under heavy traffic load. In this paper, we first propose a fault-tolerant channel acquisition algorithm which tolerates communication link failures and node (MH or MSS) failures. Then, we present a channel selection algorithm and integrate it into the distributed acquisition algorithm. Simulation results show that our algorithm significantly reduces the failure rate under network congestion, communication link failures, and node failures compared to non-fault-tolerant channel allocation algorithms.
UR - http://www.scopus.com/inward/record.url?scp=0032623527&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032623527&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.1999.751393
DO - 10.1109/INFCOM.1999.751393
M3 - Conference contribution
AN - SCOPUS:0032623527
SN - 0780354176
SN - 9780780354173
T3 - Proceedings - IEEE INFOCOM
SP - 584
EP - 591
BT - Proceedings - IEEE INFOCOM'99
T2 - 18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now, IEEE INFOCOM'99
Y2 - 21 March 1991 through 25 March 1991
ER -