Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2011-06-15
Computer Science
Distributed, Parallel, and Cluster Computing
53 pages, 2 figures, 1 table. Short version submitted to IEEE Trans. Signal Processing
Scientific paper
We consider the average-consensus problem in a multi-node network of finite size. Communication between nodes is modeled by a sequence of directed signals with arbitrary communication delays. Four distributed algorithms that achieve average-consensus are proposed. Necessary and sufficient communication conditions are given for each algorithm to achieve average-consensus. Resource costs for each algorithm are derived based on the number of scalar values that are required for communication and storage at each node. Numerical examples are provided to illustrate the empirical convergence rate of the four algorithms in comparison with a well-known "gossip" algorithm as well as a randomized information spreading algorithm when assuming a fully connected random graph with instantaneous communication.
Krishnamurthy Vikram
Topley Kevin
No associations
LandOfFree
Average-Consensus Algorithms in a Deterministic Framework does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Average-Consensus Algorithms in a Deterministic Framework, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average-Consensus Algorithms in a Deterministic Framework will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-659965