A cognitive radio scenario is considered where the signals transmitted by a secondary user (SU) are relayed by multi-antenna relays using an amplify-and-forward cooperation protocol. In this paper, the optimal power allocation and beamforming scheme is derived for the SU transmitters (SU-TXs) which minimizes the exact outage probability of the SU network with relay selection, under both a transmit power constraint and a constraint on the interference power generated at every primary user receiver. After deriving the optimal structure of the beamforming matrix, several distributed resource allocation algorithms are obtained for different levels of channel state information (CSI) at the SU-TXs: perfect CSI and imperfect CSI are considered, along with the case where only channel distribution information (CDI) is available. The numerical results show that the multi-antenna relays can significantly improve the performance of the SU network, which would otherwise be severely limited by the harsh interference constraints. Further, we also investigate how the number of relays, the number of antennas and the level of CSI impact the performance of the SU network. Finally, we point out that the proposed algorithms outperform several algorithms presented in literature.

In this contribution, a cognitive radio scenario is considered, where a secondary user (SU) cooperative network is allowed to transmit concurrently with a primary user (PU), provided that the resulting average interference power at the PU receiver is kept below a certain threshold. The SU network uses a selection amplify-and-forward protocol. An optimum and a low-complexity suboptimum dynamic energy allocation strategy are proposed, that minimize the link outage probability between the source node and the destination node of the SU network under an average interference power constraint. Because the interference channels from the SU nodes to the PU are affected by fast fading, the realistic assumption is made that each SU node has access to the root mean-square value (rather than the instantaneous value) of the gain of its own interference channel to the PU. We show that both dynamic allocation strategies considerably outperform the optimum static allocation strategy, and that the low-complexity dynamic allocation performs nearly as well as the optimum dynamic allocation. Finally, we confirm that our dynamic algorithms show a significant performance improvement as compared to the optimal dynamic algorithm under a peak interference power constraint

In this paper we consider a decode-and-forward cooperative network, which is active in the same bandwidth as a primary user network. The cooperative or secondary user network applies a dynamic resource allocation algorithm to maximize its own performance while limiting the interference caused at the primary user receivers. The main contribution of this paper is the proposition of a new accurate approximation for the outage probability, which takes into account that the channel state information available at the transmitter is imperfect and outdated. The accuracy of the approximation and the performance of the resource allocation scheme are validated through numerical simulations

We propose a novel resource allocation (RA) strategy for a cognitive radio packet-oriented bit-interleaved coded orthogonal frequency division multiplexing (BIC-OFDM) system with decode-and-forward (DF) relays. The aim of the RA is maximizing the goodput (GP) of the source-relay-destination link, which is the number of information bits correctly received at the destination node per unit of time. Therefore, we derive an accurate analytic approximation for this figure of merit, which allows us to find the optimum constellation size, code rate and energy allocation per subcarrier. Further, this expression also serves as a novel relay selection criterion. Finally, we validate the proposed RA method, and compare its performance to capacitymaximizing algorithms through numerical simulations

No abstract