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

On Information and Energy Cooperation in Energy Harvesting Cognitive Radio

This paper considers the cooperation between primary and secondary users at information and energy levels when both users are energy harvesting nodes. In particular, a secondary transmitter helps relaying the primary message, and in turn, gains the spectrum access as a reward. Also, the primary transmitter supplies energy to the secondary transmitter if the latter is energy-constrained, which facilitates an uninterrupted cooperation. We address this two-level cooperation over a finite horizon with the finite battery constraint at the secondary transmitter. While promising the rate-guaranteed service to both primary and secondary users, we aim to maximize the primary rate. We develop an iterative algorithm that obtains the optimal offline power policies for primary and secondary users. To acquire insights about the structure of the optimal solution, we examine specific scenarios. Furthermore, we investigate the effects of the secondary rate constraint and finite battery on the primary rate and the probability of cooperation. We show that the joint information and energy cooperation increases the chances of cooperation and achieves significant rate gains over only information cooperation.Comment: 6 pages, 4 figures, to be presented in IEEE PIMRC 201

Directional Relays for Multi-Hop Cooperative Cognitive Radio Networks

In this paper, we investigate power allocation and beamforming in a relay assisted cognitive radio (CR) network. Our objective is to maximize the performance of the CR network while limiting interference in the direction of the primary users (PUs). In order to achieve these goals, we first consider joint power allocation and beamforming for cognitive nodes in direct links. Then, we propose an optimal power allocation strategy for relay nodes in indirect transmissions. Unlike the conventional cooperative relaying networks, the applied relays are equipped with directional antennas to further reduce the interference to PUs and meet the CR network requirements. The proposed approach employs genetic algorithm (GA) to solve the optimization problems. Numerical simulation results illustrate the quality of service (QoS) satisfaction in both primary and secondary networks. These results also show that notable improvements are achieved in the system performance if the conventional omni-directional relays are replaced with directional ones

Power-Optimal Feedback-Based Random Spectrum Access for an Energy Harvesting Cognitive User

In this paper, we study and analyze cognitive radio networks in which secondary users (SUs) are equipped with Energy Harvesting (EH) capability. We design a random spectrum sensing and access protocol for the SU that exploits the primary link's feedback and requires less average sensing time. Unlike previous works proposed earlier in literature, we do not assume perfect feedback. Instead, we take into account the more practical possibilities of overhearing unreliable feedback signals and accommodate spectrum sensing errors. Moreover, we assume an interference-based channel model where the receivers are equipped with multi-packet reception (MPR) capability. Furthermore, we perform power allocation at the SU with the objective of maximizing the secondary throughput under constraints that maintain certain quality-of-service (QoS) measures for the primary user (PU)

Physical-Layer Security with Multiuser Scheduling in Cognitive Radio Networks

In this paper, we consider a cognitive radio network that consists of one cognitive base station (CBS) and multiple cognitive users (CUs) in the presence of multiple eavesdroppers, where CUs transmit their data packets to CBS under a primary user's quality of service (QoS) constraint while the eavesdroppers attempt to intercept the cognitive transmissions from CUs to CBS. We investigate the physical-layer security against eavesdropping attacks in the cognitive radio network and propose the user scheduling scheme to achieve multiuser diversity for improving the security level of cognitive transmissions with a primary QoS constraint. Specifically, a cognitive user (CU) that satisfies the primary QoS requirement and maximizes the achievable secrecy rate of cognitive transmissions is scheduled to transmit its data packet. For the comparison purpose, we also examine the traditional multiuser scheduling and the artificial noise schemes. We analyze the achievable secrecy rate and intercept probability of the traditional and proposed multiuser scheduling schemes as well as the artificial noise scheme in Rayleigh fading environments. Numerical results show that given a primary QoS constraint, the proposed multiuser scheduling scheme generally outperforms the traditional multiuser scheduling and the artificial noise schemes in terms of the achievable secrecy rate and intercept probability. In addition, we derive the diversity order of the proposed multiuser scheduling scheme through an asymptotic intercept probability analysis and prove that the full diversity is obtained by using the proposed multiuser scheduling.Comment: 12 pages. IEEE Transactions on Communications, 201