Communication cost of consensus for nodes with limited memory

Proc. Natl. Acad. Sci. USA, pp. 5624-5630, 2020.

Cited by: 0|Bibtex|Views37|DOI:https://doi.org/10.1073/pnas.1912980117
WOS EI
Other Links: pubmed.ncbi.nlm.nih.gov|academic.microsoft.com|arxiv.org|dblp.uni-trier.de

Abstract:

Motivated by applications in wireless networks and the Internet of Things, we consider a model of n nodes trying to reach consensus with high probability on their majority bit. Each node i is assigned a bit at time 0 and is a finite automaton with m bits of memory (i.e., [Formula: see text] states) and a Poisson clock. When the clock of i...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments