In a network, a distributed consensus algorithm is fully characterized by its weighting\nmatrix. Although there exist numerical methods for obtaining the optimal weighting matrix,\nwe have not found an in-network implementation of any of these methods that works for all\nnetwork topologies. In this paper, we propose an in-network algorithm for finding such an optimal\nweighting matrix.
Loading....