Gossip is defined as a rumor which specifically targets one individual and essentially only propagates within its friendship connections. How fast and how far a gossip can spread is for the first time assessed quantitatively in this study. For that purpose we introduce the “spread factor” and study it on empirical networks of school friendships as well as on various models for social connection...

In this paper, we review and propose an improvement on an earlier proposed distributed delay and sum beamformer (DDSB). In the original DDSB, each pair of neighboring nodes updates their estimates asynchronously, which may yield a relatively slow convergence, especially when the size of network is large. When multiple pairs of neighboring nodes update simultaneously, the algorithm converges pot...

In this paper a distributed clock synchronization algorithm is proposed. The algorithm requires gossip asynchronous communication between the nodes of the network, and because of its proportional-integral (PI) structure it is able to compensate both initial offsets and different clock speeds. Convergence of the algorithm is proved and analysed with respect to the controller parameter, while sca...

We present in this paper a general garbage collection scheme that reduces the “noise” in gossip-based broadcast algorithms. In short, our garbage collection scheme uses a simple heuristic to trade “useless” messages with “useful” ones. Used with a given gossip-based broadcast algorithm, a given size of buffers, and a given number of disseminated messages (e.g., per gossip round), our garbage co...

(ABSTRACT) In this proposal, we consider scheduling distributed soft real-time tasks in unreliable (e.g., those with arbitrary node and network failures) and untrustworthy systems (e.g., those with Byzantine node behaviors). We present a distributed real-time scheduling algorithm called Real-Time Gossip (or RTG). RTG considers a distributed (i.e., multi-node) task model where tasks are subject ...

Gossip-based techniques recently adopted in mobile ad hoc network (MANET) system have achieved significant improvement on network overhead, routing efficiency and reliability. In this paper we investigate an up-to-date gossip-based Ad Hoc routing algorithm (AODV+G) [2] implemented in Ad Hoc On-Demand Distance Vector Routing (AODV) and discuss its weakness with respect to overall network routing...

In this paper, we study an asynchronous randomized gossip algorithm under unreliable communication. At each instance, two nodes are selected to meet with a given probability. When nodes meet, two unreliable communication links are established with communication in each direction succeeding with a time-varying probability. It is shown that two particularly interesting cases arise when these comm...

In the analysis of a recently proposed distributed estimation algorithm based on the Kalman ltering and on gossip iterations, we needed to apply a new inequality which is valid for i.i.d. matrix valued random processes. This inequality can be useful in the analysis of the convergence rate of general jump Markov linear systems. In this paper we present this inequality. This is based on the theor...

Evolutionary models of human cooperation are increasingly emphasizing the role of reputation and the requisite truthful "gossiping" about reputation-relevant behavior. If resources were allocated among individuals according to their reputations, competition for resources via competition for "good" reputations would have created incentives for exaggerated or deceptive gossip about oneself and on...