Topological and combinatorial coverage hole detection in coordinate-free wireless sensor networks

Wireless sensor network WSN coverage completeness is an important quality of service QoS. It is frequently assumed that events occurring in the sensor field can always be detected. However, this is not necessarily the case, particularly if there are holes in the sensor network coverage. This paper introduces a novel centralised method for detection and relative localisation of WSN coverage holes in coordinate-free networks. We identify sensor nodes that surround or bound coverage holes, called 'hole boundary-nodes', by processing information embedded in a communication graph, which is non-planar in general. We create a hole-equivalent planar graph that has the same number and position of holes as the original sensor network graph while preserving the embedding. Finally, we build a plane simplicial complex, called maximal simplicial complex, which contains the information regarding coverage holes. Simulation results are presented to illustrate the proposed method and evaluate its accuracy and run time.

[1]  Dexter Kozen,et al.  The Design and Analysis of Algorithms , 1991, Texts and Monographs in Computer Science.

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

[3]  Samir R. Das,et al.  Tracking moving targets in a smart sensor network , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[4]  Yang Xiao,et al.  Error Analysis and Kernel Density Approach of Scheduling Sleeping Nodes in Cluster-Based Wireless Sensor Networks , 2009, IEEE Transactions on Vehicular Technology.

[5]  Matt Welsh,et al.  Deploying a wireless sensor network on an active volcano , 2006, IEEE Internet Computing.

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

[7]  Philippe Martins,et al.  Connectivity-Based Distributed Coverage Hole Detection in Wireless Sensor Networks , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[8]  Pawel Dlotko,et al.  Distributed computation of coverage in sensor networks by homological methods , 2012, Applicable Algebra in Engineering, Communication and Computing.

[9]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  Stefan Funke,et al.  Hole detection or: "how much geometry hides in connectivity?" , 2006, SCG '06.

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

[12]  H. T. Kung,et al.  Efficient location tracking using sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[13]  Xiaojiang Du,et al.  Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networks , 2009, Comput. Networks.

[14]  Magnus Egerstedt,et al.  Connectivity graphs as models of local interactions , 2004, CDC.

[15]  Alireza Tahbaz-Salehi,et al.  Distributed Coverage Verification in Sensor Networks Without Location Information , 2010, IEEE Transactions on Automatic Control.

[16]  Stefan Funke,et al.  Topological hole detection in wireless sensor networks and its applications , 2005, DIALM-POMC '05.

[17]  Suman Banerjee,et al.  Node Placement for Connected Coverage in Sensor Networks , 2003 .

[18]  Edoardo S. Biagioni,et al.  The Application of Remote Sensor Technology To Assist the Recovery of Rare and Endangered Species , 2002, Int. J. High Perform. Comput. Appl..

[19]  Damla Turgut,et al.  Multi‐hop localization system for environmental monitoring in wireless sensor and actor networks , 2013, Concurr. Comput. Pract. Exp..

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

[21]  Sajal K. Das,et al.  Localization of Wireless Sensor Nodes Using Proximity Information , 2007, 2007 16th International Conference on Computer Communications and Networks.

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

[23]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[24]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[25]  Matthias R. Brust,et al.  Topology-based Clusterhead Candidate Selection in Wireless Ad-hoc and Sensor Networks , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

[26]  Rastko R. Selmic,et al.  Cooperative mobile agents search using beehive partitioned structure and Tabu Random search algorithm , 2013, Defense, Security, and Sensing.

[27]  Ratan K. Guha,et al.  Optimal Placement of Wireless Sensor Nodes with Fault Tolerance and Minimal Energy Consumption , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[28]  Leonidas J. Guibas,et al.  Locating and Bypassing Holes in Sensor Networks , 2006, Mob. Networks Appl..

[29]  Matthias R. Brust,et al.  Heuristics on link stability in ad hoc networks , 2008, NOMS 2008 - 2008 IEEE Network Operations and Management Symposium.

[30]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

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

[32]  Yang Xiao,et al.  IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, PAPER ID: TPDS-0307-0605.R1 1 Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks , 2022 .

[33]  Stefan Funke,et al.  Network sketching or: "How Much Geometry Hides in Connectivity?--Part II" , 2007, SODA '07.

[34]  Philippe Martins,et al.  Accuracy of homology based approaches for coverage hole detection in wireless sensor networks , 2012, 2012 IEEE International Conference on Communications (ICC).

[35]  坂上 貴之,et al.  書評「T. Kaczynski, K. Mischaikow, and M. Mrozek:Computational Homology (Applied Mathematical Sciences 157, Springer-Verlag, 2004 年, 480 ページ)」 , 2005 .

[36]  Jianying Zhou,et al.  Applying intrusion detection systems to wireless sensor networks , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

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

[38]  Douglas W. Gage,et al.  Command Control for Many-Robot Systems , 1992 .

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

[40]  Gyula Simon,et al.  Countersniper system for urban warfare , 2005, TOSN.

[41]  Sandeep K. S. Gupta,et al.  Research challenges in wireless networks of biomedical sensors , 2001, MobiCom '01.