Advanced Adaptive Gossiping Using 2-Hop Neighborhood Information

Abstract

Efficient information dissemination is one of the challenging tasks in most ad-hoc network application domains, be it in wireless sensor networks, mobile ad-hoc networks, or vehicular ad-hoc networks. It is obvious, that flooding has a high communication overhead, leading to channel congestion and packet collisions. Therefore, more efficient dissemination mechanisms were investigated and proposed by the research community.One class of such algorithms is gossiping, where each node forwards a message with a certain probability. The main challenge in gossiping is the proper determination of the forwarding probability, i.e., on the one hand this value has to be chosen high enough to assure a high delivery ratio, on the other hand it has to be as low as possible to reduce communication overhead. At the same time this probability has to be adapted to dynamic network conditions, like changing node density.In this work an advanced scheme for adaptive gossiping is proposed, capable to adjust the dissemination probability dynamically and in a distributed manner. The gossiping probability is determined at a node for every message that has to be forwarded based on two hop neighborhood information. That way, the proposed protocol is capable of working in arbitrary network topologies and densities, enabling more efficient data dissemination compared to existing approaches.

On the scalability of wireless multi-hop broadcast protocols with respect to density in VANET

“…Bako et al adapt the Smart Gossip protocol [8] to the VANET context to create the Advanced Adaptive Gossiping (AAG) protocol [9]. AAG is a stochastic broadcasting protocol that utilizes 2-hop neighborhood data to set retransmit probabilities.…”

“…This function depends on three parameters: τ arp , δ, and D. τ arp is an application defined reachability target, which we set to be 0.99 as in [9]. δ is the network diameter (in number of hops) and D is the number of neighbors of v.…”

“…Advanced Adaptive Gossiping (AAG) [9] is a hybrid between a pure topological protocol like MPR and a stochastic broadcast protocol like StochLocal. AAG uses 2-hop topological information to calculate a rebroadcast probability p.…”

Analyzing dissemination redundancy to achieve data consistency in VANETs

“…We use an adaptive, probabilistic gossiping protocol, namely Advanced Adaptive Geocast (AAG) [1]. In AAG, each node determines the message forwarding probability based on the current perceived node density according to 2-hop neighborhood information.…”

Dissemination protocol for Heterogeneous Cooperative Vehicular Networks

“…This means that when a message is received the first time, not all receivers rebroadcast it, but it is only disseminated with probability P, else it is dropped. The probability could be random [4], or depends on neighbours counts [5] [6],or depends on the number of received copy of the broadcasted message [7].…”