Approximate byzantine consensus in faulty asynchronous networks

Haseltalab, Ali; Akar, Mehmet

doi:10.1109/acc.2015.7170960

Cited by 17 publications

(9 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The conditions given in Theorem 1 are equivalent to the conditions that are required for the success of the fault-tolerant algorithms given by Haseltalab and Akar (2015a); LeBlanc et al (2013) when the fault model is assumed to be Byzantine, and that are required for the success of the D-FDA given in Algorithm 1. Therefore, all non-faulty nodes implement the D-FDA to determine f i = f and then they use the MSR algorithm with parameter f i = f to achieve approximate Byzantine consensus.…”

Section: Np-rca and Its Convergence Analysismentioning

confidence: 99%

“…The convergence analysis of the W-MSR algorithm has been carried out by using the concept of network robustness. Haseltalab and Akar (2015a) proposed an MSR algorithm that solves the approximate Byzantine consensus problem independent of synchronicity of the network and time delays. They have shown that the proposed MSR algorithm can also be implemented in time-varying networks.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Distributed resilient consensus: a non-parametric approach

Oksuz

Akar

2018

Transactions of the Institute of Measurement and Control

Self Cite

View full text Add to dashboard Cite

In this paper, two parameter-independent fault-tolerant consensus algorithms are proposed to address the consensus problem in the presence of misbehaving agents. The first algorithm relies on adaptively estimating the number of faulty agents in the network by using a distributed fault-detection scheme. It is shown that this algorithm converges if the network of non-faulty agents is (f+1)-robust, where f is the number of faulty agents in the network. The second algorithm is a non-parametric Mean-Subsequence-Reduced algorithm whose convergence is guaranteed if the network of non-faulty nodes is (f+1)-robust and all non-faulty nodes have the same number of in-neighbours. Neither algorithm requires initial knowledge on the number of faulty agents in the network. The efficacy of the algorithms are illustrated with simulation results.

show abstract

Section: Np-rca and Its Convergence Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Distributed resilient consensus: a non-parametric approach

Oksuz

Akar

2018

Transactions of the Institute of Measurement and Control

Self Cite

View full text Add to dashboard Cite

show abstract

“…Kieckhafer and Azadmanesh studied the behavior of iterative algorithms (i.e., memory-less algorithms) and proved some lower bounds under Mixed-Mode faults model, where nodes may suffer crash, omission, symmetric, and/or asymmetric Byzantine failures [13]. Researchers also studied iterative approximate consensus under different communication assumptions, including arbitrary communication networks [19], networks with transient link faults [18], and timevarying networks [10] · · · etc. These works only assumed fixed fault model.…”

Section: Related Workmentioning

confidence: 99%

An Improved Approximate Consensus Algorithm in the Presence of Mobile Faults

Tseng

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each pair of nodes is able to communicate with each other directly and reliably. We consider the mobile Byzantine fault model proposed by Garay '94 -in the model, an omniscient adversary can corrupt up to f nodes in each round, and at the beginning of each round, faults may "move" in the system (i.e., different sets of nodes may become faulty in different rounds). Recent work by Bonomi et al. '16 proposed a simple iterative approximate consensus algorithm which requires at least 4f + 1 nodes. This paper proposes a novel technique of using "confession" (a mechanism to allow others to ignore past behavior) and a variant of reliable broadcast to improve the fault-tolerance level. In particular, we present an approximate consensus algorithm that requires only ⌈7f /2⌉ + 1 nodes, an ⌊f /2⌋ improvement over the state-of-the-art algorithms. Moreover, we also show that the proposed algorithm is optimal within a family of round-based algorithms.

show abstract

“…Recently, the time synchronization based on consensus algorithms for WSNs under attacks has been explored in [8], [10]- [14]. A common approach that filters the information received from one's neighbors to ensure robustness has been introduced for the study of resilient consensus problem in recent works [15]- [18], and has been extended a family of algorithms, called the Weighted Mean-Subsequence-Reduced (W-MSR) algorithm [19]. The basic idea of W-MSR is to eliminate the constant number of maximum and minimum values that each node received from its neighbors.…”

Section: Introductionmentioning

confidence: 99%

“…On the other hand, consensus in asynchronous networks is a more realistic case facing practical problems, since node independently updates its state at times determined by its own clock in real environments [5]- [7]. The resilient consensus problem in asynchronous networks is studied in [18], [28], [29]. However, in these mentioned works, they all assumed that the topology of the underlying graph is fixed during the whole consensus process.…”

Section: Introductionmentioning

confidence: 99%

Resilient Consensus-Based Time Synchronization in Asynchronous Sensor Networks

Huang

Zheng

et al. 2019

IEEE Access

View full text Add to dashboard Cite

This paper addresses the time synchronization problem of asynchronous wireless sensor networks (WSNs) under false data injection attacks. First, we extend the fundamental metric of r-robustness with the notion of trusted links and then show that the structural robustness of networks can be significantly improved without adding additional links after setting a small subset of links to be trusted. Then, for a more practical case where the intercommunication topologies between each sensor node are time-varying, we develop a resilient consensus-based distributed algorithm where the sampling period is allowed to be chosen by each sensor independently and it is shown that the time synchronization problem for WSNs can be solved via the proposed controller. Numerical simulations are conducted to illustrate the effectiveness of our proposed method. INDEX TERMS Resilient consensus, false data injection attacks, time synchronization, asynchronous, timevarying, trusted link.

show abstract

Approximate byzantine consensus in faulty asynchronous networks

Cited by 17 publications

References 14 publications

Distributed resilient consensus: a non-parametric approach

Distributed resilient consensus: a non-parametric approach

An Improved Approximate Consensus Algorithm in the Presence of Mobile Faults

Resilient Consensus-Based Time Synchronization in Asynchronous Sensor Networks

Contact Info

Product

Resources

About