Greedy Gossip with Eavesdropping

by   Deniz Ustebay, et al.

This paper presents greedy gossip with eavesdropping (GGE), a novel randomized gossip algorithm for distributed computation of the average consensus problem. In gossip algorithms, nodes in the network randomly communicate with their neighbors and exchange information iteratively. The algorithms are simple and decentralized, making them attractive for wireless network applications. In general, gossip algorithms are robust to unreliable wireless conditions and time varying network topologies. In this paper we introduce GGE and demonstrate that greedy updates lead to rapid convergence. We do not require nodes to have any location information. Instead, greedy updates are made possible by exploiting the broadcast nature of wireless communications. During the operation of GGE, when a node decides to gossip, instead of choosing one of its neighbors at random, it makes a greedy selection, choosing the node which has the value most different from its own. In order to make this selection, nodes need to know their neighbors' values. Therefore, we assume that all transmissions are wireless broadcasts and nodes keep track of their neighbors' values by eavesdropping on their communications. We show that the convergence of GGE is guaranteed for connected network topologies. We also study the rates of convergence and illustrate, through theoretical bounds and numerical simulations, that GGE consistently outperforms randomized gossip and performs comparably to geographic gossip on moderate-sized random geometric graph topologies.


page 1

page 2

page 3

page 4


Distributed Consensus in Wireless Networks with Probabilistic Broadcast Scheduling

We consider distributed average consensus in a wireless network with par...

Privacy-Preserving Average Consensus via State Decomposition

Average consensus underpins key functionalities of distributed systems r...

Distributed Processes and Scalability in Sub-networks of Large-Scale Networks

Performance of standard processes over large distributed networks typica...

Asynchronous Local Construction of Bounded-Degree Network Topologies Using Only Neighborhood Information

We consider ad-hoc networks consisting of n wireless nodes that are loca...

Trustworthy Distributed Average Consensus based on Locally Assessed Trust Evaluations

This paper proposes a distributed algorithm for average consensus in a m...

On the Communication Latency of Wireless Decentralized Learning

We consider a wireless network comprising n nodes located within a circu...

Cluster-and-Conquer: When Randomness Meets Graph Locality

K-Nearest-Neighbors (KNN) graphs are central to many emblematic data min...

Please sign up or login with your details

Forgot password? Click here to reset