IMDEA Networks Institute Publications Repository

Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony

Fernández Anta, Antonio and Milani, Alessia and Mosteiro, Miguel A. and Zaks, Shmuel (2010) Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony. In: The 24th International Symposium on DIStributed Computing (DISC 2010), 13-15 Septiembre 2010, Cambridge, Massachusetts, EE.UU..

[img]
Preview
PDF - Published Version
Download (146Kb) | Preview

Abstract

The topic of this paper is the study of Information Dissemination in Mobile Ad-hoc Networks by means of deterministic protocols. We characterize the connectivity resulting from the movement, from failures and from the fact that nodes may join the computation at different times with two values, α and β, so that, within α time slots, some node that has the information must be connected to some node without it for at least β time slots. 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 protocolclasses are observed. More precisely, in order to guarantee any progress towards solving the problem, it is shown that β must be at least n − 1 in general, but that β ∈ Ω(n 2 / log n) if an oblivious protocol is used. Since quasi-oblivious protocols can guarantee progress with β ∈ O(n), this represents a significant gap, almost linear in β, between oblivious and quasi-oblivious protocols. Regarding the time to complete the dissemination, a lower bound of Ω(nα + n3/ log n)is proved for oblivious protocols, which is tight up to a polylogarithmic factor because a constructive O(nα + n 3 log n) upper bound exists for the same class. It is also proved that adaptive protocols require Ω(nα + n 2), which is optimal given that a matching upper bound can be proved for quasi-oblivious protocols. These results show that the gap in time complexity between oblivious and quasioblivious, and 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.

Item Type: Conference or Workshop Papers (Paper)
Additional Information: Published in: DISC'10 Proceedings of the 24th international conference on Distributed computing Springer-Verlag Berlin, Heidelberg ©2010 Distributed Computing Lecture Notes in Computer Science Volume 6343 ISBN:3-642-15762-9 978-3-642-15762-2
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
T Technology > T Technology (General)
T Technology > TA Engineering (General). Civil engineering (General)
T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science
Depositing User: Christian Sanchez
Date Deposited: 02 Apr 2012 11:26
Last Modified: 03 Dec 2014 12:10
URI: http://eprints.networks.imdea.org/id/eprint/247

Actions (login required)

View Item View Item