Manifold learning algorithms for localization in wireless sensor networks
Authors:
- 28 September 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (15206149)
Abstract
If a dense network of static wireless sensors is deployed to measure a time-varying isotropic random field, then sensor data itself, rather than range measurements using specialized hardware, can be used to estimate a map of sensor locations. Furthermore, distributed and scalable sensor localization algorithms can be derived. We apply the manifold learning algorithms, Isomap, locally linear embedding (LLE), and Hessian LLE (HLLE). The HLLE-based estimator demonstrates the best bias and variance performance, but may not be robust for all random sensor deployments.Keywords
This publication has 9 references indexed in Scilit:
- Relative location estimation in wireless sensor networksIEEE Transactions on Signal Processing, 2003
- Computational experience with sequential and parallel, preconditioned Jacobi–Davidson for large, sparse symmetric matricesJournal of Computational Physics, 2003
- Localization from mere connectivity2003
- Compactly Supported Correlation FunctionsJournal of Multivariate Analysis, 2002
- Distributed compression in a dense microsensor networkIEEE Signal Processing Magazine, 2002
- Nonlinear Dimensionality Reduction by Locally Linear EmbeddingScience, 2000
- A Global Geometric Framework for Nonlinear Dimensionality ReductionScience, 2000
- Spatial analysis of saturated hydraulic conductivity in a soil with macroporesSoil Technology, 1997
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matricesJournal of Computational Physics, 1975