Improving performance of far users in cognitive radio: Exploiting NOMA and wireless power transfer

In this paper, we examine non-orthogonal multiple access (NOMA) and relay selection strategy to benefit extra advantage from traditional cognitive radio (CR) relaying systems. The most important requirement to prolong lifetime of such network is employing energy harvesting in the relay to address network with limited power constraint. In particular, we study such energy harvesting CR-NOMA using amplify-and-forward (AF) scheme to improve performance far NOMA users. To further address such problem, two schemes are investigated in term of number of selected relays. To further examine system performance, the outage performance needs to be studied for such wireless powered CR-NOMA network over Rayleigh channels. The accurate expressions for the outage probability are derived to perform outage comparison of primary network and secondary network. The analytical results show clearly that position of these nodes, transmit signal to noise ratio (SNR) and power allocation coefficients result in varying outage performance. As main observation, performance gap between primary and secondary destination is decided by both power allocation factors and selection mode of single relay or multiple relays. Numerical studies were conducted to verify our derivations.Web of Science1211art. no. 220

Decentralized Fair Scheduling in Two-Hop Relay-Assisted Cognitive OFDMA Systems

In this paper, we consider a two-hop relay-assisted cognitive downlink OFDMA system (named as secondary system) dynamically accessing a spectrum licensed to a primary network, thereby improving the efficiency of spectrum usage. A cluster-based relay-assisted architecture is proposed for the secondary system, where relay stations are employed for minimizing the interference to the users in the primary network and achieving fairness for cell-edge users. Based on this architecture, an asymptotically optimal solution is derived for jointly controlling data rates, transmission power, and subchannel allocation to optimize the average weighted sum goodput where the proportional fair scheduling (PFS) is included as a special case. This solution supports decentralized implementation, requires small communication overhead, and is robust against imperfect channel state information at the transmitter (CSIT) and sensing measurement. The proposed solution achieves significant throughput gains and better user-fairness compared with the existing designs. Finally, we derived a simple and asymptotically optimal scheduling solution as well as the associated closed-form performance under the proportional fair scheduling for a large number of users. The system throughput is shown to be $\mathcal{O}\left(N(1-q_p)(1-q_p^N)\ln\ln K_c\right)$, where $K_c$ is the number of users in one cluster, $N$ is the number of subchannels and $q_p$ is the active probability of primary users.Comment: 29 pages, 9 figures, IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSIN

A Pricing-Based Cooperative Spectrum Sharing Stackelberg Game

We consider the problem of cooperative spectrum sharing among a primary user (PU) and multiple secondary users (SUs) under quality of service (QoS) constraints. The SUs network is controlled by the PU through a relay which gets a revenue for amplifying and forwarding the SUs signals to their respective destinations. The relay charges each SU a different price depending on its received signal-to-interference and-noise ratio (SINR). The relay can control the SUs network and maximize any desired PU utility function. The PU utility function represents its rate, which is affected by the SUs access, and its gained revenue to allow the access of the SUs. The SU network can be formulated as a game in which each SU wants to maximize its utility function; the problem is formulated as a Stackelberg game. Finally, the problem of maximizing the primary utility function is solved through three different approaches, namely, the optimal, the heuristic and the suboptimal algorithms.Comment: 7 pages. IEEE, WiOpt 201

ARQ Protocols in Cognitive Decode-and-Forward Relay Networks: Opportunities Gain

In this paper, two novel automatic-repeat-request (ARQ) based protocols were proposed, which exploit coop- eration opportunity inherent in secondary retransmission to create access opportunities. If the signal was not decoded correctly in destination, another user can be acted as a relay to reduce retransmission rounds by relaying the signal. For comparison, we also propose a Direct ARQ Protocol. Specif- ically, we derive the exact closed-form outage probability of three protocols, which provides an effective means to evalu- ate the effects of several parameters. Moreover, we propose a new metric to evaluate the performance improvement for cognitive networks. Finally, Monte Carlo simulations were presented to validate the theory analysis, and a comparison is made among the three protocols

Adaptive Modulation and Coding and Cooperative ARQ in a Cognitive Radio System

In this paper, a joint cross-layer design of adaptive modulation and coding (AMC) and cooperative automatic repeat request (C-ARQ) scheme is proposed for a secondary user in a shared-spectrum environment. First, based on the statistical descriptions of the channel, closed-form expressions of the average spectral efficiency (SE) and the average packet loss rate (PLR) are presented. Then, the cross-layer scheme is designed, with the aim of maximizing the average SE while maintaining the average PLR under a prescribed level. An optimization problem is formed, and a sub-optimal solution is found: the target packet error rates (PER) for the secondary system channels are obtained and the corresponding sub-optimal AMC rate adaptation policy is derived based on the target PERs. Finally, the average SE and the average PLR performance of the proposed scheme are presented

Optimizing cooperative cognitive radio networks with opportunistic access

Optimal resource allocation for cooperative cognitive radio networks with opportunistic access to the licensed spectrum is studied. Resource allocation is based on minimizing the symbol error rate at the receiver. Both the cases of all-participate relaying and selective relaying are considered. The objective function is derived and the constraints are detailed for both scenarios. It is then shown that the objective functions and the constraints are nonlinear and nonconvex functions of the parameters of interest, that is, source and relay powers, symbol time, and sensing time. Therefore, it is difficult to obtain closed-form solutions for the optimal resource allocation. The optimization problem is then solved using numerical techniques. Numerical results show that the all-participate system provides better performance than its selection counterpart, at the cost of greater resources

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