Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony

• Published in: Distributed computing 2012-08, Vol.25 (4), p.279-296
• Main Authors: Fernández Anta, Antonio, Milani, Alessia, Mosteiro, Miguel A., Zaks, Shmuel
• Format: Article
• Language: English
• Subjects: Complexity; Computer Communication Networks; Computer Hardware; Computer Science; Computer Systems Organization and Communication Networks; Distributed, Parallel, and Cluster Computing; Gain; Information dissemination; Mathematical analysis; Messages; Networks; Protocol (computers); Schedules; Software Engineering/Programming and Operating Systems; Theory of Computation
• ISSN: 0178-2770; 1432-0452
• DOI: 10.1007/s00446-012-0165-9

The topic of this paper is the study of information dissemination in mobile ad-hoc networks by means of deterministic protocols. 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 mobile ad-hoc networks 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. The protocols studied are classified into three classes: oblivious (the transmission schedule of a node is only a function of its ID), quasi-oblivious (the transmission schedule may also depend on a global time), and adaptive . The main contribution of this work concerns negative results. Contrasting the lower and upper bounds derived, interesting complexity gaps among protocol-classes are observed. These results show that the gap in time complexity between oblivious and quasi-oblivious (hence, adaptive) protocols is almost linear. This gap is what we call the profit of global synchrony since it represents the gain the network obtains from global synchrony with respect to not having it. We note that the global synchrony required by the efficient quasi-oblivious protocol proposed is simply achieved by piggybacking in the messages sent the time at the source node, as a global reference.