Localization with Imprecise Distance Information in Sensor Networks
Authors:
- M. CaoMCM. Cao
- B.D.O. AndersonBAB.D.O. Anderson
- A.S. MorseAMA.S. Morse
- 4 October 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2829-2834
Abstract
An approach to formulate geometric relations among distances between nodes as equality constraints is introduced in this paper to study the localization problem with imprecise distance information in sensor networks. These constraints can be further used to formulate optimization problems for distance estimation. The optimization solutions correspond to a set of distances that are consistent with the fact that sensor nodes live in the same plane or 3D space as the anchor nodes. These techniques serve as the foundation for most of the existing localization algorithms that depend on the sensors' distances to anchors to compute each sensor’s location.Keywords
This publication has 9 references indexed in Scilit:
- Localization of wireless sensor networks with a mobile beacon2005
- Robust distributed network localization with noisy range measurements2004
- Distributed localization in wireless sensor networks: a quantitative comparisonComputer Networks, 2003
- Localized positioning in ad hoc networksAd Hoc Networks, 2003
- The n-Hop Multilateration Primitive for Node Localization ProblemsMobile Networks and Applications, 2003
- Calibration as parameter estimation in sensor networks2002
- Quadratically constrained least squares and quadratic problemsNumerische Mathematik, 1991
- Least squares with a quadratic constraintNumerische Mathematik, 1980
- Numerical methods for solving linear least squares problemsNumerische Mathematik, 1965