Consensus algorithms over fading channels

Consensus algorithms permit the computation of global statistics via local communications and without centralized control. We extend previous results by taking into account fading and unidirectional links in ring and random 2-D topologies. We study conditions for convergence and present simulation results to verify the analytical results in this paper. We compare the performance of consensus algorithms with a tree-based (centralized) approach. Additionally, we implement a slotted ALOHA protocol and compare its performance to that under the initial assumption of perfect scheduling.