.png){kind=icon}
Return
Distributed Projection-Based Algorithms for Source Localization in Wireless Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2015.2402672.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Source localization
wireless sensor networks
distributed algorithms
intersection computation
constrained convex optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSaveShareSave
ShareSave
View more