Cone Tessellation Model for Three-Dimensional Networks

Wireless terrestrial networks are usually designed in 2D plane, but in real life they form 3D space. In these networks, node placement strategy is one of the most important design problems. The idea is to deploy a number of nodes in an effective way to achieve communication between them. The volumetric quotient, which is the ratio of the transmission range to the sensing range of each node, is used as the main measure of the placement strategy. Researchers use polyhedrons to model 3D networks. As the volumetric quotient increases, we need less number of nodes for full coverage. In this paper, we proposed a cone model which gives a higher volumetric quotient than polyhedrons. The inspiration comes from satellite foot-print. For example, the number of nodes for truncated octahedron placement strategy is found to be 46.35% higher than the cone placement strategy. We also achieved full coverage with cone tessellation.

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

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

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

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

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

[6]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

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

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

[9]  Azzedine Boukerche,et al.  Wireless Communication and Mobile Computing , 2005, Handbook of Algorithms for Wireless Networking and Mobile Computing.

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

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

[12]  Zygmunt J. Haas,et al.  Coverage and connectivity in three-dimensional underwater sensor networks , 2008, Wirel. Commun. Mob. Comput..

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

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

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

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

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

[18]  Zygmunt J. Haas,et al.  Coverage and connectivity in three-dimensional underwater sensor networks , 2008 .

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

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