There are lots of applications where only periodic monitoring (sweep coverage) is sufficient instead of continuous monitoring. The main goal of sweep coverage problem is to minimize the number of mobile sensor nodes moving with uniform velocity required to guarantee coverage as per given sweep time. In the sweep coverage scenario, deployment of static sensor nodes may partially solve the purpose but it suffers from poor efficiency and unnecessary extra overhead. Moreover, static sensor network suffers from static sink neighborhood problem in which the sensors which lie near to the sink node dies due to which the sink disconnects from rest of the network.

Sweep coverage; Approximation algorithm; Mobile sensor; TSP; MST; Euler tour; Tessellations

[1] Vijay V. Vazirani, “Approximation Algorithms”, Springer, First Edition-2003, ISBN:978-3-662-04565-7.
[2] Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, ManiB. Srivastava,“ Coverage Problems in Wireless Ad-hoc Sensor Networks ”, Twentieth Annual Joint Conference of the IEEE Computer and Communications Society, Org by- Anchorage, AK, USA, pp(1380–1387), April 22nd-26th, 2001, ISBN: 0-7803-7016-3.
[3] Edoardo S. Biagioni, Galen Sasaki,“Wireless sensor placement for Reliable and Efiicient data collection”,IEEE 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the - Big Island, HI, USA, January 6th-9th, 2003, ISBN:0-7695-1874-5.
[4] Guiling Wang.Guohong Cao,T. LaPorta, “A bidding protocol for deploying mobile sensors ”, Transactions on Mobile Computing ,Volume-06,Issue-05,Page No(563-576) , May 2007.
[5] Mingming Lu, Jie Wu, MihaelaCardei, Minglu Li, “Energy-efficient connected coverage of discrete targets in wireless sensor networks ”, Springer: Networking and Mobile computing , Volume-3619, Page No(43–52) , May 2005.
[6] Santosh kumar, Ten H .Lai, Anish Arora,“Barrrier coverage with wireless sensors”,Mobicom’05 Proceedings of the 11th annual international conference on Mobile computing and networking,Org by-ACM, NY, USA, pp(284-298) , August 28,2006,ISBN: 1-59593-020-5.
[7] Ming Ma, Yuanyuan Yang,“Adaptive triangular deployment algorithm for unattended mobile sensor networks”, IEEE Transaction on Computer , Volume- 56 ,Issue-07, Page No(946-958), July 2007.
[8] Min Xi, Kui Wu, Yong Qi, Jizhong Zhao, Yunhao Liu, Mo Li, “Run to potential:sweep coverage in wireless sensor networks” ,IEEE: International Conference on Parallel Processing (ICPP-2009),Sponsored by-IACC, Vienna , Austria , pp ( 50–57) ,September 22nd-25th , 2009 ,ISBN: 978-0-7695-3802-0.
[9] Fadi M. Al-Turjman, Hossam S. Hassanein, Mohamed A. Ibnkahla, “Connectivity optimization for wireless sensor networks applied to forest monitoring”, In: Proceedings of the 2009 IEEE International Conference on Communications, (ICC-09), IEEE Press, Piscataway, NJ, USA, pp( 285–290),June 14th-18th,2009, ISBN: 978-1-4244-3435-0.
[10] Hung-Chi Chu, Wei-Kai Wang, Yong-Hsun Lai,“Sweep coverage mechanism for wireless sensor networks with approximate patrol times”, Ubiquitous Intelligence & Computing and 7th International Conference on Autonomic & Trusted Computing (UIC/ATC), Xian, Shaanxi, pp( 82–87) ,October 26th-29th,2010,ISBN: 978-0-7695-4272-0.
[11] Barun Gorian and Partha Sarthi Mandal, “Point and area sweep coverage in wireless sensor networks”,11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Tsukuba Science City, pp (140-145) ,May 13th-17th ,2013,ISBN : 978-1-61284-824-2.
[12] Novella Bartolini, Tiziana Calamoneri, Emanuele G. Fusco, Annalisa Massini, Simone Silvestri , “ Push & pull: autonomous deployment of mobile sensors for a complete coverage”, Wireless Netw. ,Volume-16,Issue-3,Page No(607–625),Jan 2009.
[13] Junzhao Du, Yawei Li, Hui Liu, Kewei Sha,“On sweep coverage with minimum mobile sensors”, In:Proceedings of the 2010 IEEE 16th International Conference on Parallel and Distributed Systems, ICPADS’10, IEEE Computer Society,Washington, DC, USA, pp( 283–290),Dec 8th-10th, 2010, ISBN: 978-0-7695-4307-9.
[14] Mo Li, Wei-Fang Cheng, Kebin Liu, Yunhao Liu,Xiang-Yang Li, Xiangke Liao,“Sweep coverage with mobile sensors”, IEEE: Transaction on Mobile. Computing, Volume-01, Issue-11, Page No (1534–1545), Nov 2011.
[15] Adrian Dumitrescu, MinghuiJiang, “Sweeping an oval to a vanishing point”, Elsevier: Discrete applied mathematics, Volume-159, Issue-14, Page No(1436-1442) , Aug 2011.
[16] Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickers,“On the discrete unit disk cover problem”, WALCOM: Algorithms and Computation, Volume-6552,Page No(146–157), 2011.
[17] Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy, “Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks”, wireless networks,Volume-19,Issue-5, Page No(857-870) , Sep 2012.
[18] Nasimkhazan,Ali Braumandinia and Nima Ghazanfari Motlagh,“Node Placement and coverage in Asymmetric area”, International Journal of Advanced Research in Computer Science and Software Engineering,Volume-2,Issue-11,Page No(278-282), Nov 2012.
[19] Barun Gorian and Partha Sarthi Mandal, “Approximation algorithim for sweep coverage in wireless sensor networks ” , Journal of Parallel and Distributed Computing , Volume-74, Issue-8, Page No(2699-2707), Aug 2014.