Constructing low-connectivity and full-coverage three dimensional sensor networks

Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k disjoint paths between any two sensor nodes in a WSN, where k ≤ 4. In this paper, we design a set of patterns to achieve 1-, 2-, 3- and 4-connectivity and full-coverage, and prove their optimality under any value of the ratio of communication range rc over sensing range rs, among regular lattice deployment patterns. We further investigate the evolutions among all the proposed low-connectivity patterns. Finally, we study the proposed patterns under several practical settings.

[1]  Yunhuai Liu,et al.  Surface Coverage in Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

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

[3]  Sajal K. Das,et al.  Critical Density for Coverage and Connectivity in Three-Dimensional Wireless Sensor Networks Using Continuum Percolation , 2009, IEEE Transactions on Parallel and Distributed Systems.

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

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

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

[7]  Karl Sigmund,et al.  Kepler’s conjecture: How some of the greatest minds in history helped solve one of the oldest math problems in the world , 2004 .

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

[9]  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..

[10]  H. Coxeter,et al.  Introduction to Geometry. , 1961 .

[11]  R. Kershner.  The Number of Circles Covering a Set , 1939 .

[12]  Hossam S. Hassanein,et al.  On the robustness of grid-based deployment in wireless sensor networks , 2006, IWCMC '06.

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

[14]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

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

[16]  P. C. Schuur,et al.  Improved Coverings of a Square with Six and Eight Equal Circles , 1996, Electron. J. Comb..

[17]  K. Nurmela,et al.  COVERING A SQUARE WITH UP TO 30 EQUAL CIRCLES , 2000 .

[18]  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).

[19]  Koushik Kar,et al.  Low-coordination topologies for redundancy in sensor networks , 2005, MobiHoc '05.

[20]  H. Davenport,et al.  The covering of space by spheres , 1952 .

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

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

[23]  George G. Szpiro,et al.  More on fisheries , 2003, Nature.

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

[25]  Sajal K. Das,et al.  Coverage and connectivity issues in wireless sensor networks: A survey , 2008, Pervasive Mob. Comput..

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

[27]  H. Ishida,et al.  Gas sensor network for air-pollution monitoring , 2005 .

[28]  Yu-Chee Tseng,et al.  The Coverage Problem in Three-Dimensional Wireless Sensor Networks , 2007, J. Interconnect. Networks.

[29]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

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

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

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

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

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

[35]  Zygmunt J. Haas,et al.  Coverage and connectivity in three-dimensional networks , 2006, MobiCom '06.

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

[37]  Gábor Fejes Tóth.  Covering with Fat Convex Discs , 2005, Discret. Comput. Geom..

[38]  William Thomson.  On the division of space with minimum partitional area , 1887 .

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

[40]  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.

[41]  Mario Gerla,et al.  The Meandering Current Mobility Model and its Impact on Underwater Mobile Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[42]  Teofilo F. Gonzalez,et al.  Covering a Set of Points in Multidimensional Space , 1991, Inf. Process. Lett..

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