A coverage strategy for wireless sensor networks in a three-dimensional environment

Coverage is one of the fundamental issues in wireless sensor networks (WSNs). The detection area is non–ideal and the terrain of the detection area is more complex in applications of three–dimensional sensor networks. Consequently, many of the existing coverage strategies cannot be directly applied to three–dimensional spaces. This paper presents a new coverage strategy for the three–dimensional sensor networks. Sensor nodes are uniformly distributed. The cost factor is utilised to construct the perceived probability and the classical watershed algorithm after the transformation of points from the three–dimensional space to the two–dimensional plane using the dimensionality reduction method, which can maintain the topology characteristic of the non–linear terrain. The detection probability in the optimal breath path is used as the measure to evaluate the coverage. Simulation results indicate that the proposed strategy can determine the coverage with fewer nodes, while achieving the coverage requirements of the networks.

[1]  Jay L. Devore,et al.  Probability and statistics for engineering and the sciences , 1982 .

[2]  Mark Allen Weiss,et al.  Data structures and algorithm analysis in C , 1991 .

[3]  Luc Vincent,et al.  Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Frank Hoffmann,et al.  The art gallery theorem for polygons with holes , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[5]  T. Shermer Recent Results in Art Galleries , 1992 .

[6]  Joseph O'Rourke Computational geometry column 15 , 1992, Int. J. Comput. Geom. Appl..

[7]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[8]  D. D. Ridder,et al.  Locally linear embedding for classification , 2002 .

[9]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[10]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[11]  Krishnendu Chakrabarty,et al.  Sensor placement for effective coverage and surveillance in distributed sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[12]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

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

[14]  Lale Akarun,et al.  Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks , 2004, ISCIS.

[15]  Donald F. Towsley,et al.  Mobility improves coverage of sensor networks , 2005, MobiHoc '05.

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

[17]  Yu-Chee Tseng,et al.  Efficient deployment algorithms for ensuring coverage and connectivity of wireless sensor networks , 2005, First International Conference on Wireless Internet (WICON'05).

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

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

[20]  Radha Poovendran,et al.  Stochastic coverage in heterogeneous sensor networks , 2006, TOSN.

[21]  Hakan Tezcan,et al.  3D Coverage Analysis under Heterogeneous Deployment Strategies in Wireless Sensor Networks , 2008, 2008 Fourth Advanced International Conference on Telecommunications.

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

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

[24]  Lale Akarun,et al.  Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours , 2010, Comput. Networks.

[25]  Liang Liu,et al.  On Coverage of Wireless Sensor Networks for Rolling Terrains , 2012, IEEE Transactions on Parallel and Distributed Systems.

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

[27]  A. Elfes,et al.  Occupancy Grids: A Stochastic Spatial Representation for Active Robot Perception , 2013, ArXiv.