Distributed Projection-Based Algorithms for Source Localization in Wireless Sensor Networks

In this paper, we investigate source localization for wireless sensor networks based on received signal strength. We first formulate the localization problem as the intersection computation of a group of sensing rings, and then convert this non-convex problem into two weighted convex optimization problems. We next propose a unified distributed alternating projection algorithm to solve the resulting weighted optimization problems, where sensor nodes can communicate only locally with their neighbors over a time-varying jointly-connected topology. We also show that sensor nodes´ estimates can achieve consensus on a possible minimizer. Both theoretical analysis and some comparative simulations reveal that the proposed approach has good estimation performance in both the consistent and inconsistent cases.