Gossiping on MANETs

Abstract

Gossip protocols have emerged as a powerful technique for implementing highly scalable and robust services, such as information dissemination and aggregation. The fact that gossip protocols require very little or no structure to operate makes them particularly appealing to apply in dynamic systems, where topology changes are common (for instance, due to frequent faults or high churn rates). Therefore, gossip protocols seem particularly well fit to operate in wireless self-organizing networks. Unfortunately, these networks have a number of characteristics that impede the deployment of gossip protocols designed for wired networks. In this work we identify the inherent differences in communication between wired and wireless networks and their impact on the design and implementation of gossip protocols. In particular, our comparison includes drawing a distinction between the gossiping primitives suitable for each of these environments. In the context of this analysis, we conclude by presenting a list of open research questions.

Gossiping Components for Cyber-Physical Systems

“…In MANETs gossiping translates to probabilistic broadcasting within the wireless range of each node [3]. Probabilistic forwarding is often combined with some other locally computable mechanism, such as counterbased [6], location-based [20], distance-based [21], energy-based [22], or a combination of these, to further reduce the number of retransmitted messages (with respect to blind flooding).…”

Towards Performance-Aware Engineering of Autonomic Component Ensembles

“…An important fact is that the performance of the knowledge exchange depends heavily on the particular communication protocols being used. For instance, to date DEECo features two principal knowledge exchange approaches -centralized tuple space [11] and decentralized gossip-based communication [12]. In the former case, every time a process needs to be executed a remote tuple space is queried for the necessary data and the result is stored back immediately after the execution.…”

Exploiting Synergies between Coexisting Overlays

“…Gossip-based overlays have been widely applied to provide highly scalable communication in both IPbased networks [9,10,16,17] and mobile adhoc environments [19]. To deliver scalable communication in a large fixed network, a gossip algorithm repeatedly exchanges limited data with a fixed number of randomly selected peers during gossip rounds.…”

“…RPS [10]). Gossip overlays in mobile adhoc networks differ in that they favour a probabilistic broadcast mechanism rather than a random selection of neighbours, and tend to be reactive rather than periodic, but their probabilistic and scalable approach remains unchanged [19].…”