Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.

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

Coverage in Wireless Sensor Network Phani Teja Kuruganti AICIP lab.
A Hierarchical Multiple Target Tracking Algorithm for Sensor Networks Songhwai Oh and Shankar Sastry EECS, Berkeley Nest Retreat, Jan
Tian Honeywell ACS Fellows Symposium Event-Driven Localization Techniques Tian He Department of Computer Science and Engineering University of Minnesota.
Beyond Trilateration: On the Localizability of Wireless Ad Hoc Networks Reported by: 莫斌.
Computer Science 1 CSC 774 Advanced Network Security Enhancing Source-Location Privacy in Sensor Network Routing (ICDCS ’05) Brian Rogers Nov. 21, 2005.
Source-Location Privacy Protection in Wireless Sensor Network Presented by: Yufei Xu Xin Wu Da Teng.
KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.
Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.
Nov 4, Detection, Classification and Tracking of Targets in Distributed Sensor Networks Presented by: Prabal Dutta Dan Li, Kerry Wong,
FIND: Faulty Node Detection for Wireless Sensor Networks Shuo Guo, Ziguo Zhong and Tian He University of Minnesota, Twin Cities.
Deployment Strategies for Differentiated Detection in Wireless Sensor Network Jingbin Zhang, Ting Yan, and Sang H. Son University of Virginia From SECON.
- 1 - Intentional Mobility in Wireless Sensor Networks Deployment, Dispatch, and Applications Dr. You-Chiun Wang ( 王友群 ) Department of Computer Science,
Watchdog Confident Event Detection in Heterogeneous Sensor Networks Matthew Keally 1, Gang Zhou 1, Guoliang Xing 2 1 College of William and Mary, 2 Michigan.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 13th Lecture Christian Schindelhauer.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Distributed and Efficient Classifiers for Wireless Audio-Sensor Networks Baljeet Malhotra Ioanis Nikolaidis Mario A. Nascimento University of Alberta Canada.
An Energy-efficient Target Tracking Algorithm in Wireless Sensor Networks Wang Duoqiang, Lv Mingke, Qin Qi School of Computer Science and technology Huazhong.
Speed and Direction Prediction- based localization for Mobile Wireless Sensor Networks Imane BENKHELIFA and Samira MOUSSAOUI Computer Science Department.
FIND: Faulty Node Detection for Wireless Sensor Networks SenSys 2009 Shuo Guo, Ziguo Zhong, Tian He University of Minnesota, Twin Cities Jeffrey.
A User Experience-based Cloud Service Redeployment Mechanism KANG Yu.
Presented by: Chaitanya K. Sambhara Paper by: Maarten Ditzel, Caspar Lageweg, Johan Janssen, Arne Theil TNO Defence, Security and Safety, The Hague, The.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
1 Secure Cooperative MIMO Communications Under Active Compromised Nodes Liang Hong, McKenzie McNeal III, Wei Chen College of Engineering, Technology, and.
Sidewinder A Predictive Data Forwarding Protocol for Mobile Wireless Sensor Networks Matt Keally 1, Gang Zhou 1, Guoliang Xing 2 1 College of William and.
EShare: A Capacitor-Driven Energy Storage and Sharing Network for Long-Term Operation(Sensys 2010) Ting Zhu, Yu Gu, Tian He, Zhi-Li Zhang Department of.
Sensor Positioning in Wireless Ad-hoc Sensor Networks Using Multidimensional Scaling Xiang Ji and Hongyuan Zha Dept. of Computer Science and Engineering,
Decentralized Scattering of Wake-up Times in Wireless Sensor Networks Amy L. Murphy ITC-IRST, Trento, Italy joint work with Alessandro Giusti, Politecnico.
Authors: Sheng-Po Kuo, Yu-Chee Tseng, Fang-Jing Wu, and Chun-Yu Lin
Target Tracking with Binary Proximity Sensors: Fundamental Limits, Minimal Descriptions, and Algorithms N. Shrivastava, R. Mudumbai, U. Madhow, and S.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.
Localization With Mobile Anchor Points in Wireless Sensor Networks
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
Distributed Tracking Using Kalman Filtering Aaron Dyreson, Faculty Advisor: Ioannis Schizas, Ph.D. Department of Electrical Engineering, The University.
Multi-hop-based Monte Carlo Localization for Mobile Sensor Networks
MURI: Integrated Fusion, Performance Prediction, and Sensor Management for Automatic Target Exploitation 1 Dynamic Sensor Resource Management for ATE MURI.
Detection, Classification and Tracking in a Distributed Wireless Sensor Network Presenter: Hui Cao.
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,
College of Engineering Anchor Nodes Placement for Effective Passive Localization Karthikeyan Pasupathy Major Advisor: Dr. Robert Akl Department of Computer.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
APL: Autonomous Passive Localization for Wireless Sensors Deployed in Road Networks IEEE INFOCOM 2008, Phoenix, AZ, USA Jaehoon Jeong, Shuo Guo, Tian He.
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
Covering Points of Interest with Mobile Sensors Milan Erdelj, Tahiry Razafindralambo and David Simplot-Ryl INRIA Lille - Nord Europe IEEE Transactions on.
© 2007 Sean A. Williams 1 Ecolocation: A Sequence Based Technique for RF Localization in Wireless Sensor Networks Authors: Kiran Yedavalli, Bhaskar Krishnamachari,
1 Approximate XML Query Answers Presenter: Hongyu Guo Authors: N. polyzotis, M. Garofalakis, Y. Ioannidis.
Adaptive Tracking in Distributed Wireless Sensor Networks Lizhi Yang, Chuan Feng, Jerzy W. Rozenblit, Haiyan Qiao The University of Arizona Electrical.
A Reliability-oriented Transmission Service in Wireless Sensor Networks Yunhuai Liu, Yanmin Zhu and Lionel Ni Computer Science and Engineering Hong Kong.
Wireless sensor and actor networks: research challenges
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.
Smart Sleeping Policies for Wireless Sensor Networks Venu Veeravalli ECE Department & Coordinated Science Lab University of Illinois at Urbana-Champaign.
A Protocol for Tracking Mobile Targets using Sensor Networks H. Yang and B. Sikdar Department of Electrical, Computer and Systems Engineering Rensselaer.
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 Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.
Dynamic Proxy Tree-Based Data Dissemination Schemes for Wireless Sensor Networks Wensheng Zhang, Guohong Cao and Tom La Porta Department of Computer Science.
Optimal Relay Placement for Indoor Sensor Networks Cuiyao Xue †, Yanmin Zhu †, Lei Ni †, Minglu Li †, Bo Li ‡ † Shanghai Jiao Tong University ‡ HK University.
Zijian Wang, Eyuphan Bulut, and Boleslaw K. Szymanski Center for Pervasive Computing and Networking and Department of Computer Science Rensselaer Polytechnic.
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
PROJECT DOMAIN : NETWORK SECURITY Project Members : M.Ananda Vadivelan & E.Kalaivanan Department of Computer Science.
Prof. Yu-Chee Tseng Department of Computer Science
Computing and Compressive Sensing in Wireless Sensor Networks
Fast Localization for Emergency Monitoring and Rescue in Disaster Scenarios Based on WSN SPEAKER:Jyun-Ying Yu ADVISOR:DR. Kai-Wei Ke DATE:2018/05/04.
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
Presentation transcript:

Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009 Jeffrey

Outline Abstract Introduction System Overview Basic System Design Multi-dimensional Smoothing Discussion Simulation Evaluation System Evaluation Conclusion Strength And Weakness

Outline Abstract Introduction System Overview Basic System Design Multi-dimensional Smoothing Discussion Simulation Evaluation System Evaluation Conclusion Strength And Weakness

Abstract This paper proposes a robust tracking framework using node sequencesnode sequences – An ordered list extracted from unreliable sensor readings Instead of estimating each position point separately in a movement trace – Original tracking problem is converted to problem of finding the shortest path in a graph – Equivalent to optimal matching of a series of node sequences

Abstract Multidimensional smoothing is developed to enhance tracking accuracy Design is evaluated with – Simulation – A system implementation using Pioneer III Robot and MICAz sensor nodes Tracking with node sequences provides a useful layer of abstraction – Making the design framework generic and compatible with different physical sensing modalities

Outline Abstract Introduction System Overview Basic System Design Multi-dimensional Smoothing Discussion Simulation Evaluation System Evaluation Conclusion Strength And Weakness

Introduction Wireless sensor networks (WSN) have been considered as a promising system for area surveillance applications Low-cost sensor nodes are deployed randomly or deliberately in an area to accomplish the task of monitoring – Event/target detection – Localization and tracking with or without cooperation from the target itself

Challenging Accurate large scale mobile target tracking still remains to be one of the challenging issues in the WSN community – Due to extremely limited resource constraints for each sensor node Many excellent ideas have been proposed for target tracking with WSN

Mobile Target Tracking This paper investigates a new approach for mobile target tracking with sensor networks Without assumptions of target movement models Without accurate range-based localization Mobile tracking is accomplished by processing node sequences – Easily obtained by ordering related sensor nodes according to their sensing results of the mobile target

Range-free Approach As a range-free approach, tracking by processing node sequences provides a useful layer of abstraction Specific format of the physical sensing modality (e.g., heat/RF radiation, acoustic/sematic wave) is irrelevant to the tracking algorithm as long as the node sequences obtained reflect the relative distance relationships among the target and the sensor nodes with known positions Thus, the design is very generic, flexible, and compatible with different sensing modalities

Major Challenge Node sequences are unreliable due to combined factors such as – Irregular signal patterns emitted from the target – Environment noise – Sensing irregularity Proposed design owns better tracking accuracy than the base-line method using sequential based localization – Especially in the scenarios where considerable noise exists

Outline Abstract Introduction System Overview Basic System Design Multi-dimensional Smoothing Discussion Simulation Evaluation System Evaluation Conclusion Strength And Weakness

System Overview

Map Dividing and Neighborhood Graph Building

Detection Node Sequences Obtained for the Mobile Target

Tracking with Unreliable Node Sequence Processing

Outline Abstract Introduction System Overview Basic System Design Multi-dimensional Smoothing Discussion Simulation Evaluation System Evaluation Conclusion Strength And Weakness

Basic System Design Division of the Map Unreliable Detection Node Sequence Sequence Distance Neighborhood Graph Tracking as Optimal Path Matching

Division of the Map

Unreliable Detection Node Sequence In ideal case, a detection sequences S d should be identical with one of the face signatures However, in a real system, sensing at each sensor node could be irregular and affected by many factors – including environment noise, obstacles and etc S d is unreliable, which could be either – a full detection sequence including all the related sensor nodes – or a partial detection sequence, in which some of the nodes supposed to appear are missing In addition, nodes in Sd could get flipped due to noisy sensing

Detection Sequences v.s. Face Sequences

Sequence Distance

The Insight of Sequence Distance

Extended KT Distance Algorithm

Neighborhood Graph

Neighborhood Graphs with Randomly Deployed 4, 8, 12 and 16 Sensor Nodes

Tracking as Optimal Path Matching

Outline Abstract Introduction System Overview Basic System Design Multi-dimensional Smoothing Discussion Simulation Evaluation System Evaluation Conclusion Strength And Weakness

Multi-dimensional Smoothing Modality Domain Smoothing Time Domain Smoothing Space Domain Smoothing

Modality Domain Smoothing If a sensor node is capable of sensing the environment with multiple modalities (e.g., acoustic, infrared and etc) – it could be hard to merge those sensing results at the physical layer – For example, comparing a 10dB acoustic signal with a −60dBm RF strength is meaningless

Modality Domain Smoothing

Time Domain Smoothing Time domain smoothing over continuous detection results is commonly used for filtering out random noise in many systems

Space Domain Smoothing The design presented so far maps the position of the mobile target at each time instance to the center of gravity point of a face in the map This results in two phenomena – Many positions in the true trace are projected to the same estimated position – Estimated positions scatter at both sides of the true trace

Outline Abstract Introduction System Overview Basic System Design Multi-dimensional Smoothing Discussion Simulation Evaluation System Evaluation Conclusion Strength And Weakness

Discussion System Scalability and Multiple Targets Time Synchronization and Energy Efficiency

System Scalability and Multiple Targets

Reduced Candidate Path Graph H

Time Synchronization and Energy Efficiency Current time synchronization techniques can achieve microsecond level accuracy – Flooding Time Synchronization Protocol If a short timestamp is attached to each sensing result – The sink or the distributed tracking terminals can correctly assemble the detection sequences for different time instance Most of the time, sensor nodes keep a low duty cycle until some event or target appears in the monitored area

Outline Abstract Introduction System Overview Basic System Design Multi-dimensional Smoothing Discussion Simulation Evaluation System Evaluation Conclusion Strength And Weakness

Simulation Evaluation Noise Models An Example by Figures Simulation Results

Noise Models A linear delay noise model for time-of-fly based detection A logarithmic attenuation noise model for signal-strength based detection

An Example by Figures

Smoothed Result

Simulation Results Linear Noise Model a b Number of Sensor Nodes Number of Starting Faces Effectiveness of Smoothing

Linear Noise Model

Number of Sensor Nodes

Number of Starting Faces

Effectiveness of Smoothing

Outline Abstract Introduction System Overview Basic System Design Multi-dimensional Smoothing Discussion Simulation Evaluation System Evaluation Conclusion Strength And Weakness

System Evaluation

Robot Tracking Results

Outline Abstract Introduction System Overview Basic System Design Multi-dimensional Smoothing Discussion Simulation Evaluation System Evaluation Conclusion Strength And Weakness

Conclusion This paper presented the first work for mobile target tracking using unreliable node sequences in wireless sensor networks Tracking is modeled as an optimal path matching problem in a graph Beside the basic design, multi-dimensional smoothing is proposed for further enhancing system accuracy

Conclusion Evaluation results demonstrate that tracking with optimal path matching outperforms per- position maximum likelihood estimation In addition, the design provides a general platform for different physical modalities with an abstract layer of node sequence

Outline Abstract Introduction System Overview Basic System Design Multi-dimensional Smoothing Discussion Simulation Evaluation System Evaluation Conclusion Strength And Weakness

Strength – Robust – Accurate Weakness – Real-time for WSN?

Thank you very much for your attention!

Node Sequences