September 16,2003 MobiCom'03 University of Virginia 1 Range-Free Localization Schemes in Large Scale Sensor Networks Tian He Chengdu Huang Brian.

Slides:



Advertisements
Similar presentations
6/3/2014 Wireless Sensor Networks COE 499 Localization Tarek Sheltami KFUPM CCSE COE 1.
Advertisements

Localization for Mobile Sensor Networks ACM MobiCom 2004 Lingxuan HuDavid Evans Department of Computer Science University of Virginia.
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 Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 9: Localization & positioning Holger Karl.
Range-Free Sensor Localization Simulations with ROCRSSI-based Algorithm Matt Magpayo
Range-Based and Range-Free Localization Schemes for Sensor Networks
“Localization in Underwater Sensor Networks” Presented by: Ola Ibrahim EL naggar J presentation.
A High-Accuracy, Low-Cost Localization System for Wireless Sensor Networks Radu Stoleru, Tian He, John A. Stankovic, David Luebke University of Virginia.
Murat Demirbas SUNY Buffalo
Impact of Radio Irregularity on Wireless Sensor Networks
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 16th Lecture Christian Schindelhauer.
GPS-free Positioning in Ad-Hoc Networks Yu-Min Tseng.
Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks.
Introduction to Sensor Networks Rabie A. Ramadan, PhD Cairo University 3.
Range-free Localization Schemes for Large Scale Sensor Networks
Novel Self-Configurable Positioning Technique for Multihop Wireless Networks Authors : Hongyi Wu Chong Wang Nian-Feng Tzeng IEEE/ACM TRANSACTIONS ON NETWORKING,
1 Spatial Localization Light-Seminar Spring 2005.
TPS: A Time-Based Positioning Scheme for outdoor Wireless Sensor Networks Authors: Xiuzhen Cheng, Andrew Thaeler, Guoliang Xue, Dechang Chen From IEEE.
Probability Grid: A Location Estimation Scheme for Wireless Sensor Networks Presented by cychen Date : 3/7 In Secon (Sensor and Ad Hoc Communications and.
Jana van Greunen - 228a1 Analysis of Localization Algorithms for Sensor Networks Jana van Greunen.
Geographic Routing Without Location Information A. Rao, C. Papadimitriou, S. Shenker, and I. Stoica In Proceedings of the 9th Annual international Conference.
Locating Sensors in the Wild: Pursuit of Ranging Quality Wei Xi, Yuan He, Yunhao Liu, Jizhong Zhao, Lufeng Mo, Zheng Yang, Jiliang Wang,
Wireless Sensor Networks Localization
ENERGY EFFICIENT INDOOR LOCALIZATION IN WIRELESS SENSOR NETWORKS
A Distributed Localization Scheme for Wireless Sensor Networks with Improved Grid-Scan and Vector- Based Refinement Jang-Ping Sheu, Pei-Chun Chen, and.
Secure Localization Algorithms for Wireless Sensor Networks proposed by A. Boukerche, H. Oliveira, E. Nakamura, and A. Loureiro (2008) Maria Berenice Carrasco.
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.
Time of arrival(TOA) Prepared By Sushmita Pal Roll No Dept.-CSE,4 th year.
Sensor Positioning in Wireless Ad-hoc Sensor Networks Using Multidimensional Scaling Xiang Ji and Hongyuan Zha Dept. of Computer Science and Engineering,
LOCALIZATION in Sensor Networking Hamid Karimi. Wireless sensor networks Wireless sensor node  power supply  sensors  embedded processor  wireless.
Introduction to Sensor Networks Rabie A. Ramadan, PhD Cairo University 3.
Localization With Mobile Anchor Points in Wireless Sensor Networks
Architectures and Applications for Wireless Sensor Networks ( ) Localization Chaiporn Jaikaeo Department of Computer Engineering.
Localization using DOT3 Wireless Sensors Design & Implementation Motivation Wireless sensors can be used for locating objects: − Previous works used GPS,
Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors Weikuan Yu Dept. of Computer and Info. Sci. The Ohio State University.
Multi-hop-based Monte Carlo Localization for Mobile Sensor Networks
1 Robust Statistical Methods for Securing Wireless Localization in Sensor Networks (IPSN ’05) Zang Li, Wade Trappe Yanyong Zhang, Badri Nath Rutgers University.
September 16,2003 MobiCom'03 University of Virginia 1 Range-Free Localization Schemes in Large Scale Sensor Networks Tian He Chengdu Huang Brian.
Localization and Secure Localization. The Problem The determination of the geographical locations of sensor nodes Why do we need Localization? –Manual.
A New Hybrid Wireless Sensor Network Localization System Ahmed A. Ahmed, Hongchi Shi, and Yi Shang Department of Computer Science University of Missouri-Columbia.
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.
Ad Hoc Positioning System (APS) Using AOA Dragos¸ Niculescu and Badri Nath INFOCOM ’03 1 Seoyeon Kang September 23, 2008.
Ad Hoc Positioning System (APS)
1 Probabilistic Coverage in Wireless Sensor Networks Nadeem Ahmed, Salil S. Kanhere and Sanjay Jha Computer Science and Engineering, University of New.
11/25/2015 Wireless Sensor Networks COE 499 Localization Tarek Sheltami KFUPM CCSE COE 1.
Localization and Secure Localization. Learning Objectives Understand why WSNs need localization protocols Understand localization protocols in WSNs Understand.
Positioning in Ad-Hoc Networks - A Problem Statement Jan Beutel Computer Engineering and Networks Lab Swiss Federal Institute of Technology (ETH) Zurich.
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
Localization for Mobile Sensor Networks ACM MobiCom 2004 Philadelphia, PA 28 September 2004 University of Virginia Computer Science Lingxuan Hu and David.
Webdust PI: Badri Nath SensIT PI Meeting January 15,16, Co-PIs: Tomasz Imielinski,
Cooperative Location- Sensing for Wireless Networks Authors : Haris Fretzagias Maria Papadopouli Presented by cychen IEEE International Conference on Pervasive.
© 2007 Sean A. Williams 1 Ecolocation: A Sequence Based Technique for RF Localization in Wireless Sensor Networks Authors: Kiran Yedavalli, Bhaskar Krishnamachari,
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
6.4 Global Positioning of Nodes Advanced Operating Systems Ruizhe Ma September 28, 2015.
Computer Science 1 Using Clustering Information for Sensor Network Localization Haowen Chan, Mark Luk, and Adrian Perrig Carnegie Mellon University
Distributed Localization Using a Moving Beacon in Wireless Sensor Networks IEEE Transactions on Parallel and Distributed System, Vol. 19, No. 5, May 2008.
WIRELESS SENSOR NETWORK 1 ASIS KUMAR TRIPATHY Department of Information Technology
Mingze Zhang, Mun Choon Chan and A. L. Ananda School of Computing
Range-Free Localization Schemes in Large Scale Sensor Networks
Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors
Presenter: Yawen Wei Author: Loukas Lazos and Radha Poovendran
Presented by Prashant Duhoon
6.4 Global Positioning of Nodes
Wireless Sensor Network Localization Overview
Wireless Mesh Networks
Wireless Sensor Networks and Internet of Things
A schematic overview of localization in wireless sensor networks
Overview: Chapter 2 Localization and Tracking
Presentation transcript:

September 16,2003 MobiCom'03 University of Virginia 1 Range-Free Localization Schemes in Large Scale Sensor Networks Tian He Chengdu Huang Brian. M. Blum John A. Stankovic Tarek F. Abdelzaher Department of Computer Science, University of Virginia

September 16,2003 MobiCom'03 University of Virginia 2 Outline Problem Statement State of the Art Motivation & Contribution A.P.I.T. Algorithm Details Evaluation Conclusion

September 16,2003 MobiCom'03 University of Virginia 3 Problem Statement Localization Problem: –How nodes discover their geographic positions in 2D or 3D space? Target Systems: –Static large scale sensor networks or one with a low mobility Goal: –An affordable solution suitable for large-scale deployment with a precision sufficient for many sensor applications.

September 16,2003 MobiCom'03 University of Virginia 4 State of the Art (1) Range-based Fine-grained localizations –TOA (Time of Arrival ): GPS –TDOA (Time Difference of Arrival): MIT Cricket & UCLA AHLos –AOA (Angle of Arrive ): Aviation System and Rutgers APS –RSSI (Receive Signal Strength Indicator) : Microsoft RADAR and UW SpotOn Required Expensive hardware Limited working range ( Dense anchor requirement) Log-normal model doesn ’ t hold well in practice [D. Ganesan]

September 16,2003 MobiCom'03 University of Virginia 5 State of the Art (2) Range-Free Coarse-grained localization –USC/ISI Centroid localization –Rutgers DV-Hop Localization –MIT Amorphous Localization –AT&T Active Badge Simple hardware/ Less accuracy

September 16,2003 MobiCom'03 University of Virginia 6 Motivation High precision in sensor network localization is overkill for a lot of applications. Large scale deployment require cost-effective solutions. Routing Delivery Ratio Entity Tracking Time Under different localization Error ( % Radio Range)

September 16,2003 MobiCom'03 University of Virginia 7 Contributions A novel range-free algorithm with enhanced performance under irregular radio patterns and random node placement with a much smaller overhead than flooding based solutions The first to provide a realistic and detailed quantitative comparison of existing range-free algorithms. First investigation into the effect of localization accuracy on application performance

September 16,2003 MobiCom'03 University of Virginia 8 Overview of APIT Algorithm APIT employs a novel area-based approach. Anchors divide terrain into triangular regions A node’s presence inside or outside of these triangular regions allows a node to narrow the area in which it can potentially reside. The method to do so is called Approximate Point In Triangle Test (APIT). Out IN

September 16,2003 MobiCom'03 University of Virginia 9 APIT Main Algorithm Pseudo Code: Receive beacons (X i,Y i ) from N anchors N anchors form triangles. For ( each triangle T i Є ){ InsideSet  Point-In-Triangle-Test (T i ) } Position = COG ( ∩Ti  InsideSet); For each node Anchor Beaconing Individual APIT Test Triangle Aggregation Center of Gravity Estim.

September 16,2003 MobiCom'03 University of Virginia 10 Point-In-Triangle-Test For three anchors with known positions: A(a x,a y ), B(b x,b y ), C(c x,c y ), determine whether a point M with an unknown position is inside triangle ∆ABC or not. B(b x,b y ) C(c x,c y ), A(a x,a y ) M

September 16,2003 MobiCom'03 University of Virginia 11 Perfect P.I.T Theory If there exists a direction in which M is departure from points A, B, and C simultaneously, then M is outside of ∆ABC. Otherwise, M is inside ∆ABC. Require approximation for practical use –Nodes can’t move, how to recognize direction of departure –Exhaustive test on all directions is impractical

September 16,2003 MobiCom'03 University of Virginia 12 Departure Test Recognize directions of departure via neighbor exchange 1.Receiving Power Comparison ( the solution we adopt) 2.Smoothed Hop Distance Comparison ( Nagpal 1999 MIT) Experimental Result from Berkeley Experiment Result from UVA

September 16,2003 MobiCom'03 University of Virginia 13 A.P.I.T. Test Approximation: Test only directions towards neighbors –Error in individual test exists, however is relatively small and can be masked by APIT aggregation. APIT(A,B,C,M) = IN APIT(A,B,C,M) = OUT

September 16,2003 MobiCom'03 University of Virginia 14 APIT Aggregation Aggregation provides a good accuracy, even results by individual tests are coarse and error prone. With a density 10 nodes/circle, Average 92% A.P.I.T Test is correct Average 8% A.P.I.T Test is wrong Localization Simulation example Grid-Based Aggregation High Possibility area Low possibility area

September 16,2003 MobiCom'03 University of Virginia 15 Evaluation (1) Comparison with state-of-the art solutions –USC/ISI Centroid localization by N.Bulusu and J. Heidemann 2000 –Rutgers DV-Hop Localization by D.Niculescu and B. Nath 2003 –MIT Amorphous Localization by R. Nagpal 2003 Centroid DV-Hop (online)/ Amorphous (offline)

September 16,2003 MobiCom'03 University of Virginia 16 Evaluation (2) Radio Model: Continuous Radio Variation Model. –Degree of Irregularity (DOI ) is defined as maximum radio range variation per unit degree change in the direction of radio propagation DOI =0 DOI = 0.05 DOI = 0.2 α

September 16,2003 MobiCom'03 University of Virginia 17 Simulation Setup Setup –1000 by 1000m area –2000 ~ 4000 nodes ( random or uniform placement ) –10 to 30 anchors ( random or uniform placement ) –Node density: 6 ~ 20 node/ radio range –Anchor percentage 0.5~2% –90% confidence intervals are within in 5~10% of the mean Metrics –Localization Estimation Error ( normalized to units of radio range) –Communication Overhead in terms of #message

September 16,2003 MobiCom'03 University of Virginia 18 Error Reduction by Increasing #Anchors AH=10~28,ND = 8, ANR = 10, DOI = 0 Placement = UniformPlacement = Random

September 16,2003 MobiCom'03 University of Virginia 19 Error Reduction by Increasing Node Density AH=16, Uniform, AP = 0.6%~2%, ANR = 10 DOI=0.1DOI=0.2

September 16,2003 MobiCom'03 University of Virginia 20 Error Under Varying DOI ND = 8, AH=16, AP = 2%, ANR = 10 Placement = UniformPlacement = Random

September 16,2003 MobiCom'03 University of Virginia 21 Communication Overhead Centroid and APIT –Long beacons DV-Hop and Amorphous –Short beacons Assume: 1 long beacon = Range 2  short beacons = 100 short beacons APIT > Centroid –Neighborhood information exchange DV-Hop > Amorphous –Online HopSize estimation ANR=10, AH = 16, DOI = 0.1, Uniform

September 16,2003 MobiCom'03 University of Virginia 22 Performance Summary CentroidDV-HopAmorphousAPIT Accuracy FairGood Node Density >0>8 >6 Anchor >10>8 >10 ANR >0 >3 DOI Good FairGood GPSError Good FairGood Overhead SmallestLargestLargeSmall

September 16,2003 MobiCom'03 University of Virginia 23 Hermes UVA NEST Demo EnviroTrack Real-Time Routing QoS Scheduling Data Aggregation Lazy Binding MAC Sensing Coverage APIT Localization Mote Test Bed

September 16,2003 MobiCom'03 University of Virginia 24 Conclusions Range-free schemes are cost-effective solutions for large scale sensor networks. Through a robust aggregation, APIT performs best with irregular radio patterns and random node placements APIT performs well with a low communication overhead( e.g instead of 25,000 msgs)

September 16,2003 MobiCom'03 University of Virginia 25 Questions? Thanks

September 16,2003 MobiCom'03 University of Virginia 26 Error Case Since the number of neighbors is limited, an exhaustive test on every direction is impossible. – InToOut Error can happen when M is near the edge of the triangle –OutToIn Error can happen with irregular placement of neighbors PIT = IN while APIT = OUT PIT = OUT while APIT = IN

September 16,2003 MobiCom'03 University of Virginia 27 Empirical Study on APIT Approximation Percentage of error due to APIT approximation is relatively small (e.g. 14% in the worst case, 8% when density is 10) More important, Errors can be masked by APIT aggregation. APIT Error under Varying Node Densities