Entropy 2014, 16(5), 2820-2838; doi:10.3390/e16052820

Randomized Binary Consensus with Faulty Agents

1,2,* email and 2
Received: 30 January 2014; in revised form: 7 May 2014 / Accepted: 13 May 2014 / Published: 21 May 2014
(This article belongs to the Special Issue Entropy Methods in Guided Self-Organization)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: This paper investigates self-organizing binary majority consensus disturbed by faulty nodes with random and persistent failure. We study consensus in ordered and random networks with noise, message loss and delays. Using computer simulations, we show that: (1) explicit randomization by noise, message loss and topology can increase robustness towards faulty nodes; (2) commonly-used faulty nodes with random failure inhibit consensus less than faulty nodes with persistent failure; and (3) in some cases, such randomly failing faulty nodes can even promote agreement.
Keywords: binary consensus; randomized consensus; self-organizing systems; faulty agents; Byzantine failure; density classification
PDF Full-text Download PDF Full-Text [712 KB, uploaded 21 May 2014 14:58 CEST]

Export to BibTeX |

MDPI and ACS Style

Gogolev, A.; Marcenaro, L. Randomized Binary Consensus with Faulty Agents. Entropy 2014, 16, 2820-2838.

AMA Style

Gogolev A, Marcenaro L. Randomized Binary Consensus with Faulty Agents. Entropy. 2014; 16(5):2820-2838.

Chicago/Turabian Style

Gogolev, Alexander; Marcenaro, Lucio. 2014. "Randomized Binary Consensus with Faulty Agents." Entropy 16, no. 5: 2820-2838.

Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert