Abstract
In 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 collision-prone single channel. We show upper and lower bounds for different 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.
This research was supported in part by the National Science Foundation (CCF-0937829, CCF-1114930), Comunidad de Madrid grant S2009TIC-1692, Spanish MICINN grant TIN2008–06735-C02-01.
We thank Seth Gilbert for triggering the development of this work asking a question at DISC 2010.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 290–298 (1991)
Baldoni, R., Anta, A.F., Ioannidou, K., Milani, A.: The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost. Theor. Comput. Sci. 412(12-14), 1066–1080 (2011)
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences 45, 104–126 (1992)
Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. In: Proc. Principles of Distributed Computing, pp. 260–269 (2009)
Chlebus, B.: Randomized communication in radio networks. In: Handbook on Randomized Computing, vol. 1, pp. 401–456 (2001)
Chrobak, M., Gąsieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proc. of Symp. on Foundations of Computer Science (2000)
Clementi, A., Macci, C., Pasquale, F., Monti, A., Silvestri, R.: Flooding time in edge-markovian dynamic graphs. In: Proc. of PODC, pp. 213–222 (2008)
Clementi, A., Pasquale, F., Monti, A., Silvestri, R.: Communication in dynamic radio networks. In: Proc. of PODC, pp. 205–214 (2007)
Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. of Symp. on Foundations of Computer Science (2003)
Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proc. of Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 27–34 (2003)
Farach-Colton, M., Fernandes, R.J., Mosteiro, M.A.: Lower Bounds for Clear Transmissions in Radio Networks. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 447–454. Springer, Heidelberg (2006)
Fernández Anta, A., Milani, A., Mosteiro, M.A., Zaks, S.: Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 374–388. Springer, Heidelberg (2010)
Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. In: Proc. 22nd Ann. ACM Symp. on Principles of Distributed Computing (2003)
Kowalski, D.R., Pelc, A.: Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theoretical Computer Science 333, 355–371 (2005)
Kuhn, F., Locher, T., Oshman, R.: Gradient clock synchronization in dynamic networks. In: Proc. of 21st Symp. on Parallelism in Algorithms and Architectures, pp. 270–279 (2009)
Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proc. of Symp. on Theory of Computing, pp. 513–522 (2010)
Kushilevitz, E., Mansour, Y.: An Ω(Dlog(N/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing 27(3), 702–712 (1998)
Mellier, R., Myoupo, J.-F.: A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks. In: Proc. of Wksp. on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, pp. 242–245 (2005)
O’Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: Proc. of DIAL-M/POMC, pp. 104–110 (2005)
Pelusi, L., Passarella, A., Conti, M.: Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Communications Magazine 44(11), 134–141 (2006)
Roberts, L.G.: Aloha packet system with and without slots and capture. Computer Communication Review 5(2), 28–42 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Farach-Colton, M., Fernández Anta, A., Milani, A., Mosteiro, M.A., Zaks, S. (2012). Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. In: Fernández-Baca, D. (eds) LATIN 2012: Theoretical Informatics. LATIN 2012. Lecture Notes in Computer Science, vol 7256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29344-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-29344-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29343-6
Online ISBN: 978-3-642-29344-3
eBook Packages: Computer ScienceComputer Science (R0)