In this paper, we investigate how to design greedy routing to guarantee packet delivery in a three-dimensional (3D) network. In 2D networks, many position-based routing protocols apply face routing on planar routing structure as a backup method to guarantee packet delivery when greedy routing fails at local minimum. However, in 3D networks, no planar topology can be constructed anymore. Even wo...

In this paper, we consider hot-potato packet routing of one-to-one routing patterns on n-node trees. By applying a ‘charging argument’, we show that any greedy hot-potato algorithm routes a oneto-one routing pattern within 2(n − 1) steps. On the other hand, a trivial lower bound suggests that at least 3n/2 steps are required by any oblivious greedy algorithm. As the main contribution of the pap...

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 paper 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 routin...

Exploring the faces of a planar graph is a prominent approach to recover from routing failures which may occur during geographic greedy forwarding heuristics. A recently studied variant of planar graph based recovery, termed geographical cluster based routing, performs face exploration along the edges of an overlay graph instead of using the network links directly. For this routing variant it h...

We construct the first n-node degree-d ring-based network with worst-case greedy routes of length Θ(log n/ log d) hops. We study greedy routing over uni-dimensional metrics defined over n nodes lying in a ring. greedy routing in graph (V, E) with distance function δ : V × V → R entails the following decision: Given target node t, node u with neighbors N(u) forwards a message to v ∈ N(u) such th...

In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. We show that greedy graph drawing schemes exist for the Euclidean metric in R, for 3-connected planar graphs, with coordinates that can be represented succinctly, that is, with O(log n) bits. Moreover...

This paper presents a theoretical analysis of greedy geographic routing protocols on a common class of wireless sensor networks that must provide sensing coverage over a geographic area. Contrary to well known results on random networks, we prove that the Greedy Geographic Forwarding and our new greedy protocol always succeed in any sensing covered network when the communication range is at lea...

One of the key challenges in geographic routing is how to deal with dead-ends, where greedy routing fails to find a neighbor node which is closer to the destination. Most existing geographic routing algorithms just switch to the deterministic face routing or limits its face searching range. In this paper, we demonstrate that we can improve routing performance by considering local connectivity s...

Topologies and routing protocols for peer-to-peer networks have witnessed a flurry of research activity recently. Almost all designs employ greedy routing in one form or the other. Randomized topologies that are currently under investigation fall into two categories: (a) small-world network topologies based upon Kleinberg’s construction [Kle00], and (b) randomized variants of deterministic topo...