Cooperative Cognitive Relaying Under Primary and Secondary Quality of Service Satisfaction

This paper proposes a new cooperative protocol which involves cooperation between primary and secondary users. We consider a cognitive setting with one primary user and multiple secondary users. The time resource is partitioned into discrete time slots. Each time slot, a secondary user is scheduled for transmission according to time division multiple access, and the remainder of the secondary users, which we refer to as secondary relays, attempt to decode the primary packet. Afterwards, the secondary relays employ cooperative beamforming to forward the primary packet and to provide protection to the secondary destination of the secondary source scheduled for transmission from interference. We characterize the diversity-multiplexing tradeoff of the primary source under the proposed protocol. We consider certain quality of service for each user specified by its required throughput. The optimization problem is stated under such condition. It is shown that the optimization problem is linear and can be readily solved. We show that the sum of the secondary required throughputs must be less than or equal to the probability of correct packets reception.Comment: This paper was accepted in PIMRC 201

Beamforming and Rate Allocation in MISO Cognitive Radio Networks

We consider decentralized multi-antenna cognitive radio networks where secondary (cognitive) users are granted simultaneous spectrum access along with license-holding (primary) users. We treat the problem of distributed beamforming and rate allocation for the secondary users such that the minimum weighted secondary rate is maximized. Such an optimization is subject to (1) a limited weighted sum-power budget for the secondary users and (2) guaranteed protection for the primary users in the sense that the interference level imposed on each primary receiver does not exceed a specified level. Based on the decoding method deployed by the secondary receivers, we consider three scenarios for solving this problem. In the first scenario each secondary receiver decodes only its designated transmitter while suppressing the rest as Gaussian interferers (single-user decoding). In the second case each secondary receiver employs the maximum likelihood decoder (MLD) to jointly decode all secondary transmissions, and in the third one each secondary receiver uses the unconstrained group decoder (UGD). By deploying the UGD, each secondary user is allowed to decode any arbitrary subset of users (which contains its designated user) after suppressing or canceling the remaining users.Comment: 32 pages, 6 figure

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