Pseudo Multi-hop Distributed Consensus Algorithm with Link Failure

Abstract

For network congestion in the communication among agents, there are often random communication link failures among agents. The convergence performance of the distributed consensus algorithm with link failure become bad, even become diverged, and the rate of convergence of the algorithm become smaller. In this paper, we analyze the pseudo multi-hop distributed consensus algorithm with link failures, and research the relation between convergence performance and the probability of link failures. Simulation results are provided to verify these analytical results.