Skip to main content
SpringerLink
Log in

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

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aspnes J., Ruppert E.: An introduction to population protocols. Bull. Eur. Assoc. Theor. Comput. Sci. 93, 98–117 (2007)

    MathSciNet  MATH  Google Scholar 

  2. Awerbuch, B., Even, S.: Efficient and reliable broadcast is achievable in an eventually connected network (extended abstract). In: Proceedins of 3rd Annual ACM Symposium on Principles of Distributed Computing, pp. 278–281 (1984)

  3. Awerbuch, B., Patt-Shamir, B., Peleg, D., Saks, M.: Adapting to asynchronous dynamic networks (extended abstract). In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 557–570 (1992)

  4. Baldoni, R., Ioannidou, K., Milani, A.: Mobility versus the cost of geocasting in mobile ad-hoc networks. In: Proceedings of the 21st Annual EATCS International Symposium on Distributed Computing, Lecture Notes in Computer Science, vol. 4731, pp. 48–62. Springer, Berlin (2007)

  5. 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. J. Comput. Syst. Sci. 45, 104–126 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, pp. 260–269 (2009)

  7. Boldrini, C., Conti, M., Passarella, A.: Modelling data dissemination in opportunistic networks. In: CHANTS ’08: Proceedings of the third ACM workshop on Challenged networks, pp. 89–96 (2008)

  8. Bruschi D., Pinto M.D.: Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10(3), 129–135 (1997)

    Article  Google Scholar 

  9. Chlebus, B., Ga̧sieniec, L., Lingas, A., Pagourtzis, A.: Oblivious gossiping in ad-hoc radio networks. In: Proceedings of 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 44–51 (2001)

  10. Chlebus B.S., Ga̧sieniec L., Gibbons A., Pelc A., Rytter W.: Deterministic broadcasting in unknown radio networks. Distrib. Comput. 15, 27–38 (2002)

    Article  Google Scholar 

  11. Chlebus, B.S., Kowalski, D.R., Radzik, T.: On many-to-many communication in packet radio networks. In: Proceedings of the 10th International Conference on Principles of Distributed Systems, pp. 258–272 (2006)

  12. Clementi, A., Macci, C., Pasquale, F., Monti, A., Silvestri, R.: Flooding time in edge-markovian dynamic graphs. In: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing, pp. 213–222 (2008)

  13. Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (2001)

  14. Clementi A., Monti A., Silvestri R.: Round robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distrib. Comput. 64(1), 89–96 (2004)

    Article  MATH  Google Scholar 

  15. Clementi, A., Pasquale, F., Monti, A., Silvestri, R.: Communication in dynamic radio networks. In: Proceedings of 26th Annual ACM Symposium on Principles of Distributed Computing, pp. 205–214 (2007)

  16. Clementi, A., Pasquale, F., Monti, A., Silvestri, R.: Information spreading in stationary markovian evolving graphs. In: Proceedings of 23rd IEEE International Parallel and Distributed Processing Symposium (2009)

  17. Dessmark A., Pelc A.: Broadcasting in geometric radio networks. J. Discret. Algorithms 5, 187–201 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  18. Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pp. 27–34 (2003)

  19. Farach-Colton, M., Mosteiro, M.A.: Sensor network gossiping or how to break the broadcast lower bound. In: Proceedings of the 18th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 4835, pp. 232–243. Springer, Berlin (2007)

  20. Fernández Anta, A., Milani, A.: Bounds for deterministic reliable geocast in mobile ad-hoc networks. In: Proceedings of the 12th International Conference on Principles of Distributed Systems, pp. 164–183 (2008)

  21. Fernández Anta, A., Milani, A., Mosteiro, M.A., Zaks, S.: Opportunistic information dissemination in mobile ad-hoc networks: the prot of global synchrony. In: Proceedings of the 24th International Symposium on Distributed Computing. Lecture Notes in Computer Science, vol. 6343, pp. 374–388. Springer, Berlin (2010)

  22. Fernández Anta, A., Mosteiro, M.A., Thraves, C.: Deterministic communication in the weak sensor model. In: Proceedings of the 11th International Conference on Principles of Distributed Systems, pp. 119–131 (2007)

  23. Fischer M.J., Lynch N.A., Paterson M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  24. Gallager R.G., Humblet P.A., Spira P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5(1), 66–77 (1983)

    Article  MATH  Google Scholar 

  25. Gasieniec, L., Kranakis, E., Pelc, A., Xin, Q.: Deterministic m2m multicast in radio networks. In: Proceedings of 31st International Colloquium on Automata Languages and Programming, pp. 670–682 (2004)

  26. Ga̧sieniec, L., Pelc, A., Peleg, D., Emek, Y., Kantor, E., Su, C.: Broadcasting in udg radio networks with unknown topology. In: Proceedings of 26th Annual ACM Symposium on Principles of Distributed Computing (2007)

  27. Guan, X.: Better face routing protocols. In: Dolev, S. (ed.) Algosensors. Lecture Notes in Computer Science, vol. 5804, pp. 167–178. Springer, Berlin (2009)

  28. Gupta, S., Srimani, P.: An adaptive protocol for reliable multicast in mobile multi-hop radio networks. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (1999)

  29. Humblet, P.: Selecting a leader in a clique in o(n log n) messages. In: Proceedings of 23rd Conference on Decision and Control, p. 11391140 (1984)

  30. Jinag, X., Camp, T.: A review of geocasting protocols for a mobile ad hoc network. In: Proceedings of Grace Hopper Celebration (2002)

  31. Korach E., Moran S., Zaks S.: Optimal lower bounds for some distributed algorithms for a complete network of processors. Theor. Comput. Sci. 64(1), 125–132 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  32. Kowalski, D.R.: On selection problem in radio networks. In: Proceedings of 24th Annual ACM Symposium on Principles of Distributed Computing, pp. 158–166 (2005)

  33. Kowalski D.R., Pelc A.: Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theor. Comput. Sci. 333, 355–371 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  34. Kuhn, F., Locher, T., Oshman, R.: Gradient clock synchronization in dynamic networks. In: SPAA ’09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, pp. 270–279 (2009)

  35. Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of the 42th Annual ACM Symposium on Theory of Computing, pp. 513–522 (2010)

  36. Kushilevitz E., Mansour Y.: An Ω(D log(N/D)) lower bound for broadcast in radio networks. SIAM J. Comput. 27(3), 702–712 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  37. Mitrinović D.S.: Elementary Inequalities. P. Noordhoff Ltd, Groningen (1964)

    MATH  Google Scholar 

  38. Mohsin, M., Cavin, D., Sasson, Y., Prakash, R., Schiper, A.: Reliable broadcast in wireless mobile ad hoc networks. In: Proceedings of the 39th Hawaii International Conference on System Sciences, p. 233 (2006)

  39. O’Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: Proceedings of the Workshop on Foundations of Mobile Computing, pp. 104–110 (2005)

  40. O’Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: DIALM-POMC ’05: Proceedings of the 2005 joint workshop on Foundations of mobile computing, pp. 104–110. ACM, New York, NY, USA (2005)

  41. Pagani, E., Rossi, G.: Reliable broadcast in mobile multihop packet networks. In: Proceedings of the 3rd ACM Annual International Conference on Mobile Computing and Networking, pp. 34–42 (1997)

  42. Peleg, D., Radzik, T.: Time-efficient broadcast in radio networks. In: Koster, A.M.C.A., Muñoz, X. (eds.) Graphs and Algorithms in Communication Networks, chapt. 12, pp. 315–339. Springer, Berlin (2009)

  43. Pelusi L., Passarella A., Conti M.: Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. Commun. Mag. IEEE 44(11), 134–141 (2006)

    Article  Google Scholar 

  44. Prakash, R., Schiper, A., Mohsin, M., Cavin, D., Sasson, Y.: A lower bound for broadcasting in mobile ad hoc networks. Technical Report, Ecole Polytechnique Federale de Lausanne (2004)

  45. Roberts L.G.: Aloha packet system with and without slots and capture. Comput. Commun. Rev. 5(2), 28–42 (1975)

    Article  Google Scholar 

  46. Rosser J.B., Schoenfeld L.: Approximate formulas for some functions of prime numbers. Ill. J. Math. 6(1), 64–94 (1962)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute IMDEA Networks, Madrid, Spain

    Antonio Fernández Anta

  2. LABRI, Université Bordeaux 1, Talence, France

    Alessia Milani

  3. Computer Science Department, Rutgers University, Piscataway, NJ, USA

    Miguel A. Mosteiro

  4. LADyR, GSyC, Universidad Rey Juan Carlos, Móstoles, Spain

    Miguel A. Mosteiro

  5. Department of Computer Science, Technion, Haifa, Israel

    Shmuel Zaks

Authors
  1. Antonio Fernández Anta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alessia Milani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Miguel A. Mosteiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shmuel Zaks
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Miguel A. Mosteiro.

Additional information

A preliminary version of this work is included in [21].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fernández Anta, A., Milani, A., Mosteiro, M.A. et al. Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Distrib. Comput. 25, 279–296 (2012). https://doi.org/10.1007/s00446-012-0165-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-012-0165-9

Keywords

Search

Navigation