1 / 10

Worst & Best-Case Coverage in Sensors Networks DEC 2004

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 @ Berkley. Presented by: Eugene Khokhlov Eugene@ApplicaSoft.com (847) 4591535.

alexavier-jacob
Download Presentation

Worst & Best-Case Coverage in Sensors Networks DEC 2004

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  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 @ Berkley Presented by: Eugene Khokhlov Eugene@ApplicaSoft.com (847) 4591535

  2. Coverage in Sensor Networks Voronoi diagrams & Maximal Breach Path Delaunay triangulation & Maximal Support Path Coverage Improvement Quick Overview 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 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. 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. 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 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 Eugene, Worst & Best-Case Coverage in S.N.

More Related