Skip to Main content Skip to Navigation
Conference papers

The Weakest Oracle for Symmetric Consensus in Population Protocols

Abstract : We consider the symmetric consensus problem, a version of consensus adapted to population protocols, a model for large scale networks of resource-limited mobile sensors. After proving that consensus is impossible in the considered model, we look for oracles to circumvent this impossibility. An oracle is an external (to the system) module providing some information allowing to solve the problem. We define a class of oracles adapted to population protocols, and we prove that an oracle in this class, namely DejaVu, allows to obtain a solution. Finally, and this is the major contribution of the paper, we prove that DejaVu is the weakest oracle for solving the problem.
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Janna Burman Connect in order to contact the contributor
Submitted on : Monday, December 21, 2015 - 2:34:36 AM
Last modification on : Saturday, June 25, 2022 - 10:18:38 PM
Long-term archiving on: : Saturday, April 29, 2017 - 10:56:11 PM


Files produced by the author(s)


  • HAL Id : hal-01247021, version 1


Joffroy Beauquier, Peva Blanchard, Janna Burman, Shay Kutten. The Weakest Oracle for Symmetric Consensus in Population Protocols. 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS 2015), Sep 2015, Patras, Greece. ⟨hal-01247021⟩



Record views


Files downloads