Tree Codes Improve Convergence Rate of Consensus Over Erasure Channels
Ravi Teja Sukhavasi, Babak Hassibi

TL;DR
This paper demonstrates that channel coding, especially tree codes, can significantly improve the convergence of consensus algorithms over unreliable erasure channels, ensuring accurate average consensus even with asymmetric link failures.
Contribution
The paper introduces the use of tree codes to guarantee average consensus over asymmetric erasure channels, a novel approach in consensus algorithms.
Findings
Repetition codes can accelerate convergence under symmetric erasures.
Tree codes enable consensus to the true average in asymmetric erasure scenarios.
Convergence rate with coding is often faster than traditional noisy link methods.
Abstract
We study the problem of achieving average consensus between a group of agents over a network with erasure links. In the context of consensus problems, the unreliability of communication links between nodes has been traditionally modeled by allowing the underlying graph to vary with time. In other words, depending on the realization of the link erasures, the underlying graph at each time instant is assumed to be a subgraph of the original graph. Implicit in this model is the assumption that the erasures are symmetric: if at time t the packet from node i to node j is dropped, the same is true for the packet transmitted from node j to node i. However, in practical wireless communication systems this assumption is unreasonable and, due to the lack of symmetry, standard averaging protocols cannot guarantee that the network will reach consensus to the true average. In this paper we explore…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
