|
USENIX 2002 Annual Conference - Technical Program Abstract
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
Chris Savarese,
Jan Rabaey,
Berkeley Wireless Research Center;
Koen Langendoen, Faculty of Information Technology and Systems
Abstract
A distributed algorithm for determining the positions of nodes in
an ad-hoc, wireless sensor network is explained in detail. Details
regarding the implementation of such an algorithm are also discussed.
Experimentation is performed on networks containing 400 nodes randomly
placed within a square area, and resulting error magnitudes are
represented as percentages of each node's radio range. In scenarios
with 5% errors in distance measurements, 5% anchor node population
(nodes with known locations), and average connectivity levels between
neighbors of 7 nodes, the algorithm is shown to have errors less than
33% on average. It is also shown that, given an average connectivity
of at least 12 nodes and 10% anchors, the algorithm performs well with
up to 40% errors in distance measurements.
- View the full text of this paper in
HTML,
PDF, and
PostScript.
The Proceedings are published as a collective work, © 2002 by the USENIX Association. All Rights Reserved. Rights
to individual papers remain with the author or the author's employer.
Permission is granted for the noncommercial reproduction of the complete
work for educational or research purposes. USENIX acknowledges all
trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
 To become a USENIX Member, please see our Membership Information.
|
Need help? Use our Contacts page.
