Pseudo multi-hop relay distributed consensus algorithm

In order to accelerate the convergence rate of distributed consensus problems and reduce the communication costs among nodes.A new distributed consensus algorithm with single-hop communication is presented.The new algorithm makes use of the previous information of non-adjacent nodes to update the states of the nodes.We prove that the algorithm is convergent under undirected topology,and calculate the communication volume and convergence rate of the new algorithm. By analyzing and simulating on the new algorithm,the convergence rate of the new algorithm is higher,the communication mode is simpler and the communication overload is less in the new algorithm,and communication data are not easy to lose under communication time-delays.