Explicit and Tight Bounds of the Convergence Time of Average-Based Population Protocols

  • Yves Mocquard
  • Bruno Sericola
  • Emmanuelle AnceaumeEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11639)


This paper focuses on the deep analysis of average-based problems in the population protocol model [1], a model in which agents are identically programmed, with no identity, and they progress in their computation through random pairwise interactions.


  1. 1.
    Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235–253 (2006). Scholar
  2. 2.
    Mocquard, Y., Anceaume, E., Sericola, B.: Optimal proportion computation with population protocols. In: Proceedings of the IEEE NCA (2016)Google Scholar
  3. 3.
    Mocquard, Y., Anceaume, E., Aspnes, J., Busnel, Y., Sericola, B.: Counting with population protocols. In: Proceedings of the IEEE NCA (2015)Google Scholar
  4. 4.
    Sauerwald, T., Sun, H.: Tight bounds for randomized load balancing on arbitrary network topologies. In: Proceedings of the IEEE FOCS (2012)Google Scholar
  5. 5.
    Cordasco, G., Gargano, L.: Space-optimal proportion consensus with population protocols. In: Proceedings of the IEEE SSS (2017)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Yves Mocquard
    • 1
  • Bruno Sericola
    • 2
  • Emmanuelle Anceaume
    • 3
    Email author
  1. 1.University of Rennes, CNRS, Inria, IRISARennesFrance
  2. 2.Inria, University of Rennes, CNRS, IRISARennesFrance
  3. 3.CNRS, University of Rennes, Inria, IRISARennesFrance

Personalised recommendations