Counting with Population Protocols

Abstract : —The population protocol model provides theoretical foundations for analyzing the properties emerging from simple and pairwise interactions among a very large number n of anonymous agents. The problem tackled in this paper is the following one: is there an efficient population protocol that exactly counts the difference κ between the number of agents that initially and independently set their state to A and the one that initially set it to B, assuming that each agent only uses a finite set of states ? We propose a solution which guarantees with any high probability that after O(log n) interactions any agent outputs the exact value of κ. Simulation results illustrate our theoretical analysis.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download
Contributor : Emmanuelle Anceaume <>
Submitted on : Tuesday, September 1, 2015 - 12:29:35 PM
Last modification on : Thursday, February 7, 2019 - 3:47:25 PM
Long-term archiving on : Wednesday, April 26, 2017 - 11:03:03 AM


Files produced by the author(s)


  • HAL Id : hal-01189596, version 1


Yves Mocquard, Emmanuelle Anceaume, James Aspnes, Yann Busnel, Bruno Sericola. Counting with Population Protocols. International Symposium on Network Computing and Applications (NCA), IEEE, Sep 2015, Boston, United States. pp.9. ⟨hal-01189596⟩



Record views


Files downloads