Decentralized Deployment of Mobile Sensors for Optimal Connected Sensing Coverage

In this paper, we address the optimal connected sensing coverageproblem, i.e., how mobile sensors with limited sensing capabilities can cooperatively adjust their locations so as to maximize the extension of the covered area while avoiding any internal "holes", areas that are not covered by any sensor. Our solution consists in a distributed motion algorithmthat is based on an original extension of the Voronoi tessellation.

[1]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[2]  Thomas F. La Porta,et al.  A bidding protocol for deploying mobile sensors , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[3]  Gaurav S. Sukhatme,et al.  Robomote: a tiny mobile robot platform for large-scale ad-hoc sensor networks , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[4]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

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

[6]  Mark H. Overmars,et al.  Approximating Voronoi Diagrams of Convex Sites in any Dimension , 1998, Int. J. Comput. Geom. Appl..

[7]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[8]  Tobias J. Hagge,et al.  Physics , 1929, Nature.