DocumentCode :
1459247
Title :
Joint Optimization of Source Power Allocation and Distributed Relay Beamforming in Multiuser Peer-to-Peer Relay Networks
Author :
Cheng, Yong ; Pesavento, Marius
Author_Institution :
Commun. Syst. Group, Tech. Univ. Darmstadt, Darmstadt, Germany
Volume :
60
Issue :
6
fYear :
2012
fDate :
6/1/2012 12:00:00 AM
Firstpage :
2962
Lastpage :
2973
Abstract :
In this paper, we consider the joint optimization of the source power allocation and relay beamforming weights in distributed multiuser peer-to-peer (MUP2P) relay networks applying the amplify-and-forward (AF) protocol. We adopt a quality-of-service (QoS) based approach, in which the total power transmitted from all sources and relays is minimized while guaranteeing the prescribed QoS requirement of each source-destination pair. The QoS is modeled as a function of the receive signal-to-interference-plus-noise ratio (SINR) at the destinations. Unlike the existing contributions, the transmitted powers of the sources and the beamforming weights of the relays are optimized jointly in this paper. Introducing an appropriate transformation of variables, the QoS based source power allocation and distributed relay beamforming (PADB) problem can be equivalently transformed into a difference of convex (DC) program, which can be efficiently solved with local optimality using the constrained concave convex procedure (CCCP). Based on this procedure, we also propose an iterative feasibility search algorithm (IFSA) to find an initial feasible point of the DC program. The analytic study of the proposed solution confirms that it converges to a local optimum of the PADB problem. Numerical results show that our solution outperforms (in terms of the total transmitted power) the alternating optimization procedure and the exact penalty based DC algorithm. In addition, the proposed IFSA outperforms the alternating optimization algorithm in finding feasible points of the DC program (i.e., the equivalence of the PADB problem).
Keywords :
amplify and forward communication; array signal processing; concave programming; iterative methods; peer-to-peer computing; protocols; quality of service; search problems; AF protocol; CCCP; DC program; IFSA; PADB problem; QoS based source power allocation; SINR; alternating optimization procedure; amplify-and-forward protocol; constrained concave convex procedure; difference of convex program; distributed MUP2P relay networks; distributed multiuser peer-to-peer relay networks; distributed relay beamforming; distributed relay beamforming problem; iterative feasibility search algorithm; joint optimization; quality-of-service based approach; signal-to-interferenceplus-noise ratio; source power allocation; Array signal processing; Optimization; Peer to peer computing; Quality of service; Relays; Resource management; Vectors; Constrained concave–conves procedure (CCCP); difference of convex (DC) program; distributed relay beamforming; iterative feasibility search algorithm; joint optimization; multiuser peer-to-peer relay networks; source power allocation;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/TSP.2012.2189388
Filename :
6159098
Link To Document :
بازگشت