Communication cost of consensus for nodes with limited memory
Proc. Natl. Acad. Sci. USA, pp. 5624-5630, 2020.
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
PPT (Upload PPT)