Group sweep coverage with guaranteed approximation ratio

Abstract Wireless Sensor Networks (WSNs) are often deployed to monitor a region of interest. With sweep coverage, mobile sensor nodes are scheduled to move along a planned route (i.e. sweep route) in order to collect the data from a series of Point of Interests (POIs) sequentially. In this paper, we generalizes the sweep coverage problem by proposing a new coverage paradigm, group sweep coverage. With group sweep coverage, the POIs are divided into several groups. A group is said to be covered when one of the POIs in the group is covered. The goal in group sweep coverage is to construct a sweep route that mobile sensor nodes should follow in order to cover all groups during each predefined period. In our research, we devised two algorithms for group sweep coverage: AGSC and DSRM. AGSC is a centralized scheme whose approximation ratio is 5Δ. Namely, the length of the sweep route generated by AGSC is at most 5Δ times that of the optimal sweep route. DSRM is a distributed scheme for large-scale networks with dynamic POIs. Compared with AGSC, DSRM leads to the same approximation ratio and better scalability. Our experimental results indicate that both AGSC and DSRM outperform the state-of-the-art schemes in terms of average and maximal sweep route length.

[1]  Chuang Liu,et al.  Sweep Coverage with Return Time Constraint , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[2]  Chuang Liu,et al.  Utilizing communication range to shorten the route of sweep coverage , 2017, 2017 IEEE International Conference on Communications (ICC).

[3]  Yunhao Liu,et al.  Sweep coverage with mobile sensors , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[4]  Barun Gorain,et al.  Approximation algorithms for sweep coverage in wireless sensor networks , 2014, J. Parallel Distributed Comput..

[5]  Barun Gorain,et al.  Approximation algorithm for sweep coverage on graph , 2015, Inf. Process. Lett..

[6]  Jing Zhang,et al.  Interference-Free k-barrier Coverage in Wireless Sensor Networks , 2014, COCOA.

[7]  Xiaohui Huang,et al.  Approximation algorithms for distance constraint sweep coverage with base stations , 2018, J. Comb. Optim..

[8]  Barun Gorain,et al.  Approximation Algorithms for Barrier Sweep Coverage , 2019, Int. J. Found. Comput. Sci..

[9]  Yi Wang,et al.  Achieving full-view coverage in camera sensor networks , 2013, ACM Trans. Sens. Networks.

[10]  Donghyun Kim,et al.  Imperfection Better Than Perfection: Beyond Optimal Lifetime Barrier Coverage in Wireless Sensor Networks , 2014, 2014 10th International Conference on Mobile Ad-hoc and Sensor Networks.

[11]  Fan Wu,et al.  Approximation Algorithms for Sweep Coverage Problem With Multiple Mobile Sensors , 2018, IEEE/ACM Transactions on Networking.

[12]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[13]  Liang Liu,et al.  Mobile sensor scheduling for timely sweep coverage , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[14]  S. K. Jena,et al.  Global t-Sweep Coverage Problem with Minimum Interference , 2015, 2015 International Conference on Information Technology (ICIT).

[15]  Feng Lin,et al.  ACO-Based Sweep Coverage Scheme in Wireless Sensor Networks , 2015, J. Sensors.

[16]  Yawei Li,et al.  On Sweep Coverage with Minimum Mobile Sensors , 2010, 2010 IEEE 16th International Conference on Parallel and Distributed Systems.

[17]  Li Shu,et al.  Periodic Sweep Coverage Scheme Based on Periodic Vehicle Routing Problem , 2014, J. Networks.

[18]  A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring , 2016, J. Comb. Optim..

[19]  Ioannis Ch. Paschalidis,et al.  On delay-minimized data harvesting with mobile elements in wireless sensor networks , 2012, Ad Hoc Networks.

[20]  Guihai Chen,et al.  Shorten the Trajectory of Mobile Sensors in Sweep Coverage Problem , 2014, GLOBECOM 2014.

[21]  Eylem Ekici,et al.  Responsible Editor: I.F. Akyildiz , 2006 .

[22]  Yunhao Liu,et al.  Run to Potential: Sweep Coverage in Wireless Sensor Networks , 2009, 2009 International Conference on Parallel Processing.

[23]  Ellen W. Zegura,et al.  Message ferry route design for sparse ad hoc networks with mobile nodes , 2006, MobiHoc '06.

[24]  Rajesh K. Gupta,et al.  Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks , 2010, IEEE Transactions on Mobile Computing.

[25]  Yunhao Liu,et al.  Sweep Coverage with Mobile Sensors , 2011, IEEE Trans. Mob. Comput..

[26]  Jianping Pan,et al.  A Progressive Approach to Reducing Data Collection Latency in Wireless Sensor Networks with Mobile Elements , 2013, IEEE Transactions on Mobile Computing.

[27]  Barun Gorain,et al.  Solving energy issues for sweep coverage in wireless sensor networks , 2017, Discret. Appl. Math..

[28]  Jing Zhang,et al.  Barrier Coverage with Discrete Levels of Sensing and Transmission Power in Wireless Sensor Networks , 2014, CWSN.

[29]  Andrea Gasparri,et al.  Robotic Message Ferrying for Wireless Networks Using Coarse-Grained Backpressure Control , 2017, IEEE Trans. Mob. Comput..

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

[31]  Feng Lin,et al.  GA-based Sweep Coverage Scheme in WSN , 2016, 2016 7th International Conference on Cloud Computing and Big Data (CCBD).

[32]  Seunghun Jin,et al.  Device control protocol using mobile phone , 2014, 16th International Conference on Advanced Communication Technology.

[33]  Ellen W. Zegura,et al.  Controlling the mobility of multiple data transport ferries in a delay-tolerant network , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..