Distributed resilient consensus: a non-parametric approach.

CONSENSUS (Social sciences); ALGORITHMS

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. [ABSTRACT FROM AUTHOR]

Copyright of Transactions of the Institute of Measurement & Control is the property of Sage Publications, Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)