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

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.

💡 Research Summary

The paper investigates the fundamental problem of disseminating a piece of information from a distinguished source node to a set of nodes defined by a predicate in a Mobile Ad‑hoc Network (MANET). The authors adopt a realistic model in which nodes are placed in the Euclidean plane, move with bounded speed, and communicate over a single, collision‑prone radio channel without collision detection. Two parameters, α and β, capture the temporal aspects of opportunistic connectivity: α bounds the maximum time an informed and an uninformed node may be disconnected, while β bounds the minimum time they must stay neighbors before a successful transmission can occur. Nodes may start at different times, crash, and later recover, which is reflected in arbitrary activation schedules.

The study classifies randomized dissemination protocols into three families: (1) Fair protocols, where every node transmits with the same probability in each time slot; (2) Oblivious protocols, where a node’s transmission probability is fixed in advance and does not depend on any execution history; and (3) Locally adaptive protocols, where a node can adjust its transmission probability based on its local communication history. This taxonomy allows the authors to isolate the effects of randomization, adaptivity, and fairness on the time complexity of dissemination.

The main theoretical contributions are lower‑bound and upper‑bound results for each family. For any fair protocol, the authors prove an existential lower bound of Ω((n·log(1/ε))/log n) on the time needed to increase the number of covered nodes by one with success probability 1 − ε. For both oblivious and locally adaptive protocols they derive a lower bound of Ω(n/ log n) on the total dissemination time, holding with high probability (oblivious) or in expectation (adaptive). A more general lower bound that incorporates the mobility parameters is Ω(α·n + n²/ log n), reflecting the combined delay caused by temporary disconnections (α·n) and contention on the single channel (n²/ log n). These bounds hold for any protocol in the respective class, regardless of node speed, crash/recovery patterns, or activation schedules.

On the constructive side, the paper shows that a very simple fair oblivious protocol—essentially the one proposed in