Exact Byzantine Consensus on Arbitrary Directed Graphs under Local Broadcast Model
Muhammad Samir Khan, Lewis Tseng, Nitin H. Vaidya

TL;DR
This paper establishes tight conditions for achieving Byzantine consensus in directed graphs under the local broadcast model, highlighting how asymmetric communication affects fault tolerance in wireless networks.
Contribution
It provides the first tight conditions for Byzantine consensus in directed graphs with local broadcast communication, extending prior undirected graph results.
Findings
Derived necessary and sufficient conditions for consensus
Identified the impact of link directionality on fault tolerance
Enhanced understanding of wireless network communication constraints
Abstract
We consider Byzantine consensus in a synchronous system where nodes are connected by a network modeled as a directed graph, i.e., communication links between neighboring nodes are not necessarily bi-directional. The directed graph model is motivated by wireless networks wherein asymmetric communication links can occur. In the classical point-to-point communication model, a message sent on a communication link is private between the two nodes on the link. This allows a Byzantine faulty node to equivocate, i.e., send inconsistent information to its neighbors. This paper considers the local broadcast model of communication, wherein transmission by a node is received identically by all of its outgoing neighbors. This allows such neighbors to detect a faulty node's attempt to equivocate, effectively depriving the faulty nodes of the ability to send conflicting information to different…
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.
