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

A Gossip-Based Algorithm for Discrete Consensus Over Heterogeneous Networks

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)
Franceschelli, M. ; Dipt. di Ing. Elettr. ed Elettron., Univ. di Cagliari, Cagliari, Italy ; Giua, A. ; Seatzu, C.

Quantized consensus assumes that the state of each node may only take nonnegative integer values. Reaching consensus under quantization is equivalent to determining a balanced assignment of identical tasks to nodes. In this note, we generalize this problem in two ways and denote the resulting framework discrete consensus. First, we consider tasks that are not identical: each one is characterized by its own weight. Secondly, we assume that nodes are not identical as well. As an example, in the case of task assignment, that we consider as a reference problem in this framework, nodes may have different speeds and should be assigned a total weight proportional to their speed. We provide a gossip-based distributed algorithm that aims to minimize the maximum execution time over nodes, whose convergence to a bounded set is guaranteed. We show that the convergence time of the proposed algorithm relies ultimately on the average meeting time between two agents performing a random walk on a graph.

Published in:

Automatic Control, IEEE Transactions on  (Volume:55 ,  Issue: 5 )

Date of Publication:

May 2010

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.