This paper studies reliability of probabilistic neighbor-aware gossip algorithms over three wellknown large-scale random topologies, namely Bernoulli (or Erdős-Rényi) graph, the random geometric graph, and the scale-free graph. We propose a new and simple algorithm which ensures higher reliability at lower message complexity than the three families of gossip algorithms over every topology in ou...

Gossip-based protocol has been widely adopted by many large-scale multicast applications. In this paper, we study the impact of node cheating on decentralized gossip-based protocol. We mainly focus on two cheating strategies, one is to increase the subscription request sending times, and the other is to increase the PartialView size. We establish a cheating model of nodes for gossip-based proto...

We investigate how suitable a weighted network is for gossip spreading. The proposed model is based on the gossip spreading model introduced by Lind et.al. on unweighted networks. Weight represents “friendship. Potential spreader prefers not to spread if the victim of gossip is a “close friend”. Gossip spreading is related to the triangles and cascades of triangles. It gives more insight about ...

Gossiping is an information dissemination problem in which each node of a communication network has a unique piece of information that must be transmitted to all other nodes using two-way communications between pairs of nodes along the communication links of the network. In this paper, we study gossiping using a linear cost model of communication which includes a start-up time and a propagation...

Gossip protocols are simple, robust and scalable and have been consistently applied to many (mostly wired) distributed systems. Nevertheless, most validation in this area has been empirical so far and there is a lack of a theoretical counterpart to characterize what can and cannot be computed with gossip protocols. Population protocols, on the other hand, benefit from a sound theoretical framew...

Prior theory suggests that reputation spreading (e.g., gossip) and punishment are two key mechanisms to promote cooperation in groups, but no behavioral research has yet examined their relative effectiveness and efficiency in promoting and maintaining cooperation. To examine these issues, we observed participants interacting in a four-round public goods game (PGG) with or without gossip and pun...

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...

Information Communication Technology (ICT) contributes effectively to spreading of all sorts of information, including gossip and rumors. The continuous growth of online communications calls thus for analysis of their mechanisms and consequences, as moral responsibility increases with increasing information. Taking the Information Ethics (IE) perspective we discuss gossip and its role in social...

Ad hoc and sensor networks usually do not have a central entity for managing information spreading. Moreover, such wireless stations have limited energy and computational power. All this leads to a need for distributed and efficient algorithms for disseminating information across the network. Network coding in conjunction with random walks and gossip techniques proposes a local and distributed ...