Theoretical aspects of connectivity-based multi-hop positioning

Authors:
R. O'Dell;R. Wattenhofer
Affiliations:
ETZ, ETH Zentrum, Zürich, Switzerland and Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland;Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland
Venue:
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Year:
2005

Citing 16
Cited 6

Routing with guaranteed delivery in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors

Proceedings of the 7th annual international conference on Mobile computing and networking
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks

ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Localization from mere connectivity

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Worst-Case optimal and average-case efficient geometric ad-hoc routing

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
GPS-Free Positioning in Mobile ad-hoc Networks

HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Geometric ad-hoc routing: of theory and practice

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Range-free localization schemes for large scale sensor networks

Proceedings of the 9th annual international conference on Mobile computing and networking
Geographic routing without location information

Proceedings of the 9th annual international conference on Mobile computing and networking
Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems

Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems
Semidefinite programming for ad hoc wireless sensor network localization

Proceedings of the 3rd international symposium on Information processing in sensor networks
Error characteristics of ad hoc positioning systems (aps)

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Virtual coordinates for ad hoc and sensor networks

Proceedings of the 2004 joint workshop on Foundations of mobile computing
Unit disk graph approximation

Proceedings of the 2004 joint workshop on Foundations of mobile computing
Organizing a global coordinate system from local information on an ad hoc sensor network

IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks

Distributed localization using noisy distance and angle information

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Wireless localization using self-organizing maps

Proceedings of the 6th international conference on Information processing in sensor networks
Local solutions for global problems in wireless networks

Journal of Discrete Algorithms
Ad hoc networks beyond unit disk graphs

Wireless Networks
Sensor networks continue to puzzle: selected open problems

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
The minimum positional error incurred by any connectivity-based positioning algorithm for mobile wireless systems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.