- freely available
Randomized Binary Consensus with Faulty Agents
AbstractThis 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.
Share & Cite This Article
Gogolev, A.; Marcenaro, L. Randomized Binary Consensus with Faulty Agents. Entropy 2014, 16, 2820-2838.View more citation formats
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.
Notes: Multiple requests from the same IP address are counted as one view.