The design philosophy of the DARPA internet protocols
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A model, analysis, and protocol framework for soft state-based communication
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Stochastic properties of the random waypoint mobility model
Wireless Networks
Erasure-coding based routing for opportunistic networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spatial Node Distribution of the Random Waypoint Mobility Model with Applications
IEEE Transactions on Mobile Computing
Locating mobile nodes with EASE: learning efficient routes from encounter histories alone
IEEE/ACM Transactions on Networking (TON)
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A comparison of hard-state and soft-state signaling protocols
IEEE/ACM Transactions on Networking (TON)
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Weak state routing for large scale dynamic networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Orthogonal rendezvous routing protocol for wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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 [2], GLS-GPSR [3], [4]), 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.