Bubble routing: A scalable algorithm with guaranteed delivery in 3D sensor networks

Compared with its 2D counterpart, the scalability problem is greatly exacerbated in a 3D wireless sensor network. In this paper, we propose a scalable routing algorithm, dubbed Bubble Routing. It preprocesses global knowledge via a distributed algorithm, such that a node only needs to store a small constant information to make correct and efficient local routing decisions and achieve guaranteed delivery at the same time. More specifically, the proposed bubble routing algorithm first decompose a 3D network into a set of hollow spherical cells (HSCs). A continuous and one-to-one mapping is applied and a virtual tree structure is established inside each HSC to enable greedy routing. On the other hand, routing across HSCs is guided by a small routing table whose size is bounded by the number of interior holes. Our simulation results show that bubble routing can achieve guaranteed data delivery, low stretch factor, and well balanced traffic load.

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

[2]  Jie Wu,et al.  Efficient Geometric Routing in Three Dimensional Ad Hoc Networks , 2009, IEEE INFOCOM 2009.

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

[4]  David G. Kirkpatrick,et al.  On routing with guaranteed delivery in three-dimensional ad hoc wireless networks , 2008, Wirel. Networks.

[5]  Kamran Mohseni,et al.  SensorFlock: an airborne wireless sensor network of micro-air vehicles , 2007, SenSys '07.

[6]  B. Chow,et al.  COMBINATORIAL RICCI FLOWS ON SURFACES , 2002, math/0211256.

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

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

[9]  Hongyi Wu,et al.  Optimal surface deployment problem in wireless sensor networks , 2012, 2012 Proceedings IEEE INFOCOM.

[10]  Hongyi Wu,et al.  A distributed triangulation algorithm for wireless sensor networks on 2D and 3D surface , 2011, 2011 Proceedings IEEE INFOCOM.

[11]  Wei Cheng,et al.  Underwater Localization in Sparse 3D Acoustic Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[12]  Hongyi Wu,et al.  Localized Algorithm for Precise Boundary Detection in 3D Wireless Networks , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[13]  Dario Pompili,et al.  Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks , 2006, MobiCom '06.

[14]  Mark Crovella,et al.  Hyperbolic Embedding and Routing for Dynamic Graphs , 2009, IEEE INFOCOM 2009.

[15]  Hongyi Wu,et al.  Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks , 2011, MobiHoc '11.

[16]  Roger Wattenhofer,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

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

[18]  Ben Leong,et al.  Path vector face routing: geographic routing with local face information , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[19]  Weijia Jia,et al.  Low-connectivity and full-coverage three dimensional wireless sensor networks , 2009, MobiHoc '09.

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

[21]  Siyuan Chen,et al.  Load Balancing Routing in Three Dimensional Wireless Networks , 2008, 2008 IEEE International Conference on Communications.

[22]  Jiejun Kong,et al.  The challenges of building mobile underwater wireless networks for aquatic applications , 2006, IEEE Network.

[23]  Tristan Needham,et al.  Visual Complex Analysis , 1997 .

[24]  Weijia Jia,et al.  Full-Coverage and k-Connectivity (k=14,6) Three Dimensional Networks , 2009, IEEE INFOCOM 2009.

[25]  Chen Qian,et al.  Geographic Routing with Low Stretch in d-dimensional Spaces ∗ , 2010 .

[26]  Chen Qian,et al.  Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch , 2013, TNET.

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

[28]  David Eppstein,et al.  Optimal Möbius Transformations for Information Visualization and Meshing , 2001, WADS.

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

[30]  Roger Wattenhofer,et al.  Randomized 3D Geographic Routing , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[31]  Jaroslav Opatrny,et al.  Randomized 3D Position-based Routing Algorithms for Ad-hoc Networks , 2006, 2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services.

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

[33]  Ivan Stojmenovic,et al.  On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks , 2006, MobiCom '06.

[34]  P. Lockhart,et al.  Introduction to Geometry , 1940, The Mathematical Gazette.

[35]  Jaroslav Opatrny,et al.  Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks , 2005, CCCG.

[36]  Yu Chen,et al.  Practical 3D geographic routing for wireless sensor networks , 2010, SenSys '10.

[37]  Jaroslav Opatrny,et al.  Randomized 3D Position-based Routing Algorithms for Ad-hoc Networks , 2006 .

[38]  Anne-Marie Kermarrec,et al.  Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks , 2009, IEEE INFOCOM 2009.

[39]  Otfried Cheong,et al.  The Voronoi Diagram of Curved Objects , 1995, SCG '95.

[40]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.