Coverage and connectivity in three-dimensional networks

Although most wireless terrestrial networks are based on two-dimensional (2D) design, in reality, such networks operate in three-dimensions (3D). Since most often the size (i.e., the length and the width) of such terrestrial networks is significantly larger than the differences in the third dimension (i.e., the height) of the nodes, the 2D assumption is somewhat justified and usually it does not lead to major inaccuracies. However, in some environments, this is not the case; the underwater, atmospheric, or space communications being such apparent examples. In fact, recent interest in underwater acoustic ad hoc and sensor networks hints at the need to understand how to design networks in 3D. Unfortunately, the design of 3D networks is surprisingly more difficult than the design of 2D networks. For example, proofs of Kelvin's conjecture and Kepler's conjecture required centuries of research to achieve breakthroughs, whereas their 2D counterparts are trivial to solve. In this paper, we consider the coverage and connectivity issues of 3D networks, where the goal is to find a node placement strategy with 100% sensing coverage of a 3D space, while minimizing the number of nodes required for surveillance. Our results indicate that the use of the Voronoi tessellation of 3D space to create truncated octahedral cells results in the best strategy. In this truncated octahedron placement strategy, the transmission range must be at least 1.7889 times the sensing range in order to maintain connectivity among nodes. If the transmission range is between 1.4142 and 1.7889 times the sensing range, then a hexagonal prism placement strategy or a rhombic dodecahedron placement strategy should be used. Although the required number of nodes in the hexagonal prism and the rhombic dodecahedron placement strategies is the same, this number is 43.25% higher than the number of nodes required by the truncated octahedron placement strategy. We verify by simulation that our placement strategies indeed guarantee ubiquitous coverage. We believe that our approach and our results presented in this paper could be used for extending the processes of 2D network design to 3D networks.

[1]  Peter I. Corke,et al.  Data collection, storage, and retrieval with an underwater sensor network , 2005, SenSys '05.

[2]  David Wells,et al.  The Penguin Dictionary of Curious and Interesting Geometry , 1992 .

[3]  James E. pLebensohn.  Geometry and the Imagination , 1952 .

[4]  Jean Frédéric Myoupo,et al.  A basis for 3-D cellular networks , 2001, Proceedings 15th International Conference on Information Networking.

[5]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[6]  George Garrett.  "Is This Heaven?" , 2006 .

[7]  Rahul Jain,et al.  Geographical routing using partial information for wireless ad hoc networks , 2001, IEEE Wirel. Commun..

[8]  Tian He,et al.  Differentiated surveillance for sensor networks , 2003, SenSys '03.

[9]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[10]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[11]  Martin Gardner,et al.  Sixth book of mathematical games from Scientific American , 1971 .

[12]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

[13]  D. L. Weaire,et al.  The Kelvin problem : foam structures of minimal surface area , 1996 .

[14]  Leigh Burstein,et al.  Data Collection , 1985 .

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

[16]  Dario Pompili,et al.  Underwater acoustic sensor networks: research challenges , 2005, Ad Hoc Networks.

[17]  Pramod K. Varshney,et al.  Distributed Detection and Data Fusion , 1996 .

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

[19]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

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

[21]  Akbar M. Sayeed,et al.  Detection, Classification and Tracking of Targets in Distributed Sensor Networks , 2002 .

[22]  C. Decayeux,et al.  A new model for 3D cellular mobile networks , 2004, Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks.

[23]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[25]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[26]  Guoliang Xing,et al.  On greedy geographic routing algorithms in sensing-covered networks , 2004, MobiHoc '04.

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

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

[29]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[30]  Parameswaran Ramanathan,et al.  Sensor deployment strategy for target detection , 2002, WSNA '02.

[31]  Jiejun Kong,et al.  Building underwater ad-hoc networks and sensor networks for large scale real-time aquatic applications , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

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

[33]  D. Weaire,et al.  A counter-example to Kelvin's conjecture on minimal surfaces , 1994 .

[34]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[35]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..