Partner selection based on optimal power allocation in cooperative-diversity systems

被引：49

作者：

Mahinthan, Veluppillai ^{[1
]}

Cai, Lin ^{[2
]}

Mark, Jon W. ^{[1
]}

Shen, Xuemin ^{[1
]}

机构：

[1] Univ Waterloo, Dept Elect & Comp Engn, Ctr Wireless Commun, Waterloo, ON N2L 3G1, Canada

[2] Univ Victoria, Dept Elect & Comp Engn, Victoria, BC V8W 2Y2, Canada

来源：

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY | 2008年 / 57卷 / 01期

基金：

加拿大自然科学与工程研究理事会;

关键词：

cooperative diversity (CD); matching algorithm; partner selection; power allocation; wireless networks;

D O I：

10.1109/TVT.2007.905441

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

We study how to appropriately match users for two-user cooperative-diversity (CD) systems deploying an optimal-power-allocation (OPA) strategy, considering both the amplify and forward and the regenerate and forward CD schemes. The OPA strategies, which can minimize the total energy consumption for the cooperating pair, are derived for both CD schemes. Then, we study the location of the optimal partner for a user and develop a novel nonbipartite stable matching algorithm with a performance that is very close to the optimal maximum weighted (MW) matching algorithm. The proposed matching algorithm is simple to implement, and its computational complexity is one order lower than that of the optimal MW matching algorithm. Numerical results show that with the OPA and the proposed matching algorithm, a 9 similar to 10 dB CD gain can be achieved, which is equivalent to prolonging the cell-phone-battery recharge time by about ten times.

引用

页码：511 / 520

页数：10

共 16 条

[1]

ADEANE J, 2005, P 12 ICT CAP TOWN S

[2]

Ahuja RK, 1993, NETWORK FLOWS THEORY

[3]

[Anonymous], 2002, THESIS MIT

[4] A SURVEY OF HEURISTICS FOR THE WEIGHTED MATCHING PROBLEM [J].