Worst & Best-Case Coverage in Sensors Networks DEC 2004 Presented by: Eugene Khokhlov...

Worst & Best-Case Coverage in Sensors Networks DEC 2004

Presented by: Eugene Khokhlov Eugene@ApplicaSoft.com

(847) 4591535

Seapahn Megerian

Ph.D. UCLA

Miodrag Potkonjak

Ph.D. Berkley

Mani B.Srivastava

Ph.D. Berkley

FarinazKoushanfar

Grad @ Berkley

Eugene, Worst & Best-Case Coverage in S.N.

2

Quick Overview

• Coverage in Sensor Networks• Voronoi diagrams & Maximal

Breach Path• Delaunay triangulation &

Maximal Support Path• Coverage Improvement

Eugene, Worst & Best-Case Coverage in S.N.

3

Definitions• Coverage – an area in which seismic or

acoustic sensors can detect an activity• Worst-case (Breach)– The closest

distance to sensors on a path.• Best-Case – The maximum distance

between the sensors on the path of closest sensors

Eugene, Worst & Best-Case Coverage in S.N.

4

Voronoi Diagram

Set of polygons such that all points inside a polygon are closest to only one site

Edges that areequidistant from neighboring sites

Eugene, Worst & Best-Case Coverage in S.N.

5

Delaunay triangulation

• Connecting the sites in the Voronoi diagram whose polygons share a common edge.

Eugene, Worst & Best-Case Coverage in S.N.

6

Worst Case (Breach)

Worst Case (Breach)

Eugene, Worst & Best-Case Coverage in S.N.

7

Best Case, Path Choosing the CLOSEST

Eugene, Worst & Best-Case Coverage in S.N.

8

Worst Case => Breach WeightThe closest distance to sensors on the path of travel.

Best Case => Support Weight The maximum distance from the closest sensors on the Path of travel

Comparison

Eugene, Worst & Best-Case Coverage in S.N.

9

Add 1 sensor to 100 and get 10% improvement in coverage

Coverage Improvement

Eugene, Worst & Best-Case Coverage in S.N.

10

Conclusion

• Voronoy diagram & breach path (Worst-Case)

• Delaunay triangulation & Support Path (Best-Case)

• Coverage improvement• Questions? Email to:

Eugene@ApplicaSoft.com