Optimized power allocation for pairwise cooperative multiple access

被引:16
作者
Mesbah, Wessam [1 ]
Davidson, Timothy N. [1 ]
机构
[1] McMaster Univ, Dept Elect & Comp Engn, Hamilton, ON L8S 4K1, Canada
关键词
achievable rate; convex optimization; cooperative communications; decode-and-forward; resource allocation;
D O I
10.1109/TSP.2008.917390
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Multiple access schemes in which the transmitting nodes are allowed to cooperate have the potential to provide higher quality of service than conventional schemes. In the class of pair-wise cooperative multiple access schemes in which channel state information is available at the transmitters, the allocation of transmission power plays a key role in the realization of these quality of service gains. Unfortunately, the natural formulation of the power allocation problem for full-duplex cooperative schemes is not convex. It is shown herein that this non-convex formulation can be simplified and recast in a convex form. In fact, closed-form expressions for the optimal power allocation for each point on the boundary of an achievable rate region are obtained. In practice, a half-duplex cooperative scheme, in which the channel resource is partitioned in such a way that interference is avoided, may be preferred over a full-duplex scheme. The channel resource is often partitioned equally, but we develop an efficient algorithm for the joint allocation of power and the channel resource for a modified version of an existing half-duplex cooperative scheme. We demonstrate that this algorithm enables the resulting scheme to attain a significantly larger fraction of the achievable rate region for the full duplex case than the underlying scheme that employs a fixed resource allocation.
引用
收藏
页码:2994 / 3008
页数:15
相关论文
共 13 条
[1]  
[Anonymous], 1983, P ANN ALLERTON C COM
[2]   On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels [J].
Azarian, K ;
El Gamal, H ;
Schniter, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4152-4172
[3]  
Boyd S., 2004, CONVEX OPTIMIZATION
[4]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[5]  
Cover TM, 2006, Elements of Information Theory
[6]   Capacity bounds and power allocation for wireless relay channels [J].
Host-Madsen, A ;
Zhang, JS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (06) :2020-2040
[7]  
Host-Madsen A, 2002, IEEE VTS VEH TECHNOL, P1333, DOI 10.1109/VETECF.2002.1040432
[8]  
Kaya O, 2005, 2005 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS, COMMUNICATIONS AND MOBILE COMPUTING, VOLS 1 AND 2, P1443
[9]   Power control for fading cooperative multiple access channels [J].
Kaya, Onur ;
Ulukus, Sennur .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2007, 6 (08) :2915-2923
[10]   Cooperative strategies and capacity theorems for relay networks [J].
Kramer, G ;
Gastpar, M ;
Gupta, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (09) :3037-3063