Greedy Convex Embeddings for Ad-Hoc Networks

Recent advances in networked systems and wireless communications have set the stage for applications with wide-ranging benefits. Perhaps the most natural problem in such systems is the ” efficient” propagation of locally stored data. In order to address this problem, the notion of greedy embedding was defined by Papadimitriou and Ratajczak, where the authors conjectured that every 3-connected planar graph has a greedy embedding (possibly planar and convex) in the Euclidean plane. Recently, the greedy embedding conjecture was proved by Leighton and Moitra. However, their algorithm does not result in a drawing that is planar and convex in the Euclidean plane for all 3-connected planar graphs. Here we consider the planar convex greedy embedding conjecture and give a probabilistic proof for the existence of such embeddings. In addition, we discuss a second proof which is almost immediate in the case of an embedding into the 3-dimensional sphere.

[1]  Raghavan Dhandapani,et al.  Greedy Drawings of Triangulations , 2008, SODA '08.

[2]  László Lovász,et al.  Rubber bands, convex embeddings and graph connectivity , 1988, Comb..

[3]  Carsten Thomassen.  Tutte's spring theorem , 2004, J. Graph Theory.

[4]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[5]  Jürgen Richter-Gebert.  Realization Spaces of Polytopes , 1996 .

[6]  Gnter Rote,et al.  The number of spanning trees in a planar graph , 2005 .

[7]  William T. Tutte,et al.  A theory of 3-connected graphs , 1961 .

[8]  Frank Thomson Leighton,et al.  Some Results on Greedy Embeddings in Metric Spaces , 2008, FOCS.

[9]  Mirela Ben-Chen,et al.  Distributed computation of virtual coordinates , 2007, SCG '07.

[10]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[11]  László Lovász,et al.  Connectivity Algorithms Using Rubber-bands , 1986, Foundations of Software Technology and Theoretical Computer Science.

[12]  D. E. Daykin,et al.  An inequality for the weights of two families of sets, their unions and intersections , 1978 .

[13]  Tutte's spring theorem , 2004 .

[14]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[15]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[16]  T. E. Harris.  A lower bound for the critical probability in a certain percolation process , 1960, Mathematical Proceedings of the Cambridge Philosophical Society.

[17]  Christos H. Papadimitriou,et al.  On a conjecture related to geometric routing , 2004, Theor. Comput. Sci..

[18]  W. T. Tutte.  Convex Representations of Graphs , 1960 .

[19]  W. T. Tutte.  How to Draw a Graph , 1963 .

[20]  Frank Thomson Leighton,et al.  Some Results on Greedy Embeddings in Metric Spaces , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[21]  Koushik Sinha,et al.  On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs , 2009, FCT.