Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism

TL;DR

This paper investigates how different strategies affect information dissemination in dynamic mobile ad-hoc networks, analyzing the effectiveness of adaptive, oblivious, randomized, and deterministic protocols under various network conditions.

Contribution

It provides a comprehensive analysis of the performance of randomized versus deterministic protocols in dynamic MANETs, highlighting conditions for success and limitations.

Findings

Randomized protocols outperform deterministic ones in highly dynamic scenarios.

Adaptive strategies improve dissemination speed in mobile environments.

Certain protocols fail under high node mobility or disconnection conditions.

Abstract

In this paper the problem of information dissemination in Mobile Ad-hoc Networks (MANET) is studied. The problem is to disseminate a piece of information, initially held by a distinguished source node, to all nodes in a set defined by some predicate. We use a model of MANETs that is well suited for dynamic networks and opportunistic communication. In this model nodes are placed in a plane, in which they can move with bounded speed, and communication between nodes occurs over a collision-prone single channel. In this setup informed and uninformed nodes can be disconnected for some time (bounded by a parameter alpha), but eventually some uninformed node must become neighbor of an informed node and remain so for some time (bounded by a parameter beta). In addition, nodes can start at different times, and they can crash and recover. Under the above framework, we show negative and positive results for different types of randomized protocols, and we put those results in perspective with respect to previous deterministic results.