Distributed localization in wireless sensor networks

Slides:



Advertisements
Similar presentations
Dynamic Location Discovery in Ad-Hoc Networks
Advertisements

Yang Yang, Miao Jin, Hongyi Wu Presenter: Buri Ban The Center for Advanced Computer Studies (CACS) University of Louisiana at Lafayette 3D Surface Localization.
Designing An g Ad-hoc Network for Multimedia Communication Chung-Wei Lee & Jonathan C.L. Liu Presented By: Mahendra Kumar.
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
Broadcasting Protocol for an Amorphous Computer Lukáš Petrů MFF UK, Prague Jiří Wiedermann ICS AS CR.
Applications and communication patterns for WSN N. Reijers Consensus day TU Delft February 7, 2003.
Madhavi W. SubbaraoWCTG - NIST Dynamic Power-Conscious Routing for Mobile Ad-Hoc Networks Madhavi W. Subbarao Wireless Communications Technology Group.
Prepared By: Kopila Sharma  Enables communication between two or more system.  Uses standard network protocols for communication.  Do.
CS 546: Intelligent Embedded Systems Gaurav S. Sukhatme Robotic Embedded Systems Lab Center for Robotics and Embedded Systems Computer Science Department.
Localization from Mere Connectivity Yi Shang (University of Missouri - Columbia); Wheeler Ruml (Palo Alto Research Center ); Ying Zhang; Markus Fromherz.
1 Target Tracking with Sensor Networks Chao Gui Networks Lab. Seminar Oct 3, 2003.
Speaker: Li-Sheng Chen 1 Jan 2, 2012 EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing Protocol for Wireless Ad Hoc Networks.
GPS-free Positioning in Ad-Hoc Networks Yu-Min Tseng.
1 Localization Technologies for Sensor Networks Craig Gotsman, Technion/Harvard Collaboration with: Yehuda Koren, AT&T Labs.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 17th Lecture Christian Schindelhauer.
Intrusion Detection in Wireless Sensor Networks Group Meeting Spring 2005 Presented by Edith Ngai.
TPS: A Time-Based Positioning Scheme for outdoor Wireless Sensor Networks Authors: Xiuzhen Cheng, Andrew Thaeler, Guoliang Xue, Dechang Chen From IEEE.
Ad-Hoc Localization Using Ranging and Sectoring Krishna Kant Chintalapudi, Amit Dhariwal, Ramesh Govindan, Gaurav Sukhatme Computer Science Department,
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.
Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:
DCL Concepts STL Concepts ContainerIteratorAlgorithmFunctorAdaptor What New Concepts are Needed for a “DCL”? (Distributed Computing Library) Distributed.
August 6, Mobile Computing COE 446 Network Planning Tarek Sheltami KFUPM CCSE COE Principles of.
Locating Sensors in the Forest: A Case Study in GreenOrbs Tsung-Yun Cheng
Speed and Direction Prediction- based localization for Mobile Wireless Sensor Networks Imane BENKHELIFA and Samira MOUSSAOUI Computer Science Department.
ENERGY EFFICIENT INDOOR LOCALIZATION IN WIRELESS SENSOR NETWORKS
CS2510 Fault Tolerance and Privacy in Wireless Sensor Networks partially based on presentation by Sameh Gobriel.
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
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.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.
Introduction to Sensor Networks Rabie A. Ramadan, PhD Cairo University 3.
Localization With Mobile Anchor Points in Wireless Sensor Networks
Localization in Wireless Sensor Networks Shafagh Alikhani ELG 7178 Fall 2008.
2015/10/1 A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks Tai-Jung Chang, Kuochen Wang, Yi-Ling Hsieh Department.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Scalable and Fully Distributed Localization With Mere Connectivity.
Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors Weikuan Yu Dept. of Computer and Info. Sci. The Ohio State University.
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
Positioning in Ad-Hoc Networks - Directions and Results Jan Beutel Computer Engineering and Networks Lab Swiss Federal Institute of Technology Zurich August.
Multi-hop-based Monte Carlo Localization for Mobile Sensor Networks
Algorithms for Wireless Sensor Networks Marcela Boboila, George Iordache Computer Science Department Stony Brook University.
1 Robust Statistical Methods for Securing Wireless Localization in Sensor Networks (IPSN ’05) Zang Li, Wade Trappe Yanyong Zhang, Badri Nath Rutgers University.
A Novel Mechanism for Flooding Based Route Discovery in Ad Hoc Networks Jian Li and Prasant Mohapatra GlobeCom’03 Speaker ︰ CHUN-WEI.
Relative Accuracy based Location Estimation in Wireless Ad Hoc Sensor Networks May Wong 1 Demet Aksoy 2 1 Intel, Inc. 2 University of California, Davis.
A new Ad Hoc Positioning System 컴퓨터 공학과 오영준.
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.
Differential Ad Hoc Positioning Systems Presented By: Ramesh Tumati Feb 18, 2004.
Ad Hoc Positioning System (APS)
G. Giorgetti, ACM MSWiM 2008 – Vancouver - October 28, $ 70 $ 115 $ 185 $ Optimal RSS Threshold in Connectivity-Based Localization Schemes Gianni.
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.
Webdust PI: Badri Nath SensIT PI Meeting January 15,16, Co-PIs: Tomasz Imielinski,
C. Savarese, J. Beutel, J. Rabaey; UC BerkeleyICASSP Locationing in Distributed Ad-hoc Wireless Sensor Networks Chris Savarese, Jan Beutel, Jan Rabaey.
By: Gang Zhou Computer Science Department University of Virginia 1 Medians and Beyond: New Aggregation Techniques for Sensor Networks CS851 Seminar Presentation.
UNIT IV INFRASTRUCTURE ESTABLISHMENT. INTRODUCTION When a sensor network is first activated, various tasks must be performed to establish the necessary.
Selection and Navigation of Mobile Sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
Density-Aware Hop-Count Localization (DHL) in Wireless Sensor Networks with Variable Density Sau Yee Wong 1,2, Joo Chee Lim 1, SV Rao 1, Winston KG Seah.
The (k, l) Coredian Tree for Ad-Hoc Networks Department of Communication Systems Engineering, Ben-Gurion University of the Negev, 2008 Vladimir Katz Alex.
- Pritam Kumat - TE(2) 1.  Introduction  Architecture  Routing Techniques  Node Components  Hardware Specification  Application 2.
Computing and Compressive Sensing in Wireless Sensor Networks
Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors
Presented by Prashant Duhoon
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Localization in WSN Localization in WSN.
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.
Wireless Mesh Networks
Presentation transcript:

Distributed localization in wireless sensor networks The embedded Ubicom system 30 may 2002 Distributed localization in wireless sensor networks Koen Langendoen Niels Reijers Delft University of Technology The Netherlands

The embedded Ubicom system 30 may 2002 Technology trend Small integrated devices Smaller, cheaper, more powerful PDAs, mobile phones Many opportunities, and research areas Power management Distributed algorithms

Wireless sensor networks The embedded Ubicom system 30 may 2002 Wireless sensor networks Wireless sensor node power supply sensors embedded processor wireless link Many, cheap sensors wireless  easy to install intelligent  collaboration low-power  long lifetime

Possible applications The embedded Ubicom system 30 may 2002 Possible applications Fire rescue breadcrumbs exit path hazard detection Environmental monitoring detecting forest fires Monitoring bulk goods (potatoes) mix sensors with goods temperature, humidity

Required technologies The embedded Ubicom system 30 may 2002 Required technologies Efficient data routing ad-hoc network one or more ‘datasinks’ In-network data processing large amounts of raw data limited power and bandwidth Node localization

The embedded Ubicom system 30 may 2002 Ad-hoc localization Many nodes (> 100) NO infrastructure NO central processing Sparse anchor nodes known position Other nodes determine position using this data Distance measurement

The embedded Ubicom system 30 may 2002 Ad-hoc localization 2D, static node positions Several different algorithms have been proposed 3 will be compared Simulations on DAS2 supercomputer

The embedded Ubicom system 30 may 2002 Main result no ‘one size fits all’ Best algorithm depends on: error in range measurement (range variance) connectivity (number of neighbours) network topology node capabilities application requirements

The embedded Ubicom system 30 may 2002 Three-phase approach Determine distance to anchor nodes (communication) Establish position estimates (computation) Iteratively refine positions using additional range measurements (both)

Phase 1: Distance to anchor The embedded Ubicom system 30 may 2002 Phase 1: Distance to anchor Three algorithms Sum-dist [Savvides et al.] DV-Hop [Niculescu et al., Savarese et al.] Euclidean [Niculescu et al.] anchors flood network with their known position

The embedded Ubicom system 30 may 2002 Phase 1: Sum-dist Anchors flood network with known position Nodes add hop distances require range measurement B B: 6+4 = 10 6 4 C: 5+6+4 = 15 6 5 C A: 5 5 A

The embedded Ubicom system 30 may 2002 Phase 1: DV-hop Anchors flood network with known position flood network with avg hop distance Nodes count #hops to anchors multiply with avg hop distance A-B: 12 3 hops B avg hop: 4 3 2 4 1 C A

The embedded Ubicom system 30 may 2002 Phase 1: Euclidean Anchors flood network with known position Nodes determine distance by range measurement geometric calculation require range measurement B C A

The embedded Ubicom system 30 may 2002 Phase 1: Euclidean (2) Wanted: Distance A-G D G E Using AEGF: A-G = 8 ...or 3 F Using AEGD: A-G = 8 ...or 0.5 A A-G = 8

The embedded Ubicom system 30 may 2002 Phase 1: Euclidean (3) Needs high connectivity Error prone (selecting wrong distance) Perfect accuracy possible B D G E C F A

The embedded Ubicom system 30 may 2002 Phase 1: Comparison Range measurement Very accurate: Euclidean Reasonable: Sum-dist None / very bad: DV-hop

Phase 2: Determining position The embedded Ubicom system 30 may 2002 Phase 2: Determining position Two algorithms: Lateration very common local triangulation solve [Ax=b] Min-max [Savvides et al.] B C A

The embedded Ubicom system 30 may 2002 Phase 2: Min-max Using range to anchors to determine a bounding box Use center of box as position estimate B C A

Comparison: distance error The embedded Ubicom system 30 may 2002 Comparison: distance error

Comparison: distance bias The embedded Ubicom system 30 may 2002 Comparison: distance bias

The embedded Ubicom system 30 may 2002 A problem with Min-max Very sensitive to anchor placement

The embedded Ubicom system 30 may 2002 Phase 1 + 2 combined

The embedded Ubicom system 30 may 2002 Phase 1 + 2 combined Euclidean: very sensitive to both range variance and connectivity

The embedded Ubicom system 30 may 2002 Error and coverage There is a tradeoff between coverage and error

The embedded Ubicom system 30 may 2002 Matrix Radio range (connectivity) 16 (15.3) 14 (12.0) 12 (8.8) 10 (6.4) 8 (4.1) Range variance Eucl Lat Sum-d MM DV-hop 0.025 0.05 0.1 0.25 0.5 Radio range (connectivity) 16 (15.3) 14 (12.0) 12 (8.8) 10 (6.4) 8 (4.1) Range variance Eucl Lat Sum-d MM DV-hop 0.025 0.05 0.1 0.25 0.5 Radio range (connectivity) 16 (15.3) 14 (12.0) 12 (8.8) 10 (6.4) 8 (4.1) Range variance Eucl Lat Sum-d MM DV-hop 0.025 0.05 0.1 0.25 0.5 Radio range (connectivity) 16 (15.3) 14 (12.0) 12 (8.8) 10 (6.4) 8 (4.1) Range variance Eucl Lat Sum-d MM DV-hop 0.025 0.05 0.1 0.25 0.5 Radio range (connectivity) 16 (15.3) 14 (12.0) 12 (8.8) 10 (6.4) 8 (4.1) Range variance Eucl Lat Sum-d MM DV-hop 0.025 0.05 0.1 0.25 0.5 Radio range (connectivity) 16 (15.3) 14 (12.0) 12 (8.8) 10 (6.4) 8 (4.1) Range variance Eucl Lat Sum-d MM DV-hop 0.025 0.05 0.1 0.25 0.5

The embedded Ubicom system 30 may 2002 Phases 1 and 2 Position error usually 30% of the radio range or higher Range measurements between nodes only used to determine anchor distance Can we do better?

Phase 3: Iterative refinement The embedded Ubicom system 30 may 2002 Phase 3: Iterative refinement obtain initial position (phases 1 and 2) broadcast my position iteratively refine position using: ranges to direct neighbours their initial positions

Phase 3: Iterative refinement The embedded Ubicom system 30 may 2002 Phase 3: Iterative refinement Initial estimate Receive neighbour positions Broadcast new position Local lateration A

The embedded Ubicom system 30 may 2002 Phase 3: Position error

The embedded Ubicom system 30 may 2002 Phase 3: Coverage

The embedded Ubicom system 30 may 2002 Conclusion No ‘one size fits all’ Refinement needs better coverage to be useful Lots of room for improvement in all phases Details in Tech Report PDS-2002-03 (http://pds.twi.tudelft.nl/reports/2002/PDS-2002-003)

The embedded Ubicom system 30 may 2002 What is wrong? Bad topology identical hop-TERRAIN positions twins Error propagation rapid infection of complete network – hop – triangulate – hop – triangulate –

The embedded Ubicom system 30 may 2002 Confidence weights Weight input for triangulation (wAx = wb) Initialization anchors 1.0 twins, identical hops 0 others 0.1 Triangulation large residue 0 small residue avg of input confidences