2,881 research outputs found
Greedy Gossip with Eavesdropping
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.Comment: 25 pages, 7 figure
A New Perspective on Randomized Gossip Algorithms
In this short note we propose a new approach for the design and analysis of
randomized gossip algorithms which can be used to solve the average consensus
problem. We show how that Randomized Block Kaczmarz (RBK) method - a method for
solving linear systems - works as gossip algorithm when applied to a special
system encoding the underlying network. The famous pairwise gossip algorithm
arises as a special case. Subsequently, we reveal a hidden duality of
randomized gossip algorithms, with the dual iterative process maintaining a set
of numbers attached to the edges as opposed to nodes of the network. We prove
that RBK obtains a superlinear speedup in the size of the block, and
demonstrate this effect through experiments
Privacy Preserving Randomized Gossip Algorithms
In this work we present three different randomized gossip algorithms for
solving the average consensus problem while at the same time protecting the
information about the initial private values stored at the nodes. We give
iteration complexity bounds for all methods, and perform extensive numerical
experiments.Comment: 38 page
Gossip consensus algorithms via quantized communication
This paper considers the average consensus problem on a network of digital
links, and proposes a set of algorithms based on pairwise ''gossip''
communications and updates. We study the convergence properties of such
algorithms with the goal of answering two design questions, arising from the
literature: whether the agents should encode their communication by a
deterministic or a randomized quantizer, and whether they should use, and how,
exact information regarding their own states in the update.Comment: Accepted for publicatio
- …