Distributed Maximum Likelihood Sensor Network Localization

Abstract

We propose a class of convex relaxations to solve the sensor network localization problem, based on a maximum likelihood (ML) formulation. This class, as well as the tightness of the relaxations, depends on the noise probability density function (PDF) of the collected measurements. We derive a computational efficient edge-based version of this ML convex relaxation class and we design a distributed algorithm that enables the sensor nodes to solve these edge-based convex programs locally by communicating only with their close neighbors. This algorithm relies on the alternating direction method of multipliers (ADMM), it converges to the centralized solution, it can run asynchronously, and it is computation error-resilient. Finally, we compare our proposed distributed scheme with other available methods, both analytically and numerically, and we argue the added value of ADMM, especially for large-scale networks.

References in corpus (2)

• Stochastic ADMM for Nonsmooth Optimization
• DCOOL-NET: Distributed cooperative localization for sensor networks

Cited by in corpus (31)

• Simple and fast convex relaxation method for cooperative localization in sensor networks using range measurements
• Cooperative Localization in Massive Networks
• Bayesian Cooperative Localization Using Received Signal Strength With Unknown Path Loss Exponent: Message Passing Approaches
• Time-Varying Convex Optimization via Time-Varying Averaged Operators
• On a registration-based approach to sensor network localization
• Relative kinematics of an anchorless network
• Alternating Minimization Based First-Order Method for the Wireless Sensor Network Localization Problem
• STRONG: Synchronous and asynchronous RObust Network localization, under Non-Gaussian noise
• Distributed, simple and stable network localization
• Range and Bearing Data Fusion for Precise Convex Network Localization
• ADMM Based Privacy-preserving Decentralized Optimization
• Angle-Based Sensor Network Localization
• NEXT: In-Network Nonconvex Optimization
• Localization in Wireless Sensor Networks Using Quadratic Optimization
• Distributed Localization of Tree-structured Scattered Sensor Networks
• Asynchronous and time-varying proximal type dynamics multi-agent network games
• Achieving Optimal Output Consensus for Discrete-time Linear Multi-agent Systems with Disturbance Rejection
• An Intelligent Prediction System for Mobile Source Localization Using Time Delay Measurements
• Distributed Semidefinite Programming with Application to Large-scale System Analysis
• Time-varying constrained proximal type dynamics in multi-agent network games
• Peregrine: Network Localization and Navigation with Scalable Inference and Efficient Operation
• A Distributed Parallel Optimization Algorithm via Alternating Direction Method of Multipliers
• Distributed Event Localization via Alternating Direction Method of Multipliers
• Robust Localization Using Range Measurements with Unknown and Bounded Errors
• Primal Recovery from Consensus-Based Dual Decomposition for Distributed Convex Optimization
• A Less Noise-Sensitive SDP Relaxation in Wireless Sensor Network Localization
• Convergence Analysis of Nonconvex ADMM for Rigid Registration
• Graph Neural Network for Large-Scale Network Localization
• A preconditioned Forward-Backward method for partially separable SemiDefinite Programs
• Parameter-free Maximum Likelihood Localization of a Network of Moving Agents from Ranges, Bearings and Velocity measurements
• Stochastic Multidimensional Scaling