Simple and fast convex relaxation method for cooperative localization in sensor networks using range measurements

Abstract

We address the sensor network localization problem given noisy range measurements between pairs of nodes. We approach the non-convex maximum-likelihood formulation via a known simple convex relaxation. We exploit its favorable optimization properties to the full to obtain an approach that: is completely distributed, has a simple implementation at each node, and capitalizes on an optimal gradient method to attain fast convergence. We offer a parallel but also an asynchronous flavor, both with theoretical convergence guarantees and iteration complexity analysis. Experimental results establish leading performance. Our algorithms top the accuracy of a comparable state of the art method by one order of magnitude, using one order of magnitude fewer communications.

Cited by in corpus (11)

• On a registration-based approach to sensor network localization
• Global and Asymptotically Efficient Localization from Range Measurements
• Alternating Minimization Based First-Order Method for the Wireless Sensor Network Localization Problem
• STRONG: Synchronous and asynchronous RObust Network localization, under Non-Gaussian noise
• Range and Bearing Data Fusion for Precise Convex Network Localization
• Distributed Localization of Tree-structured Scattered Sensor Networks
• Robust dissimilarity measure for Network Localization
• Parameter-free Maximum Likelihood Localization of a Network of Moving Agents from Ranges, Bearings and Velocity measurements
• Range-based Coordinate Alignment for Cooperative Mobile Sensor Network Localization
• Cooperative Localization in Visible Light Networks: Theoretical Limits and Distributed Algorithms
• Convergence Analysis of Nonconvex ADMM for Rigid Registration