Percolation Theory-Based Exposure-Path Prevention for 3D-Wireless Sensor Networks Coverage

Different from the existing works on coverage problems in wireless sensor networks (WSNs), this paper considers the exposure-path prevention problem by using the percolation theory in three dimensional (3D) WSNs, which can be implemented in intruder detecting applications. In this paper, to avoid the loose bounds of critical density, a bond percolation-based scheme is proposed to put the exposure-path problem into a 3D uniform lattice. Within this scheme, the tighter bonds of critical density for omnidirectional and directional sensor networks under random sensor deployment?a 3D Poisson process are derived. Extensive simulation results show that our scheme generates tighter bounds of critical density with no exposure path in 3D WSNs.

[1]  Ashok Kumar P.M,et al.  Anomalous Event Detection in Traffic Video Based on Sequential Temporal Patterns of Spatial Interval Events , 2015 .

[2]  Yi Wang,et al.  Barrier coverage in camera sensor networks , 2011, MobiHoc '11.

[3]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[4]  Yi Wang,et al.  On full-view coverage in camera sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.

[5]  E. N. Gilbert,et al.  Random Plane Networks , 1961 .

[6]  Donald F. Towsley,et al.  A study of the coverage of large-scale sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[7]  Jie Wang,et al.  Strong barrier coverage of wireless sensor networks , 2008, MobiHoc '08.

[8]  Ai Chen,et al.  Designing localized algorithms for barrier coverage , 2007, MobiCom '07.

[9]  Jie Wang,et al.  Barrier Coverage of Line-Based Deployed Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[10]  Silvia Ferrari,et al.  A potential field approach to finding minimum-exposure paths in wireless sensor networks , 2010, 2010 IEEE International Conference on Robotics and Automation.

[11]  Hristo Djidjev,et al.  Approximation algorithms for computing minimum exposure paths in a sensor field , 2010, TOSN.

[12]  Jiming Chen,et al.  Cost-effective barrier coverage by mobile sensor networks , 2012, 2012 Proceedings IEEE INFOCOM.

[13]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[14]  Hristo Djidjev,et al.  Efficient Computation of Minimum Exposure Paths in a Sensor Network Field , 2007, DCOSS.

[15]  Anish Arora,et al.  Barrier coverage with wireless sensors , 2005, MobiCom '05.

[16]  Daji Qiao,et al.  Barrier Information Coverage with Wireless Sensors , 2009, IEEE INFOCOM 2009.

[17]  Brian D. O. Anderson,et al.  Ieee Transactions on Wireless Communications, Accepted for Publication 1 Critical Density for Connectivity in 2d and 3d Wireless Multi-hop Networks , 2022 .

[18]  Miodrag Potkonjak,et al.  Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure , 2001, MobiHoc '01.

[19]  Rainer Lienhart,et al.  Approximating Optimal Visual Sensor Placement , 2006, 2006 IEEE International Conference on Multimedia and Expo.

[20]  Masoud Sabaei,et al.  Notice of Violation of IEEE Publication PrinciplesCritical Density for Coverage and Connectivity in Two-Dimensional Aligned-Orientation Directional Sensor Networks Using Continuum Percolation , 2015, IEEE Sensors Journal.

[21]  Jie Wu,et al.  Connected Point Coverage in Wireless Sensor Networks Using Robust Spanning Trees , 2011, 2011 31st International Conference on Distributed Computing Systems Workshops.

[22]  Yueyun Chen,et al.  Resource Allocation based on Hybrid Sharing Mode for Heterogeneous Services of Cognitive Radio OFDM Systems , 2015, KSII Trans. Internet Inf. Syst..

[23]  J. Hammersley,et al.  Percolation processes , 1957, Mathematical Proceedings of the Cambridge Philosophical Society.