On Design of Collaborative Beamforming for Two-Way Relay Networks

被引:104
作者
Zeng, Meng [1 ]
Zhang, Rui [2 ,3 ]
Cui, Shuguang [1 ]
机构
[1] Texas A&M Univ, Dept Elect & Comp Engn, College Stn, TX 77843 USA
[2] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore 117548, Singapore
[3] ASTAR, Inst Infocomm Res, Singapore, Singapore
关键词
Achievable rate region; collaborative beamforming; Pareto optimal; semi-definite programming (SDP); semi-definite relaxation (SDR); two-way relay; CODED COOPERATION; CAPACITY THEOREMS; MIMO; CHANNEL;
D O I
10.1109/TSP.2011.2107906
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper studies the achievable rate region for an amplify-and-forward (AF)-based two-way relay network with collaborative beamforming. With different assumptions of channel reciprocity between the source-relay and relay-source channels, the achievable rate region is characterized under two setups. First, with reciprocal channels, we investigate the achievable rate regions when the relay cluster is subject to a sum-power constraint or individual-power constraints. We show that the optimal beamforming vectors obtained from solving the weighted sum inverse-SNR minimization (WSISMin) problems are sufficient to characterize the corresponding achievable rate region. Furthermore, we derive the closed-form solutions for those optimal beamforming vectors and consequently propose the partially distributed algorithms to implement the optimal beamforming, where each relay node only needs the local channel information and one global parameter. Second, with the nonreciprocal channels, the achievable rate regions are also characterized for both the sum-power constraint case and the individual-power constraint case. Although no closed-form solutions are available under this setup, we present efficient numerical algorithms by solving a sequence of semi-definite programming (SDP) problems after semi-definite relaxation(SDR), where the optimal beamformer can be obtained under the sum-power constraint and approximate optimal solutions can be obtained under the individual power constraints.
引用
收藏
页码:2284 / 2295
页数:12
相关论文
共 23 条
[1]  
[Anonymous], 2003, CONVEX OPTIMIZATION
[2]  
[Anonymous], 1985, Matrix Analysis
[3]  
BIGLIERI E, 2007, FUNDAMENTALS WIRELES
[4]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[5]   Energy-efficiency of MIMO and cooperative MIMO techniques in sensor networks [J].
Cui, SG ;
Goldsmith, AJ ;
Bahai, A .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2004, 22 (06) :1089-1098
[6]  
Grant M, 2010, CVX USERS GUIDE CVX
[7]   Distributed beamforming for relay networks based on second-order statistics of the channel state information [J].
Havary-Nassab, Veria ;
Shahbazpanahi, Shahram ;
Grami, Ali ;
Luo, Zhi-Quan .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (09) :4306-4316
[8]   Optimal Distributed Beamforming for Two-Way Relay Networks [J].
Havary-Nassab, Veria ;
Shahbazpanahi, Shahram ;
Grami, Ali .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (03) :1238-1250
[9]   Complex matrix decomposition and quadratic programming [J].
Huang, Yongwei ;
Zhang, Shuzhong .
MATHEMATICS OF OPERATIONS RESEARCH, 2007, 32 (03) :758-768
[10]   Coded cooperation in wireless communications: Space-time transmission and iterative decoding [J].
Janani, M ;
Hedayat, A ;
Hunter, TE ;
Nosratinia, A .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2004, 52 (02) :362-371