.png){kind=icon}
.png){kind=icon}
Return
Eavesdropping-Based Gossip Algorithms for Distributed Consensus in Wireless Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2015.2398191.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we present an eavesdropping-based gossip algorithm (EBGA). In the novel algorithm, when a node unicasts its values to a randomly selected neighboring node, all other nodes, which eavesdrop these values, simultaneously update their state values. By exploiting the broadcast nature of wireless communications, this novel algorithm has similar performance to broadcast gossip algorithms. Although broadcast gossip algorithms have the fastest rate of convergence among all gossip algorithms, they either converge to a random value rather than the average consensus, or need out-degree information available for each node to guarantee convergence to the average consensus. Utilizing non-negative matrix theory and ergodicity coefficient, we have proved that this novel algorithm can converge to the average consensus without any assumption which is difficult to be realized in real networks.
Keywords:
Distributed averaging
distributed signal processing
wireless sensor networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W