https://hal.inria.fr/hal-00992680Farach-Colton, MartinMartinFarach-ColtonRU - Rutgers, The State University of New Jersey [New Brunswick] - Rutgers - Rutgers University SystemAnta, Antonio FernándezAntonio FernándezAntaInstitute IMDEA Software [Madrid]Milani, AlessiaAlessiaMilaniLaBRI - Laboratoire Bordelais de Recherche en Informatique - UB - Université de Bordeaux - École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) - CNRS - Centre National de la Recherche ScientifiqueMosteiro, Miguel A.Miguel A.MosteiroComputer Science Department - RU - Rutgers, The State University of New Jersey [New Brunswick] - Rutgers - Rutgers University SystemZaks, ShmuelShmuelZaksDepartment of Computer Science [Haifa] - University of Haifa [Haifa]Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. DeterminismHAL CCSD2012[INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]Travers, CorentinDavid Fernández-Baca2014-05-19 10:47:312022-06-25 10:34:482014-05-19 11:15:00enConference papershttps://hal.inria.fr/hal-00992680/document10.1007/978-3-642-29344-3_26application/pdf1In this paper the problem of information dissemination in Mobile Ad-hoc Networks (MANETs) is studied. The problem is to disseminate a piece of information, initially held by a distinguished source node, to all nodes in a target set. We assume a weak set of restrictions on the mobility of nodes, parameterized by α, the disconnection time, and β, the link stability time, such that the MANETs considered are connected enough for dissemination. Such a connectivity model generalizes previous models in that we assume much less connectivity, or make explicit the assumptions in previous papers. In MANETs, nodes are embedded in the plane and can move with bounded speed. Communication between nodes occurs over a collisionprone single channel. We show upper and lower bounds for diﬀerent types of randomized protocols, parameterized by α and β. This problem has been extensively studied in static networks and for deterministic protocols. We show tight bounds on the randomized complexity of information dissemination in MANETs, for reasonable choices of α and β. We show that randomization reduces the time complexity of the problem by a logarithmic or linear factor, depending on the class of randomized protocol considered.