Blacklist-aided forwarding in static multihop wireless networks

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.

[1]  Ramesh Govindan,et al.  Interaction of retransmission, blacklisting, and routing metrics for reliability in sensor network routing , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[2]  DravesRichard,et al.  Comparison of routing metrics for static multi-hop wireless networks , 2004 .

[3]  Anindya Basu,et al.  Routing using potentials: a dynamic traffic-aware routing algorithm , 2003, SIGCOMM '03.

[4]  Eryk Dutkiewicz,et al.  A review of routing protocols for mobile ad hoc networks , 2004, Ad Hoc Networks.

[5]  Christophe Diot,et al.  An approach to alleviate link overload as observed on an IP backbone , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Kai-Yeung Siu,et al.  Local restoration algorithm for link-state routing protocols , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[7]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2005, Wirel. Networks.

[8]  D. Woolley The White Paper. , 1972, British medical journal.

[9]  David A. Maltz,et al.  DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .

[10]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[11]  Chen-Nee Chuah,et al.  Proactive vs reactive approaches to failure resilient routing , 2004, IEEE INFOCOM 2004.

[12]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[13]  Jitendra Padhye,et al.  Comparison of routing metrics for static multi-hop wireless networks , 2004, SIGCOMM '04.

[14]  Jitendra Padhye,et al.  Routing in multi-radio, multi-hop wireless mesh networks , 2004, MobiCom '04.

[15]  Ram Ramanathan,et al.  Making link-state routing scale for ad hoc networks , 2001, MobiHoc '01.

[16]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[17]  Robert Tappan Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM '04.

[18]  Mario Gerla,et al.  Fisheye State Routing Protocol (FSR) for Ad Hoc Networks , 2002 .