Outlier-aware cooperative spectrum sensing in cognitive radio networks

This paper considers the problem of cooperative spectrum sensing in cognitive radio networks (CRN). Communication in CRNs may be disrupted due to the presence of malicious secondary users (SU) or channel impairments such as shadowing. This paper proposes a spatio-frequency framework that can detect and track malicious users and anomalous measurements in CRNs. The joint problem of spectrum sensing and malicious user identification is posed as an optimization problem that aims to exploit the sparsity inherent to both, spectrum occupancy and malicious user occurrence. Proposed scheme obtains improved performance by utilizing node location information, and can handle missing or inaccurate location information, and noisy SU reports. A distributed block-coordinate descent-based algorithm is proposed that is shown to outperform the state-of-the-art PCA-based approach, and is flexible enough to defeat a variety of attacks encountered in SU networks. An online algorithm, that can handle incorporate multiple SU readings sequentially and adapt to time-varying channels, primary user, and malicious user activity, is also proposed and shown to be consistent. Simulation results demonstrate the efficacy of the proposed algorithms.     

Joint optimal fair cooperative spectrum sensing and transmission in cognitive radio

Since the sensing power consumption of cooperative spectrum sensing (CSS) will decrease the throughput of secondary users (SU) in cognitive radio (CR), a joint optimal model of fair CSS and transmission is proposed in this paper, which can compensate the sensing overhead of cooperative SUs. The model uses the periodic listen-before-transmission method, where each SU is assigned a portion of channel bandwidth, when the primary user (PU) is estimated to be free by the coordinator. Then, a joint optimization problem of local sensing time, number of cooperative SUs, transmission bandwidth and power is formulated, which can compensate the sensing overhead of cooperative SUs appropriately through choosing suitable compensating parameter. The proposed optimization problem can be solved by the Polyblock algorithm. Simulation results show that compared with the traditional model, the total system throughput of the fairness cooperation model decreases slightly, but the total throughput of the cooperative SUs improves obviously.     

Reinforcement learning for performance improvement in cooperative spectrum sensing

Cognitive radio (CR) can provide a promising solution to the spectrum scarcity issue for upcoming wireless communication technologies. Cooperative spectrum sensing (CSS) is generally adopted to improve spectrum utilization and minimize interference to primary users (PUs). The performance of CSS is significantly affected by imperfect reporting channels, and it is an easy target for Byzantine attackers. This paper studies CSS under imperfect reporting channels and Byzantine attacks. We have considered centralized CSS with a hard combining fusion rule. The binary symmetric channel (BSC) is used to model the imperfect reporting channels, and a centralized independent probabilistic small scale attack model is chosen to model Byzantine attackers. We first analyze the traditional CSS (T-CSS) under the imperfect reporting channel and the Byzantine attack. The performance of T-CSS is found to be greatly affected in the considered scenarios. We propose a reinforcement learning-based algorithm to detect cooperating secondary users (CSUs) experiencing weak reporting channels and Byzantine attackers. Generally, in literature, the detected malicious users (MUs) are removed to improve the performance. However, in case there are CSUs with weak reporting channels, the genuine CSUs may be detected as Byzantine attackers and hence removed. To overcome this issue, we propose a weighted sum-based CSS (WS-CSS) algorithm that can improve the CSS performance under weak reporting channels and attacks from Byzantine attackers. It is demonstrated using plots that the proposed WS-CSS algorithm significantly improves the CSS performance.     

5G-based wideband cognitive radio system design with cooperative spectrum sensing

Since the 5G bandwidth is very large, there are a large number of non-continuous idle spectrum in 5G communication. In this paper, we have designed transmitter and receiver of a 5G-based wideband cognitive radio (CR) system with cooperative spectrum sensing, in order to improve transmission performance and avoid interference signals. Each CR user marks the spectrum availability for getting the sub-basis function through doing Inverse Fast Fourier Transform (IFFT) with the product of spectrum marker vector and random phase vector. The cooperative spectrum sensing can be realized by cascading the sub-basis functions of all the users. Multiple access of the CR system is also proposed to access much non-continuous idle spectrum. The simulation results have shown that the proposed CR system can avoid the interference effectively and outperform the spread spectrum system obviously.     

用于认知无线电协作频谱感知的混合蛙跳算法群体初始化技术

提出了一种用于认知无线电线性加权协作频谱感知的改进混合蛙跳算法(shuffled frog leaping algorithm, SFLA) 的群体初始化技术, 提出在SFLA初始群体中包含基于修正偏差因子所得的解, 从而改进算法初期性能. 仿真结果表明相比于传统群体初始化技术, 本文所提出的群体初始化技术能够以更快的速率得到期望解, 从而节约计算时间, 更有利于实时应用 关键词： 认知无线电 频谱感知 混合蛙跳算法 群体初始化     

Cooperative wideband spectrum sensing under reporting channel errors: Analysis and algorithm

This paper focuses on the performance analysis and the algorithm development for cooperative wideband spectrum sensing (CWSS) under imperfect reporting channels for cognitive radio (CR). The centralized approach with multiple distributed cooperating secondary users (CSUs) and a fusion center (FC) is considered for CWSS. Nakagami fading is used to model the channel between PUs and the CSUs. The CSUs equipped with multiple diversity antennas are considered to take advantage of both space and antenna diversity. In this work, the reporting channel model under erroneous reporting is proposed. The repetition code-based CWSS (RC-CWSS) algorithm is proposed for performance improvement. First, the modified, improved theoretical analysis of an existing algorithm called partial band Nyquist sampling-based CWSS (PBNS-CWSS) under no reporting errors is given. The theoretical analysis under an imperfect reporting channel is then carried out for the same algorithm. Then, the complete theoretical analysis for the proposed RC-CWSS algorithm is carried out. The theoretical analyses are verified using Monte-Carlo simulations. The analysis shows that the performance of CWSS is greatly affected by the reporting channel errors. Also, the RC-CWSS outperforms recently proposed state-of-the-art algorithms. Finally, the effects of different parameters on the performance of the proposed algorithm are also studied.     

Single decision reporting for cooperative spectrum sensing under erroneous feedback channels with Byzantine attack

Spectrum sensing based on a single user suffers from low detection performance due to fading, shadowing, and hidden node problems. Cooperative spectrum sensing (CSS) is thought to be a potential method to overcome these issues and improve detection performance in determining the available spectrum in cognitive radio (CR). However, CSS suffers in case of erroneous reporting channels, and it is also susceptible to Byzantine attacks by malicious users (MUs). In this paper, we first analyze the traditional CSS under erroneous feedback channels. And then, we extend the analysis to include erroneous reporting channels in the presence of the Byzantine attack. We propose a single decision reporting (SD-R) algorithm immune to erroneous reporting channels. The proposed algorithm also improves the performance under the Byzantine attack. With the proposed algorithm, MUs can attempt only false alarm attacks, whereas the miss detection attack is not possible. An extensive analysis is carried out, and the plots are shown to prove the superiority of the proposed algorithm.     

基于证据可信度的D-S理论协作频谱感知方法

D-S证据理论频谱感知算法中,针对当协作用户数增加时所引起的报告数据量迅速增大、带宽开销增加问题,将本地测量统计量中不确定度分配到确定信息中,减少了向融合中心发送的数据量,有效降低了带宽开销。其次,针对高冲突数据对D-S证据理论融合结果影响大的问题,通过评估每个证据的可信度,将可信度作为权重来计算加权平均证据,降低了高冲突证据对融合结果的影响。仿真结果表明,所提方法在有效降低了报告带宽开销的同时,能够减少高冲突证据对融合结果的影响。     

认知无线电网络中利用FEC和DE的多节点频谱感知算法

针对认知无线电网络(CRN)中空闲频谱感知困难的问题,本文提出了基于前向纠错和差分进化算法的多节点频谱感知算法。首先,利用基于差分进化算法的协同检测完成信号感知;然后,研究了信道噪声对频谱感知性能的影响;最后,分析了前向纠错技术在信道存在噪声时对频谱感知性能的影响。仿真实验将纠错和无纠错控制信道的不同信噪比作为依据,采用三种不同的检测方法评估了本文算法。仿真实验结果表明,在存在噪声的认知无线电网络中,本文算法提高了系统的性能和检测概率,且协同感知算法的性能随着节点数目的增加而提高,该算法适合应用于实时性要求较高的应用程序。     

基于随机矩阵最大特征值分布的频谱感知算法

现有频谱感知算法在低信噪比时检测性能较低且受虚警概率影响大,针对此问题,提出了一种基于wishart矩阵样本协方差矩阵最大特征值的分布特性的频谱感知算法。该算法利用最大特征值与几何平均特征值的比值,不需要主用户的先验知识,不敏感于噪声,对相关信号和独立同分布信号均具有较高的检测性能。仿真结果表明,所提算法受虚警概率的影响较小,检测性能高,并且在采样点数、协作用户数、信噪比及虚警概率较小的情况下,也能获得较好的检测性能。     

基于改进混合蛙跳算法的认知无线电协作频谱感知

提出了一种改进的混合蛙跳算法（shuffled frog leaping algorithm,SFLA）,并提出了基于改进SFLA的认知无线电协作频谱感知方法,通过仿真对改进SFLA算法性能与传统SFLA算法性能进行了比较,并对本文提出的基于改进SFLA的协作感知方法与已有的基于修正偏差因子（modified deflection coefficient,MDC）的协作感知方法性能进行了比较.结果表明改进SFLA算法性能优于传统SFLA;基于改进SFLA的协作感知方法比MDC方法能获得更大的检测概率,验证 关键词： 认知无线电 频谱感知 混合蛙跳算法     

Potential reduction interior point algorithm unfolding of neutron energy spectrum measured by recoil proton method

A reconstruction algorithm for unfolding neutron energy spectra has been developed, based for the first time on the potential reduction interior point algorithm. This algorithm can be easily applied to neutron energy spectrum reconstruction in the recoil proton method. We transform the neutron energy spectrum unfolding problem into a typical nonnegative linear complementarity problem. The recoil proton energy spectrum and response matrix at angles of 0^o and 30^o are generated by the Geant4 simulation toolkit. Several different neutron energy test spectra are also employed. It is found that this unfolding algorithm is stable and provides efficient, accurate results.