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

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

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.     

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.     

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.     

Opportunistic spectrum access for TDMA-based cognitive radio networks

In this paper, opportunistic spectrum access is proposed for TDMA-based cognitive radio networks. In TDMA-based networks, the time is divided into slots with fixed length one by one. If a primary user (PU) needs to transmit data, one or several slots will be used. Otherwise, the slots are idle and can be utilized by secondary users (SUs). When SUs want to use the licensed channel, they should sense the channel at the beginning period of each slot. Then SUs exchange their sensing results and make the same decision about the channel state (idle or used by PUs), which could reduce the probability of false sensing. The aforementioned duration is called spectrum sensing phase. When SUs decide there is an idle channel, they contend to use the channel at the rest time of the slot. The duration is called access phase. In this period, SUs contend the channel with backoff counters. When the remaining time is less than one data transmission duration, SUs cannot transmit data packets. Therefore, the remaining time is wasted. To solve this problem, SUs transmit control packets with small length in the remaining time instead. The SU who exchange control packets successfully reserves the channel and sends a data packet prior to other SUs in access phase of the next idle slot. Obviously, this reserved transmission is without collision. The independent spectrum sensing, channel state decision and control packets reservation influence the performance of SUs. The proposed scheme is formulated with all above factors. Simulations which consist with the numerical results show the proposed access scheme achieve higher throughput than the existed scheme without channel reservation.     

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

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

Secure collaborative cognitive radio based on chaotic modulation and compressive sensing

Cognitive radio (CR) is a wireless technology that is used to overcome the spectrum scarcity problem. CR includes several stages, spectrum sensing is the first stage in the CR cycle. Traditional spectrum sensing (SS) techniques have many challenges in the wideband spectrum. CR security is an important problem, since when an attacker from outside the network access the sensing information this produces an increase in sensing time and reduces the opportunities for exploiting vacant band. Compressive sensing (CS) is proposed to capture all the wideband spectrum at the same time to solve the challenges and improve the performance in the traditional techniques and then one of the traditional SS techniques are applied to the reconstructed signal for detection purpose. The sensing matrix is the core of CS must be designed in a way that produces a low reconstruction error with high compression. There are many types of sensing matrices, the chaotic matrix is the best type in terms of security, memory storage, and system performance. Few works in the literature use the chaotic matrix in CS based CR and these works have many challenges: they used sample distance in the chaotic map to generate a chaotic sequence which consumes high resources, they did not take into consideration the security in reporting channel, and they did not measure their works using real primary user (PU) signal of a practical application under fading channel and low SNR values. In this paper, we propose a chaotic CS based collaborative scenario to solve all challenges that have been presented. We proposed a chaotic matrix based on the Henon map and use the differential chaotic shift keying (DCSK) modulation to transmit the measurement vector through the reporting channel to increase the security and improve the performance under fading channel. The simulation results are tested based on a recorded real-TV signal as PU and Compressive Sampling Matching Pursuit (CoSaMP) recovery algorithm under AWGN and TDL-C fading channels in collaborative and non-collaborative scenarios. The performance of the proposed system has been measured using recovery error, mean square error (MSE), derived probability of detection (Pdrec), and sensitivity to initial values. To measure the improvement introduced by the proposed system, it is evaluated in comparison with selected chaotic and random matrices. The results show that the proposed system provides low recovery error, MSE, with high Pdrec, security, and compression under SNR equal to −30 dB in AWGN and TDL-C fading channels as compared to other matrices in the literature.     

Robust secrecy rate maximization in IRS-assisted cognitive radio networks

In this paper, we focus on the secrecy rate maximization problem in intelligent reflecting surface (IRS)-assisted cognitive radio (CR) networks. In order to improve the security, there is a common scheme to add artificial noise (AN) to the transmitted signal, which is also applied in this paper. Further, in CR networks, the secondary users always cannot obtain accurate channel state information (CSI) about the primary user and eavesdropper. By taking jointly design for the IRS phase shift matrix, the transmitted beamforming of the secondary base station (BS), and the covariance matrix of AN, our objective is to maximize the minimal secrecy rate of all secondary users. Due to the serious coupling among the designed variables, it cannot be solved by conventional methods. We propose an alternating optimization (AO) algorithm. In simulation results, we apply primary users and secondary users randomly distributed in the communication area, which numerically demonstrate the superiority of our proposed scheme.     

On spectrum sensing in cognitive radio CDMA networks with beamforming

In this paper, the performance of cognitive radio (CR) code division multiple access (CDMA) networks is analyzed in the presence of receive beamforming at the base stations (BSs). More precisely, we analyze, through simulations, the performance achievable by a CR user, with and without spectrum sensing, in a three-cell scenario. Uplink communications are considered. Three different schemes for spectrum sensing with beamforming are presented, together with a scheme without spectrum sensing. CR users belong to a cognitive radio network (CRN) which is coexisting with a primary radio network (PRN). Both the CRN and the PRN are CDMA based. The CRN is assumed to utilize beamforming for its CR users. Soft hand-off (HO) and power control are considered in both the CRN and the PRN. The impact of beamforming on the system performance is analyzed, considering various metrics. In particular, we evaluate the performance of the proposed systems in terms of outage probability, blocking probability, and average data rate of CR users. The results obtained clearly indicate that significant performance improvements can be obtained by CR users with the help of beamforming. The impact of several system parameters on the performance of the three considered spectrum sensing schemes with beamforming is analyzed. Our results, in terms of probability of outage, show that the relative improvement brought by the use of beamforming is higher in the absence of spectrum sensing (reduction of 80%) than in the presence of spectrum sensing (reduction of 42%).     

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.     

Spectrum sensing in cognitive radio networks and metacognition for dynamic spectrum sharing between radar and communication system: A review

The massive growth in mobile users and wireless technologies has resulted in increased data traffic and created demand for additional radio spectrum. This growing demand for radio spectrum has resulted in spectrum congestion and mandated the need for coexistence between radar and interfering communication emitters. To address the aforementioned issues, it is critical to review existing policies and evaluate new technologies that can utilize spectrum in an efficient and intelligent manner. Cognitive radio and cognitive radar are two promising technologies that exploit spectrum using dynamic spectrum access techniques. Additionally, introducing the bio-inspired concept ‘metacognition’ in a cognitive process has shown to increase the effectiveness and robustness of the cognitive radio and cognitive radar system. Metacognition is a high-order thinking agent that monitors and regulates the cognition process through a feedback and control process called the perception–action cycle. Extensive research has been done in the field of spectrum sensing in cognitive radio and spectral coexistence between radar and communication systems. This paper provides a detailed classification of spectrum sensing schemes and explains how dynamic spectrum access strategies share the spectrum between radar and communication systems. In addition to this, the fundamentals of cognitive radio, its architecture, spectrum management framework, and metacognition concept in radar are discussed. Furthermore, this paper presents various research issues, challenges, and future research directions associated with spectrum sensing in cognitive radar and dynamic spectrum access strategies in cognitive radar.     

Multi-channel sensing and resource allocation in energy constrained cognitive radio networks

We consider a cognitive radio network in a multi-channel licensed environment. Secondary user transmits in a channel if the channel is sensed to be vacant. This results in a tradeoff between sensing time and transmission time. When secondary users are energy constrained, energy available for transmission is less if more energy is used in sensing. This gives rise to an energy tradeoff. For multiple primary channels, secondary users must decide appropriate sensing time and transmission power in each channel to maximize average aggregate-bit throughput in each frame duration while ensuring quality-of-service of primary users. Considering time and energy as limited resources, we formulate this problem as a resource allocation problem. Initially a single secondary user scenario is considered and solution is obtained using decomposition and alternating optimization techniques. Later we extend the analysis for the case of multiple secondary users. Simulation results are presented to study effect of channel occupancy, fading and energy availability on performance of proposed method.     

A virus spreading model for cognitive radio networks

Since cognitive radio (CR) networks could solve the spectrum scarcity problem, they have drawn much research in recent years. Artificial intelligence(AI) is introduced into CRs to learn from and adapt to their environment. Nonetheless, AI brings in a new kind of attacks specific to CR networks. The most powerful one is a self-propagating AI virus. And no spreading properties specific to this virus have been reported in the literature. To fill this research gap, we propose a virus spreading model of an AI virus by considering the characteristics of CR networks and the behavior of CR users. Several important observations are made from the simulation results based on the model. Firstly, the time taken to infect the whole network increases exponentially with the network size. Based on this result, CR network designers could calculate the optimal network size to slow down AI virus propagation rate. Secondly, the anti-virus performance of static networks to an AI virus is better than dynamic networks. Thirdly, if the CR devices with the highest degree are initially infected, the AI virus propagation rate will be increased substantially. Finally, it is also found that in the area with abundant spectrum resource, the AI virus propagation speed increases notably but the variability of the spectrum does not affect the propagation speed much.     

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.     

A tree-structured DFT filter bank based spectrum detector for estimation of radio channel edge frequencies in cognitive radios

Cognitive Radio (CR) aims to provide efficient spectrum utilization in spectrum scarce wireless environments. One of the key CR functionalities is the spectrum sensing, which allows CRs to monitor the electromagnetic spectrum and detect unused bands of spectrum. Wideband spectrum sensing needs to be employed for better spectrum opportunity detection and interference avoidance both in the case of commercial and military applications. Accurate sensing needs to be employed for blocker detection in commercial systems such as LTE for the design of transmit/receive path. In military radios, the challenge lies in the robust detection of the location of the center frequencies and bandwidths of individual radio channels in the wideband input signal. In this paper, an energy detector based on tree-structured discrete Fourier transform based filter bank (TDFTFB) is proposed for detecting the edges of the channels in the spectrum. The proposed method is compared with the conventional wavelets based method for complexity and performance. The design example and simulations show that the gate count resource utilization of the proposed detection scheme is 22.9% lesser than the wavelets method at the cost of a slight degradation (0.5%) in detection accuracy. Over-the-air tests performed using Universal Software Radio Peripheral 2 (USRP2) and MATLAB/SIMULINK showed that the present method is not input specific whereas the conventional wavelet based approach depends on the spectral location of the input.     

A robust power spectrum split cancellation-based spectrum sensing method for cognitive radio systems

Spectrum sensing is an essential component to realize the cognitive radio, and the requirement for real-time spectrum sensing in the case of lacking prior information, fading channel, and noise uncertainty, indeed poses a major challenge to the classical spectrum sensing algorithms. Based on the stochastic properties of scalar transformation of power spectral density（PSD）, a novel spectrum sensing algorithm, referred to as the power spectral density split cancellation method（PSC）, is proposed in this paper. The PSC makes use of a scalar value as a test statistic, which is the ratio of each subband power to the full band power. Besides, by exploiting the asymptotic normality and independence of Fourier transform,the distribution of the ratio and the mathematical expressions for the probabilities of false alarm and detection in different channel models are derived. Further, the exact closed-form expression of decision threshold is calculated in accordance with Neyman–Pearson criterion. Analytical and simulation results show that the PSC is invulnerable to noise uncertainty,and can achive excellent detection performance without prior knowledge in additive white Gaussian noise and flat slow fading channels. In addition, the PSC benefits from a low computational cost, which can be completed in microseconds.     

Spectrum mobility in cognitive radio network using spectrum prediction and monitoring techniques

The spectrum mobility during data transmission is an integral part of the cognitive radio network (CRN) which is conventionally two types for instance reactive and proactive. In the reactive approach, the cognitive user (CU) switches its communication after the emergence of the primary user (PU), where the detection of emergence of PU relies either on spectrum sensing and/or monitoring. Due to certain limitations of the reactive approach such as: (1) loss at least one packet on the emergence of PU and (2) resource (bandwidth) wastage if the periodic sensing is used for mobility, the researchers have introduced the concept of proactive spectrum mobility. In this approach, the emergence of PU is predicted on the bases of pre-available spectrum information, and switching is performed before true emergence of the PU, in order to avoid even the single packet loss. However, the imperfect spectrum prediction is a major milestone for the proactive spectrum mobility. Recently, due to introduction of the spectrum monitoring simultaneous to the data transmission, the reactive approach has come into lime-light again, however, it suffers from the ‘single packet loss’ and ‘imperfect spectrum monitoring’ issues. Therefore in this paper, we have exploited the spectrum monitoring and prediction techniques, simultaneously for the spectrum mobility, in order to enhance the performance of cognitive radio network (CRN). In the proposed strategy, the decision results of the spectrum prediction and monitoring techniques are fused using AND and OR fusion rules, for the detection of emergence of PU during the data transmission. Further, the closed-form expressions of the resource wastage, achieved throughput, interference power at PU and data-loss for the proposed approaches as well as for the prediction and monitoring approaches are derived. Moreover, the simulation results for the proposed approaches are presented and validation is performed by comparing the results with prediction and monitoring approach. In a special case, when the prediction error is zero, the graphs of all metric values overlies the spectrum monitoring approach, which further validates the proposed approach.     

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

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