Consensus algorithms over fading channels

Kevin Chan, Ananthram Swami, Qing Zhao, Anna Scaglione

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

10 Citations (Scopus)

Abstract

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 publicationProceedings - IEEE Military Communications Conference MILCOM
Pages549-554
Number of pages6
DOIs
StatePublished - 2010
Externally publishedYes
Event2010 IEEE Military Communications Conference, MILCOM 2010 - San Jose, CA, United States
Duration: Oct 31 2010Nov 3 2010

Other

Other2010 IEEE Military Communications Conference, MILCOM 2010
CountryUnited States
CitySan Jose, CA
Period10/31/1011/3/10

Fingerprint

Fading channels
Scheduling
Topology
Statistics
Communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Chan, K., Swami, A., Zhao, Q., & Scaglione, A. (2010). Consensus algorithms over fading channels. In Proceedings - IEEE Military Communications Conference MILCOM (pp. 549-554). [5680428] https://doi.org/10.1109/MILCOM.2010.5680428

Consensus algorithms over fading channels. / Chan, Kevin; Swami, Ananthram; Zhao, Qing; Scaglione, Anna.

Proceedings - IEEE Military Communications Conference MILCOM. 2010. p. 549-554 5680428.

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

Chan, K, Swami, A, Zhao, Q & Scaglione, A 2010, Consensus algorithms over fading channels. in Proceedings - IEEE Military Communications Conference MILCOM., 5680428, pp. 549-554, 2010 IEEE Military Communications Conference, MILCOM 2010, San Jose, CA, United States, 10/31/10. https://doi.org/10.1109/MILCOM.2010.5680428
Chan K, Swami A, Zhao Q, Scaglione A. Consensus algorithms over fading channels. In Proceedings - IEEE Military Communications Conference MILCOM. 2010. p. 549-554. 5680428 https://doi.org/10.1109/MILCOM.2010.5680428
Chan, Kevin ; Swami, Ananthram ; Zhao, Qing ; Scaglione, Anna. / Consensus algorithms over fading channels. Proceedings - IEEE Military Communications Conference MILCOM. 2010. pp. 549-554
@inproceedings{9f58f8f276f441d09613e33b4743fdc6,
title = "Consensus algorithms over fading channels",
abstract = "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.",
author = "Kevin Chan and Ananthram Swami and Qing Zhao and Anna Scaglione",
year = "2010",
doi = "10.1109/MILCOM.2010.5680428",
language = "English (US)",
isbn = "9781424481804",
pages = "549--554",
booktitle = "Proceedings - IEEE Military Communications Conference MILCOM",

}

TY - GEN

T1 - Consensus algorithms over fading channels

AU - Chan, Kevin

AU - Swami, Ananthram

AU - Zhao, Qing

AU - Scaglione, Anna

PY - 2010

Y1 - 2010

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

SN - 9781424481804

SP - 549

EP - 554

BT - Proceedings - IEEE Military Communications Conference MILCOM

ER -