Cooperative Power Scheduling for a Network of MIMO Links

Abstract

A cooperative power scheduling algorithm developed by Wang, Krunz and Cui is extended for an ad hoc network of MIMO links. This algorithm, referred to as pricebased iterative water filling (PIWF) algorithm, is a distributed algorithm by which each link computes its power scheduling through an iterative and cooperative process. The cooperation among all links is achieved by adaptive price factors applied by each link. Compared to a centralized power scheduling algorithm, the PIWF algorithm is much more efficient in computation although not as efficient in network throughput. Compared to a non-cooperative counter-part by Demirkol and Ingram where all price factors are zero, the PIWF algorithm requires additional in-network computation but is more efficient in network throughput.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 08, 2010
Accession Number
ADA515832

Entities

People

  • Xiang Dong
  • Yingbo Hua
  • Yue Rong

Organizations

  • University of California, Riverside

Tags

DTIC Thesaurus Topics

  • Ad Hoc Networks
  • Algorithms
  • Channel Estimation
  • Computations
  • Cooperation
  • Electronic Mail
  • Engineering
  • Mesh Networks
  • Multiple Input Multiple Output
  • Network Topology
  • Networks
  • Peak Power
  • Scheduling (Production)
  • Simulations
  • Throughput
  • Wireless Communications
  • Wireless Networks

Fields of Study

  • Computer science

Readers

  • Approximation Theory.
  • Computer Networking