Distributed Binary Consensus in Networks with Disturbances
ACM Transactions on Autonomous and Adaptive Systems(2015)
摘要
This article evaluates convergence rates of binary majority consensus algorithms in networks with different types of disturbances and studies the potential capacity of randomization to foster convergence. Simulation results show that (a) additive noise, topology randomness, and stochastic message loss may improve the convergence rate; (b) presence of faulty nodes degrades the convergence rate; and (c) explicit randomization of consensus algorithms can be exploited to improve the convergence rate. Watts-Strogatz and Waxman graphs are used as underlying network topologies. A consensus algorithm is proposed that exchanges state information with dynamically randomly selected neighbors and, through this randomization, achieves almost sure convergence in some scenarios.
更多查看译文
关键词
Performance,Fault Tolerance,Consensus algorithms,randomization,faulty nodes,Byzantine fault tolerance,delayed system,self-organization,density classification,majority sorting
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要