Reaching consensus in asynchronous WSNs: Algebraic approach

Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our investigations of distributed algorithms solving consensus problems on more realistic, asynchronous networks in which nodes randomly transmit to their neighborhood. Following a linear algebraic approach we show conditions for convergence to a consensus and derive convergence properties in the mean and mean square sense.