1. Coverage and Deployment 1

2. Coverage Problems Coverage: is a measure of the Quality of Service (QoS) of a sensor network How well can the network observe (or cover) a given event? – For example, intruder detection; animal or fire detection Coverage depends upon: – Range and sensitivity of sensing nodes – Location and density of sensing nodes in given region 2

5. Voronoi diagrams In 2D, the Voronoi diagram of a set of points partitions the plane into a set of convex polygons such that: – All points inside a polygon are closest to only one site. – The polygons have edges equidistant from nearby points. 5

6. Examples Fig. shows the bounded Voronoi diagram and the maximal breach path 6

7. Maximal Breach Path For the intruder, the maximal breach path is the best path to take within the field, because the closest sensor encountered is at the farthest possible distance 7

8. Voronoi diagrams Delaunay Triangulation – Connect points in V-Diag. whose polygons share a common edge. 8

9. Example Figure on the right shows the Delaunay Triangulation and the maximal support path 9

10. 10 Maximal Support Path