Distributed averaging on digital erasure networks

Abstract : Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do not require the agents to have any knowledge about the global network structure or size. Almost sure convergence to state agreement is proved, and the communication and computational complexities of the algorithms are analyzed. Both the number of transmissions and the number of computations performed by each agent of the network are shown to grow not faster than poly-logarithmically in the desired precision. The impact of the graph topology on the algorithms' performance is analyzed as well. Moreover, it is shown how, in the presence of noiseless communication feedback, one can modify the algorithms, significantly improving their performance versus complexity trade-off.
Liste complète des métadonnées

https://hal.inria.fr/inria-00541039
Contributeur : Federica Garin <>
Soumis le : lundi 29 novembre 2010 - 16:39:42
Dernière modification le : mercredi 17 juin 2015 - 01:14:26

Identifiants

Collections

Citation

Ruggero Carli, Giacomo Como, Paolo Frasca, Federica Garin. Distributed averaging on digital erasure networks. Automatica, Elsevier, 2011, 47 (1), pp.115-121. 〈10.1016/j.automatica.2010.10.015〉. 〈inria-00541039〉

Partager

Métriques

Consultations de la notice

350