There are typical applications where only periodic patrol inspections are sufficient instead of continuous monitoring like in traditional coverage. This periodic monitoring is termed as sweep coverage. 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 as in static sensor network all sensing data from the sensors are relayed to the sink node (base station) through multi hop. As a result, the sensors near to the sink node become the bottleneck since they have to relay the data of other nodes. Once they die, the sink disconnects from the rest of the network while the rest of sensors are still fully operational with sufficient residual energy. To overcome this problem in our work, we proposed Mobile Sink Wireless Sensor Network (MSWSN). We assume that the given region is Rectangular and our aim is to do Sweep Coverage for Boundary of the Region. In Wireless sensor network Sensor node has fixed communication range ( let D be the communication range then Sensor node will cover all the points which lie within D distance from it in all directions ) and therefore to guarantee the coverage of Boundary Mobile sink will not traverse whole of the boundary but visit certain points in the Boundary known as points to Visit ( P1, P2, ----- Pn ). Points to Visit ( P1, P2, ----- Pn ) are to be chosen in such a way that every boundary point lie within the communication range of Mobile sink from at least one points to Visit ( P1, P2, ----- Pn ) and Mobile Sink must visit every edge of the boundary during traversal. Keeping above coverage conditions in mind our main objective is to choose points to Visit ( P1, P2, ----- Pn ) in such a way that the overall length of closed path travelled by the Mobile sink to collect the data is minimum.

Sweep coverage problem; Area sweep coverage; Point sweep coverage; convex hull algorithm; Tessellation

[1] Gurbax kaur, Ritesh Sharma, "Point Sweep Coverage in Wireless Sensor Networks Using Convex Hull Algorithm", International Journal of Computer Sciences and Engineering, Volume-04, Issue-08, Page No (23-27), Aug -2016
[2] Gurbax Kaur, Ritesh Sharma, �A Review on Sweep Coverage in Wireless Sensor Networks�, International Journal of Computer Sciences and Engineering, Volume-4, Issue-6, Page No (113-117), June 2016
[3] Barun Gorian , Partha Sarthi Mandal,�Approximation algorithm for sweep coverage in wireless sensor networks � ,Journal of Parallel and Distributed Computing , Volume-74, Issue-8, Page No(2699-2707), Aug 2014.
[4] Mo Li, Wei-Fang Cheng, Kebin Liu, Yunhao Liu,Xiang-Yang Li, Xiangke Liao, �Sweep coverage with mobile sensors�, Transaction on Mobile Computing , Volume-01, Issue-11, Page No (1534�1545), Nov 2011.
[5] Barun Gorian ,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.
[6] 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.
[7] R.A. Jarvis, �on the identification of the convex hull of a finite set of points in the plane�, Information Processing Letters, Volume-2, Issue-1, Page No (18-21), Dec 1973.
[8] 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.
[9] Adrian Dumitrescu, MinghuiJiang, �Sweeping an oval to a vanishing point�, Elsevier: Discrete applied mathematics, Volume-159, Issue-14, Page No (1436-1442), Aug 2011.
[10] 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.
[11] 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.
[12] Xiaojiang Du,Fengjing Lin, �Improving sensor network performance by deploying mobile sensors�,IEEE international performance, computing, and communications conference , Phoenix, AZ, USA ,pp(67-71),April 7th � 9th ,2005, ISBN: 0-7803-8991-3.
[13] 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.
[14] Yi Ning Chen, Ko-Jui Lin ; Chang Wu Yu,�Dynamis coverage techniques in mobile wireless sensor networks� ,Fifth International Conference on Ubiquitous and Future Networks (ICUFN), Da Nang, pp(12-17), July 2nd -5th ,2013, ISSN:2165-8528.
[15] 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.
[16] Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha, �Efficient algorithm for placing a given number of base stations to cover a convex region�, Journal of. Parallel Distributed Computing,Volume- 66,Issue-11,Page No (1353 � 1358),July 2006.
[17] Junzhao Du,Yawei Li,Hui Liu and Kewai Sha, � On sweep coverage with minimum mobile sensors�, 16th international conference on Parallel and Distributed System, Shanghai, pp(283-290). December 8th-10th, 2010, ISBN: 978-1-4244-9727-0.
[18] A. Bykat, �Convex Hull Of A Finite Set Of Points In Two Dimensions�, Information Processing Letter, Volume-7, Issue-6, Page No (296-298), Oct 1978.