Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning

  • Authors:
  • Regina Bischoff;Rogert Wattenhofer

  • Affiliations:
  • -;-

  • Venue:
  • PERCOM '04 Proceedings of the Second IEEE International Conference on Pervasive Computing and Communications (PerCom'04)
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

We investigate the theoretical limits of positioning algorithms.In particular, we study scenarios where the nodes donot receive anchors directly (multi-hop) and where no physicaldistance or angle information whatsoever is available(connectivity-based). Since we envision large-scale sensornetworks as an application, we are interested in fast, distributedalgorithms. As such, we show that plain hop algorithmsare not competitive. Instead, for one-dimensionalunit disk graphs we present an optimal algorithm HS.Fortwo or more dimensions, we propose an algorithm GHoSTwhich improves upon the basic hop algorithm in theory andin simulations.