Cost-Effective Barrier Coverage by Mobile Sensor Networks

Abstract : Barrier coverage problem in emerging mobile sensor networks has been an interesting research issue. Existing solutions to this problem aim to decide one-time movement for individual sensors to construct as many barriers as possible, which may not work well when there are no sufficient sensors to form a single barrier. In this paper, we try to achieve barrier coverage in sensor scarcity case by dynamic sensor patrolling. In specific, we design a periodic monitoring scheduling (PMS) algorithm in which each point along the barrier line is monitored periodically by mobile sensors. Based on the insight from PMS, we then propose a coordinated sensor patrolling (CSP) algorithm to further improve the barrier coverage, where each sensor's current movement strategy is decided based on the past intruder arrival information. By jointly exploiting sensor mobility and intruder arrival information, CSP is able to significantly enhance barrier coverage. We prove that the total distance that the sensors move during each time slot in CSP is the minimum. Considering the decentralized nature of mobile sensor networks, we further introduce two distributed versions of CSP: S-DCSP and G-DCSP. Through extensive simulations, we demonstrate that CSP has a desired barrier coverage performance and S-DCSP and G-DCSP have similar performance as that of CSP.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-00664311
Contributor : Xu Li <>
Submitted on : Monday, January 30, 2012 - 12:13:30 PM
Last modification on : Friday, March 23, 2018 - 4:01:31 PM

Identifiers

Collections

Citation

Shibo He, Jiming Chen, Xu Li, Xuemin Shen, Youxian Sun. Cost-Effective Barrier Coverage by Mobile Sensor Networks. INFOCOM 2012 - 31st IEEE International Conference on Computer Communications, Mar 2012, Orlando, United States. pp.819-827, ⟨10.1109/INFCOM.2012.6195829⟩. ⟨hal-00664311⟩

Share

Metrics

Record views

260