1. Shih-Chieh Lee 1 Detection and Tracking of Region-Based Evolving Targets in Sensor Networks Chunyu Jiang, Guozhu Dong, Bin Wang Wright State University ICCCN 2005

2. 2Shih-Chieh Lee Agenda Introduction Introduction Background Background R-tree Sensor Network Topology R-tree Sensor Network Topology In-network Detection In-network Detection In-network Tracking In-network Tracking Experimental Evaluation Experimental Evaluation Conclusions Conclusions

3. 3Shih-Chieh Lee Introduction Region-based targets/events Contiguous spatial regions where objects of interest are present Applications: toxic leak region, pollution area, area of forest fires, formations of tanks Issues: detection of event shape tracking of shape evolving targets communicating spatial objects in-network processing of spatial information efficient processing of spatial queries

4. 4Shih-Chieh Lee Introduction This work designs efficient network topologies and algorithms for detecting and tracking region-based targets and events

5. 5Shih-Chieh Lee Background Definition: A region-based target is a spatial region where objects/phenomenon of interest exist. We will assume that regions can be described by polygons. Each region is represented by a chain- of-vertices (COV) description, which consists of the vertices of the underlying polygon of the region listed in clockwise manner.

6. 6Shih-Chieh Lee Chain-of-Vertices (COV) = 41-27-31-39-47-51-(41) Background

7. 7Shih-Chieh Lee R-tree Sensor Network Topology A 2-D space2 sensor field is divided into grids: grid is a basic spatial unit of a square shape at least one sensor exists in each grid Using R-tree structure to organize sensor nodes into a distributed hierarchical topology. R-tree (1) effectively represent spatial information (2) obtain fast response time and accuracy for query execution (3) achieve minimal energy consumption for shape evolving target detection and tracking

8. 8Shih-Chieh Lee R-tree Sensor Network Topology A 2-D space2 sensor field is divided into grids: grid is a basic spatial unit of a square shape at least one sensor exists in each grid Using R-tree structure to organize sensor nodes into a distributed hierarchical topology. R-tree (1) effectively represent spatial information (2) obtain fast response time and accuracy for query execution (3) achieve minimal energy consumption for shape evolving target detection and tracking

9. 9Shih-Chieh Lee R-tree Sensor Network Topology R-tree satisfies the following properties: The root has at least two children unless it is a leaf Every non-leaf node has at least 0.5p children unless it is the root All leaves appear on the same level

10. 10Shih-Chieh Lee In-network Detection Base Algorithm: Forward-All Algorithm each intermediate node simply passes the information received from its children to its parent incurs a large amount of communication/energy overhead since Forward-Description Algorithm Boundary detection algorithm Merging algorithm: Description improvement algorithm:

11. 11Shih-Chieh Lee In-network Detection Boundary detection algorithm Used for nodes at a certain level of the R-tree in a distributed manner Determines the sensors on the boundary of the event Graham ’ s scan [11] for computing convex hull : O(n2) Suggest boundary detection algorithm at level 3 or higher level COV = 41-34-27-28-29-30-31-39-47- 46-45-44-43-51-42-(41)

12. 12Shih-Chieh Lee convex hull The convex hull of a set of points is the smallest convex set that includes the points. For a two dimensional finite set the convex hull is a convex polygon. The convex hull of a set of points is the smallest convex set that includes the points. For a two dimensional finite set the convex hull is a convex polygon.

13. 13Shih-Chieh Lee In-network Detection Merging algorithm: Used by a node to merge the event regions obtained from its child nodes 41-27-31-47-51-(41)88-90-99-106-104-(88) 47-51-41-27-31-88-90-99-106-104-(47)

14. 14Shih-Chieh Lee In-network Detection Description improvement algorithm: reducing the unnecessary details in COV can help reduce communication cost. Simplification 41-34-27-28-29-30-31-39-47-51-(41) => 41-27-31-47-51-(41) Smoothing When the length of an edge is much shorter than the lengths of its two neighboring edges, we can remove this edge by removing one of the two points of this edge from the COV description.

15. 15Shih-Chieh Lee In-network Detection Smoothing

16. 16Shih-Chieh Lee In-network Tracking Concerned with determining various dynamic characteristics of the event region moving direction/speed/rate of change (expansion or shrinking) in area center(t), area(t)

17. 17Shih-Chieh Lee Experimental Evaluation 32 * 32 sensor grids sensors are organized into a 6-level R-tree with a branching factor p of 4. Event Detection cases: Event 1: a circular shaped event of radius 4 involving 52 grids located at the center of the sensor field. Event 2: a circular shaped event of radius 5 involving 76 grids located at the center of the sensor field Event 3: the same size and shape as event 1, but is located on the right side of the sensor field Event 4: a small irregular shaped event involving 63 grids.

18. 18Shih-Chieh Lee Experimental Evaluation Event 5: a large irregular shaped event involving 200 grids, and has several concave segments. Event 6: a moon shaped event involving 79 grids, and has a concave side and a convex side.

19. 19Shih-Chieh Lee

20. 20Shih-Chieh Lee

21. 21Shih-Chieh Lee

22. 22Shih-Chieh Lee Conclusions Developed in-network algorithms for the detection of spatial, regionbased event, for simplification of event descriptions to reduce communication cost, and for tracking of region-based events/targets.

23. 23Shih-Chieh Lee Conclusions