TY - JOUR
T1 - Resource allocation for wireless cooperative networks
T2 - A unified cooperative bargaining game theoretic framework
AU - Zhang, Guopeng
AU - Yang, Kun
AU - Chen, Hsiao Hwa
N1 - Funding Information:
ACKNOWLEDGMENTS The authors would like to gratefully acknowledge the following grants supporting this research: U.K. EPSRC project PAL (TS/H000186/1), EU FP7 project EVANS (PIRSESGA-2010-269323), the Priority Academic Program Development of Jiangsu Higher Education Institutions (PAPD), Fundamental Research Funds for the Central Universities (2010QNA27, 2011QNB26), Postdoctoral Science Foundation (20100481185), Postdoctoral Research Funds of Jiangsu Province (1101108C), and Taiwan NSC grant NSC99-2221-E006-016-MY3.
PY - 2012/4
Y1 - 2012/4
N2 - Wireless cooperative communications require appropriate spectrum allocation (SA) and power allocation (PA) between the source and relay nodes. In this article, we first present an overview of the game theoretic incentive mechanisms for stimulating cooperation among selfish user nodes. Thereafter, the related issues on user payoff function design and the corresponding SA and PA strategies are discussed. To distribute the collective capacity gains among the cooperative nodes efficiently, we analyze and then formulate multiple resource allocation problems including SA, PA, and simultaneous multiresource allocation (SMRA) problems into the unified cooperative bargaining game, and the Nash bargaining solution method is utilized to solve these problems. Moreover, we propose to decompose the SMRA game into multiple single-resource allocation games and then resolve them sequentially. Finally, various game results are compared with a view to highlight that the decomposed SMRA game could obtain a good trade-off between computational complexity and system efficiency.
AB - Wireless cooperative communications require appropriate spectrum allocation (SA) and power allocation (PA) between the source and relay nodes. In this article, we first present an overview of the game theoretic incentive mechanisms for stimulating cooperation among selfish user nodes. Thereafter, the related issues on user payoff function design and the corresponding SA and PA strategies are discussed. To distribute the collective capacity gains among the cooperative nodes efficiently, we analyze and then formulate multiple resource allocation problems including SA, PA, and simultaneous multiresource allocation (SMRA) problems into the unified cooperative bargaining game, and the Nash bargaining solution method is utilized to solve these problems. Moreover, we propose to decompose the SMRA game into multiple single-resource allocation games and then resolve them sequentially. Finally, various game results are compared with a view to highlight that the decomposed SMRA game could obtain a good trade-off between computational complexity and system efficiency.
UR - http://www.scopus.com/inward/record.url?scp=84860554618&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84860554618&partnerID=8YFLogxK
U2 - 10.1109/MWC.2012.6189411
DO - 10.1109/MWC.2012.6189411
M3 - Review article
AN - SCOPUS:84860554618
SN - 1536-1284
VL - 19
SP - 38
EP - 43
JO - IEEE Wireless Communications
JF - IEEE Wireless Communications
IS - 2
M1 - 6189411
ER -