Abstract-We study the convergence of the average consensus algorithm in wireless networks in the presence of interference. For regular lattices with periodic boundary conditions, we characterize the convergence properties of optimal MAC protocol that maximizes the speed of convergence on these networks. We provide analytical upper and lower bounds for the convergence rate. Our results show that the fastest converging interconnection topology for the consensus algorithm crucially depends on the geometry of node placement in an interferencelimited scenario.
Reference REF studies the convergence of the average consensus algorithm in wireless networks in the presence of interference and characterizes the convergence properties of an optimal Time Division Multiple Access protocol that maximises the speed of convergence on these networks.
Power-delay analysis of consensus algorithms on wireless networks with interference
2008 46th Annual Allerton Conference on Communication, Control, and Computing
2008 46th Annual Allerton Conference on Communication, Control, and Computing
Computer Science