DILAND: An Algorithm for Distributed Sensor Localization With Noisy Distance Measurements

DOI10.1109/TSP.2009.2038423zbMATH Open1392.94628arXiv0910.2743MaRDI QIDQ4570845FDOQ4570845

Soummya Kar, Usman A. Khan, José M. F. Moura

Publication date: 9 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: In this correspondence, we present an algorithm for distributed sensor localization with noisy distance measurements (DILAND) that extends and makes the DLRE more robust. DLRE is a distributed sensor localization algorithm in $mathbb{R}^m$ $(mgeq1)$ introduced in cite{usman_loctsp:08}. DILAND operates when (i) the communication among the sensors is noisy; (ii) the communication links in the network may fail with a non-zero probability; and (iii) the measurements performed to compute distances among the sensors are corrupted with noise. The sensors (which do not know their locations) lie in the convex hull of at least $m+1$ anchors (nodes that know their own locations.) Under minimal assumptions on the connectivity and triangulation of each sensor in the network, this correspondence shows that, under the broad random phenomena described above, DILAND converges almost surely (a.s.) to the exact sensor locations.

Full work available at URL: https://arxiv.org/abs/0910.2743

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13)

Cited In (12)

• Primal-dual stochastic distributed algorithm for constrained convex optimization
• An accelerated distributed online gradient push-sum algorithm on time-varying directed networks
• Time-varying distributed optimization problem with inequality constraints
• Distributed centroid estimation from noisy relative measurements
• Robust consensus of multi‐agent systems with multiplicative uncertainties and its application in time synchronization
• Adaptive online distributed optimization in dynamic environments
• Consensus of discrete-time multi-agent systems with multiplicative uncertainties and delays
• Bearing-only distributed localization for multi-agent systems with complex coordinates
• DILAND
• Neighbor constraint assisted distributed localization for wireless sensor networks
• Neighborhood Kalman estimation for distributed localization in wireless sensor networks
• Asynchronous distributed localization in networks with communication delays and packet losses

This page was built for publication: DILAND: An Algorithm for Distributed Sensor Localization With Noisy Distance Measurements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570845)