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 r...

Full description

Saved in:
Bibliographic Details
Main Authors: Chan, Kevin, Swami, Ananthram, Zhao, Qing, Scaglione, Anna
Format: Report
Language:English
Subjects:
ALGORITHMS
CHANNELS
COMMUNICATION AND RADIO SYSTEMS
FADING(ELECTROMAGNETIC WAVES)
PERFORMANCE(ENGINEERING)
Radiofrequency Wave Propagation
SYMPOSIA
TOPOLOGY
TWO DIMENSIONAL
UNIDIRECTIONAL
VERIFICATION
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. Presented at the Proceedings of IEEE Military Communication Conference (MILCOM) held in San Jose, CA on 31 Oct-3 Nov 2010.