The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2011 vol.10)
pp: 1534-1545
Mo Li , Hong Kong University of Science and Technology, Hong Kong
Weifang Cheng , National University of Defense Technology, China
Kebin Liu , Shanghai Jiao Tong University, China
Yuan He , Hong Kong University of Science and Technology, Hong Kong
Xiang-Yang Li , Illinois Institute of Technology, Chicago
Xiangke Liao , National University of Defense Technology, China
ABSTRACT
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.
INDEX TERMS
Sweep coverage, mobile sensors, dynamic coverage, DSWEEP.
CITATION
Mo Li, Weifang Cheng, Kebin Liu, Yuan He, Xiang-Yang Li, Xiangke Liao, "Sweep Coverage with Mobile Sensors", IEEE Transactions on Mobile Computing, vol.10, no. 11, pp. 1534-1545, November 2011, doi:10.1109/TMC.2010.237
REFERENCES
[1] "GreenOrbs," http:/www.greenorbs.org, 2011.
[2] "Robocar," http://www.esi.ust.hkprojects.html, 2011.
[3] "Simbad," http:/simbad.sourceforge.net, 2011.
[4] S. Arora, "Polynomial-Time Approximation Schemes for Euclidean TSP and Other Geometric Problems," Proc. IEEE 37th Ann. Symp. Foundations of Computer Science (FOCS '96), 1996.
[5] P. Balister, B. Bollobas, A. Sarkar, and S. Kumar, "Reliable Density Estimates for Achieving Coverage and Connectivity in Thin Strips of Finite Length," Proc. ACM MobiCom, 2007.
[6] M.A. Batalin and G.S. Sukhatme, "Multi-Robot Dynamic Coverage of a Planar Bounded Environment," Proc. IEEE/RSJ Int'l Conf. Intelligent Robots and Systems, 2002.
[7] M.A. Batalin and G.S. Sukhatme, "Multi-Robot Dynamic Coverage of a Planar Bounded Environment," Univ. of Southern California, CRES-03-011, 2003.
[8] M. Bennewitz, W. Burgard, and S. Thrun, "Optimizing Schedules for Prioritized Path Planning of Multi-Robot Systems," Proc. IEEE Int'l Conf. Robotics and Automation (ICRA '01), 2001.
[9] M. Cardei and D.-Z. Du, "Improving Wireless Sensor Network Lifetime through Power Aware Organization," ACM Wireless Networks, vol. 11, pp. 333-340, 2005.
[10] M. Cardei and J. Wu, "Energy-Efficient Coverage Problems in Wireless Ad Hoc Sensor Networks," J. Computer Comm. Sensor Networks, vol. 29, pp. 413-420, 2005.
[11] A. Chen, S. Kumar, and T.H. Lai, "Designing Localized Algorithms for Barrier Coverage," Proc. ACM MobiCom, 2007.
[12] H. Choset, "Coverage for Robotics—A Survey of Recent Results," Annals of Math. and Artificial Intelligence, vol. 31, pp. 113-126, 2001.
[13] N. Christofides, "Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem," Technical Report 388, Carnegie Mellon Univ., 1976.
[14] P. Fazli, "On Multi-Robot Area Coverage," Proc. Ninth Int'l Conf. Autonomous Agents and Multiagent Systems (AAMAS '10), 2010.
[15] D.W. Gage, "Command Control for Many-Robot Systems," Proc. AUVS Technical Symp., 1992.
[16] A. Howard, M.J. Mataric, and G.S. Sukhatme, "Mobile Sensor Network Deployment Using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem," Proc. Int'l Conf. Distributed Autonomous Robotic Systems 5 (DARS '02), 2002.
[17] C.F. Huang and Y.C. Tseng, "The Coverage Problem in a Wireless Sensor Network," Proc. Second ACM Int'l Conf. Wireless Sensor Networks and Applications (WSNA '03), 2003.
[18] F.A. Kolushev and A.A. Bogdanov, "Multi-Agent Optimal Path Planning for Mobile Robots in Environment with Obstacles," Proc. Third Int'l Andrei Ershov Memorial Conf. Perspectives of System Informatics (PSI '99), 1999.
[19] C. Kong, A. New, and I. Rekleitis, "Distributed Coverage with Multi-Robot System," Proc. IEEE Int'l Conf. Robotics and Automation (ICRA '06), 2006.
[20] S. Kumar, T.H. Lai, and A. Arora, "Barrier Coverage with Wireless Sensors," Proc. ACM MobiCom, 2005.
[21] S. Kumar, T.H. Lai, and J. Balogh, "On K-Coverage in a Mostly Sleeping Sensor Network," Proc. ACM MobiCom, 2004.
[22] D. Latimer, S. Srinivasa, V. Shue, S. Sonne, and H. Choset, "Towards Sensor Based Coverage with Robot Teams," Proc. IEEE Int'l Conf. Robotics and Automation (ICRA '02), 2002.
[23] L. Lin and H. Lee, "Distributed Algorithms for Dynamic Coverage in Sensor Networks," Proc. 26th Ann. ACM Symp. Principles of Distributed Computing (PODC '07), 2007.
[24] B. Liu, P. Brass, and O. Dousse, "Mobility Improves Coverages of Sensor Networks," Proc. ACM MobiHoc, 2005.
[25] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M.B. Srivastava, "Coverage Problems in Wireless Ad-Hoc Sensor Networks," Proc. IEEE INFOCOM, 2001.
[26] L. Mo, Y. He, Y. Liu, J. Zhao, S. Tang, X. Li, and G. Dai, "Canopy Closure Estimates with GreenOrbs: Sustainable Sensing in the Forest," Proc. Seventh ACM Conf. Embedded Networked Sensor Systems (SenSys '09), 2009.
[27] M. Ryan, "Graph Decomposition for Efficient Multi-Robot Path Planning," Proc. 20th Int'l Joint Conf. Artifical Intelligence (IJCAI '07), 2007.
[28] M.R.K. Ryan, "Exploiting Subgraph Structure in Multi-Robot Path Planning," J. Artificial Intelligence Research, vol. 31, pp. 497-542, 2008.
[29] S. Slijepcevic and M. Potkonjak, "Power Efficient Organization of Wireless Sensor Networks," Proc. IEEE Int'l Conf. Comm. (ICC '01), 2001.
[30] B. Sundararaman, U. Buy, and A.D. Kshemkalyani, "Clock Synchronization in Wireless Sensor Networks: A Survey," Ad-Hoc Networks, vol. 3, pp. 281-323, May 2005.
[31] P. Svestka and M.H. Overmars, "Coordinated Path Planning for Multiple Robots," Robotics and Autonomous Systems, vol. 23, pp. 125-152, 1998.
[32] A. Vahdat and D. Becker, "Epidemic Routing for Partially Connected Ad hoc Networks," Technical Report CS-200006, Duke Univ., 2000.
[33] D. Wang, J. Liu, and Q. Zhang, "Field Coverage Using a Hybrid Network of Static and Mobile Sensors," Proc. IEEE Int'l Workshop Quality of Service (IWQoS '07), 2007.
[34] G. Wang, G. Cao, and T.L. Porta, "Sensor Deployment and Target Localization Based on Virtual Forces," Proc. IEEE INFOCOM, 2003.
[35] G. Wang, G. Cao, and T.L. Porta, "Movement-Assisted Sensor Deployment," Proc. IEEE INFOCOM, 2004.
[36] W. Wang, V. Srinivasan, and K.C. Chua, "Trade-Offs between Mobility and Density for Coverage in Wireless Sensor Networks," Proc. ACM MobiCom, 2007.
78 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool