A Novel Subspace Approach for Cooperative Localization in Wireless Sensor Networks Using Range Measurements
Authors:
- 6 January 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 57 (1) , 260-269
Abstract
Estimating the positions of sensor nodes is a fundamental and crucial problem in wireless sensor networks. In this paper, three novel subspace methods for node localization in a fully connected network are devised with the use of range measurements. Biases and mean square errors of the sensor node position estimates are also derived. Computer simulations are included to contrast the performance of the proposed algorithms with the conventional subspace positioning method, namely, classical multidimensional scaling, as well as Cramer-Rao lower bound.Keywords
This publication has 21 references indexed in Scilit:
- Semidefinite Programming Approaches for Sensor Network Localization With Noisy Distance MeasurementsIEEE Transactions on Automation Science and Engineering, 2006
- Semidefinite programming based algorithms for sensor network localizationACM Transactions on Sensor Networks, 2006
- Nonparametric belief propagation for self-localization of sensor networksIEEE Journal on Selected Areas in Communications, 2005
- Performance study of localization methods for ad-hoc sensor networks2005
- Localization from connectivity in sensor networksIEEE Transactions on Parallel and Distributed Systems, 2004
- Robust sensor localization algorithm in wireless ad-hoc sensor networks2004
- Distributed particle filters for sensor networks2004
- Convex position estimation in wireless sensor networks2002
- Dynamic fine-grained localization in Ad-Hoc networks of sensors2001
- MUSIC, maximum likelihood, and Cramer-Rao bound: further results and comparisonsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1990