DMCA
Distributed Localization in Wireless Sensor Networks: A Quantitative Comparison (2003)
Cached
Download Links
| Citations: | 302 - 7 self |
BibTeX
@MISC{Langendoen03distributedlocalization,
author = {Koen Langendoen and Niels Reijers},
title = {Distributed Localization in Wireless Sensor Networks: A Quantitative Comparison},
year = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper studies the problem of determining the node locations in ad-hoc sensor networks. We compare three distributed localization algorithms (Ad-hoc positioning, Robust positioning, and N-hop multilateration) on a single simulation platform. The algorithms share a common, three-phase structure: (1) determine node--anchor distances, (2) compute node positions, and (3) optionally refine the positions through an iterative procedure. We present a detailed analysis comparing the various alternatives for each phase, as well as a head-to-head comparison of the complete algorithms. The main conclusion is that no single algorithm performs best; which algorithm is to be preferred depends on the conditions (range errors, connectivity, anchor fraction, etc.). In each case, however, there is significant room for improving accuracy and/or increasing coverage.
Keyphrases
wireless sensor network quantitative comparison main conclusion node location significant room anchor fraction determine node anchor distance three-phase structure single algorithm performs single simulation platform algorithm share compute node position complete algorithm paper study robust positioning ad-hoc sensor network various alternative localization algorithm head-to-head comparison n-hop multilateration detailed analysis iterative procedure range error ad-hoc positioning
