DocumentCode
1435881
Title
Cooperative power scheduling for a network of MIMO links
Author
Dong, Xiang ; Rong, Yue ; Hua, Yingbo
Author_Institution
Dept. of Electr. Eng., Univ. of California, Riverside, CA, USA
Volume
9
Issue
3
fYear
2010
fDate
3/1/2010 12:00:00 AM
Firstpage
939
Lastpage
944
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 price-based 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.
Keywords
MIMO communication; radio links; scheduling; MIMO links; cooperative power scheduling algorithm; distributed algorithm; noncooperative counter-part; price factors; price-based iterative water filling algorithm; Ad hoc networks; Computer networks; Distributed algorithms; Distributed computing; Filling; Iterative algorithms; MIMO; Processor scheduling; Scheduling algorithm; Throughput; Ad hoc network of MIMO links, iterative water filling, power scheduling, network throughput, cooperative game.;
fLanguage
English
Journal_Title
Wireless Communications, IEEE Transactions on
Publisher
ieee
ISSN
1536-1276
Type
jour
DOI
10.1109/TWC.2010.03.090628
Filename
5427423
Link To Document