Weak State Routing for Large-Scale Dynamic Networks

Forwarding decisions in routing protocols rely on information about the destination nodes provided by routing table states. When paths to a destination change, corresponding states become invalid and need to be refreshed with control messages for resilient routing. In large and highly dynamic networks, this overhead can crowd out the capacity for data traffic. For such networks, we propose the concept of weak state, which is interpreted as a probabilistic hint, not as absolute truth. Weak state can remain valid without explicit messages by systematically reducing the confidence in its accuracy. Weak State Routing (WSR) is a novel routing protocol that uses weak state along with random directional walks for forwarding packets. When a packet reaches a node that contains a weak state about the destination with higher confidence than that held by the packet, the walk direction is biased. The packet reaches the destination via a sequence of directional walks, punctuated by biasing decisions. WSR also uses random directional walks for disseminating routing state and provides mechanisms for aggregating weak state. Our simulation results show that WSR offers a very high packet delivery ratio ( ≥ 98%). Control traffic overhead scales as O(N), and the state complexity is Θ(N3/2), where N is the number of nodes. Packets follow longer paths compared to prior protocols (OLSR , GLS-GPSR , ), but the average path length is asymptotically efficient and scales as O(√N). Despite longer paths, WSR's end-to-end packet delivery delay is much smaller due to the dramatic reduction in protocol overhead.

[1]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[2]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[3]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[4]  David D. Clark,et al.  The design philosophy of the DARPA internet protocols , 1988, SIGCOMM '88.

[5]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[6]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[7]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[8]  Steven McCanne,et al.  A model, analysis, and protocol framework for soft state-based communication , 1999, SIGCOMM '99.

[9]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[10]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

[11]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[12]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[13]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[14]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[15]  A. Laouiti,et al.  Optimized link state routing protocol for ad hoc networks , 2001, Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century..

[16]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[17]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[18]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[19]  John Kubiatowicz,et al.  Probabilistic location and routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[20]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[21]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[22]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[23]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[24]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[25]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[26]  Jörg Widmer,et al.  Hierarchical location service for mobile ad-hoc networks , 2004, MOCO.

[27]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[28]  Hannes Hartenstein,et al.  Stochastic Properties of the Random Waypoint Mobility Model , 2004, Wirel. Networks.

[29]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[30]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[31]  Abhishek Kumar,et al.  Efficient and scalable query routing for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[32]  Margaret Martonosi,et al.  Erasure-coding based routing for opportunistic networks , 2005, WDTN '05.

[33]  Jorma T. Virtamo,et al.  Spatial node distribution of the random waypoint mobility model with applications , 2006, IEEE Transactions on Mobile Computing.

[34]  Antony I. T. Rowstron,et al.  Virtual ring routing: network routing inspired by DHTs , 2006, SIGCOMM.

[35]  M. Vetterli,et al.  Locating mobile nodes with EASE: learning efficient routes from encounter histories alone , 2006, IEEE/ACM Transactions on Networking.

[36]  Antony Rowstron,et al.  Virtual ring routing: network routing inspired by DHTs , 2006, SIGCOMM 2006.

[37]  Alhussein A. Abouzeid,et al.  Capacity Deficit in Mobile Wireless Ad Hoc Networks Due to Geographic Routing Overheads , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[38]  Jussi Kangasharju,et al.  Explaining BubbleStorm: Resilient, Probabilistic, and Exhaustive PeertoPeer Search , 2007, SIGCOMM 2007.

[39]  Don Towsley,et al.  A Comparison of Hard-State and Soft-State Signaling Protocols , 2007, IEEE/ACM Transactions on Networking.

[40]  Alhussein A. Abouzeid,et al.  Link State Routing Overhead in Mobile Ad Hoc Networks: A Rate-Distortion Formulation , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[41]  Murat Yuksel,et al.  Orthogonal rendezvous routing protocol for wireless mesh networks , 2009, TNET.

[42]  Murat Yuksel,et al.  Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks , 2009, IEEE/ACM Transactions on Networking.

[43]  Alhussein A. Abouzeid,et al.  An Evaluation of Weak State Mechanism Design for Indirection in Dynamic Networks , 2009, IEEE INFOCOM 2009.

[44]  Alhussein A. Abouzeid,et al.  Weak State Routing for Large-Scale Dynamic Networks , 2010, IEEE/ACM Trans. Netw..