Article thumbnail
Location of Repository

Coverage Assessment and Target Tracking in 3D Domains

By Noureddine Boudriga, Mohamed Hamdi and Sitharama Iyengar


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

Topics: Article
Publisher: Molecular Diversity Preservation International (MDPI)
OAI identifier:
Provided by: PubMed Central

Suggested articles


  1. (2005). A probabilistic signal-strength-based evaluation methodology for sensor network deployment.
  2. (2004). A study of the coverage of large-scale sensor networks.
  3. (2001). Algebraic Topology;
  4. (2006). Coordinate-free coverage in sensor networks with controlled boundaries via homology.
  5. (2005). Coverage and hole-detection in sensor networks via homology.
  6. (2007). Coverage in sensor networks via persistent homology.
  7. (2003). Coverage in wireless ad hoc sensor networks.
  8. (2001). Coverage problems in wireless ad-hoc sensor networks.
  9. (2008). Distributed coverage verification in sensor networks without location information.
  10. (2007). Dynamic coverage verification in mobile sensor networks via switched higher order Laplacians.
  11. (2005). Localization and navigation assisted by networked cooperating sensors and robots.
  12. (2005). Maintaining sensing coverage and connectivity in large sensor networks. Wirel. Ad Hoc Sensor Netw.
  13. (2004). Neighborhood-based topology recognition in sensor networks.
  14. (2004). Network coverage using low duty-cycled sensors: Random & coordinated sleep algorithms.
  15. (2004). On the coverage of a random sensor network in a bounded domain.
  16. (2004). Power conservation and quality of surveillance in target tracking sensor networks.
  17. Sensor deployment and target localization in distributed sensor networks.
  18. (2003). The coverage problem in a wireless sensor network.
  19. (1984). Topology of Surfaces; BCS Associates:
  20. (2008). Using higher-order Voronoi tessellations for WSN-based target tracking.
  21. X.Astudyonobjecttrackingqualityunderprobabilistic coverage in sensor networks.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.