Sciweavers

Share
PERCOM
2004
ACM

Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning

10 years 11 months ago
Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physical distance or angle information whatsoever is available (connectivity-based). Since we envision large-scale sensor networks as an application, we are interested in fast, distributed algorithms. As such, we show that plain hop algorithms are not competitive. Instead, for one-dimensional unit disk graphs we present an optimal algorithm HS. For two or more dimensions, we propose an algorithm GHoST which improves upon the basic hop algorithm in theory and in simulations.
Regina Bischoff, Roger Wattenhofer
Added 24 Dec 2009
Updated 24 Dec 2009
Type Conference
Year 2004
Where PERCOM
Authors Regina Bischoff, Roger Wattenhofer
Comments (0)
books