Abstract

In this paper, we analyze distributed average consensus algorithms, both deterministic and gossip based, with respect to a new metric related to the energy cost of communication among agents. We first introduce a new notion of communication complexity as a metric to assess the energy efficiency properties of consensus algorithms. We provide explicit formulas to compute the communication complexity of deterministic algorithms and gossip based algorithms depending on different stopping criteria. We also show that the gossip based algorithms have less communication complexity than the deterministic counterparts under mild conditions, usually satisfied by a large number of networks. We also show that the gossip algorithm with minimum communication complexity can be effectively computed as the solution of a convex optimization problem.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.