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.


Publié dans:
IEEE, ICASSP 2009, 3661-3664
Présenté à:
ICASSP 2009, Taipei, Taiwan, April 19-24, 2009
Année
2009
Mots-clefs:
Laboratoires:




 Notice créée le 2009-02-10, modifiée le 2019-03-31

n/a:
Télécharger le documentPDF
Lien externe:
Télécharger le documentURL
Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)