Geographic gossip on geometric random graphs via affine combinations

Authors:
Hariharan Narayanan
Affiliations:
University of Chicago, Chicago, IL
Venue:
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Year:
2007

Citing 3
Cited 0

Parallel and Distributed Computation: Numerical Methods

Parallel and Distributed Computation: Numerical Methods
Geographic gossip: efficient aggregation for sensor networks

Proceedings of the 5th international conference on Information processing in sensor networks
The capacity of wireless networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent times, a considerable amount of work has been devoted to the development and analysis of gossip algorithms in Geometric Random Graphs. In a recently introduced model termed "Geographic Gossip," each node is aware of its position but possesses no further information. We develop a new protocol for Geographic Gossip, in which counter-intuitively, we use "non-convex affinecombinations" as updates in addition to convex combinations to accelerate the averaging process.