Abstract
In this work we propose an anchor-based sensor networks localization scheme that utilizes a dual spectral embedding. The input noisy distance measurements are first embedded by Diffusion embedding and then by Isomap. This allows to better estimate the intrinsic network geometry and derive improved adaptive bases, that are used to estimate the global localization via $L1 regression. We then introduce the Augmented Dual Embedding by computationally augmenting the set of measured distances and computing the dual embedding. This significantly improves the scheme's robustness and accuracy. We also propose a straightforward approach to preprocessing the noisy distances via the triangle inequality. The proposed scheme is experimentally shown to outperform contemporary state-of-the-art localization schemes.
Original language | English |
---|---|
Article number | 7055876 |
Pages (from-to) | 2420-2431 |
Number of pages | 12 |
Journal | IEEE Transactions on Signal Processing |
Volume | 63 |
Issue number | 9 |
DOIs | |
State | Published - 1 May 2015 |
Bibliographical note
Publisher Copyright:© 1991-2012 IEEE.
Keywords
- Graph theory
- machine learning
- network theory (graphs)
- wireless sensor networks