Joint optimization of source power allocation and distributed relay beamforming in multiuser peer-to-peer relay networks
Y Cheng, M Pesavento - IEEE Transactions on Signal …, 2012 - ieeexplore.ieee.org
IEEE Transactions on Signal Processing, 2012•ieeexplore.ieee.org
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 …
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 …
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).
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果