Spherical representation and polyhedron routing for load balancing in wireless sensor networks

In this paper we address the problem of scalable and load balanced routing for wireless sensor networks. Motivated by the analog of the continuous setting that geodesic routing on a sphere gives perfect load balancing, we embed sensor nodes on a convex polyhedron in 3D and use greedy routing to deliver messages between any pair of nodes with guaranteed success. This embedding is known to exist by the Koebe-Andreev-Thurston Theorem for any 3-connected planar graphs. In our paper we use discrete Ricci flow to develop a distributed algorithm to compute this embedding. Further, such an embedding is not unique and differs from one another by a Möbius transformation. We employ an optimization routine to look for the Möbius transformation such that the nodes are spread on the polyhedron as uniformly as possible. We evaluated the load balancing property of this greedy routing scheme and showed favorable comparison with previous schemes.

[1]  Yuliy Baryshnikov,et al.  Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks , 2009, Internet Math..

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

[3]  Jie Gao,et al.  Load-Balanced Short-Path Routing in Wireless Networks , 2006, IEEE Trans. Parallel Distributed Syst..

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

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

[6]  Richard M. Karp,et al.  Balancing traffic load in wireless networks with curveball routing , 2007, MobiHoc '07.

[7]  Jie Gao,et al.  Greedy routing with guaranteed delivery using Ricci flows , 2009, 2009 International Conference on Information Processing in Sensor Networks.

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

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

[10]  Robert D. Kleinberg.  Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[11]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[12]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[13]  Julinda Stefa,et al.  Routing in Outer Space: Fair Traffic Load in Multihop Wireless Networks , 2009, IEEE Transactions on Computers.

[14]  R. Hamilton.  Three-manifolds with positive Ricci curvature , 1982 .

[15]  Wei Zeng,et al.  Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space , 2010, 2010 Proceedings IEEE INFOCOM.

[16]  Prabhakar Raghavan,et al.  Provably good routing in graphs: regular arrays , 1985, STOC '85.

[17]  A. Bobenko,et al.  Variational principles for circle patterns and Koebe’s theorem , 2002, math/0203250.

[18]  Roger Wattenhofer,et al.  Greedy Routing with Bounded Stretch , 2009, IEEE INFOCOM 2009.

[19]  Christos H. Papadimitriou,et al.  On a Conjecture Related to Geometric Routing , 2004, ALGOSENSORS.

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

[21]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

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

[23]  Kenneth Stephenson,et al.  A circle packing algorithm , 2003, Comput. Geom..