Joint node localization and error correction in wireless sensor networks
In the node localization problem of wireless sensor networks (WSNs), distance measurements are often corrupted by large errors which will lead to inaccurate position estimates without correction. To address this issue, we propose a scheme of joint node localization and error correction from distance...
Saved in:
| Published in | Proceedings of the 31st Chinese Control Conference pp. 6600 - 6604 |
|---|---|
| Main Authors | , , , |
| Format | Conference Proceeding |
| Language | English |
| Published |
IEEE
01.07.2012
|
| Subjects | |
| Online Access | Get full text |
| ISBN | 1467325813 9781467325813 |
| ISSN | 1934-1768 |
Cover
| Summary: | In the node localization problem of wireless sensor networks (WSNs), distance measurements are often corrupted by large errors which will lead to inaccurate position estimates without correction. To address this issue, we propose a scheme of joint node localization and error correction from distance measurements of WSNs. The enabling fact is that only a small number of distance measurements are subject to large errors in general. Such sparsity motivates us to propose an l 1 regularized nonlinear least squares model, where the l 1 regularization term promotes the sparsity of large errors and the nonlinear least squares term reflects the fidelity of distance measurements. This nonconvex model is further relaxed to a second-order cone programming (SOCP) problem, which is convex and tractable. Extensive simulations demonstrate the effectiveness of the proposed approach. |
|---|---|
| ISBN: | 1467325813 9781467325813 |
| ISSN: | 1934-1768 |