Interval consensus: from quantized gossip to voting

We design distributed and quantized average consensus algorithms on arbitrary connected networks. By construction, quantized algorithms cannot produce a real, analog average. Instead, our algorithm reaches consensus on the quantized interval that contains the average. We prove that this consensus in reached in finite time almost surely. As a byproduct of this convergence result, we show that the majority voting problem is solvable with only 2 bits of memory per agent.


Published in:
IEEE, ICASSP 2009, 3661 - 3664
Presented at:
ICASSP 2009, Taipei, Taiwan, April 19-24, 2009
Year:
2009
Keywords:
Laboratories:




 Record created 2009-02-10, last modified 2018-11-19

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)