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

Slides:



Advertisements
Similar presentations
1 A Real-Time Communication Framework for Wireless Sensor-Actuator Networks Edith C.H. Ngai 1, Michael R. Lyu 1, and Jiangchuan Liu 2 1 Department of Computer.
Advertisements

Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.
Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks Xiaorui Wang, Guoliang Xing, Yuanfang Zhang*, Chenyang Lu, Robert Pless,
1 An Energy-Efficient Unequal Clustering Mechanism for Wireless Sensor Networks Chengfa Li, Mao Ye, Guihai Chen State Key Laboratory for Novel Software.
KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.
TSF: Trajectory-based Statistical Forwarding for Infrastructure-to-Vehicle Data Delivery in Vehicular Networks Jaehoon Jeong, Shuo Guo, Yu Gu, Tian He,
Optimal Sleep-Wakeup Algorithms for Barriers of Wireless Sensors S. Kumar, T. Lai, M. Posner and P. Sinha, BROADNETS ’ 2007.
Mobility Improves Coverage of Sensor Networks Benyuan Liu*, Peter Brass, Olivier Dousse, Philippe Nain, Don Towsley * Department of Computer Science University.
Deployment Strategies for Differentiated Detection in Wireless Sensor Network Jingbin Zhang, Ting Yan, and Sang H. Son University of Virginia From SECON.
Energy-Efficient Target Coverage in Wireless Sensor Networks Mihaela Cardei, My T. Thai, YingshuLi, WeiliWu Annual Joint Conference of the IEEE Computer.
USense: A Unified Asymmetric Sensing Architecture for Wireless Sensor Networks Yu Gu, Joengmin Hwang, Tian He and David Du Minnesota Embedded Sensor System.
Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.
Delay-aware Routing in Low Duty-Cycle Wireless Sensor Networks Guodong Sun and Bin Xu Computer Science and Technology Department Tsinghua University, Beijing,
Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.
An Energy-efficient Target Tracking Algorithm in Wireless Sensor Networks Wang Duoqiang, Lv Mingke, Qin Qi School of Computer Science and technology Huazhong.
Energy-efficient Multiple Targets Tracking Using Target Kinematics in Wireless Sensor Networks Akond Ashfaque Ur Rahman, Mahmuda Naznin, Md. Atiqul Islam.
Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.
Lifetime and Coverage Guarantees Through Distributed Coordinate- Free Sensor Activation ACM MOBICOM 2009.
Dynamic Coverage Enhancement for Object Tracking in Hybrid Sensor Networks Computer Science and Information Engineering Department Fu-Jen Catholic University.
Localization With Mobile Anchor Points in Wireless Sensor Networks
A novel gossip-based sensing coverage algorithm for dense wireless sensor networks Vinh Tran-Quang a, Takumi Miyoshi a,b a Graduate School of Engineering,
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Preserving Area Coverage in Wireless Sensor Networks by using Surface Coverage Relay Dominating Sets Jean Carle, Antoine Gallais and David Simplot-Ryl.
Prediction-based Object Tracking and Coverage in Visual Sensor Networks Tzung-Shi Chen Jiun-Jie Peng,De-Wei Lee Hua-Wen Tsai Dept. of Com. Sci. and Info.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
On Energy-Efficient Trap Coverage in Wireless Sensor Networks Junkun Li, Jiming Chen, Shibo He, Tian He, Yu Gu, Youxian Sun Zhejiang University, China.
Multi-hop-based Monte Carlo Localization for Mobile Sensor Networks
Xiaobing Wu, Guihai Chen
Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,
1 Probabilistic Coverage in Wireless Sensor Networks Nadeem Ahmed, Salil S. Kanhere and Sanjay Jha Computer Science and Engineering, University of New.
Bounded relay hop mobile data gathering in wireless sensor networks
APL: Autonomous Passive Localization for Wireless Sensors Deployed in Road Networks IEEE INFOCOM 2008, Phoenix, AZ, USA Jaehoon Jeong, Shuo Guo, Tian He.
1 TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks IEEE ICDCS’09, Montreal, Quebec, Canada Jaehoon Jeong, Shuo Gu, Yu Gu, Tian.
1 VISA: Virtual Scanning Algorithm for Dynamic Protection of Road Networks IEEE Infocom’09, Rio de Janeiro, Brazil Jaehoon Jeong (Paul), Yu Gu, Tian He.
Chinh T. Vu, Yingshu Li Computer Science Department Georgia State University IEEE percom 2009 Delaunay-triangulation based complete coverage in wireless.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Node Reclamation and Replacement for Long-lived Sensor Networks Bin Tong, Wensheng Zhang, and Chuang Wang Department of Computer Science, Iowa State University.
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
Collaborative Broadcasting and Compression in Cluster-based Wireless Sensor Networks Anh Tuan Hoang and Mehul Motani National University of Singapore Wireless.
Variable Bandwidth Allocation Scheme for Energy Efficient Wireless Sensor Network SeongHwan Cho, Kee-Eung Kim Korea Advanced Institute of Science and Technology.
Ching-Ju Lin Institute of Networking and Multimedia NTU
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Barrier Coverage in Camera Sensor Networks ACM MobiHoc 2011 Yi Wang Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University.
Data Gathering in Wireless Sensor Networks with Mobile Collectors Ming Ma and Yuanyuan Yang State University of New York, Stony Brook 1 IEEE Parallel and.
A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks Di Tian, and Nicolas D. Georanas ACM WSNA ‘ 02.
Maximizing Angle Coverage in Visual Sensor Networks Kit-Yee Chow, King-Shan Lui and Edmund Y. Lam Department of Electrical and Electronic Engineering The.
U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.
Centralized Transmission Power Scheduling in Wireless Sensor Networks Qin Wang Computer Depart., U. of Science & Technology Beijing Edward Y. Hua Wireless.
A Load-Balanced Guiding Navigation Protocol in Wireless Sensor Networks Wen-Tsuen Chen Department of Computer Science National Tsing Hua University Po-Yu.
Decentralized Energy-Conserving and Coverage-Preserving Protocols for Wireless Sensor Networks Chi-Fu Huang, Li-Chu Lo, Yu-Chee Tseng, and Wen-Tsuen Chen.
Dynamic Node Collaboration for Mobile Target Tracking in Wireless Camera Sensor Networks Liang Liu†,‡, Xi Zhang†, and Huadong Ma‡ † Networking and Information.
Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Ming Ma and Yuanyuan Yang Department of Electrical & Computer Engineering.
SenSys 2003 Differentiated Surveillance for Sensor Networks Ting Yan Tian He John A. Stankovic Department of Computer Science, University of Virginia November.
A Protocol for Tracking Mobile Targets using Sensor Networks H. Yang and B. Sikdar Department of Electrical, Computer and Systems Engineering Rensselaer.
A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks Di Tian, Nicolas D. Georganas First ACM international workshop on Wireless.
HCRL: A Hop-Count-Ratio based Localization in Wireless Sensor Networks Sungwon Yang, Jiyoung Yi and Hojung Cha Department of Computer Science, Yonsei University,
Younghwan Yoo† and Dharma P. Agrawal‡ † School of Computer Science and Engineering, Pusan National University, Busan, KOREA ‡ OBR Center for Distributed.
LORD: A Localized, Reactive and Distributed Protocol for Node Scheduling in Wireless Sensor Networks Arijit Ghosh and Tony Givargis Center for Embedded.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
KAIS T Sensor Deployment Based on Virtual Forces Reference: Yi Zou and Krishnendu Chakarabarty, “Sensor Deployment and Target Localization Based on Virtual.
Zijian Wang, Eyuphan Bulut, and Boleslaw K. Szymanski Center for Pervasive Computing and Networking and Department of Computer Science Rensselaer Polytechnic.
A Coverage-Preserving and Hole Tolerant Based Scheme for the Irregular Sensing Range in WSNs Azzedine Boukerche, Xin Fei PARADISE Research Lab Univeristy.
/ 24 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai Santosh Kumar Dong Xuan Computer Science and Engineering The Ohio.
I owa S tate U niversity Laboratory for Advanced Networks (LAN) Coverage and Connectivity Control of Wireless Sensor Networks under Mobility Qiang QiuAhmed.
Efficient Route Update Protocol for Wireless Sensor Networks Xuhui Hu, Yong Liu, Myung J. Lee, Tarek N. Saadawi City University of New York, City College.
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks High-Speed Networking Lab. Dept. of CSIE,
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!