Low Complexity Energy-Efficient Collaborative Spectrum Sensing for Cognitive Radio Networks

Clustering approach is considered a management technology that arranged the distributed cognitive radio users into logical groups to improve the sensing performance of the network. A lot of works in this area showed that cluster-based spectrum sensing (CBSS) technique efficiently tackled the trade-off between performance and overhead issue. By employing the tree structure of the cluster, a multilevel hierarchical cluster-based spectrum sensing (MH-CBSS) algorithm was proposed to compromise between the gained performance and incurred overhead. However, the MH-CBSS iterative algorithm incurs high computational requirements. In this thesis, an energy-efficient low computational hierarchical cluster-based algorithm is proposed which reduces the incurred computational burden. This is achieved by predetermining the number of cognitive radios (CRs) in the cluster, which provides an advantage of reducing the number of iterations of the MH-CBSS algorithm. Furthermore, for a comprehensive study, the modified algorithm is investigated over both Rayleigh and Nakagami fading channels. Simulation results show that the detection performance of the modified algorithm outperforms the MH-CBSS algorithm over Rayleigh and Nakagami fading channels. In addition, a conventional energy detection algorithm is a fixed threshold based algorithm. Therefore, the threshold should be selected properly since it significantly affects the sensing performance of energy detector. For this reason, an energy-efficient hierarchical cluster-based cooperative spectrum sensing algorithm with an adaptive threshold is proposed which enables the CR dynamically adapts its threshold to achieve the minimum total cluster error. Besides, the optimal threshold level for minimizing the overall cluster detection error rate is numerically determined. The detection performance of the proposed algorithm is presented and evaluated through simulation results

Combined Soft Hard Cooperative Spectrum Sensing in Cognitive Radio Networks

Providing some techniques to enhance the performance of spectrum sensing in cognitive radio systems while accounting for the cost and bandwidth limitations in practical scenarios is the main objective of this thesis. We focus on an essential element of cooperative spectrum sensing (CSS) which is the data fusion that combines the sensing results to make the final decision. Exploiting the advantage of the superior performance of the soft schemes and the low bandwidth of the hard schemes by incorporating them in cluster based CSS networks is achieved in two different ways. First, a soft-hard combination is employed to propose a hierarchical cluster based spectrum sensing algorithm. The proposed algorithm maximizes the detection performances while satisfying the probability of false alarm constraint. Simulation results of the proposed algorithm are presented and compared with existing algorithms over the Nakagami fading channel. Moreover, the results show that the proposed algorithm outperforms the existing algorithms. In the second part, a low complexity soft-hard combination scheme is suggested by utilizing both one-bit and two-bit schemes to balance between the required bandwidth and the detection performance by taking into account that different clusters undergo different conditions. The scheme allocates a reliability factor proportional to the detection rate to each cluster to combine the results at the Fusion center (FC) by extracting the results of the reliable clusters. Numerical results obtained have shown that a superior detection performance and a minimum overhead can be achieved simultaneously by combining one bit and two schemes at the intra-cluster level while assigning a reliability factor at the inter-cluster level

Performance analyses and design for cognitive radios

Cognitive radio has been proposed as a promising solution to the conflict between the spectrum scarcity and spectrum under-utilization. As the demand increases for wireless communication services, cognitive radio technology attracts huge attention from both commercial industries and academic researches. The purpose of this thesis is to provide an analytical evaluation of the cognitive radio system performance while taking into consideration of some realistic conditions. Several problems are investigated in this thesis. First, by adopting a dynamic primary user traffic model with one primary user occupancy status change and exponentially distributed channel holding times, its effect on the cognitive radio system performance is evaluated. In the evaluation, the sensing-throughput tradeoff of the cognitive radio is used as the examination criteria, while energy detection is applied during the spectrum sensing. The thesis then takes the investigation further by establishing a primary user multiple changes traffic model which considers multiple primary user occupancy status changes and any reasonable channel holding time distributions. The effect of the primary user multiple changes traffic on the spectrum sensing performance is investigated while the channel holding times are assumed to be exponential, Gamma, Erlang and log-normal distributed. The analytical evaluation of cognitive radio is also carried out from the secondary user transmission perspective, where the performance of the adaptive modulation in cognitive radio system is investigated. The effect of the cognitive radio distinctive features on the performance of both the adaptive continuous rate scheme and the adaptive discrete rate scheme of the adaptive modulation are examined. The BER performance and the link spectral efficiency performance are derived for both schemes. A novel frame structure where the spectrum sensing is performed by using the recovered received secondary frames is also evaluated in this thesis. A realistic scenario which considers the secondary user signal decoding errors is examined for the novel structure, while an ideal upper bound performance is given when the decoding process is assumed perfect. By extending the system to include multiple consecutive secondary frames, the performance of the novel structure is compared to the performance of the traditional frame structure proposed by the IEEE 802.22 WRAN standard. The effect of the primary user multiple changes traffic is also examined for the novel structure. Several major findings are made from the analytical evaluations presented in this thesis. Through numerical examinations, it was shown that, first, the dynamic primary user traffic degrades the performance of cognitive radio systems. Second, the degree of the performance degradation of the cognitive radio systems is related to the number of primary user status changes and the primary user traffic intensity. Different primary user channel holding times distributions also lead to different sensitivities of the system performance to the primary user traffic. Third, cognitive radio distinctive features degrades the performance of the adaptive modulation. When the novel structure is applied for cognitive radio, a higher secondary achievable throughput can be obtained with a limited saturation threshold

Spectrum Sensing and Multiple Access Schemes for Cognitive Radio Networks

Increasing demands on the radio spectrum have driven wireless engineers to rethink approaches by which devices should access this natural, and arguably scarce, re- source. Cognitive Radio (CR) has arisen as a new wireless communication paradigm aimed at solving the spectrum underutilization problem. In this thesis, we explore a novel variety of techniques aimed at spectrum sensing which serves as a fundamental mechanism to find unused portions of the electromagnetic spectrum. We present several spectrum sensing methods based on multiple antennas and evaluate their receiving operating characteristics. We study a cyclostationary feature detection technique by means of multiple cyclic frequencies. We make use of a spec- trum sensing method called sequential analysis that allows us to significantly decrease the time needed for detecting the presence of a licensed user. We extend this scheme allowing each CR user to perform the sequential analysis algorithm and send their local decision to a fusion centre. This enables for an average faster and more accurate detection. We present an original technique for accounting for spatial and temporal cor- relation influence in spectrum sensing. This reflects on the impact of the scattering environment on detection methods using multiple antennas. The approach is based on the scattering geometry and resulting correlation properties of the received signal at each CR device. Finally, the problem of spectrum sharing for CR networks is addressed in or- der to take advantage of the detected unused frequency bands. We proposed a new multiple access scheme based on the Game Theory. We examine the scenario where a random number of CR users (considered as players) compete to access the radio spec- trum. We calculate the optimal probability of transmission which maximizes the CR throughput along with the minimum harm caused to the licensed users’ performance

Generalized detector as a spectrum sensor in cognitive radio networks

The implementation of the generalized detector (GD) in cognitive radio (CR) systems allows us to improve the spectrum sensing performance in comparison with employment of the conventional detectors. We analyze the spectrum sensing performance for the uncorrelated and spatially correlated receive antenna array elements. Addi¬tionally, we consider a practical case when the noise power at the output of GD linear systems (the preliminary and additional filters) is differed by value. The choice of the optimal GD threshold based on the minimum total error rate criterion is also discussed. Simulation results demonstrate superiority of GD implementation in CR sys¬tem as spectrum sensor in comparison with the energy detector (ED), weighted ED (WED), maximum-minimum eigenvalue (MME) detector, and generalized likelihood ratio test (GLRT) detecto

Wideband Spectrum Sensing for Dynamic Spectrum Sharing

The proliferation of wireless devices grows exponentially, demanding more and more data communication capacity over wireless links. Radio spectrum is a scarce resource, and traditional wireless networks deployed by Mobile Network Operators (MNO) are based on an exclusive spectrum band allocation. However, underutilization of some licensed bands in time and geographic domains has been reported, especially in rural areas or areas away from high population density zones. This coexistence of increasingly high data communication needs and spectrum underutilization is an incomprehensible scenario. A more rational and efficient use of the spectrum is the possibility of Licensed Users (known as Primary Users – PU) to lease the spectrum, when not in use, to Unlicensed Users (known as Secondary Users – SU), or allowing the SU to opportunistically use the spectrum after sensing and verifying that the PU is idle. In this latter case, the SU must stop transmitting when the PU becomes active. This thesis addresses the spectrum sensing task, which is essential to provide dynamic spectrum sharing between PUs and SUs. We show that the Spectral Correlation Function (SCF) and the Spectral Coherence Function (SCoF) can provide a robust signal detection algorithm by exploiting the cyclostationary characteristics of the data communication signal. We enhance the most used algorithm to compute de SCF - the FAM (FFT Accumulation Method) algorithm – to efficiently compute the SCF in a local/zoomed region of the support ( ; ) plane (frequency/cycle frequency plane). This will provide the quick identification of spectral bands in use by PUs or free, in a wideband sampling scenario. Further, the characterization of the probability density of the estimates of the SCF and SCoF when only noise is present, using the FAM algorithm, will allow the definition of an adaptive threshold to develop a blind (with respect to the noise statistics) Constant False Alarm Rate (CFAR) detector (using the SCoF) and also a CFAR and a Constant Detection Rate (CDR) detector when that characterization is used to obtain an estimate of the background noise variance (using the SCF).A proliferação de dispositivos sem fios cresce de forma exponencial, exigindo cada vez mais capacidade de comunicação de dados através de ligações sem fios. O espectro radioelétrico é um recurso escasso, e as redes sem fios tradicionais implantadas pelos Operadores de Redes Móveis baseiam-se numa atribuição exclusiva de bandas do espectro. No entanto, tem sido relatada a subutilização de algumas bandas licenciadas quer ao longo do tempo, quer na sua localização geográfica, especialmente em áreas rurais, e em áreas longe de zonas de elevada densidade populacional. A coexistência da necessidade cada vez maior de comunicação de dados, e a subutilização do espectro é um cenário incompreensível. Uma utilização mais racional e eficiente do espectro pressupõe a possibilidade dos Utilizadores Licenciados (conhecidos como Utilizadores Primários – Primary Users - PU) alugarem o espectro, quando este não está a ser utilizado, a Utilizadores Não Licenciados (conhecidos como Utilizadores Secundários – Secondary Users - SU), ou permitir ao SU utilizar oportunisticamente o espectro após a deteção e verificação de que o PU está inativo. Neste último caso, o SU deverá parar de transmitir quando o PU ficar ativo. Nesta tese é abordada a tarefa de deteção espectral, que é essencial para proporcionar a partilha dinâmica do espectro entre PUs e SUs. Mostra-se que a Função de Correlação Espectral (Spectral Correlation Function - SCF) e a Função de Coerência Espectral (Spectral Coherence Function - SCoF) permitem o desenvolvimento de um algoritmo robusto de deteção de sinal, explorando as características ciclo-estacionárias dos sinais de comunicação de dados. Propõe-se uma melhoria ao algoritmo mais utilizado para cálculo da SCF – o método FAM (FFT Accumulation Method) - para permitir o cálculo mais eficiente da SCF numa região local/ampliada do plano de suporte / (plano de frequência/frequência de ciclo). Esta melhoria permite a identificação rápida de bandas espectrais em uso por PUs ou livres, num cenário de amostragem de banda larga. Adicionalmente, é feita a caracterização da densidade de probabilidade das estimativas da SCF e SCoF quando apenas o ruído está presente, o que permite a definição de um limiar adaptativo, para desenvolver um detetor de Taxa de Falso Alarme Constante (Constant False Alarm Rate – CFAR) sem conhecimento do ruído de fundo (usando a SCoF) e também um detetor CFAR e Taxa de Deteção Constante (Constant Detection Rate – CDR), quando se utiliza aquela caracterização para obter uma estimativa da variância do ruído de fundo (usando a SCF)

Throughput analysis of full-duplex communication cognitive radio network

In this paper we deal with the throughput of full-duplex cognitive communication radio which exploits unused band of primary user (PU) network. Classical cognitive radio uses half-duplex communication spectrum sensing to perform spectrum sensing and data transmission at different time intervals. It’s well-established fact that in half-duplex communication cognitive radio spectrum sensing time increases at low SNR which gives rise to lesser data transmission time for secondary user (SU) and hence results in less throughput for SU. It’s useful idea to do spectrum sensing and data transmission at the same time with two different antennas co-located on the SU transceiver. This shall not only guarantee high probability of detection of PU but also increased data transmission which means more throughput for SU. However, simultaneous sensing and data transmission has inherent problem of self-interference. One of the possible solution is to use polarisation discrimination in which sensing and data transmission antennas must use different polarisation. This is feasible if there is prior information about the polarisation of the signals emitted by the PUs. It shall be of special interest to assess throughput using analytical expressions for probability of detection PD, probability of false alarm PFA at various values of SNR for time-slotted cognitive radio which uses half-duplex spectrum sensing and non-time-slotted cognitive radio which uses full-duplex communication cognitive radio