Distributed Coverage Verification in Sensor Networks Without Location Information

In this paper, we present three distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of localization devices, simplicial complexes and tools from algebraic topology can be used in providing valuable information about the properties of the cover. Our approach is based on computation of homologies of the Rips complex corresponding to the sensor network. First, we present a decentralized scheme based on Laplacian flows to compute a generator of the first homology, which represents coverage holes. Then, we formulate the problem of localizing coverage holes as an optimization problem for computing a sparse generator of the first homology. Furthermore, we show that one can detect redundancies in the sensor network by finding a sparse generator of the second homology of the cover relative to its boundary. We demonstrate how subgradient methods can be used in solving these optimization problems in a distributed manner. Finally, we provide simulations that illustrate the performance of our algorithms.

[1]  A. Jadbabaie,et al.  Decentralized Computation of Homology Groups in Networks by Gossip , 2007, 2007 American Control Conference.

[2]  Bojan Mohar,et al.  Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs , 2007, Discret. Comput. Geom..

[3]  Erin W. Chambers,et al.  Testing contractibility in planar rips complexes , 2008, SCG '08.

[4]  Jeff Erickson,et al.  Tightening non-simple paths and cycles on surfaces , 2006, SODA '06.

[5]  Victor Reiner,et al.  Shifted simplicial complexes are Laplacian integral , 2002 .

[6]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[7]  D. Donoho,et al.  Sparse nonnegative solution of underdetermined linear equations by linear programming. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Stephen P. Boyd,et al.  Subgradient Methods , 2007 .

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

[10]  B. Eckmann.  Harmonische Funktionen und Randwertaufgaben in einem Komplex , 1944 .

[11]  R. Ho.  Algebraic Topology , 2022 .

[12]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[13]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[14]  Chao Chen,et al.  Quantifying Homology Classes II: Localization and Stability , 2007, ArXiv.

[15]  Loring W. Tu,et al.  Differential forms in algebraic topology , 1982, Graduate texts in mathematics.

[16]  Erin W. Chambers,et al.  Rips Complexes of Planar Point Sets , 2007, 0712.0395.

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

[18]  Francis Lazarus,et al.  Optimal System of Loops on an Orientable Surface , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[19]  Magnus Egerstedt,et al.  Control Using Higher Order Laplacians in Network Topologies , 2006 .

[20]  Abubakr Muhammad,et al.  Blind Swarms for Coverage in 2-D , 2005, Robotics: Science and Systems.

[21]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

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

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

[24]  F. Bullo,et al.  Distributed deployment of asynchronous guards in art galleries , 2006, 2006 American Control Conference.

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

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

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

[28]  O. Nelles,et al.  An Introduction to Optimization , 1996, IEEE Antennas and Propagation Magazine.

[29]  Bojan Mohar,et al.  Finding one tight cycle , 2008, SODA '08.

[30]  L. Vietoris.  Über den höheren Zusammenhang kompakter Räume und eine Klasse von zusammenhangstreuen Abbildungen , 1927 .

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

[32]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[33]  Jeff Erickson,et al.  Greedy optimal homotopy and homology generators , 2005, SODA '05.

[34]  Stephen P. Boyd,et al.  Low-authority controller design via convex optimization , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[35]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

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

[37]  R. Merris.  Laplacian matrices of graphs: a survey , 1994 .