TY - GEN
T1 - Consensus algorithms over fading channels
AU - Chan, Kevin
AU - Swami, Ananthram
AU - Zhao, Qing
AU - Scaglione, Anna
PY - 2010/12/1
Y1 - 2010/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=79951665910&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79951665910&partnerID=8YFLogxK
U2 - 10.1109/MILCOM.2010.5680428
DO - 10.1109/MILCOM.2010.5680428
M3 - Conference contribution
AN - SCOPUS:79951665910
SN - 9781424481804
T3 - Proceedings - IEEE Military Communications Conference MILCOM
SP - 549
EP - 554
BT - 2010 IEEE Military Communications Conference, MILCOM 2010
T2 - 2010 IEEE Military Communications Conference, MILCOM 2010
Y2 - 31 October 2010 through 3 November 2010
ER -