Distributed Maximum Likelihood Sensor Network Localization

DOI10.1109/TSP.2014.2302746zbMATH Open1394.94542arXiv1309.2502OpenAlexW2008141156MaRDI QIDQ4579063FDOQ4579063

Andrea Simonetto, G. Leus

Publication date: 22 August 2018

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

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.

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited In (12)

• Primal recovery from consensus-based dual decomposition for distributed convex optimization
• Bounds for the tracking error of first-order online optimization methods
• Distributed consensus-based solver for semi-definite programming: an optimization viewpoint
• Optimal Nonlinear Estimation for Localization of Wireless Sensor Networks
• Consensus control for linear systems with optimal energy cost
• Distributed push-pull estimation for node localization in wireless sensor networks
• Parallel alternating direction method of multipliers
• Collision avoidance cooperative attack with multiple pursuers based on bearing-only measurements
• Incremental localization algorithm based on regularized iteratively reweighted least square
• Distributed localization with mixed measurements under switching topologies
• Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization
• Distributed gradient descent localization in wireless sensor networks

This page was built for publication: Distributed Maximum Likelihood Sensor Network Localization

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