Semidefinite programming for ad hoc wireless sensor network localization
- 26 April 2004
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the third international symposium on Information processing in sensor networks - IPSN'04
Abstract
We describe an SDP relaxation based method for the position estimation problem in wireless sensor networks. The optimization problem is set up so as to minimize the error in sensor positions to fit distance measures. Observable gauges are developed to check the quality of the point estimation of sensors or to detect erroneous sensors. The performance of this technique is highly satisfactory compared to other techniques. Very few anchor nodes are required to accurately estimate the position of all the unknown nodes in a network. Also the estimation errors are minimal even when the anchor nodes are not suitably placed within the network or the distance measurements are noisy.Keywords
This publication has 8 references indexed in Scilit:
- Localization from mere connectivityPublished by Association for Computing Machinery (ACM) ,2003
- Convex position estimation in wireless sensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The bits and flops of the n-hop multilateration primitive for node localization problemsPublished by Association for Computing Machinery (ACM) ,2002
- Location systems for ubiquitous computingComputer, 2001
- Dynamic fine-grained localization in Ad-Hoc networks of sensorsPublished by Association for Computing Machinery (ACM) ,2001
- Solving Euclidean Distance Matrix Completion Problems Via Semidefinite ProgrammingComputational Optimization and Applications, 1999
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with ApplicationsSIAM Journal on Optimization, 1997
- Global Continuation for Distance Geometry ProblemsSIAM Journal on Optimization, 1997