A Sweep Coverage Scheme Based on Vehicle Routing Problem

As an emerging coverage problem in wireless sensor networks, sweep coverage which introducing mobile sensors to cover points of interest within certain time interval can satisfy monitoring request in some particular application scenarios with less number of nodes than the conventional static coverage approach. In this work, aiming to support dynamical POI coverage and data delivery simultaneously, a novel sweep coverage scheme, named VRPSC(Vehicle Routing Problem based Sweep Coverage), is proposed by modeling the minimum number of required sensors problem in sweep coverage as a Vehicle Routing Problem (VRP). In VRPSC, an insertion algorithm is first introduced to create the initial scanning routes for POIs, and then the Simulated Annealing is employed to optimize these routes. The simulation results show that the VRPSC scheme achieves better performance than existing schemes. DOI:  http://dx.doi.org/10.11591/telkomnika.v11i4.2380

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

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

[3]  Mihaela Cardei,et al.  Coverage in Wireless Sensor Networks , 2004, Handbook of Sensor Networks.

[4]  Majid Bagheri,et al.  Efficient k-Coverage algorithms for wireless sensor networks and their applications to early detection of forest fires , 2007 .

[5]  Silvester Tena,et al.  Wireless Sensor Network for Landslide Monitoring in Nusa Tenggara Timur , 2011 .

[6]  Zhenya Zhang,et al.  MTSP based solution for minimum mobile node number problem in sweep converge of wireless sensor network , 2011, Proceedings of 2011 International Conference on Computer Science and Network Technology.

[7]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[8]  Liang-min Wang,et al.  Fault-Tolerant Method for Detecting Coverage Holes of Wireless Sensor Networks , 2012 .

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

[10]  Hung-Chi Chu,et al.  Sweep Coverage Mechanism for Wireless Sensor Networks with Approximate Patrol Times , 2010, 2010 7th International Conference on Ubiquitous Intelligence & Computing and 7th International Conference on Autonomic & Trusted Computing.

[11]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[12]  Chao Zhai,et al.  Sweep coverage algorithm and coverage time estimation for multi-agent systems , 2012, 2012 24th Chinese Control and Decision Conference (CCDC).