Coverage Assessment and Target Tracking in 3D Domains

Recent advances in integrated electronic devices motivated the use of Wireless Sensor Networks (WSNs) in many applications including domain surveillance and mobile target tracking, where a number of sensors are scattered within a sensitive region to detect the presence of intruders and forward related events to some analysis center(s). Obviously, sensor deployment should guarantee an optimal event detection rate and should reduce coverage holes. Most of the coverage control approaches proposed in the literature deal with two-dimensional zones and do not develop strategies to handle coverage in three-dimensional domains, which is becoming a requirement for many applications including water monitoring, indoor surveillance, and projectile tracking. This paper proposes efficient techniques to detect coverage holes in a 3D domain using a finite set of sensors, repair the holes, and track hostile targets. To this end, we use the concepts of Voronoi tessellation, Vietoris complex, and retract by deformation. We show in particular that, through a set of iterative transformations of the Vietoris complex corresponding to the deployed sensors, the number of coverage holes can be computed with a low complexity. Mobility strategies are also proposed to repair holes by moving appropriately sensors towards the uncovered zones. The tracking objective is to set a non-uniform WSN coverage within the monitored domain to allow detecting the target(s) by the set of sensors. We show, in particular, how the proposed algorithms adapt to cope with obstacles. Simulation experiments are carried out to analyze the efficiency of the proposed models. To our knowledge, repairing and tracking is addressed for the first time in 3D spaces with different sensor coverage schemes.

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

[2]  Mingyan Liu,et al.  Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[3]  Sándor P. Fekete,et al.  Neighborhood-Based Topology Recognition in Sensor Networks , 2004, ALGOSENSORS.

[4]  Yu-Chee Tseng,et al.  A probabilistic signal-strength-based evaluation methodology for sensor network deployment , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[5]  ZhangXiaodong,et al.  A study on object tracking quality under probabilistic coverage in sensor networks , 2005 .

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

[7]  R. Ho Algebraic Topology , 2022 .

[8]  Abubakr Muhammad,et al.  Dynamic Coverage Verification in Mobile Sensor Networks Via Switched Higher Order Laplacians , 2007, Robotics: Science and Systems.

[9]  Vin de Silva,et al.  Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology , 2006, Int. J. Robotics Res..

[10]  Peter I. Corke,et al.  Localization and Navigation Assisted by Networked Cooperating Sensors and Robots , 2005, Int. J. Robotics Res..

[11]  Alireza Tahbaz-Salehi,et al.  Distributed coverage verification in sensor networks without location information , 2008, 2008 47th IEEE Conference on Decision and Control.

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

[13]  Henri Koskinen,et al.  ON THE COVERAGE OF A RANDOM SENSOR NETWORK IN A BOUNDED DOMAIN , 2004 .

[14]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization in distributed sensor networks , 2004, TECS.

[15]  V. Boltyanskii,et al.  Topology of Surfaces , 2001 .

[16]  Xiang-Yang Li,et al.  Coverage in wireless ad-hoc sensor networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[17]  J. Hausmann On the Vietoris-Rips complexes and a Cohomology Theory for metric spaces , 1996 .

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

[19]  Abubakr Muhammad,et al.  Coverage and hole-detection in sensor networks via homology , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[20]  H. S. Wolff,et al.  iRun: Horizontal and Vertical Shape of a Region-Based Graph Compression , 2022, Sensors.

[21]  Vin de Silva,et al.  Coverage in sensor networks via persistent homology , 2007 .

[22]  Prasant Mohapatra,et al.  Power conservation and quality of surveillance in target tracking sensor networks , 2004, MobiCom '04.