Seung oh kang saganamu@kut ac kr
Download
1 / 19

Seung Oh Kang [email protected] - PowerPoint PPT Presentation


  • 82 Views
  • Uploaded on

한국기술교육대학교. Strong Barrier Coverage of Wireless Sensor Networks. Seung Oh Kang [email protected] [email protected] 2009. 04. 27. 한국기술교육대학교. Contents. □ Introduction □ Constructing Barriers □ Performance Evaluation □ Conclusion. [email protected] 한국기술교육대학교. Introduction.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Seung Oh Kang [email protected]' - brynn-landry


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Seung oh kang saganamu@kut ac kr

한국기술교육대학교

Strong Barrier Coverage of Wireless Sensor Networks

Seung Oh Kang

[email protected]

[email protected]

2009. 04. 27


한국기술교육대학교

Contents

□ Introduction

□ Constructing Barriers

□ Performance Evaluation

□ Conclusion

[email protected]


Introduction

한국기술교육대학교

Introduction

Barrier Coverage

USA

2/10

[email protected]



Two special belt regions
Two special belt regions

Introduction

  • Rectangular:

  • Donut-shaped:


How to define a belt region
How to define a belt region?

Introduction

  • Parallel curves

  • Region between two parallel curves


Introduction2

한국기술교육대학교

Introduction

Crossing Paths

  • A crossing path is a path that crosses the complete width of the belt region.

Crossing pathsNot crossing paths

[email protected]


K covered
k-Covered

Introduction

  • 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


K barrier covered
k-Barrier Covered

Introduction

  • A belt region is k-barrier covered if all crossing paths are k-covered.

Not barrier covered

1-barrier covered


Barrier vs blanket coverage
Barrier vs. Blanket Coverage

Introduction

  • 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
Reduced to k-connectivity problem

Introduction

  • 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





한국기술교육대학교

Performance Evaluation

Conditions for strong barrier coverage

[email protected]


한국기술교육대학교

Performance Evaluation

Strengthened local barrier coverage

[email protected]



한국기술교육대학교

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.

[email protected]



ad