By Topic

Average consensus by gossip algorithms with quantized communication

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Frasca, P. ; Dipt. di Mat., Politec. di Torino, Torino, Italy ; Carli, R. ; Fagnani, F. ; Zampieri, S.

This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to the average value, up to the size of the quantization bins, whenever the the graph is connected. Moreover, its speed of convergence is estimated.

Published in:

Decision and Control, 2008. CDC 2008. 47th IEEE Conference on

Date of Conference:

9-11 Dec. 2008