Location-sensing using the IEEE 802.11 Infrastructure and the Peer-to-peer Paradigm for Mobile Computing Applications Anastasia Katranidou Supervisor:

Slides:



Advertisements
Similar presentations
Localization for Mobile Sensor Networks ACM MobiCom 2004 Lingxuan HuDavid Evans Department of Computer Science University of Virginia.
Advertisements

Dynamic Location Discovery in Ad-Hoc Networks
You are here Three Beacon Sensor Network Localization through Self Propagation Mohit Choudhary Under Guidance of: Dr. Bhaskaran Raman.
Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
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.
Advanced Wireless Sensor Network Bakii S Juma ID.:
Madhavi W. SubbaraoWCTG - NIST Dynamic Power-Conscious Routing for Mobile Ad-Hoc Networks Madhavi W. Subbarao Wireless Communications Technology Group.
A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks Slides by Alex Papadimitriou.
1 Empirical-based Analysis of a Cooperative Location-Sensing System 1 Institute of Computer Science, Foundation for Research & Technology-Hellas (FORTH)
RADAR: An In-Building RF-based User Location and Tracking System Paramvir Bahl and Venkata N. Padmanabhan Microsoft Research.
1 Lecture on Positioning Prof. Maria Papadopouli University of Crete ICS-FORTH
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 16th Lecture Christian Schindelhauer.
INSS 2009 June, 18 th 2009 Pittsburgh, USA Marcelo Martins, Hongyang Chen and Kaoru Sezaki University of Tokyo, Japan OTMCL: Orientation Tracking-based.
CMPE 257 Spring CMPE 257: Wireless and Mobile Networking Spring 2005 Location management.
Location Systems for Ubiquitous Computing Jeffrey Hightower and Gaetano Borriello.
 Idit Keidar, Technion Intel Academic Seminars, February Octopus A Fault-Tolerant and Efficient Ad-hoc Routing Protocol Idit Keidar, Technion Joint.
Novel Self-Configurable Positioning Technique for Multihop Wireless Networks Authors : Hongyi Wu Chong Wang Nian-Feng Tzeng IEEE/ACM TRANSACTIONS ON NETWORKING,
Dynamic Localization Control for Mobile Sensor Networks S. Tilak, V. Kolar, N. Abu-Ghazaleh, K. Kang (Computer Science Department, SUNY Binghamton)
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.
Jana van Greunen - 228a1 Analysis of Localization Algorithms for Sensor Networks Jana van Greunen.
A Cross Layer Approach for Power Heterogeneous Ad hoc Networks Vasudev Shah and Srikanth Krishnamurthy ICDCS 2005.
UNIVERSITY of CRETE Fall04 – HY436: Mobile Computing and Wireless Networks Location Sensing Overview Lecture 8 Maria Papadopouli
RADAR: An In-Building RF-Based User Location and Tracking system Paramvir Bahl and Venkata N. Padmanabhan Microsoft Research Presented by: Ritu Kothari.
Location-sensing using the IEEE Infrastructure and the Peer-to-peer Paradigm for mobile computing applications Anastasia Katranidou Supervisor:
BluEyes Bluetooth Localization and Tracking Ei Darli Aung Jonathan Yang Dae-Ki Cho Mario Gerla Ei Darli Aung Jonathan Yang Dae-Ki Cho Mario Gerla.
ENERGY EFFICIENT INDOOR LOCALIZATION IN WIRELESS SENSOR NETWORKS
Hamida SEBA - ICPS06 June 26 th -29 th Lyon France 1 ARMP: an Adaptive Routing Protocol for MANETs Hamida SEBA PRISMa Lab. – G2Ap team
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.
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
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.
Presenter Ho-lin Chang. Introduction Design Implementation Evaluation Conclusion and future Work 2.
A Distributed Clustering Framework for MANETS Mohit Garg, IIT Bombay RK Shyamasundar School of Tech. & Computer Science Tata Institute of Fundamental Research.
Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors Weikuan Yu Dept. of Computer and Info. Sci. The Ohio State University.
Location Estimation in Ad-Hoc Networks with Directional Antennas N. Malhotra M. Krasniewski C. Yang S. Bagchi W. Chappell 5th IEEE International Conference.
1 Robust Statistical Methods for Securing Wireless Localization in Sensor Networks (IPSN ’05) Zang Li, Wade Trappe Yanyong Zhang, Badri Nath Rutgers University.
A study of Intelligent Adaptive beaconing approaches on VANET Proposal Presentation Chayanin Thaina Advisor : Dr.Kultida Rojviboonchai.
September 16,2003 MobiCom'03 University of Virginia 1 Range-Free Localization Schemes in Large Scale Sensor Networks Tian He Chengdu Huang Brian.
A New Hybrid Wireless Sensor Network Localization System Ahmed A. Ahmed, Hongchi Shi, and Yi Shang Department of Computer Science University of Missouri-Columbia.
RADAR: an In-building RF-based user location and tracking system
Differential Ad Hoc Positioning Systems Presented By: Ramesh Tumati Feb 18, 2004.
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)
11/25/2015 Wireless Sensor Networks COE 499 Localization Tarek Sheltami KFUPM CCSE COE 1.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
Positioning in Ad-Hoc Networks - A Problem Statement Jan Beutel Computer Engineering and Networks Lab Swiss Federal Institute of Technology (ETH) Zurich.
Location Directory Services Vivek Sharma 9/26/2001 CS851: Large Scale Deeply Embedded Networks.
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.
C. Savarese, J. Beutel, J. Rabaey; UC BerkeleyICASSP Locationing in Distributed Ad-hoc Wireless Sensor Networks Chris Savarese, Jan Beutel, Jan Rabaey.
An Efficient Localization Algorithm Focusing on Stop-and-Go Behavior of Mobile Nodes IEEE PerCom 2011 Takamasa Higuchi, Sae Fujii, Hirozumi Yamaguchi and.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
Location System for Ubiquitous Computing Jeffrey Hightower Gaetano Borriello University of Washington.
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)
Cooperative Location-Sensing for Wireless Networks Charalampos Fretzagias and Maria Papadopouli Department of Computer Science University of North Carolina.
Secure positioning in Wireless Networks Srdjan Capkun, Jean-Pierre Hubaux IEEE Journal on Selected area in Communication Jeon, Seung.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Presented by Barath Raghavan.
Copyright © 2002 OPNET Technologies, Inc. 1 Random Waypoint Mobility Model Empirical Analysis of the Mobility Factor for the Random Waypoint Model 1542.
Nov. 29, 2006GLOBECOM /17 A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks Stephen S. Yau, Wei Gao, and Dazhi.
Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors
Presented by Prashant Duhoon
Indoor Location Estimation Using Multiple Wireless Technologies
Wireless Mesh Networks
A schematic overview of localization in wireless sensor networks
RFID Object Localization
RADAR: An In-Building RF-based User Location and Tracking System
Presentation transcript:

Location-sensing using the IEEE Infrastructure and the Peer-to-peer Paradigm for Mobile Computing Applications Anastasia Katranidou Supervisor: Maria Papadopouli Master Thesis, University of Crete & FORTH-ICS, Hellas 20 February 2006

Master Thesis, University of Crete & FORTH-ICS, Hellas 2 Overview Location-sensing Motivation Proposed system - CLS Evaluation of CLS Conclusions Future work

Master Thesis, University of Crete & FORTH-ICS, Hellas 3 Pervasive computing century Pervasive computing  enhances computer use by making many computers available throughout the physical environment but effectively invisible to the user

Master Thesis, University of Crete & FORTH-ICS, Hellas 4 Why is location-sensing important ? Navigation systems Locating people & objects Wireless routing Smart spaces Supporting location-based applications  transportation industry  medical community  security  entertainment industry  emergency situations

Master Thesis, University of Crete & FORTH-ICS, Hellas 5 Location-sensing properties Metric (signal strength, AoA, ToA, TDoA) Techniques (triangulation, proximity, scene analysis) Multiple modalities (RF, ultrasound, infrared) Limitations & dependencies (e.g., infrastructure vs. ad-hoc) Localized or remote computation Physical vs. symbolic location Absolute vs. relative location Scalability Cost Specialized hardware Privacy

Master Thesis, University of Crete & FORTH-ICS, Hellas 6 Related work GPS satellite localization, absolute, outdoors Active Badge infrared, symbol, absolute, special hardware APS with AoA RF, ultrasound, physical, relative, special hardware Cricket ultrasound, RF from IEEE Savarese et al. ad-hoc networks RADAR IEEE infrastructure, physical absolute, triangulation Ladd et al. IEEE infrastructure, physical, relative

Master Thesis, University of Crete & FORTH-ICS, Hellas 7 Motivation Build a location-sensing system for mobile computing applications that can provide position estimates:  using the available communication infrastructure  within a few meters accuracy  without the need of specialized hardware and extensive training  operating on indoors and outdoors environments Use  peer-to-peer paradigm  knowledge of the environment and mobility

Master Thesis, University of Crete & FORTH-ICS, Hellas 8 Design goals Robust to tolerate network failures, disconnections, delays due to host mobility Extensible to incorporate application-dependent semantics or external information (e.g., floorplan, signal strength map) Computationally inexpensive Scalable Use of cooperation of the devices and information sharing No need for extensive training and specialized hardware Suitable for indoor and outdoor environments

Master Thesis, University of Crete & FORTH-ICS, Hellas 9 Thesis Implementation of the Cooperative Location System (CLS) Extension of the CLS design  signal strength map  information about the environment (e.g., floorplan)  heuristics based on confidence intervals Extensive performance analysis  range error  density of hosts  mobility Empirical study of the range error in FORTH-ICS

Master Thesis, University of Crete & FORTH-ICS, Hellas 10 Cooperative Location System (CLS) Communication Protocol  Each host estimates its distance from neighboring peers refines its estimations iteratively as it receives new positioning information from peers Voting algorithm  accumulates and evaluates the received positioning information Grid-representation of the terrain

Master Thesis, University of Crete & FORTH-ICS, Hellas 11 CLS beacon  neighbor discovery protocol with single-hop broadcast beacons  respond to beacons with positioning information (positioning entry & SS) CLS entry  set of information (positioning entry & distance estimation) that a host maintains for a neighboring host CLS update messages  dissemination of CLS entries CLS table  all the received CLS entries Peer idPositionTimeRangeWeightDistanceVote A(x A,y A )tntn RARA wAwA (d u,A - e, d u,A + e)Positive C(x C,y C )tktk RCRC wCwC (R C,  )Negative CLS table of host u Positioning entry Distance estimation CLS entries Communication protocol

Master Thesis, University of Crete & FORTH-ICS, Hellas 12 Voting algorithm Grid for host u (unknown position)  Corresponds to the terrain  Peer A has positioned itself  Positive votes from peer A The value of a cell = sum of the accumulated votes The higher the value of a cell, the more hosts agree that this cell is likely position of the host  Peer B has positioned itself  Positive votes from peer B  Negative vote from peer C

Master Thesis, University of Crete & FORTH-ICS, Hellas 13 Voting algorithm termination Set of cells with maximal values defines possible position A cell is a possible position If the num of votes in a cell is above ST and the num of cells with max value below LECT  terminate the iteration process  report the centroid of the set as the host position u

Master Thesis, University of Crete & FORTH-ICS, Hellas 14 Evaluation of CLS Impact of several parameters on the accuracy  ST and LECT thresholds  range error  density of hosts and landmarks Simulation testbed  100x100 square units in size  Randomly placed nodes (10 landmarks + 90 nodes) in the terrain  Location & range errors as % of the transmission range (R=20 m)

Master Thesis, University of Crete & FORTH-ICS, Hellas 15 Impact of range error  avg connectivity degree = 10  avg connectivity degree = 12

Master Thesis, University of Crete & FORTH-ICS, Hellas 16 Impact of connectivity degree & percentage of landmarks For low connectivity degree or few landmarks  the location error is bad For 10% or more landmarks and connectivity degree of at least 7  the location error is reduced considerably 5% range error

Master Thesis, University of Crete & FORTH-ICS, Hellas 17 Extension of CLS Incorporation of:  signal strength map  information about the environment (e.g., floorplan)  confidence intervals  topological information  pedestrian speed

Master Thesis, University of Crete & FORTH-ICS, Hellas 18 Signal strength map Training phase:  each cell & every AP  60 measured SS values  1 signal strength (SS) value / sec  95% - confidence intervals Estimation phase :  SS measurements in 45 cells  if LB i [c] ≤ ŝ i ≤ UB i [c] cell c accumulates vote from APi  final position: centroid of cells with maximal values

Master Thesis, University of Crete & FORTH-ICS, Hellas 19 CLS with signal strength map 95% - confidence intervals  no CLS : 80% hosts ≤ 2 m  extended CLS : 80% hosts ≤ 1 m

Master Thesis, University of Crete & FORTH-ICS, Hellas 20 Impact of mobility Movement paths Speed Frequency of CLS runs Simulation setting  10 landmarks, 10 mobile and 80 stationary nodes  transmission range (R) = 20 m  range error = 10% R

Master Thesis, University of Crete & FORTH-ICS, Hellas 21 Impact of movement paths Simulation setting  10 different scenarios  max speed = 2 m/s  time= 100 sec Mean location error [%R] Simulation time (sec)

Master Thesis, University of Crete & FORTH-ICS, Hellas 22 Impact of the speed Simulation setting  6 times the same scenario  fixed initial and destination position of each node at each run  time = 100 sec Simulation time (sec) location error [%R]

Master Thesis, University of Crete & FORTH-ICS, Hellas 23 Impact of the frequency of CLS runs Simulation setting  6 times the same scenario  every 120, 60, 40, 30, 20 sec  CLS run = 1, 2, 3, 4, 6 times  speed = 2 m/s  time = 120 sec Tradeoff accuracy vs. overhead  message exchanges  computations Simulation time (sec) location error [%R]

Master Thesis, University of Crete & FORTH-ICS, Hellas 24 Evaluation of the extended CLS under mobility Incorporation of:  topological information  signal strength map  pedestrian speed Simulation setting  5 landmarks, 30 mobile and 15 stationary nodes  speed = 1m/s  R = 20 m  range error = 10% R  sim time = 120 sec  CLS every 10 sec

Master Thesis, University of Crete & FORTH-ICS, Hellas 25 Use of topological information mobile node cannot:  walk through walls  enter in some forbidden areas negative weights CLS under mobility:  80% of hosts ≤ 90% location error (%R) CLS & topological information :  80% of hosts ≤ 60% location error (%R)

Master Thesis, University of Crete & FORTH-ICS, Hellas 26 Use of signal strength map CLS & topological information & SS map :  80% of hosts ≤ 30% location error (%R)

Master Thesis, University of Crete & FORTH-ICS, Hellas 27 Use of the pedestrian speed pedestrian speed: 1 m/s  time instance t1 : at point X  after t sec : at any point of a disc centered at X with radius equal to t meters CLS & topological information & SS map & pedestrian speed :  80% of hosts ≤ 13% location error (%R )

Master Thesis, University of Crete & FORTH-ICS, Hellas 28 Estimation of Range Error in FORTH-ICS 50x50 cells, 5 APs For each cell we took 60 SS values 95% confidence intervals (CI) for each cell c and the respective APs i Range error i [c] = max{|d(i,c) - d(i,c’)|},  c' such that: CI i [c]∩CI i [c’] ≠ Ø 90% cells ≤ 4 meters range error (10% R) Maximum range error due to the topology ≤ 9.4 meters

Master Thesis, University of Crete & FORTH-ICS, Hellas 29 Conclusions Evaluation and extension of the CLS algorithm  80% of hosts ≤ 0.8 m  estimations from peers give better accuracy than SS measurements Evaluation of CLS under mobility  80% of hosts ≤ 2.6 m  great impact of frequency of CLS runs Comparison with related work  static RADAR: 80% ≤ 4.5 m  mobile RADAR: 80% ≤ 5 m

Master Thesis, University of Crete & FORTH-ICS, Hellas 30 Future work Incorporate heterogeneous devices (e.g, RF tags, sensors) to enhance the accuracy Employ theoretical framework (e.g., particle filters) to support the grid-based voting algorithm and mobility models Provide guidelines for tuning the weight votes of hosts Use more sophisticated radio propagation model

Master Thesis, University of Crete & FORTH-ICS, Hellas 31 Publications Under preparation for submission to the Mobile Computing and Communications Review (MC 2 R) journal

Location-sensing using the IEEE Infrastructure and the Peer-to-peer Paradigm for Mobile Computing Applications Anastasia Katranidou Supervisor: Maria Papadopouli Master Thesis, University of Crete & FORTH-ICS, Hellas 20 February 2006 THANK YOU!

Master Thesis, University of Crete & FORTH-ICS, Hellas 33 APPENDIX Appendix

Master Thesis, University of Crete & FORTH-ICS, Hellas 34 RADAR vs. CLS RADAR : 3 APs 90% hosts ≤ 6 m sampling density: 1 sample every 13.9 m 2 Extended static CLS: 5 APs 90% hosts ≤ 2 m sampling density: 1 sample every 14.8 m 2

Master Thesis, University of Crete & FORTH-ICS, Hellas 35 Ladd et al. vs. CLS Static localization Ladd et al.  9 APs  77% of hosts ≤ 1.5 m Extended static CLS  5 APs  77% of hosts ≤ 0.8 m Static fusion Ladd et al.  9 APs  64% of hosts ≤ 1 m Extended mobile CLS  5 APs  45% of hosts ≤ 1 m

Master Thesis, University of Crete & FORTH-ICS, Hellas 36 Savarese et al. vs. CLS Savarese et al. better with very small connectivity degree (4) or less than 5 landmarks Extended static CLS better with connectivity degree of at least 8 and 10% or more landmarks

Master Thesis, University of Crete & FORTH-ICS, Hellas 37 Impact of ST and LECT thresholds Terminate the iteration process  ST: the num of votes in a cell must be above it  LECT: the num of cells with max value must be below it LECT Host h defined solely from host g  not acceptable: the possible cells of host h correspond to a ring Host h defined from host g and k  1 case: not acceptable  2 case: location error max = √ [D max 2 – (D min + e) 2 ] Host h defined from host g, k and m  Possible area: (2· ε +1) 2  location error max : √ [(2· ε +1) 2 / 2] ST  eventually each host will receive votes from every landmark and every other host (CLS updates)  w all_landmarks +w all_hosts

Master Thesis, University of Crete & FORTH-ICS, Hellas 38 ST and LECT Simulation setting  10 landmarks and 90 nodes  avg connectivity degree = 10  range error = 10% R Best values  ST = 800  LECT = 5

Master Thesis, University of Crete & FORTH-ICS, Hellas 39 Interpolation methods Cubic interpolation Least squares Linear interpolation

Master Thesis, University of Crete & FORTH-ICS, Hellas 40 Impact of connectivity degree under mobility Simulation setting  5 landmarks  30 mobile nodes  15 stationary nodes Simulation setting  5 landmarks  5 mobile nodes  5 stationary nodes

Master Thesis, University of Crete & FORTH-ICS, Hellas 41 Grid size 100x100: reasonable choice

Master Thesis, University of Crete & FORTH-ICS, Hellas 42 Message exchanges

Master Thesis, University of Crete & FORTH-ICS, Hellas 43 Movement example Random waypoint model  Max speed  Pause time