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

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$ $(m\ge 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.

Submitted to the IEEE Transactions on Signal Processing. Initial submission on May 2009. 12 pages

Cited by in corpus (28)

• Distributed Maximum Likelihood Sensor Network Localization
• ADD-OPT: Accelerated Distributed Directed Optimization
• DSA: Decentralized Double Stochastic Averaging Gradient Algorithm
• Decentralized Quasi-Newton Methods
• DQM: Decentralized Quadratically Approximated Alternating Direction Method of Multipliers
• Cloud K-SVD: A Collaborative Dictionary Learning Algorithm for Big, Distributed Data
• Simple and fast convex relaxation method for cooperative localization in sensor networks using range measurements
• Higher Dimensional Consensus: Learning in Large-Scale Networks
• A Primal-Dual Quasi-Newton Method for Exact Consensus Optimization
• Distributed Localization in Wireless Sensor Networks Under Denial-of-Service Attacks
• Multi-consensus Decentralized Accelerated Gradient Descent
• On the Linear Convergence of Distributed Optimization over Directed Graphs
• Network Newton-Part II: Convergence Rate and Implementation
• Network Newton-Part I: Algorithm and Convergence
• A Statistically Modelling Method for Performance Limits in Sensor Localization
• $\mathcal{C}\mathcal{I}\mathcal{R}\mathcal{FE}$: A Distributed Random Fields Estimator
• Distributed, simple and stable network localization
• Large-Scale Sensor Network Localization via Rigid Subnetwork Registration
• Mobile Node Localization via Pareto Optimization: Algorithm and Fundamental Performance Limitations
• DCOOL-NET: Distributed cooperative localization for sensor networks
• Linear convergence in optimization over directed graphs with row-stochastic matrices
• Power Optimization for Network Localization
• Attack-Resilient Distributed Convex Optimization of Linear Multi-Agent Systems Against Malicious Cyber-Attacks over Random Digraphs
• Parameter-free Maximum Likelihood Localization of a Network of Moving Agents from Ranges, Bearings and Velocity measurements
• Localization in mobile networks via virtual convex hulls
• Range-Only Localization in n-Dimensional Networks With Arbitrary Anchor Placement
• Localization in internets of mobile agents: A linear approach
• Peer-to-Peer Localization for Single-Antenna Devices