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

https://hal.archives-ouvertes.fr/hal-01170575
Contributor : Emmanuelle Anceaume <>
Submitted on : Wednesday, July 1, 2015 - 5:23:24 PM
Last modification on : Tuesday, January 22, 2019 - 8:12:10 PM
Long-term archiving on : Tuesday, April 25, 2017 - 9:15:11 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01170575, version 1

Citation

Yves Mocquard, Emmanuelle Anceaume, James Aspnes, Yann Busnel, Bruno Sericola. Counting with Population Protocols. 2015. ⟨hal-01170575⟩

Share

Metrics

Record views

1818

Files downloads

299