Achieving robust average consensus over wireless networks

This work addresses the average consensus problem over wireless networks that suffer from transmitter-based random communication losses. Two novel methods are proposed to compensate for the information that is lost during communication as a result of packet collisions. The speeds of convergence of the two methods are analytically estimated and compared with another compensation method from the literature: simulations illustrate and validate our results. Furthermore, we describe a time-slotted communication algorithm to implement the compensation methods.