Network Localization with Biased Range Measurements
Authors:
- Joseph S. PicardJPJoseph S. Picard
- 16 January 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 7 (1) , 298-304
Abstract
We discuss the challenge of node localization in ad-hoc wireless networks using range measurements and a few anchors. The measurements are assumed to be noisy with unknown bias. We propose an iterative Maximum Likelihood algorithm that is statistically efficient under these conditions. The algorithm is related to phase retrieval and can be viewed as an adaptation of the Gerchberg-Saxton Iterations alternating projection procedure. As a byproduct the algorithm estimates the bias of the range measurements. Closed form expressions for the Fisher Information Matrix are derived. Finally, simulations are used to corroborate the analysis.Keywords
This publication has 19 references indexed in Scilit:
- Resilient localization for sensor networks in outdoor environmentsACM Transactions on Sensor Networks, 2010
- Nonparametric belief propagation for self-localization of sensor networksIEEE Journal on Selected Areas in Communications, 2005
- On the accuracy of a cellular location system based on rss measurementsIEEE Transactions on Vehicular Technology, 2003
- Relative location estimation in wireless sensor networksIEEE Transactions on Signal Processing, 2003
- Convex position estimation in wireless sensor networks2002
- GPS-less low-cost outdoor localization for very small devicesIEEE Wireless Communications, 2000
- An analytical constant modulus algorithmIEEE Transactions on Signal Processing, 1996
- The spherical interpolation method of source localizationIEEE Journal of Oceanic Engineering, 1987
- A passive localization algorithm and its accuracy analysisIEEE Journal of Oceanic Engineering, 1987
- Phase retrieval algorithms: a comparisonApplied Optics, 1982