Controlled Gossiping in Ad Hoc Networks

Abstract

Abstract-Gossiping, a probabilistic algorithm for networkwide broadcasting, can significantly reduce the number of transmissions in one-to-all message spread. Based on the Continuum Percolation Theory, we develop a novel analytical model of gossiping for wireless ad hoc networks. This model provides an intuitive way for setting the gossiping probability, so that a gossip achieves high degree of network coverage with limited number of transmissions. We also propose and study a distributed gossiping scheme, in which nodes set their gossiping probabilities according to locally acquired information. Both gossiping schemes are demonstrated to be scalable; i.e., for fixed network area, the expected number of gossip transmissions does not depend on the number of nodes in the network. The analytical results are verified via simulations of large ad hoc networks.

A survey on probabilistic broadcast schemes for wireless ad hoc networks

“…In Global GOSSIP [70], the authors demonstrated that if the nodes forward incoming packets with a probability p ¼ h À1 ðcÞ / in a network with average degree / > h À1 ðcÞ, the probability of a successful broadcast procedure is c. Where c is the target gossip coverage level (target reachability), / the average node degree, and h À1 ðcÞ is the minimum average degree so that the fraction of nodes in the largest connected component of a network with infinite size is at least c. The average node's degree / is defined as / ¼ kpr, k is the intensity of homogeneous Poisson process H k , which is used to distribute nodes in the network. Although this scheme is suitable from the theoretical point of view, it makes assumptions on the level of knowledge available at individual nodes, which would either incur huge cost or impossible to attain.…”

“…Another issue is how nodes can know the value of h À1 ðcÞ in a real network. An improved version of Global GOSSIP is presented as Distributed GOSSIP in [70]. Nodes use the node's number of neighbors n b instead of using the average node degree / in the network.…”

“…Although some analytical models have been presented for broadcasting schemes in wireless ad hoc networks, such as flooding [110,113], fixed probabilistic scheme [110,113], distance-based [126,113,125], counter-based [126,113,125], location-based [113], further work is needed to model the different types of probabilistic schemes presented in this survey. Only a few papers include analytical models for the proposed schemes such as [70,37]. Most of the proposed schemes are based on heuristics.…”

Geografia e Inovação

“…The formal description used in the literature to analyze the multi-hop dissemination of packets in an ad hoc network corresponds to the so called Geometric Graph on a random point configuration also called Random Geometric Graph (RGG) [1,2]. Such a description defines a graph, in an d-dimensional space, in terms of the transmission radius of nodes, r, as follows:…”

Analysis of probabilistic information dissemination in wireless networks employing algebraic graph theory elements

“…They compare the proposed scheme with the AODV protocol and a fixed probabilistic approach and it is shown that it the number of rebroadcasts is significantly reduced. [121], considering Continuum Percolation Theory, propose a gossip model where the broadcast probability is fixed and inversely proportional to the average node degree. Moreover, a distributed gossiping scheme is also proposed, in which the nodes set the gossiping probability according to the number of own neighbors.…”