ACO-Based Sweep Coverage Scheme in Wireless Sensor Networks

Coverage problem is one of the major issues in wireless sensor networks (WSN). In order to optimize the network coverage, different coverage formulations have been proposed. Recently, a newly emerging coverage scheme in wireless sensor networks, sweep coverage, which uses mobile sensors to monitor certain points of interest (POIs), is proposed. However, the data delivery to sink, an important problem in WSN, is not considered in original sweep coverage and many of the existing works did not consider it yet. In this work, a novel algorithm named ACOSC (ACO-based sweep coverage) to solve the sweep coverage problem considering periodical coverage of POIs and delivery of data simultaneously is proposed. The evaluation results show that our algorithm has better performance than existing schemes.

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

[2]  Zhou Ji-liu MASC:A Sweep Coverage Approach with Mobile-assisted Carriers , 2010 .

[3]  Chao Wang,et al.  Data Collection in Wireless Sensor Networks by Utilizing Multiple Mobile Nodes , 2011, 2011 Seventh International Conference on Mobile Ad-hoc and Sensor Networks.

[4]  Li Shu,et al.  A Sweep Coverage Scheme Based on Vehicle Routing Problem , 2013 .

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

[6]  Douglas W. Gage,et al.  Command Control for Many-Robot Systems , 1992 .

[7]  Alhussein A. Abouzeid,et al.  Stochastic Event Capture Using Mobile Sensors Subject to a Quality Metric , 2006, IEEE Transactions on Robotics.

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

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

[10]  Bin Yu,et al.  An ant colony optimization model: The period vehicle routing problem with time windows , 2011 .

[11]  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.