Edge Delay and Communication Phase in Consensus Network

Abstract

We study the basic consensus algorithms and calculate the consensus parameter for the 8 nodes 1-nearest neighbour cycle. Further, we analyze network having 3-nodes, which is an irreducible markov chain for fixed delay environment on two different edges of this network. With the help of this analysis, we check the effect over the convergence rate. Later, we study the initial working behaviour of consensus and communication phase of a 50-nodes 1-nearest neighbour cycle. Also, we calculate slot's timing along with number of transmitters in any slot. We find convergence rate bound for the 50-nodes network having 1-nearest neighbour.