Gossiping in groups: Distributed averaging over the wireless medium

Published

Journal Article

We present an approach to gossip algorithms tailored to the practical considerations of wireless communications. Traditional gossip algorithms operate via the pairwise exchange of estimates, which fails to capture the broadcast and superposition nature of the wireless medium. Adapting the virtual full-duplex framework of Guo and Zhang, we construct a communications scheme in which each node can broadcast its estimate to its neighbors while simultaneously receiving its neighbors' estimates. This full-duplex scheme gives rise to group gossip, a more flexible family of gossip algorithms built on multilateral, rather than pairwise, exchanges. Our approach obviates the need for orthogonalization or medium access; only local information and synchronization are necessary. Additionally, group gossip has better convergence properties than does randomized gossip. Group gossip permits a tighter bound on the convergence speed than randomized gossip, and in general the upper bound on the convergence time is at most one-third that of randomized gossip. © 2011 IEEE.

Full Text

Duke Authors

Cited Authors

  • Nokleby, M; Bajwa, WU; Calderbank, R; Aazhang, B

Published Date

  • December 1, 2011

Published In

  • 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Start / End Page

  • 1242 - 1249

Digital Object Identifier (DOI)

  • 10.1109/Allerton.2011.6120310

Citation Source

  • Scopus