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 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
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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)
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
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Hierarchical location service for mobile ad-hoc networks
ACM SIGMOBILE Mobile Computing and Communications Review
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
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
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
An optimal probabilistic forwarding protocolin delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Improving routing distance for geographic multicast with Fermat points in mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Dircast: flooding-reduced routing in MANETs without destination coordinates
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Using directionality in mobile routing
Wireless Networks
Weak state routing for large-scale dynamic networks
IEEE/ACM Transactions on Networking (TON)
Fast track article: Connectivity in time-graphs
Pervasive and Mobile Computing
Efficient routing in MANETs using ordered walks
Wireless Networks
Understanding stateful vs stateless communication strategies for ad hoc networks
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Practical routing in a cyclic MobiSpace
IEEE/ACM Transactions on Networking (TON)
Path approximation for multi-hop wireless routing under application-based accuracy constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
Concurrent face traversal for efficient geometric routing
Journal of Parallel and Distributed Computing
Internet of things: objectives and scientific challenges
Journal of Computer Science and Technology - Special issue on Natural Language Processing
Message-driven based energy-efficient routing in heterogeneous delay-tolerant networks
Proceedings of the 1st ACM workshop on High performance mobile opportunistic systems
Performance modeling of DTN routing with heterogeneous and selfish nodes
Wireless Networks
Hi-index | 0.00 |
Routing in communication networks involves the indirection from a persistent name (or ID) to a locator and delivering packets based upon the locator. In a large-scale, highly dynamic network, the ID-to-locator mappings are both large in number, and change often. Traditional routing protocols require high overhead to keep these in directions up-to-date. In this paper, we propose Weak State Routing (WSR), a routing mechanism for large-scale highly dynamic networks. WSR's novelty is that it uses random directional walks biased occasionally by weak indirection state information in intermediate nodes. The indirection state information is weak, i.e. interpreted not as absolute truth, but as probabilistic hints. Nodes only have partial information about the region a destination node is likely to be. This method allows us to aggregate information about a number of remote locations in a geographic region. In other words, the state information maps a set-of-IDs to a it geographical region. The intermediate nodes receiving the random walk use a method similar to longest-prefix-match in order to prioritize their mappings to decide how to bias and forward the random walk. WSR can also be viewed as an unstructured distributed hashing technique. WSR displays good rare-object recall with scalability properties similar to structured DHTs, albeit with more tolerance to dynamism and without constraining the degree distribution of the underlying network. Through simulations, we show that WSR offers a high packet delivery ratio, more than 98%. The control packet overhead incurred in the network scales as O(N) for N-node networks. The number of mappings stored in the network appears to scale as Θ(N(3/2)). We compare WSR with Dynamic Source Routing (DSR) and geographic forwarding (GPSR) combined with Grid Location Service (GLS). Our results indicate that WSR delivers more packets with less overhead at the cost of increased path length.