1. Worst & Best-Case Coverage in Sensors Networks DEC 2004
Seapahn
Megerian
Ph.D. UCLA
Miodrag
Potkonjak
Ph.D. Berkley
Mani B.
Srivastava
Ph.D. Berkley
Farinaz
Koushanfar
Berkley
Presented by: Eugene Khokhlov
(847)

2. Eugene, Worst & Best-Case Coverage in S.N.
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. Eugene, Worst & Best-Case Coverage in S.N.
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. Eugene, Worst & Best-Case Coverage in S.N.
Voronoi Diagram
Set of polygons
such that all points
inside a polygon are
closest to only one
site
Edges that are
equidistant 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. Eugene, Worst & Best-Case Coverage in S.N.
Worst Case (Breach)
Worst Case (Breach)
Eugene, Worst & Best-Case Coverage in S.N.

7. Eugene, Worst & Best-Case Coverage in S.N.
Best Case, Path Choosing the CLOSEST
Eugene, Worst & Best-Case Coverage in S.N.

8. Eugene, Worst & Best-Case Coverage in S.N.
Comparison
Worst Case => Breach Weight
The 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
Eugene, Worst & Best-Case Coverage in S.N.

9. Add 1 sensor to 100 and get 10% improvement in coverage
Eugene, Worst & Best-Case Coverage in S.N.

10. Eugene, Worst & Best-Case Coverage in S.N.
Conclusion
Voronoy diagram & breach path (Worst-Case)
Delaunay triangulation & Support Path (Best-Case)
Coverage improvement
Questions? to:
Eugene, Worst & Best-Case Coverage in S.N.