230 likes | 323 Views
Barrier Coverage with Mobile Sensors. Changxiang Shen Weifang Cheng Xiangke Liao Shaoliang Peng. National University of Defense Technology. I-SPAN 2008. Proceedings of the I nternational S ymposium on P arallel Architectures, A lgorithms and N etworks. Outline. Introduction
E N D
Barrier Coverage with Mobile Sensors Changxiang Shen Weifang Cheng Xiangke Liao Shaoliang Peng National University of Defense Technology I-SPAN 2008 Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks
Outline • Introduction • Problem Formulation • CBarrier algorithm • DBarrier algorithm • Performance Evaluation • Conclusion
Introduction • In the wireless sensor network (WSN) sensors monitor the field for some application • to monitor the entire environment • Full coverage • the boundary guard or the movement detection • Barrier coverage
Introduction • An example randomly deployed sensors for barrier coverage "Reliable Density Estimates for Achieving Coverage and Connectivity in Thin Strips of Finite Length" P. Balister, B. Bollobas, A. Sarkar, S. Kumar. in Proceedings of ACM MobiCom. 2007.
Introduction • When sensors are deployed • Randomly • much more sensors are required than deterministically deployed • Deterministically • Environment limitation • Cost a lot of time
This paper study barrier coverage with mobile sensors • Relocated after random deployment • Utilize much fewer mobile sensors
Problem Formulation • Assumption • N mobile sensor S={s1,s2,…,sN} • Each sensor si has initial coordinates (xi,yi) • Sensing range : R
Minimum number : • Maximum number Problem Formulation • The interesting area : W x L (0,W) (L,W) W (0,0) (L,0) L
Problem Formulation • Given the randomly deployed mobile sensors • To provide required barrier coverage (It is not hard) • The sensor moving is waste energy • The paper propose an relocation algorithm • Save energy consumption
Problem Formulation Goal : There is a left neighbor There is a right neighbor There is a sensor overlapping the left boundary There is a sensor overlapping the right boundary
To assume that • the relocated sensors are aligned into a straight line y=ax+b • yi’=axi’+b • Order the xi by the sort of x1≤x2 ≤x3 ≤… ≤ xN x1’=R , xN’=L-R the xi’=R+(i-1)[(L-R)-R]/(N-1) Centralize Barrier Algorithm(CBarrier)
(0,W) (L,W) W (0,0) (L,0) L Centralize Barrier Algorithm(CBarrier)
Distributed Barrier Algorithm(DBarrier) • The virtual force • FR : repulsive force • FA : attractive force (0,W) (L,W) W (0,0) (L,0) L
Performance Evaluation • MATLAB • Sensing range R : 4m • Communication range Rc : 10m • Field size W x L : 15m x 60m • The number of sensor :15 • Move unit :0.1m~0.8m • MAX_STEP = 100
Conclusion • This paper discusses the MEBC problem and propose two algorithm • The CBarrier algorithm • To compute the relocated position with knowing the initial position • The DBarrier algorithm • Sensors adjust the position according the total virtual force