Dynamic Resource Allocation in Cognitive Radio Networks: A Convex Optimization Perspective

This article provides an overview of the state-of-art results on communication resource allocation over space, time, and frequency for emerging cognitive radio (CR) wireless networks. Focusing on the interference-power/interference-temperature (IT) constraint approach for CRs to protect primary radio transmissions, many new and challenging problems regarding the design of CR systems are formulated, and some of the corresponding solutions are shown to be obtainable by restructuring some classic results known for traditional (non-CR) wireless networks. It is demonstrated that convex optimization plays an essential role in solving these problems, in a both rigorous and efficient way. Promising research directions on interference management for CR and other related multiuser communication systems are discussed.Comment: to appear in IEEE Signal Processing Magazine, special issue on convex optimization for signal processin

Resource Allocation for Delay Differentiated Traffic in Multiuser OFDM Systems

Most existing work on adaptive allocation of subcarriers and power in multiuser orthogonal frequency division multiplexing (OFDM) systems has focused on homogeneous traffic consisting solely of either delay-constrained data (guaranteed service) or non-delay-constrained data (best-effort service). In this paper, we investigate the resource allocation problem in a heterogeneous multiuser OFDM system with both delay-constrained (DC) and non-delay-constrained (NDC) traffic. The objective is to maximize the sum-rate of all the users with NDC traffic while maintaining guaranteed rates for the users with DC traffic under a total transmit power constraint. Through our analysis we show that the optimal power allocation over subcarriers follows a multi-level water-filling principle; moreover, the valid candidates competing for each subcarrier include only one NDC user but all DC users. By converting this combinatorial problem with exponential complexity into a convex problem or showing that it can be solved in the dual domain, efficient iterative algorithms are proposed to find the optimal solutions. To further reduce the computational cost, a low-complexity suboptimal algorithm is also developed. Numerical studies are conducted to evaluate the performance the proposed algorithms in terms of service outage probability, achievable transmission rate pairs for DC and NDC traffic, and multiuser diversity.Comment: 29 pages, 8 figures, submitted to IEEE Transactions on Wireless Communication

On the Performance of Spectrum Sensing Algorithms using Multiple Antennas

In recent years, some spectrum sensing algorithms using multiple antennas, such as the eigenvalue based detection (EBD), have attracted a lot of attention. In this paper, we are interested in deriving the asymptotic distributions of the test statistics of the EBD algorithms. Two EBD algorithms using sample covariance matrices are considered: maximum eigenvalue detection (MED) and condition number detection (CND). The earlier studies usually assume that the number of antennas (K) and the number of samples (N) are both large, thus random matrix theory (RMT) can be used to derive the asymptotic distributions of the maximum and minimum eigenvalues of the sample covariance matrices. While assuming the number of antennas being large simplifies the derivations, in practice, the number of antennas equipped at a single secondary user is usually small, say 2 or 3, and once designed, this antenna number is fixed. Thus in this paper, our objective is to derive the asymptotic distributions of the eigenvalues and condition numbers of the sample covariance matrices for any fixed K but large N, from which the probability of detection and probability of false alarm can be obtained. The proposed methodology can also be used to analyze the performance of other EBD algorithms. Finally, computer simulations are presented to validate the accuracy of the derived results.Comment: IEEE GlobeCom 201

Secrecy Outage and Diversity Analysis of Cognitive Radio Systems

In this paper, we investigate the physical-layer security of a multi-user multi-eavesdropper cognitive radio system, which is composed of multiple cognitive users (CUs) transmitting to a common cognitive base station (CBS), while multiple eavesdroppers may collaborate with each other or perform independently in intercepting the CUs-CBS transmissions, which are called the coordinated and uncoordinated eavesdroppers, respectively. Considering multiple CUs available, we propose the round-robin scheduling as well as the optimal and suboptimal user scheduling schemes for improving the security of CUs-CBS transmissions against eavesdropping attacks. Specifically, the optimal user scheduling is designed by assuming that the channel state information (CSI) of all links from CUs to CBS, to primary user (PU) and to eavesdroppers are available. By contrast, the suboptimal user scheduling only requires the CSI of CUs-CBS links without the PU's and eavesdroppers' CSI. We derive closed-form expressions of the secrecy outage probability of these three scheduling schemes in the presence of the coordinated and uncoordinated eavesdroppers. We also carry out the secrecy diversity analysis and show that the round-robin scheduling achieves the diversity order of only one, whereas the optimal and suboptimal scheduling schemes obtain the full secrecy diversity, no matter whether the eavesdroppers collaborate or not. In addition, numerical secrecy outage results demonstrate that for both the coordinated and uncoordinated eavesdroppers, the optimal user scheduling achieves the best security performance and the round-robin scheduling performs the worst. Finally, upon increasing the number of CUs, the secrecy outage probabilities of the optimal and suboptimal user scheduling schemes both improve significantly.Comment: 16 pages, 5 figures, accepted to appear, IEEE Journal on Selected Areas in Communications, 201

Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks

In cognitive radio (CR) networks, there are scenarios where the secondary (lower priority) users intend to communicate with each other by opportunistically utilizing the transmit spectrum originally allocated to the existing primary (higher priority) users. For such a scenario, a secondary user usually has to trade off between two conflicting goals at the same time: one is to maximize its own transmit throughput; and the other is to minimize the amount of interference it produces at each primary receiver. In this paper, we study this fundamental tradeoff from an information-theoretic perspective by characterizing the secondary user's channel capacity under both its own transmit-power constraint as well as a set of interference-power constraints each imposed at one of the primary receivers. In particular, this paper exploits multi-antennas at the secondary transmitter to effectively balance between spatial multiplexing for the secondary transmission and interference avoidance at the primary receivers. Convex optimization techniques are used to design algorithms for the optimal secondary transmit spatial spectrum that achieves the capacity of the secondary transmission. Suboptimal solutions for ease of implementation are also presented and their performances are compared with the optimal solution. Furthermore, algorithms developed for the single-channel transmission are also extended to the case of multi-channel transmission whereby the secondary user is able to achieve opportunistic spectrum sharing via transmit adaptations not only in space, but in time and frequency domains as well.Comment: Extension of IEEE PIMRC 2007. 35 pages, 6 figures. Submitted to IEEE Journal of Special Topics in Signal Processing, special issue on Signal Processing and Networking for Dynamic Spectrum Acces