Three Dimensional Networks

In this paper, we study the problem of constructing full-coverage three dimensional networks with multiple con- nectivity. We design a set of patterns for full coverage and two representative connectivity requirements, i.e. 14- and 6- connectivity. We prove their optimality under any ratio of the communication range over the sensing range among regular lattice deployment patterns. We also conduct a study on the proposed patterns under practical settings. To our knowledge, our work is the first one that provides deployment patterns with proven optimality that achieve both coverage and connectivity in three dimensional networks.

[1]  Weijia Jia,et al.  Complete optimal deployment patterns for full-coverage and k-connectivity (k≤6) wireless sensor networks , 2008, MobiHoc '08.

[2]  H. Coxeter,et al.  Introduction to Geometry , 1964, The Mathematical Gazette.

[3]  M.K. Watfa,et al.  A coverage algorithm in 3D wireless sensor networks , 2006, 2006 1st International Symposium on Wireless Pervasive Computing.

[4]  N. Sloane.  The proof of the packing , 2003, Nature.

[5]  T. Hales.  The Kepler conjecture , 1998, math/9811078.

[6]  Marco Zuniga,et al.  Analyzing the transitional region in low power wireless links , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[7]  Tarek F. Abdelzaher,et al.  Analysis of Target Detection Performance for Wireless Sensor Networks , 2005, DCOSS.

[8]  Mohamed K. Watfa.  Practical Applications and Connectivity Algorithms in Future Wireless Sensor Networks , 2008 .

[9]  Dario Pompili,et al.  Three-dimensional routing in underwater acoustic sensor networks , 2005, PE-WASUN '05.

[10]  Brian Neil Levine,et al.  A survey of practical issues in underwater networks , 2006, MOCO.

[11]  Jun-Hong Cui,et al.  Scalable Localization with Mobility Prediction for Underwater Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[12]  George G. Szpiro.  Kepler's Conjecture: How Some of the Greatest Minds in History Helped Solve One of the Oldest Math Problems in the World , 2003 .

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

[14]  R. P. Bambah.  Lattice coverings with four-dimensional spheres , 1954 .

[15]  S. W. Thomson.  LXIII. On the division of space with minimum partitional area , 1887 .

[16]  E. S. Barnes.  The Covering Of Space By Spheres , 1956, Canadian Journal of Mathematics.

[17]  M. Bleicher.  Lattice Coverings of n-Space By Spheres , 1962, Canadian Journal of Mathematics.

[18]  Miodrag Potkonjak,et al.  Exposure in Wireless Sensor Networks: Theory and Practical Solutions , 2002, Wirel. Networks.

[19]  P. Lockhart.  INTRODUCTION TO GEOMETRY , 2007 .

[20]  Yu-Chee Tseng,et al.  The coverage problem in three-dimensional wireless sensor networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[21]  Dong Xuan,et al.  On Deploying Wireless Sensors to Achieve Both Coverage and Connectivity , 2006, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[22]  Jun-Hong Cui,et al.  DBR: Depth-Based Routing for Underwater Sensor Networks , 2008, Networking.

[23]  Yuan Li,et al.  Research challenges and applications for underwater sensor networking , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

[24]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[25]  Weijia Jia,et al.  Deploying Four-Connectivity and Full-Coverage Wireless Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[26]  L. Few.  Covering space by spheres , 1956 .

[27]  R. Bambah,et al.  On lattice coverings by spheres , 1954 .