PRIMARY USER AUTHENTICATION IN COGNITIVE RADIO NETWORKS: A SURVEY

ABSTRACT: For effective usage of radio frequency spectrum, cognitive radio networks have been proposed, allowing the secondary users to occupy the spectrum whenever the primary user is not using it. To avoid interference with the primary user secondary user should constantly check the usage of the spectrum. But achieving a faithful monitoring is not so easy. Hence Primary user Emulation (PUE) attack comes into existence. To counter this attack primary user's signal can be authenticated in the physical layer itself. In this paper, we provide various approaches (dealt in different papers) for authenticating primary users' signals that conforms FCC's requirement

A Message Passing Approach for Decision Fusion in Adversarial Multi-Sensor Networks

We consider a simple, yet widely studied, set-up in which a Fusion Center (FC) is asked to make a binary decision about a sequence of system states by relying on the possibly corrupted decisions provided by byzantine nodes, i.e. nodes which deliberately alter the result of the local decision to induce an error at the fusion center. When independent states are considered, the optimum fusion rule over a batch of observations has already been derived, however its complexity prevents its use in conjunction with large observation windows. In this paper, we propose a near-optimal algorithm based on message passing that greatly reduces the computational burden of the optimum fusion rule. In addition, the proposed algorithm retains very good performance also in the case of dependent system states. By first focusing on the case of small observation windows, we use numerical simulations to show that the proposed scheme introduces a negligible increase of the decision error probability compared to the optimum fusion rule. We then analyse the performance of the new scheme when the FC make its decision by relying on long observation windows. We do so by considering both the case of independent and Markovian system states and show that the obtained performance are superior to those obtained with prior suboptimal schemes. As an additional result, we confirm the previous finding that, in some cases, it is preferable for the byzantine nodes to minimise the mutual information between the sequence system states and the reports submitted to the FC, rather than always flipping the local decision

Secure Transmission Design for Cognitive Radio Networks With Poisson Distributed Eavesdroppers

In this paper, we study physical layer security in an underlay cognitive radio (CR) network. We consider the problem of secure communication between a secondary transmitter-receiver pair in the presence of randomly distributed eavesdroppers under an interference constraint set by the primary user. For different channel knowledge assumptions at the transmitter, we design four transmission protocols to achieve the secure transmission in the CR network. We give a comprehensive performance analysis for each protocol in terms of transmission delay, security, reliability, and the overall secrecy throughput. Furthermore, we determine the optimal design parameter for each transmission protocol by solving the optimization problem of maximizing the secrecy throughput subject to both security and reliability constraints. Numerical results illustrate the performance comparison between different transmission protocols.ARC Discovery Projects Grant DP15010390

Some MIMO applications in cognitive radio networks

In the last decade, the wireless communication technology has witnessed a rapid development, which led to a rapid growth in wireless applications and services. However, the radio spectrum resources scarcity resulting from using the traditional methods of fixed spectrum resources allocation has potential constraints on this wireless services rapid growth. Consequently, cognitive radio has been emerged as a possible solution for alleviating this spectrum scarcity problem by employing dynamic resource allocation strategies in order to utilize the available spectrum in a more efficient way so that finding opportunities for new wireless application services could be achieved. In cognitive radio networks, the radio spectrum resources utilization is improved by allowing unlicensed users, known as secondary users, to share the spectrum with licensed users, known as primary users, as long as this sharing do not induce harmful interference on the primary users, which completely entitled to utilize the spectrum. Motivated by MIMO techniques that have been used in practical systems as a means for high data rate transmission and a source for spatial diversity, and by its ease implementation with OFDM, different issues in multi-user MIMO (MU-MIMO) in both the uplink and downlink in the context of cognitive radio are studied in this thesis. More specifically, in the first thrust of this thesis, the spectrum spatial holes which could exist in an uplink MU-MIMO cell as a result of the possible free spatial dimensions resulted from the sparse activity of the primary users is studied; a modified sensing algorithm for these spectrum spatial holes that exploit both the block structure of the OFDM signals and the correlation of their activity states along time are proposed. The second thrust is concerned with cognitive radio relaying in the physical layer where the cognitive radio base station (CBS) relays the PU signal while transmitting its own signals to its SUs. We define secondary users with different priorities (different quality of service requirements); the different levels of priority for SUs are achieved by a newly proposed simple linear scheme based on zero forcing called Hierarchal Priority Zero Forcing scheme HPZF