Worst

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 Grad _at_ Berkley
Presented by Eugene Khokhlov Eugene_at_ApplicaSoft.
com (847) 4591535
2
Quick Overview

• Coverage in Sensor Networks
• Voronoi diagrams Maximal Breach Path
• Delaunay triangulation Maximal Support Path
• Coverage Improvement

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

4
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
5
Delaunay triangulation

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

6
Worst Case (Breach)
Worst Case (Breach)
7
Best Case, Path Choosing the CLOSEST
8
Comparison
Worst Case gt Breach Weight The closest distance
to sensors on the path of travel. Best Case gt
Support Weight The maximum distance from the
closest sensors on the Path of travel
9
Add 1 sensor to 100 and get 10 improvement in
coverage
Coverage Improvement
10
Conclusion

• Voronoy diagram breach path (Worst-Case)
• Delaunay triangulation Support Path (Best-Case)
• Coverage improvement
• Questions? Email to
• Eugene_at_ApplicaSoft.com