We consider a class of distributed algorithms for computing arithmetic averages (average consensus) over networks of agents connected through digital noisy broadcast channels. Our algorithms combine error-correcting codes with the classical linear consensus iterative algorithm, and do not require the agents to have knowledge of the global network structure. We improve the performance by introducing in the state-upadate a compensation for the quantization error, avoiding its accumulation. We prove almost sure convergence to state agreement, and we discuss the speed of convergence and the distance between the asymptotic value and the average of the initial values.

Distributed averaging on digital noisy networks

CARLI, RUGGERO;
2011

Abstract

We consider a class of distributed algorithms for computing arithmetic averages (average consensus) over networks of agents connected through digital noisy broadcast channels. Our algorithms combine error-correcting codes with the classical linear consensus iterative algorithm, and do not require the agents to have knowledge of the global network structure. We improve the performance by introducing in the state-upadate a compensation for the quantization error, avoiding its accumulation. We prove almost sure convergence to state agreement, and we discuss the speed of convergence and the distance between the asymptotic value and the average of the initial values.
2011
Proceedings of the Information Theory and Applications Workshop (ITA), 2011
Information Theory and Applications Workshop (ITA), 2011
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/2532281
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
  • OpenAlex ND
social impact