# Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.

## Presentation on theme: "Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer."— Presentation transcript:

Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer Science & Engineering University of Minnesota Minneapolis Infocom 2007

2 Outline Introduction Minimal Contour Tracking Algorithm (MCTA) Simulation Conclusion

3 Introduction Sensor nodes  Battery operated  The lifetime of WSN is the primary concern

4 Introduction Sensor Node

5 Goal Proposed a Minimal Contour Tracking Algorithm (MCTA)  To guarantee the target tracking without missing  To maximize the sensor network lifetime Refresh Time Minimal Contour

6 Assumptions The sensing range is a uniform-disk whose radius is r. The communication radius is adjustable by controlling RF transmission power. The RF transmission angle is adjustable by using directional Antenna. The localization scheme is provided for the sensor nodes in order to find the position, speed, and direction of the vehicle at any time.

7 Definitions Refresh Time  We define the lifetime of the tracking area as refresh time. Tracking Circle  The tracking circle is the tracking area where the target can visit for its current position and speed during refresh time.  The tracking circle’s radius is the multiplication of target’s speed and refresh time.

8 Definitions Tracking Contour  The tracking contour is the tracking area where the target can visit for its current position, speed and direction during refresh time, considering the vehicular kinematics.

9 Definitions

10

11 Design Goals The optimization of refresh time for minimal contour The minimization of communication cost in terms of the number of RF receiving sensors Each sensor’s localized determination of its warming up time and finishing time for sensing

12

13 Minimal Contour Tracking Algorithm (MCTA)

14 Minimal Contour Tracking Algorithm (MCTA) Refresh Time

15 Minimal Contour Tracking Algorithm (MCTA)

16 Minimal Contour Tracking Algorithm (MCTA) V = 30 km/h φ max = 25°

17 Optimization of Refresh Time for Minimal Contour

18 Minimal Contour Tracking Algorithm (MCTA)

19 Minimal Contour Tracking Algorithm (MCTA)

20 Minimal Contour Tracking Algorithm (MCTA)

21 Simulation 10,000 sensor nodes are uniformly deployed in the surveillance field of 500m × 500m. The radius of communication is 75m. The vehicle’s speed is 30km/h and its maximum turning angle is 25°.

22 Simulation Results

23 Simulation Results

24 Simulation Results

25 Conclusions Proposed a Minimal Contour Tracking Algorithm (MCTA)  Optimize the refresh time  Transmission power control  Directional antenna  Using minimal tracking area called tracking contour that is based on the vehicular kinematics  The communication and sensing energy saving

26 Thank you!

Download ppt "Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer."

Similar presentations