Gossip along the way: Order-Optimal Consensus through Randomized Path Averaging

Abstract

Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. However for many topologies that are realistic for wireless ad-hoc and sensor networks (like grids and random geometric graphs), the standard nearest-neighbor gossip converges very… (More)

Topics

5 Figures and Tables

Statistics

051015'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

53 Citations

Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics