Positioning in Ad-Hoc Networks - Directions and Results Jan Beutel Computer Engineering and Networks Lab Swiss Federal Institute of Technology Zurich August.

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.

Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.

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.

1st Meeting Industrial Geometry Computational Geometry ---- Some Basic Structures 1st IG-Meeting.

Jan 15, 2004MobiLoc1 MobiLoc: Mobility Enhanced Localization Prabal Dutta Sarah Bergbreiter.

Luca De Nardis Ranging and positioning in UWB adhoc networks Problem definition.

Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:

Localization from Mere Connectivity Yi Shang (University of Missouri - Columbia); Wheeler Ruml (Palo Alto Research Center ); Ying Zhang; Markus Fromherz.

1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 16th Lecture Christian Schindelhauer.

SANS A Simple Ad hoc Network Simulator Nicolas Burri Roger Wattenhofer Yves Weber Aaron Zollinger.

Introduction to Location Discovery Lecture 4 September 14, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor Networks Andreas Savvides.

Speaker: Li-Sheng Chen 1 Jan 2, 2012 EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing Protocol for Wireless Ad Hoc Networks.

Lost in Space or Positioning in Sensor Networks Michael O’Dell Regina O’Dell Mirjam Wattenhofer Roger Wattenhofer.

Distributed localization in wireless sensor networks

GPS-free Positioning in Ad-Hoc Networks Yu-Min Tseng.

1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 17th Lecture Christian Schindelhauer.

1 Spatial Localization Light-Seminar Spring 2005.

Ad-Hoc Localization Using Ranging and Sectoring Krishna Kant Chintalapudi, Amit Dhariwal, Ramesh Govindan, Gaurav Sukhatme Computer Science Department,

Jana van Greunen - 228a1 Analysis of Localization Algorithms for Sensor Networks Jana van Greunen.

1 University of Denver Department of Mathematics Department of Computer Science.

Scalable and Distributed GPS free Positioning for Sensor Networks Rajagopal Iyengar and Biplab Sikdar Department of ECSE, Rensselaer Polytechnic Institute.

Sensor Positioning in Wireless Ad-hoc Sensor Networks Using Multidimensional Scaling Xiang Ji and Hongyuan Zha Dept. of Computer Science and Engineering,

A Framework for Energy- Saving Data Gathering Using Two-Phase Clustering in Wireless Sensor Networks Wook Chio, Prateek Shah, and Sajal K. Das Center for.

Architectures and Applications for Wireless Sensor Networks ( ) Localization Chaiporn Jaikaeo Department of Computer Engineering.

Scalable and Fully Distributed Localization With Mere Connectivity.

Tessellations Sets of connected discrete two-dimensional units -can be irregular or regular –regular (infinitely) repeatable patter of regular polygon.

1 Robust Statistical Methods for Securing Wireless Localization in Sensor Networks (IPSN ’05) Zang Li, Wade Trappe Yanyong Zhang, Badri Nath Rutgers University.

Claudinei Rodrigues de Aguiar Federal University of Technology - Parana Paulo de Oliveira Camargo São Paulo State University.

College of Engineering Grid-based Coordinated Routing in Wireless Sensor Networks Uttara Sawant Major Advisor : Dr. Robert Akl Department of Computer Science.

A New Hybrid Wireless Sensor Network Localization System Ahmed A. Ahmed, Hongchi Shi, and Yi Shang Department of Computer Science University of Missouri-Columbia.

Neural Networks - Lecture 81 Unsupervised competitive learning Particularities of unsupervised learning Data clustering Neural networks for clustering.

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)

Akram Bitar and Larry Manevitz Department of Computer Science

Teaching Assistant Demonstrator - Contribution - Jan Beutel, Michael Eisenring, Marco Platzner, Christian Plessl, Lothar Thiele Computer Engineering and.

Localization and Secure Localization. Learning Objectives Understand why WSNs need localization protocols Understand localization protocols in WSNs Understand.

Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.

Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION The Minimum Variance Estimate ASEN 5070 LECTURE.

Positioning in Ad-Hoc Networks - A Problem Statement Jan Beutel Computer Engineering and Networks Lab Swiss Federal Institute of Technology (ETH) Zurich.

A Systematic Approach to the Design of Distributed Wearable Systems Urs Anliker, Jan Beutel, Matthias Dyer, Rolf Enzler, Paul Lukowicz Computer Engineering.

V. A. GRISHIN Federal State Unitary Enterprise Scientific Industrial Center of Automation and Instrument Engineering Space Research Institute - Russian.

Model-Centric Smart Grid for Big Data

University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.

Wireless Communication Technologies Group 3/20/02CISS 2002, Princeton 1 Distributional Properties of Inhibited Random Positions of Mobile Radio Terminals.

Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.

Universität Stuttgart Institute of Parallel and Distributed Systems (IPVS) Universitätsstraße 38 D Stuttgart Voronoi Overlay Networks Pavel Skvortsov.

Cooperative Location- Sensing for Wireless Networks Authors ： Haris Fretzagias Maria Papadopouli Presented by cychen IEEE International Conference on Pervasive.

C. Savarese, J. Beutel, J. Rabaey; UC BerkeleyICASSP Locationing in Distributed Ad-hoc Wireless Sensor Networks Chris Savarese, Jan Beutel, Jan Rabaey.

6.4 Global Positioning of Nodes Advanced Operating Systems Ruizhe Ma September 28, 2015.

How to tell the differences between a Cat and a Dog Masoud Alipour Ali Farhadi IPM – Scientific Computing Center Vision.

Communication for the Wearable Platform Jan Beutel Computer Engineering and Networks Lab Swiss Federal Institute of Technology (ETH) Zurich October 19,

Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Fall 2015 Ki-Joune Li Pusan.

Evolving RBF Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan Edgar Galvan.

Goals in Wearable Computing Jan Beutel, Michael Eisenring, Marco Platzner, Christian Plessl, Lothar Thiele Computer Engineering and Networks Lab Swiss.

1 On Improving Data Accessibility in Storage Based Sensor Networks Tan Apaydin, Serdar Vural and Prasun Sinha IEEE International Conference on Mobile Adhoc.

Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov, Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.

Localization for Anisotropic Sensor Networks

Presented by Prashant Duhoon

任課教授：陳朝鈞教授學生：王志嘉、馬敏修

Spatial interpolation

On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks High-Speed Networking Lab. Dept. of CSIE,

Wireless Mesh Networks

Redundant Ghost Nodes in Jacobi

Wireless Sensor Networks and Internet of Things

Solving Equations 3x+7 –7 13 –7 =.

Overview: Chapter 4 Infrastructure Establishment

Introduction to Location Discovery Lecture 4 September 14, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor Networks Andreas.

Akram Bitar and Larry Manevitz Department of Computer Science

Presentation transcript:

Positioning in Ad-Hoc Networks - Directions and Results Jan Beutel Computer Engineering and Networks Lab Swiss Federal Institute of Technology Zurich August 10, 2002 Computer Engineering and Networks Laboratory

2 ETH Zurich Jan Beutel, August 10, 2002 Ad-Hoc Network Scenarios Low power Small size Very large population No infrastructure necessary Varying population density Multihop environment Partitioning

3 ETH Zurich Jan Beutel, August 10, 2002 Positioning: The Problem Finding the position of networking nodes Relative vs. Absolute Positioning Mode Reference Positions, Map Database Other Networking Nodes, Distance and Geometric Topology

4 ETH Zurich Jan Beutel, August 10, 2002 RSSI Samples Over Distance - Free Space b Bluetooth

5 ETH Zurich Jan Beutel, August 10, 2002 Redundant Triangulation Every node executes Identification of neighbors Establishing range estimates Maintaining a set of a minimum of 3 linear equations to the neighbors Solve for MMSE Dissemination of data over the network

6 ETH Zurich Jan Beutel, August 10, 2002 Redundant Triangulation and Filtering Average over 25 individual triangulations with 50% range error Delaunay Mesh of 25 Networked Nodes x Solution on 25 Ranges and 50% Error x Solutions and Mean x Zoom on Error x dx dy % position error

7 ETH Zurich Jan Beutel, August 10, 2002 Influence of Range Quantization

8 ETH Zurich Jan Beutel, August 10, 2002 Very Large Errors and Topology 3 anchors ~ 94% 4 anchors ~ 6% 5 anchors >1%

9 ETH Zurich Jan Beutel, August 10, 2002 Influence of Border Regions Center I Edge II Corner III

10 ETH Zurich Jan Beutel, August 10, 2002 Influence of Border Regions

11 ETH Zurich Jan Beutel, August 10, 2002 Ad-hoc Network Simulation Environment

12 ETH Zurich Jan Beutel, August 10, 2002 The TERRAIN Algorithm. Triangulation via Extended Range and Redundant Association of Intermediate Nodes Algorithm creates local maps Every node waits to be included in  3 maps Extended ranges calculated from respective maps Triangulation node based on extended ranges Network-wide iterations radio range extended range intermediate node