Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second 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
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Compact routing schemes with low stretch factor
Journal of Algorithms
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Bounded Geometries, Fractals, and Low-Distortion Embeddings
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the 1st international conference on Embedded networked sensor systems
TOSSIM: accurate and scalable simulation of entire TinyOS applications
Proceedings of the 1st international conference on Embedded networked sensor systems
LAND: stretch (1 + ε) locality-aware networks for DHTs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Triangulation and Embedding Using Small Sets of Beacons
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Approximately uniform random sampling in sensor networks
DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
Hybrid sensor networks: a small world
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Name independent routing for growth bounded networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On the pitfalls of geographic face routing
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Geographic gossip: efficient aggregation for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Optimal-stretch name-independent compact routing in doubling metrics
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Routing in Networks with Low Doubling Dimension
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Lazy cross-link removal for geographic routing
Proceedings of the 4th international conference on Embedded networked sensor systems
Hierarchical spatial gossip for multi-resolution representations in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Beacon vector routing: scalable point-to-point routing in wireless sensornets
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Map: medial axis based geometric routing in sensor networks
Wireless Networks
S4: small state and small stretch routing protocol for large wireless sensor networks
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
| Hi-index | 0.00 |
In traditional routing, the routing tables store shortest paths to all other destinations and have size linear in the size of the network, which is not scalable for resource-constrained networks such as wireless sensor networks. In this article we show that by storing selectively a much smaller set of routing paths in the routing tables one can get low-stretch, compact routing schemes. Our routing scheme includes an approximate distance oracle with which one can obtain approximate shortest path length estimates to destinations. This distance oracle can be obtained, for example, by a landmark-based scheme, or in case of sensor networks, from the geographic distance between node locations. With an approximate distance oracle one can attempt greedy routing by forwarding to the neighbor whose estimate is closer to the destination. But there is no guarantee of delivery nor of the routing path length. We augment the distance oracle by storing, for each node u, routing paths to O(log2 n) strategically selected nodes that serve as intermediate destinations. These nodes are selected with probability proportional to 1/rρ, where r is the distance to u and ρ is a suitable constant for the network. Then we derive a set of sufficient conditions to select the next step at each stage of routing, such that these conditions can be verified locally and guarantee 1+ϵ stretch routing on any metric. These conditions serve as the “greedy routing” or local decision rule. On graphs of bounded growth, our scheme guarantees 1+ϵ stretch routing with high probability, with an average routing table size of O(√n log2 n). This scheme is favorable for its simplicity, generality, and blindness to any global state. It demonstrates that global routing properties could emerge from purely distributed and uncoordinated routing table design.