Sweep Coverage with Mobile Sensors

Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In this work, we study a new coverage scenario, sweep coverage, which differs with the previous static coverage. In sweep coverage, we only need to monitor certain points of interest (POIs) periodically so the coverage at each POI is time-variant, and thus we are able to utilize a small number of mobile sensors to achieve sweep coverage among a much larger number of POIs. We investigate the definitions and model for sweep coverage. Given a set of POIs and their sweep period requirements, we prove that determining the minimum number of required sensors (min-sensor sweep-coverage problem) is NP-hard, and it cannot be approximated within a factor of 2. We propose a centralized algorithm with constant approximation ratio 3 for the min-sensor sweep-coverage problem. We further characterize the nonlocality of the problem and design a distributed sweep algorithm, DSWEEP, cooperating sensors to provide efficiency with the best effort. We conduct extensive simulations to study the performance of the proposed algorithms. Our simulations show that DSWEEP outperforms the randomized scheme in both effectiveness and efficiency.

[1]  Ioannis M. Rekleitis,et al.  Distributed coverage with multi-robot system , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[2]  Lan Lin,et al.  Distributed algorithms for dynamic coverage in sensor networks , 2007, PODC '07.

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

[4]  Béla Bollobás,et al.  Reliable Density Estimates for Achieving Coverage and Connectivity in Thin Strips of Finite Length , 2007, ACM/IEEE International Conference on Mobile Computing and Networking.

[5]  Ai Chen,et al.  Designing localized algorithms for barrier coverage , 2007, MobiCom '07.

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

[7]  James M. Conrad,et al.  Time synchronization in wireless sensor networks: A survey , 2010, Proceedings of the IEEE SoutheastCon 2010 (SoutheastCon).

[8]  Pooyan Fazli.  On Multi-robot Area Coverage , 2010, Canadian Conference on AI.

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

[10]  Malcolm R. K. Ryan.  Graph Decomposition for Efficient Multi-Robot Path Planning , 2007, IJCAI.

[11]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[12]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[13]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[14]  Béla Bollobás,et al.  Reliable density estimates for coverage and connectivity in thin strips of finite length , 2007, MobiCom '07.

[15]  Wolfram Burgard,et al.  Optimizing schedules for prioritized path planning of multi-robot systems , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[16]  Jie Wu,et al.  Energy-efficient coverage problems in wireless ad-hoc sensor networks , 2006, Comput. Commun..

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

[18]  Qian Zhang,et al.  Probabilistic Field Coverage using a Hybrid Network of Static and Mobile Sensors , 2007, 2007 Fifteenth IEEE International Workshop on Quality of Service.

[19]  József Balogh,et al.  On k-coverage in a mostly sleeping sensor network , 2004, MobiCom '04.

[20]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[21]  Malcolm Ross Kinsella Ryan.  Exploiting Subgraph Structure in Multi-Robot Path Planning , 2008, J. Artif. Intell. Res..

[22]  Donald F. Towsley,et al.  Mobility improves coverage of sensor networks , 2005, MobiHoc '05.

[23]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

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

[25]  Ajay D. Kshemkalyani,et al.  Clock synchronization for wireless sensor networks: a survey , 2005, Ad Hoc Networks.

[26]  Wei Wang,et al.  Trade-offs between mobility and density for coverage in wireless sensor networks , 2007, MobiCom '07.

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

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

[29]  Thomas F. La Porta,et al.  Movement-Assisted Sensor Deployment , 2006, IEEE Trans. Mob. Comput..

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

[31]  Ai Chen,et al.  Local Barrier Coverage in Wireless Sensor Networks , 2010, IEEE Transactions on Mobile Computing.

[32]  Mark H. Overmars,et al.  Coordinated path planning for multiple robots , 1998, Robotics Auton. Syst..

[33]  Shaojie Tang,et al.  Canopy closure estimates with GreenOrbs: sustainable sensing in the forest , 2009, SenSys '09.

[34]  Fedor A. Kolushev,et al.  Multi-agent Optimal Path Planning for Mobile Robots in Environment with Obstacles , 1999, Ershov Memorial Conference.

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