Seung Oh Kang saganamu@kut.ac.kr Strong Barrier Coverage of Wireless Sensor Networks Seung Oh Kang saganamu@kut.ac.kr saganamu@kut.ac.kr 한국기술교육대학교 2009. 04. 27

□ Constructing Barriers □ Performance Evaluation □ Conclusion Contents □ Introduction □ Constructing Barriers □ Performance Evaluation □ Conclusion saganamu@kut.ac.kr 한국기술교육대학교

Introduction Barrier Coverage USA 2/10 saganamu@kut.ac.kr 한국기술교육대학교

Introduction Belt Region saganamu@kut.ac.kr 한국기술교육대학교

Two special belt regions Introduction Two special belt regions Rectangular: Donut-shaped:

How to define a belt region? Introduction How to define a belt region? Parallel curves Region between two parallel curves

Crossing paths Not crossing paths Introduction Crossing Paths A crossing path is a path that crosses the complete width of the belt region. Crossing paths Not crossing paths saganamu@kut.ac.kr 한국기술교육대학교

Introduction k-Covered A crossing path is said to be k-covered if it intersects the sensing disks of at least k sensors. 3-covered 1-covered 0-covered

Introduction k-Barrier Covered A belt region is k-barrier covered if all crossing paths are k-covered. Not barrier covered 1-barrier covered

Barrier vs. Blanket Coverage Introduction Barrier vs. Blanket Coverage Barrier coverage Every crossing path is k-covered Blanket coverage Every point is covered (or k-covered) Blanket coverage Barrier coverage 1-barrier covered but not 1-blanket covered

Reduced to k-connectivity problem Introduction Reduced to k-connectivity problem Given a sensor network over a belt region Construct a coverage graph G(V, E) V: sensor nodes, plus two dummy nodes L, R E: edge (u,v) if their sensing disks overlap Region is k-barrier covered if L and R are k-connected in G. R L

Introduction saganamu@kut.ac.kr 한국기술교육대학교

Constructing Barriers saganamu@kut.ac.kr 한국기술교육대학교

Constructing Barriers saganamu@kut.ac.kr 한국기술교육대학교

Conditions for strong barrier coverage Performance Evaluation Conditions for strong barrier coverage saganamu@kut.ac.kr 한국기술교육대학교

Strengthened local barrier coverage Performance Evaluation Strengthened local barrier coverage saganamu@kut.ac.kr 한국기술교육대학교

Performance Evaluation saganamu@kut.ac.kr 한국기술교육대학교

To this end, we make two main contributions that provide Conclusion We want to ensure that intruders cannot cross the strip undetected no matter how they choose their crossing paths. To this end, we make two main contributions that provide theoretical foundations and practical algorithm for the construction of strong barriers in a sensor network. Specically, we obtain the critical conditions for strong barrier coverage in a strip sensor network, filling the gap in the understanding of the critical conditions for barrier coverage. saganamu@kut.ac.kr 한국기술교육대학교

Thank you saganamu@kut.ac.kr 한국기술교육대학교