Minimum-Delay POIs Coverage in mobile wireless sensor networks

In some mobile wireless sensor network applications, it is not necessary to monitor the entire field all the time, and only a number of critical points or points of interest (POIs) need to be monitored periodically. In this paper, we address the minimum-delay POIs coverage in mobile wireless sensor networks problem with cost restriction, which is how to schedule the limited number of mobile sensors monitoring to minimize the service delay of POIs. We study two scenarios of the problem. In the first scenario, the start positions of mobile sensors are determined in advance, we propose the SSR algorithm to address this problem. In the second scenario, without pre-defined start positions, we propose two algorithms, the TSP-S and the SSNOR. By the comprehensive simulations, we evaluate the performance of the proposed algorithms. The simulation results show the efficiency of our algorithms.

[1]  Weijia Jia,et al.  Complete optimal deployment patterns for full-coverage and k-connectivity (k≤6) wireless sensor networks , 2008, MobiHoc '08.

[2]  Donald F. Towsley,et al.  Mobility improves coverage of sensor networks , 2005, MobiHoc '05.

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

[4]  Deying Li,et al.  Minimum Energy Cost k-barrier Coverage in Wireless Sensor Networks , 2010, WASA.

[5]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

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

[7]  Yi Wang,et al.  On full-view coverage in camera sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.

[8]  Ai Chen,et al.  Designing localized algorithms for barrier coverage , 2007, MobiCom '07.

[9]  Jie Wang,et al.  Barrier Coverage of Line-Based Deployed Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[10]  Arun K. Pujari,et al.  Q-Coverage Problem in Wireless Sensor Networks , 2009, ICDCN.

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

[12]  Béla Bollobás,et al.  Reliable Density Estimates for Achieving Coverage and Connectivity in Thin Strips of Finite Length , 2007, ACM/IEEE International Conference on Mobile Computing and Networking.

[13]  Bin Ma,et al.  Deploying Wireless Sensor Networks under Limited Mobility Constraints , 2007, IEEE Transactions on Mobile Computing.

[14]  Deying Li,et al.  Energy-Efficient Algorithm for the Target Q-coverage Problem in Wireless Sensor Networks , 2010, WASA.

[15]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[16]  Eylem Ekici,et al.  Mobility-based communication in wireless sensor networks , 2006, IEEE Communications Magazine.

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

[18]  Béla Bollobás,et al.  Reliable density estimates for coverage and connectivity in thin strips of finite length , 2007, MobiCom '07.

[19]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[20]  Dong Xuan,et al.  On Deploying Wireless Sensors to Achieve Both Coverage and Connectivity , 2006, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[21]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[22]  Himanshu Gupta,et al.  Connected K-coverage problem in sensor networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[23]  Jie Wang,et al.  Strong barrier coverage of wireless sensor networks , 2008, MobiHoc '08.

[24]  Majid Bagheri,et al.  Randomized k-Coverage Algorithms For Dense Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[25]  Wei Wang,et al.  Trade-offs between mobility and density for coverage in wireless sensor networks , 2007, MobiCom '07.

[26]  Ivan Stojmenovic,et al.  Strictly Localized Sensor Self-Deployment for Optimal Focused Coverage , 2011, IEEE Transactions on Mobile Computing.

[27]  Kuo-Feng Ssu,et al.  K-Barrier Coverage With A Directional Sensing Model , 2009 .

[28]  Qian Zhang,et al.  Probabilistic Field Coverage using a Hybrid Network of Static and Mobile Sensors , 2007, 2007 Fifteenth IEEE International Workshop on Quality of Service.

[29]  József Balogh,et al.  On k−coverage in a mostly sleeping sensor network , 2008, Wirel. Networks.

[30]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[31]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[32]  Jiming Chen,et al.  Cost-effective barrier coverage by mobile sensor networks , 2012, 2012 Proceedings IEEE INFOCOM.

[33]  Hai Liu,et al.  Maximal lifetime scheduling in sensor surveillance networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..