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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 2010
Accession Number
ADA554337

Entities

People

  • Ananthram Swami
  • Anna Scaglione
  • Kevin C Chan
  • Qing Zhao

Organizations

  • United States Army Research Laboratory

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Collision Avoidance
  • Collisions
  • Consensus Algorithms
  • Convergence
  • Energy Consumption
  • Monte Carlo Method
  • Networks
  • Probability
  • Ring Networks
  • Scheduling (Production)
  • Sensor Networks
  • Simulations
  • Topology
  • Two Dimensional
  • Unmanned Vehicles
  • Wireless Networks

Fields of Study

  • Mathematics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Graph Algorithms and Convex Optimization.
  • Radio communications and signal processing.