Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Structural Information and Communication Complexity (SIROCCO 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11639))

  • 316 Accesses

Abstract

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.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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). https://doi.org/10.1007/s00446-005-0138-3

    Article  MATH  Google Scholar 

  2. Mocquard, Y., Anceaume, E., Sericola, B.: Optimal proportion computation with population protocols. In: Proceedings of the IEEE NCA (2016)

    Google Scholar 

  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. Sauerwald, T., Sun, H.: Tight bounds for randomized load balancing on arbitrary network topologies. In: Proceedings of the IEEE FOCS (2012)

    Google Scholar 

  5. Cordasco, G., Gargano, L.: Space-optimal proportion consensus with population protocols. In: Proceedings of the IEEE SSS (2017)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Rennes, CNRS, Inria, IRISA, Rennes, France

    Yves Mocquard

  2. Inria, University of Rennes, CNRS, IRISA, Rennes, France

    Bruno Sericola

  3. CNRS, University of Rennes, Inria, IRISA, Rennes, France

    Emmanuelle Anceaume

Authors
  1. Yves Mocquard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruno Sericola
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Emmanuelle Anceaume
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emmanuelle Anceaume .

Editor information

Editors and Affiliations

  1. Technion, Haifa, Israel

    Keren Censor-Hillel

  2. University of L'Aquila, L'Aquila, Italy

    Michele Flammini

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mocquard, Y., Sericola, B., Anceaume, E. (2019). Explicit and Tight Bounds of the Convergence Time of Average-Based Population Protocols. In: Censor-Hillel, K., Flammini, M. (eds) Structural Information and Communication Complexity. SIROCCO 2019. Lecture Notes in Computer Science(), vol 11639. Springer, Cham. https://doi.org/10.1007/978-3-030-24922-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-24922-9_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-24921-2

  • Online ISBN: 978-3-030-24922-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation