TY - GEN
T1 - Blacklist-aided forwarding in static multihop wireless networks
AU - Nelakuditi, Srihari
AU - Lee, Sanghwan
AU - Yu, Yinzhe
AU - Wang, Junling
AU - Zhong, Zifei
AU - Lu, Guor Huar
AU - Zhang, Zhi Li
PY - 2005/12/1
Y1 - 2005/12/1
N2 - Static broadband wireless networks, due to their ease of deployment, are likely to proliferate in the near future. The major stumbling block, however, is that wireless links are prone to external interference, channel fading, inclement weather, etc. Therefore scalable and reliable routing despite frequent link quality fluctuations is needed for accelerating the growth of these networks. Most of the wireless routing schemes proposed in the literature are less suitable for these networks, as they are designed primarily for mobile ad hoc networks with dynamic and unpredictable topologies. In this paper, we propose a novel link-state-based blacklist-aided forwarding (BAF) approach, that takes advantage of the fact that the nodes and therefore their adjacencies are relatively static, for scalable packet delivery in static wireless networks. Under BAF, each packet carries a blacklist, a minimal set of degraded-quality links encountered along its path, and the next hop is determined based on both its destination and blacklist. BAF provides loop-free delivery of packets to reachable destinations regardless of the number of degraded links in the network. We evaluate the performance of BAF and show that it is not only reliable but also scalable.
AB - Static broadband wireless networks, due to their ease of deployment, are likely to proliferate in the near future. The major stumbling block, however, is that wireless links are prone to external interference, channel fading, inclement weather, etc. Therefore scalable and reliable routing despite frequent link quality fluctuations is needed for accelerating the growth of these networks. Most of the wireless routing schemes proposed in the literature are less suitable for these networks, as they are designed primarily for mobile ad hoc networks with dynamic and unpredictable topologies. In this paper, we propose a novel link-state-based blacklist-aided forwarding (BAF) approach, that takes advantage of the fact that the nodes and therefore their adjacencies are relatively static, for scalable packet delivery in static wireless networks. Under BAF, each packet carries a blacklist, a minimal set of degraded-quality links encountered along its path, and the next hop is determined based on both its destination and blacklist. BAF provides loop-free delivery of packets to reachable destinations regardless of the number of degraded links in the network. We evaluate the performance of BAF and show that it is not only reliable but also scalable.
UR - http://www.scopus.com/inward/record.url?scp=33845498638&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33845498638&partnerID=8YFLogxK
U2 - 10.1109/SAHCN.2005.1557080
DO - 10.1109/SAHCN.2005.1557080
M3 - Conference contribution
AN - SCOPUS:33845498638
SN - 0780390113
SN - 9780780390119
T3 - 2005 Second Annual IEEE Communications Society Conference on Sensor and AdHoc Communications and Networks, SECON 2005
SP - 252
EP - 262
BT - 2005 Second Annual IEEE Communications Society Conference on Sensor and AdHoc Communications and Networks, SECON 2005
T2 - 2005 Second Annual IEEE Communications Society Conference on Sensor and AdHoc Communications and Networks, SECON 2005
Y2 - 26 September 2005 through 29 September 2005
ER -