Dynamic Coverage Verification in Mobile Sensor Networks Via Switched Higher Order Laplacians

In this paper, we study the problem of verifying dynamic coverage in mobile sensor networks using certain switched linear systems. These switched systems describe the flow of discrete differential forms on time-evolving simplicial complexes. The simplicial complexes model the connectivity of agents in the network, and the homology groups of the simplicial complexes provides information about the coverage properties of the network. Our main result states that the asymptotic stability the switched linear system implies that every point of the domain covered by the mobile sensor nodes is visited infinitely often, hence verifying dynamic coverage. The enabling mathematical technique for this result is the theory of higher order Laplacian operators, which is a generalization of the graph Laplacian used in spectral graph theory and continuous-time consensus problems.

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

[2]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2005, Mob. Networks Appl..

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

[4]  József Balogh,et al.  On k−coverage in a mostly sleeping sensor network , 2008, Wirel. Networks.

[5]  Gaurav S. Sukhatme,et al.  Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[6]  Milan Nosovic,et al.  Low Power Rendezvous and RFID Wakeup for Embedded Wireless Networks , 2000 .

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

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

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

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

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

[12]  Gaurav S. Sukhatme,et al.  Multi-robot Dynamic Coverage of a Planar Bounded Environment , 2003 .

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

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

[15]  Stefan Friedrich,et al.  Topology , 2019, Arch. Formal Proofs.

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

[17]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[18]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

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

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

[21]  Anthony M. Bloch,et al.  Dynamic coverage optimal control of interferometric imaging spacecraft formations , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[22]  Gaurav S. Sukhatme,et al.  Spreading Out: A Local Approach to Multi-robot Coverage , 2002, DARS.

[23]  Jeremy Gray,et al.  A history of algebraic and differential topology, 1900–1960: By Jean Dieudonné. Boston and Basel (Birkhäuser). 1989. xxi + 648 pp , 1991 .

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

[25]  Gaurav S. Sukhatme,et al.  Sensor coverage using mobile robots and stationary nodes , 2002, SPIE ITCom.

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

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

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

[29]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[30]  Bruce H. Krogh,et al.  Energy-efficient surveillance system using wireless sensor networks , 2004, MobiSys '04.

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

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

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

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