2011/06/15 by Kevin Topley, Vikram Krishnamurthy, Topley, Kevin +1
Computer Science · #Cooperative Communication and Network Coding #Distributed #Distributed Control Multi-Agent Systems #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Opportunistic and Delay-Tolerant Networks #Optimization and Control (math.OC) #Parallel #Systems and Control (eess.SY) #and Cluster Computing (cs.DC) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1106.4346
openalex publication_date 2011/06/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.