Cart (Loading....) | Create Account
Close category search window

Robust average consensus using Total Variation Gossip Algorithm

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

3 Author(s)
Ben-Ameur, W. ; Inst. Mines-Telecom, Telecom SudParis, Evry, France ; Bianchi, P. ; Jakubowicz, J.

Consider a connected network of N agents observing N arbitrary samples. We investigate distributed algorithms, also known as gossip algorithms, whose aim is to compute the sample average by means of local computations and nearby information sharing between agents. First, we analyze the convergence of some widespread gossip algorithms in the presence of misbehaving (stubborn) agents which permanently introduce some false value inside the distributed averaging process. We show that the network is driven to a state which exclusively depends on the stubborn agents. Second, we introduce a novel gossip algorithm called Total Variation Gossip Algorithm. We show that, provided that the sample vector satisfies some regularity condition, the final estimate of the network remains close to the sought consensus, and is unsensitive to large perturbations of stubborn agents. Numerical experiments complete our theoretical results.

Published in:

Performance Evaluation Methodologies and Tools (VALUETOOLS), 2012 6th International Conference on

Date of Conference:

9-12 Oct. 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.