1 / 21

Coverage Problem in Sensor Networks

Coverage Problem in Sensor Networks. Qinghui Tang. Related Papers. 1) S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava . Coverage problems in wireless ad-hoc sensor networks . In Proc. of the Conf. on Computer Communications (INFOCOM), 2001.

telma
Download Presentation

Coverage Problem in Sensor Networks

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. Coverage Problem in Sensor Networks Qinghui Tang

  2. Related Papers • 1) S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava. Coverage problems in wireless ad-hoc sensor networks. In Proc. of the Conf. on Computer Communications (INFOCOM), 2001. • 2) S. Meguerdichian, F. Koushanfar, G. Qu, M. Potkonjak, "Exposure in Wireless Ad Hoc Sensor Networks", In Proceedings of 7th Annual International Conference on Mobile Computing and Networking (MobiCom '01), pp. 139-150, July 2001.

  3. Importance of Coverage Problem • How well do the sensors observe the physical space. • Placement (deployment) and Cost • A measure of QoS • Ability to detect events • Latency of detection (and reporting) • Accuracy (redundancy)

  4. Classification of Coverage Problem • Algorithms • Centralized, distributed, localized • Deployment • Deterministic, Stochastic

  5. Classification of Coverage Problem • Area coverage • Point (node) coverage • Connection Coverage • Barrier coverage

  6. Barrier Coverage • Goal : minimizing the probability of undetected penetration

  7. Voronoi Diagram • Each polygon contains exactly one point • consists of the points closer to center point object than to any others • Polygon edge are equidistant from neighboring points.

  8. Delaunay Triangulation The Delaunay triangulation is a triangulation which is equivalent to the nerve of the cells in a Voronoi diagram

  9. Worst Case Coverage: Maximal Breach Path Breach path: finding areas of lower observability from sensor nodes

  10. Best Case Coverage: Maximal Support Path • Support path: finding areas of high observability from sensor nodes

  11. breach_weight & support_weight • breach_weight : the minimum distance from sensors that an agent must encounter • support_weight : the maximum distance from the closest sensors that an agent must encounter at least once.

  12. Saturation Point

  13. Exposure: An Introduction

  14. Sensor Exposure Suppose S(s,p) represents the non-negative sensibility of sensor s to the point p. All-Sensor Field Intensity. The Exposure for an object in the sensor field during the interval [t1,t2]along the path p(t) is:

  15. Result : • Continuous domain problem change to discrete domain

  16. Result : Deterministic deployment • cross-based provided the best level of exposure, followed by the triangle-based scheme. • Deterministic deployment was higher than the average randomly generated network topology.

  17. Summary Maximal Breach Path Maximal Support Path Maximal Exposure Path

  18. Questions ? • Thank you

More Related