Presentation is loading. Please wait.

Presentation is loading. Please wait.

APL: Autonomous Passive Localization for Wireless Sensors Deployed in Road Networks IEEE INFOCOM 2008, Phoenix, AZ, USA Jaehoon Jeong, Shuo Guo, Tian He.

Published byCuthbert Rodgers Modified over 8 years ago

Similar presentations

Presentation on theme: "APL: Autonomous Passive Localization for Wireless Sensors Deployed in Road Networks IEEE INFOCOM 2008, Phoenix, AZ, USA Jaehoon Jeong, Shuo Guo, Tian He."— Presentation transcript:

1 APL: Autonomous Passive Localization for Wireless Sensors Deployed in Road Networks IEEE INFOCOM 2008, Phoenix, AZ, USA Jaehoon Jeong, Shuo Guo, Tian He and David Du Computer Science and Engineering, University of Minnesota {jjeong,sguo,tianhe,du}@cs.umn.edu April 16th, 2008 1

2 Problem Definition Wireless Sensor Deployment Detection Timestamp Target Detecting Sensors 2

3 APL Localization Sequence 3 Timestamp Analysis Timestamp Collection Prefilter Path Estimates Reduce SensorNet Graph Perform Graph Matching

4 APL Localization Sequence 4 Timestamp Analysis Timestamp Collection Prefilter Path Estimates Reduce SensorNet Graph Perform Graph Matching

5 APL Localization Sequence 5 Timestamp Analysis Timestamp Collection Prefilter Path Estimates Reduce SensorNet Graph Perform Graph Matching

6 APL Localization Sequence 6 Timestamp Analysis Timestamp Collection Prefilter Path Estimates Reduce SensorNet Graph Perform Graph Matching

7 APL Localization Sequence 7 Timestamp Analysis Timestamp Collection Prefilter Path Estimates Reduce SensorNet Graph Perform Graph Matching Sensor Network Road Network Matching

8 APL Localization Sequence 8 Timestamp Analysis Timestamp Collection Prefilter Path Estimates Reduce SensorNet Graph Perform Graph Matching

9 APL Localization Sequence 9 Timestamp Analysis Timestamp Collection Prefilter Path Estimates Reduce SensorNet Graph Perform Graph Matching Isomorphic

10 APL Localization Sequence 10 Timestamp Analysis Timestamp Collection Prefilter Path Estimates Reduce SensorNet Graph Perform Graph Matching Matching

11 Traffic Analysis for Road Segment Length Estimation  We want to estimate the length of the road segment between two neighboring sensors S 1 and S 2.  There are three sensors S 1, S 2, and S 3 as below: Neighboring Sensors S 1, S 2, and S 3 Vehicle Detection Sequence at Sensors S 1, S 2, and S 3 11 Correlation among Timestamps! vehicles

12 Time Difference on Detection (TDOD) Operation  Time Difference On Detection (TDOD) for Sensors S1 and S2  Estimation of Movement Time through TDOD Operation Road Segment Length? 12

13 Comparison between Non-aggregation Method and Aggregation Method 13 For Noise-Resilient Estimate, we compute Moving Average with Time Difference Window of 10 seconds. For Noise-Resilient Estimate, we compute Moving Sum with Aggregation Window of 5 seconds. Aggregation Window Wrong Estimate Accurate Estimate Speed Limit V =50 km/h Road Length L =130 m Movement Time T = L/V =9.36 sec 26.8 sec 9.3 sec Estimated Road Length L’ =129.2 m

14 Outdoor Test for TDOD 14  Test Road Network Speed Limit V =64.4 km/h Road (A, B) L =800 m Movement Time T = L/V = 44.7 sec Speed Limit V =64.4 km/h Road (B, C) L =900 m Movement Time T = L/V = 50.3 sec

15 Outdoor Test for TDOD 15  Road Segment Estimation 43 sec 45 sec 56 sec54 sec 44.7 sec 50.3 sec TDOD gives good estimates for road segments.

16 Path Estimate vs. Road Segment Estimate 16 95 sec 37 sec52 sec TDOD cannot give good estimates for paths. Path estimate has a large deviation per traffic measure.

17 Procedure of Prefiltering for Virtual Graph (a) Road Sensor Network (b) Virtual Topology for Sensors (c) Virtual Graph after Prefiltering based on Relative Deviation Error (d) Virtual Graph after Prefiltering based on Minimum Spanning Tree 17 Isomorphic

18 Graph Matching  Now, we have a virtual graph whose subgraph is isomorphic to the real graph corresponding to the road network. (a) Road Sensor Network (b) Virtual Topology of Wireless Sensors (c) Virtual Graph for Sensor Network 18

19 Graph Matching Procedure  First, we find the Subgraph isomorphic to the real graph.  To find out Intersection Nodes from the Virtual Graph.  Second, we perform the Isomorphic Graph Matching.  To find out the Optimal Permutation Matrix for matching. Reduction Matching Reduced Virtual Subgraph 19 Permutation

20 Graph Matching Example Virtual GraphVirtual Subgraph Road NetworkReal Graph Reduction Abstraction Matching 20

21 Node Location Identification  Localization of Intersection Nodes  We have localized Intersection Nodes with Permutation Matrix P.  Localization of Non-intersection Nodes  Let G v = (V v, E v ) be the virtual graph.  Beginning from an intersection node u in E v, we create a path from u to another intersection node v such as Virtual Graph 21 Real Graph Node Localization Done! uv

22 Performance Evaluation  We investigate the effect of the following three parameters on our localization:  Maximum Time Synchronization Error  Vehicle Speed Standard Deviation  Vehicle Interarrival Time  Simulation Setting  18 sensors are deployed.  10-hour road traffic measurement  Vehicle Speed: 50 km/h  Default Time Synch Error: 0.01 sec  Default Interarrival Time: 120 sec Road Network 22

23 Performance Comparison between Road Segment Estimation Methods  Maximum Time Synchronization Error  Up to 0.3-second time-synch error, 0% localization error rate can be achieved.  Vehicle Speed Standard Deviation  Up to 10 km/h vehicle-speed deviation, 0% localization error rate can be achieved.  Vehicle Interarrival Time  For the interarrival time greater than 1 second, 0% localization error rate can be achieved. 23

24 APL Operational Region  What range of (i) time synchronization and (ii) vehicle speed deviation does APL work well? Vehicle Speed Deviation [km/h] Time Synch Error [sec] Localization Error Ratio 24 Operational Region

25 Conclusion  In sparse sensor networks over road networks, sensors cannot effectively obtain (i) pair-wise ranging distance or (ii) connectivity information.  Our Autonomous Passive Localization (APL) works well under realistic scenarios With Vehicle-detection timestamps and With Road map of target area.  As next step, we will perform the test of APL system in real road networks with Motes such as XSM. 25

26 Q & A 26

Download ppt "APL: Autonomous Passive Localization for Wireless Sensors Deployed in Road Networks IEEE INFOCOM 2008, Phoenix, AZ, USA Jaehoon Jeong, Shuo Guo, Tian He."

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.

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.
On Map-Matching Vehicle Tracking Data

On Map-Matching Vehicle Tracking Data
Computer Science Dr. Peng NingCSC 774 Adv. Net. Security1 CSC 774 Advanced Network Security Topic 7.3 Secure and Resilient Location Discovery in Wireless.

Computer Science Dr. Peng NingCSC 774 Adv. Net. Security1 CSC 774 Advanced Network Security Topic 7.3 Secure and Resilient Location Discovery in Wireless.
Tian Honeywell ACS Fellows Symposium Event-Driven Localization Techniques Tian He Department of Computer Science and Engineering University of Minnesota.

Tian Honeywell ACS Fellows Symposium Event-Driven Localization Techniques Tian He Department of Computer Science and Engineering University of Minnesota.
Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.

Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
Yu Stephanie Sun 1, Lei Xie 1, Qi Alfred Chen 2, Sanglu Lu 1, Daoxu Chen 1 1 State Key Laboratory for Novel Software Technology, Nanjing University, China.

Yu Stephanie Sun 1, Lei Xie 1, Qi Alfred Chen 2, Sanglu Lu 1, Daoxu Chen 1 1 State Key Laboratory for Novel Software Technology, Nanjing University, China.
Detecting Phantom Nodes in Wireless Sensor Networks Joengmin Hwang Tian He Yongdae Kim Department of Computer Science, University of Minnesota, Minneapolis.

Detecting Phantom Nodes in Wireless Sensor Networks Joengmin Hwang Tian He Yongdae Kim Department of Computer Science, University of Minnesota, Minneapolis.
KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.

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.

Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.

A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
A High-Accuracy, Low-Cost Localization System for Wireless Sensor Networks Radu Stoleru, Tian He, John A. Stankovic, David Luebke University of Virginia.

A High-Accuracy, Low-Cost Localization System for Wireless Sensor Networks Radu Stoleru, Tian He, John A. Stankovic, David Luebke University of Virginia.
The Cat and The Mouse -- The Case of Mobile Sensors and Targets David K. Y. Yau Lab for Advanced Network Systems Dept of Computer Science Purdue University.

The Cat and The Mouse -- The Case of Mobile Sensors and Targets David K. Y. Yau Lab for Advanced Network Systems Dept of Computer Science Purdue University.
TSF: Trajectory-based Statistical Forwarding for Infrastructure-to-Vehicle Data Delivery in Vehicular Networks Jaehoon Jeong, Shuo Guo, Yu Gu, Tian He,

TSF: Trajectory-based Statistical Forwarding for Infrastructure-to-Vehicle Data Delivery in Vehicular Networks Jaehoon Jeong, Shuo Guo, Yu Gu, Tian He,
FIND: Faulty Node Detection for Wireless Sensor Networks Shuo Guo, Ziguo Zhong and Tian He University of Minnesota, Twin Cities.

FIND: Faulty Node Detection for Wireless Sensor Networks Shuo Guo, Ziguo Zhong and Tian He University of Minnesota, Twin Cities.
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.

Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
Optimal Sleep-Wakeup Algorithms for Barriers of Wireless Sensors S. Kumar, T. Lai, M. Posner and P. Sinha, BROADNETS ’ 2007.

Optimal Sleep-Wakeup Algorithms for Barriers of Wireless Sensors S. Kumar, T. Lai, M. Posner and P. Sinha, BROADNETS ’ 2007.
Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:

Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.

On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
1 Energy-Efficient localization for networks of underwater drifters Diba Mirza Curt Schurgers Department of Electrical and Computer Engineering.

1 Energy-Efficient localization for networks of underwater drifters Diba Mirza Curt Schurgers Department of Electrical and Computer Engineering.
SMART: A Scan-based Movement- Assisted Sensor Deployment Method in Wireless Sensor Networks Jie Wu and Shuhui Yang Department of Computer Science and Engineering.

SMART: A Scan-based Movement- Assisted Sensor Deployment Method in Wireless Sensor Networks Jie Wu and Shuhui Yang Department of Computer Science and Engineering.

Similar presentations

Ads by Google