A survey of gossiping and broadcasting in communication networks

By S. M. Hedetniemi, S. Hedetniemi, Arthur L. Liestman. 1988

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

A Multi-Agent Framework for Packet Routing in Wireless Sensor Networks (2015, background): “Specifically, the selected routing approaches are gossiping [11] (a flat routing approach), LEACH-revised (a hierarchical routing approach) and GEAR [26] (a location-based routing approach).”
Connectivity and inference problems for temporal networks (2000, background): “Gossip protocols in distributed systems, for example, are based on the dissemination of information through a network using node-to-node transmissions [5, 9, 15, 16].”
Wireless sensor networks: a survey (2002, background): “Gossiping: A derivation of flooding is gossiping [32] in which nodes do not broadcast but send the incoming packets to a randomly selected neighbor.”
Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks (2002, background): “Gossiping [9] is an alternative to the classic ooding approach that uses randomization to conserve energy.”
A survey on routing protocols for wireless sensor networks (2005, background): “Flooding and gossiping [31] are two classical mechanisms to relay data in sensor networks without the need for any routing algorithms and topology maintenance.”
Digraphs - theory, algorithms and applications (2002, background): “surveys Fraigniaud and Lazard [248], Hedetniemi, Hedetniemi and Liestman [409], Hromkovič, Klasing, Monien and Peine [433]).”
A tutorial on modeling and analysis of dynamic social networks. Part I (2017, background): “ral, 2n−2 calls [181, 182]. A survey of results on gossiping and a similar broadcasting problem (an item of information, known by one agent, has to be transmitted to all other agents) can be found in [183]. The pairwise gossiping interactions between the agents need not be random; consensus and othe”
Novel Multidimensional Models of Opinion Dynamics in Social Networks (2015, background): “A more realistic opinion dynamics can be based on asynchronous gossip-based [48], [49] communication, assuming that only two agents interact during each step.”
Network coding for efficient communication in extreme networks (2005, background): “Randomized broadcasting and gossiping have been studied as communication paradigms for networking for quite a while [7].”
Spatial gossip and resource location protocols (2001, background): “A well-known result states that with high probability, all nodes will receive a copy of a given message m within O (log N ) steps of its initial appearance [7, 10, 14].”
Sensor Networks (2002, background): “A derivation of flooding is gossiping [19] in which nodes do not broadcast but send the incoming packets to a randomly selected neighbor.”
Routing techniques in wireless sensor networks: a survey (2004, background): “We study the design trade-offs between energy and communication overhead savings in every routing paradigm.”
Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey (2013, background): “However, TORA does not incorporate multicast into its basic operation. b) Gossiping: Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by means of a communication network [47].”