Skip to Main Content
This paper considers a communication network with multiple pairs of source and destination, assisted by multiple relays. It is assumed that perfect channel state information (CSI) is available at the relays. In a two-stage AF protocol, all the sources broadcast their signals to all the relays in the first stage. The received signal at each relay is processed by a beamforming weight and then re-broadcasted to all the destinations at the same time with other relays in the second stage. The focus is to find the optimal beamforming weights to meet a given set of target signal-to-interference-and-noise ratio (SINR) at the destinations, while minimizing the total transmitted power at the relays. We show that this problem can be formulated as a nonconvex quadratically constrained quadratic program (QCQP). Through relaxations, the problem can be solved efficiently by convex programming.