Reaching approximate Byzantine consensus with multi-hop communication

Su, Lili; Vaidya, Nitin H.

doi:10.1016/j.ic.2016.12.003

Cited by 26 publications

(50 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It can also decide not to send any value. 2 As commonly done in the literature [9], [10], we assume that each normal node knows the value of f and the topology information of the graph up to l hops. Moreover, the malicious model is reasonable in applications such as wireless sensor networks, where neighbors' information is obtained by broadcast communication.…”

Section: Threat Modelmentioning

confidence: 99%

“…Compared to MSR algorithms, which do not have such detection capabilities, the algorithms are applicable to more sparse networks with the same tolerance of adversaries. Furthermore, in [10], by introducing multi-hop communication in MSR algorithms, the authors solved the approximate Byzantine consensus problem with a weaker condition on network structures compared to that derived under the one-hop communication model [13]. In [29], the authors tackled the same problem under asynchronous updates based on rounds, which is different from the asynchrony setting used in this paper (see the discussions in Section VI).…”

Section: Introductionmentioning

confidence: 99%

“…Yet, only few works have looked into resilient consensus with multi-hop communication. As mentioned earlier, the work [10] is restricted to the Byzantine adversary case. To the best of our knowledge, resilient consensus with multi-hop communication under malicious attacks still remains as an open problem.…”

Section: Introductionmentioning

confidence: 99%

“…It is hence of significant importance to extend our algorithm to the case of asynchronous updates with time delays. We must note that such a case is not considered in [10] and [30].…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, we consider the malicious model, which is suitable for broadcast network and is different from the Byzantine model studied in [10]. Then we derive necessary and sufficient graph conditions based on the new notion of robustness with l hops for the proposed MW-MSR algorithms to achieve resilient consensus under synchronous updates and asynchronous updates with time delays in the communication.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Resilient Consensus with Multi-hop Communication

Lei¹,

Ishii²

2022

Preprint

View full text Add to dashboard Cite

In this paper, we study the problem of resilient consensus for a multi-agent network where some of the nodes might be adversarial, attempting to prevent consensus by transmitting faulty values. Our approach is based on that of the so-called weighted mean subsequence reduced (W-MSR) algorithm with a special emphasis on its use in agents capable to communicate with multi-hop neighbors. The MSR algorithm is a powerful tool for achieving resilient consensus under minimal requirements for network structures, characterized by the class of robust graphs. Our analysis highlights that through multi-hop communication, the network connectivity can be reduced especially in comparison with the common one-hop communication case. Moreover, we analyze the multi-hop W-MSR algorithm with delays in communication since the values from different multi-hop neighbors may arrive at the agents at different time steps.

show abstract

Section: Threat Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…It is hence of significant importance to extend our algorithm to the case of asynchronous updates with time delays. We must note that such a case is not considered in [10] and [30].…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Resilient Consensus with Multi-hop Communication

Lei¹,

Ishii²

2022

Preprint

View full text Add to dashboard Cite

show abstract

Tolerance-Based Disruption-Tolerant Consensus in Directed Networks

Bouis,

Lowe,

Clark

et al. 2024

Studies in Computational Intelligence

View full text Add to dashboard Cite

Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

Tseng

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Fault-tolerant consensus has been studied extensively in the literature, because it is one of the most important distributed primitives and has wide applications in practice. This paper surveys important results on fault-tolerant consensus in message-passing networks, and the focus is on results from the past decade. Particularly, we categorize the results into two groups: new problem formulations and practical applications. In the first part, we discuss new ways to define the consensus problem, which includes larger input domains, link fault models, different network models . . . etc, and briefly discuss the important techniques. In the second part, we focus on Crash Fault-Tolerant (CFT) systems that use Paxos or Raft, and Byzantine Fault-Tolerant (BFT) systems. We also discuss Bitcoin, which can be related to solving Byzantine consensus in anonymous systems, and compare Bitcoin with BFT systems and Byzantine consensus.

show abstract

Reaching approximate Byzantine consensus with multi-hop communication

Cited by 26 publications

References 7 publications

Resilient Consensus with Multi-hop Communication

Resilient Consensus with Multi-hop Communication

Tolerance-Based Disruption-Tolerant Consensus in Directed Networks

Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

Contact Info

Product

Resources

About