Cooperative power scheduling for a network of MIMO links

Authors:
Xiang Dong;Yue Rong;Yingbo Hua
Affiliations:
Department of Electrical Engineering, University of California, Riverside, CA;Department of Electrical and Computer Engineering, Curtin University of Technology, Bentley, WA;Department of Electrical Engineering, University of California, Riverside, CA
Venue:
IEEE Transactions on Wireless Communications
Year:
2010

Citing 7
Cited 0

A utility-based power-control scheme in wireless cellular systems

IEEE/ACM Transactions on Networking (TON)
Fundamentals of wireless communication

Fundamentals of wireless communication
Optimized signaling for MIMO interference systems with feedback

IEEE Transactions on Signal Processing
Spectral efficiency of FDMA/TDMA wireless systems with transmit and receive antenna arrays

IEEE Transactions on Wireless Communications
A distributed medium access control scheme for a large network of wireless routers

IEEE Transactions on Wireless Communications - Part 1
Optimal Power Schedule for Distributed MIMO Links

IEEE Transactions on Wireless Communications
The capacity of wireless networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.01

Visualization

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.