Distributed minimum-time weight balancing over digraphs

Themistoklis Charalambous*, Christoforos N. Hadjicostis, Mikael Johansson

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

1 Citation (Scopus)


We address the weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology (digraph). A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role in a variety of applications, such as coordination of groups of robots, distributed decision making, and distributed averaging which is important for a wide range of applications in signal processing. We propose a distributed algorithm for solving the weight balancing problem in a minimum number of iterations, when the weights are nonnegative real numbers. We also provide examples to corroborate the proposed algorithm.

Original languageEnglish
Title of host publicationISCCSP 2014 - 2014 6th International Symposium on Communications, Control and Signal Processing, Proceedings
Number of pages4
ISBN (Print)9781479928903
Publication statusPublished - 2014
MoE publication typeA4 Article in a conference publication
EventInternational Symposium on Communications, Control, and Signal Processing - Athens, Greece
Duration: 21 May 201423 May 2014
Conference number: 6


ConferenceInternational Symposium on Communications, Control, and Signal Processing
Abbreviated titleISCCSP


Dive into the research topics of 'Distributed minimum-time weight balancing over digraphs'. Together they form a unique fingerprint.

Cite this