Consensus algorithms over fading channels

Kevin Chan, Ananthram Swami, Qing Zhao, Anna Scaglione

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Scopus citations


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.

Original languageEnglish (US)
Title of host publication2010 IEEE Military Communications Conference, MILCOM 2010
Number of pages6
StatePublished - Dec 1 2010
Externally publishedYes
Event2010 IEEE Military Communications Conference, MILCOM 2010 - San Jose, CA, United States
Duration: Oct 31 2010Nov 3 2010

Publication series

NameProceedings - IEEE Military Communications Conference MILCOM


Other2010 IEEE Military Communications Conference, MILCOM 2010
Country/TerritoryUnited States
CitySan Jose, CA

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Consensus algorithms over fading channels'. Together they form a unique fingerprint.

Cite this