×

DILAND

swMATH ID: 44506
Software Authors: Khan, Usman A.; Kar, Soummya; Moura, José M. F.
Description: DILAND: an algorithm for distributed sensor localization with noisy distance measurements. 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 ℝm (m≥1) 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.
Homepage: https://arxiv.org/abs/0910.2743
Keywords: Distributed iterative sensor localization; sensor networks; Cayley-Menger determinant; barycentric coordinates; absorbing Markov chain; stochastic approximation; anchor
Related Software: Adam; AdaGrad; Saga
Cited in: 8 Documents

Citations by Year