We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance to t decreases monotonically along the path. A consequence of this conjecture would be that in any ad hoc network containing such a graph as a subgraph, 2-dimensional virtual coordinates for the nodes can be found for which greedy geographic routing is guaranteed to work. We discuss this conjecture and its equivalent forms. We show a weaker result, namely that for any network containing a 3-connected planar subgraph, 3-dimensional virtual coordinates always exist enabling a form of greedy routing inspired by the simplex method; we provide experimental evidence that this scheme is quite effective in practice. We also propose a rigorous form of face routing based on the Koebe-Andre’ev-Thurston theorem. Finally, we show a result delimiting the applicability of our approach: any 3-connected K 3,3-free graph has a planar 3-connected subgraph.
[1]
W. T. Tutte.
Convex Representations of Graphs
,
1960
.
[2]
László Lovász,et al.
Rubber bands, convex embeddings and graph connectivity
,
1988,
Comb..
[3]
G. Ziegler.
Lectures on Polytopes
,
1994
.
[4]
W. Thurston,et al.
Three-Dimensional Geometry and Topology, Volume 1: Volume 1
,
1997
.
[5]
W. Thurston,et al.
Three-Dimensional Geometry and Topology, Volume 1
,
1997,
The Mathematical Gazette.
[6]
Brad Karp,et al.
GPSR: greedy perimeter stateless routing for wireless networks
,
2000,
MobiCom '00.
[7]
László Lovász,et al.
Steinitz Representations of Polyhedra and the Colin de Verdière Number
,
2001,
J. Comb. Theory, Ser. B.
[8]
Yan Zhang,et al.
Geometric ad-hoc routing: of theory and practice
,
2003,
PODC '03.
[9]
Scott Shenker,et al.
Geographic routing without location information
,
2003,
MobiCom '03.
[10]
Mathew D. Penrose,et al.
Random Geometric Graphs
,
2003
.