Throughput Maximization in Cognitive Radio System with Transmission Probability Scheduling and Traffic Pattern Prediction

In this paper, we propose a novel transmission probability scheduling (TPS) scheme for the opportunistic spectrum access based cognitive radio system (OSA-based CRS), in which the secondary user (SU) optimally schedules its transmission probabilities in the idle period of the primary user (PU), to maximize the throughput of the SU over a single channel when the collision probability perceived by the PU is constrained under a required threshold. Particularly, we first study the maximum achievable throughput of the SU when the proposed TPS scheme is employed under the assumption that the distribution of the PU idle period is known and the spectrum sensing is perfect. When the spectrum sensing at the SU is imperfect, we thoroughly quantify the impact of sensing errors on the SU performance with the proposed TPS scheme. Furthermore, in the situation that the traffic pattern of the PU and its parameters are unknown and the spectrum sensing is imperfect, we propose a predictor based on hidden Markov model (HMM) for the proposed TPS scheme to predict the future PU state. Extensive simulations are conducted and show that the proposed TPS scheme with the HMM-based predictor can achieve a reasonably high SU throughput under the PU collision probability constraint even when the sensing errors are severe.     

Dynamic wireless spectrum access using GNU Radio and software‐defined radios

This paper presents the design, implementation, and results from a dynamic wireless spectrum access system built using GNU Radio and software‐defined radios (SDRs) as part of an undergraduate senior design project. The project involved designing and implementing a dynamic wireless spectrum access system in which the secondary user (SU) learns the unknown transmission behavior (channel occupancy and time slots) of the primary user (PU) and then opportunistically transmits during time slots and using channels when they are not being used by the PUs. The main design objective was to maximize the throughput of the SU while minimizing the interference to the PU. A transmitted signal energy detection algorithm with an adaptive threshold was employed to set the channel states as occupied or not occupied. Channel state information was used to determine the PU behavior in a deterministic manner such that the unused time slots and channels could be exploited. A channel allocation scheme for the SU is proposed using the PU channel occupancy information to calculate the channel(s) and time slots available to the SU at any given time. Simulation and physical testing of the system validate the proposed algorithms. Students' feedback affirms GNU Radio and SDRs to be an effective platform for introducing abstract mathematical communications theory concepts, such as cognitive radios and dynamic spectrum allocation, in a hands‐on manner.     

Adaptive dual‐radio spectrum‐sensing scheme in cognitive radio networks

In this paper, a novel spectrum‐sensing scheme, called adaptive dual‐radio spectrum‐sensing scheme (ADRSS), is proposed for cognitive radio networks. In ADRSS, each secondary user (SU) is equipped with a dual radio. During the data transmission, with the received signal‐to‐noise ratio of primary user (PU) signal, the SU transmitter (SUT) and the SU receiver (SUR) are selected adaptively to sense one channel by one radio while communicating with each other by the other one. The sensing results of the SUR are sent to the SUT through feedback channels (e.g., ACK). After that, with the sensing results from the SUT or the SUR, the SUT can decide whether the channel switching should be carried out. The theoretical analysis and simulation results indicate that the normalized channel efficiency, defined as the expected ratio of time duration without interference to PUs in data transmission to the whole frame length, can be improved while satisfying the interference constraint to PUs. After that, an enhanced ADRSS is designed by integrating ADRSS with cooperative spectrum sensing, and the performance of ADRSS under imperfect feedback channel is also discussed. Copyright © 2011 John Wiley & Sons, Ltd.     

Defense against primary user emulation attacks from the secondary user throughput perspective

The maximization of Secondary user (SU) throughput has been studied extensively in honest cooperative spectrum sensing (CSS). However, when primary user emulation attacks (PUEAs) are launched, the model of CSS changes. This also necessitates the redesigning of the SU throughput maximisation scheme. In this paper, such redesigning of the SU throughput maximisation scheme under PUEAs has been carried out. Our objective is to suppress the damages caused by the PUEAs on the SU throughput. To serve this purpose, an optimally weighted CSS has been proposed. The optimal weights are obtained by maximising the SU throughput while protecting the primary user (PU) from interference in a network facing the PUEAs. Considering the significance of simplicity and speed in CSS, we apply the Nelder Mead Simplex Algorithm to solve the problem. The experiments carried out endorse the effectiveness of the proposed scheme compared to the existing combination schemes.     

Optimal Energy Harvesting-based Weighed Cooperative Spectrum Sensing in Cognitive Radio Network

In cognitive radio (CR) network, to improve spectrum sensing performance to primary user (PU) and decrease energy wastage of secondary user (SU) in cooperative spectrum sensing, an energy harvesting-based weighed cooperative spectrum sensing is proposed in this paper. The SU harvests the radio frequency (RF) energy of the PU signal and then converts the RF energy into the electric energy to supply the power used for energy detection and cooperation. The time switching model and power splitting model are developed to realize the notion. In the time switching model, the SU performs either spectrum sensing or energy harvesting at any time, while in the power splitting model, the received PU signal is split into two signal streams, one for spectrum sensing and the other one for energy harvesting. A joint optimization problem is formulated to maximize the spectrum access probability of the SU by jointly optimizing sensing time, number of cooperative SUs and splitting factor. The simulation results have shown that compared to the traditional cooperative spectrum sensing, the proposed energy harvesting-based weighed cooperative spectrum sensing can decrease the energy wastage obviously while guaranteeing the maximum spectrum access probability.     

基于稳定匹配的认知无线网络协作物理层安全机制

在Underlay认知无线网络中,次用户被允许在主用户进行数据发送时接入主用户的频谱.此时,主用户将对次用户和窃听者造成干扰.利用协作干扰技术,主用户产生的干扰可以被用来改善次用户的物理层安全.基于此,本文针对包含多个主次用户的Underlay认知无线网络,提出了一种新的协作物理层安全机制.为了在保证主用户通信质量的前提下,最大化网络中次用户的总的安全容量,该机制将对次用户进行合理的频谱接入选择和功率控制.另外,考虑到个体理性和自私性对于频谱接入稳定性的影响,该机制利用稳定匹配理论将频谱接入选择问题建模为一对一的双边匹配问题,通过构建主次用户之间的稳定匹配来保证频谱接入的稳定性.仿真结果表明,使用本文所提安全机制,可以在保证主用户通信质量的前提下,稳定而又有效地改善网络中次用户获得的总的安全容量.     

A reliable cooperative spectrum detection scheme in cognitive radio networks

Reliable spectrum detection of the primary user (PU) performs an important role in the cognitive radio network since it’s the foundation of other operations. Spectrum sensing and cognitive signal recognition are two key tasks in the development of cognitive radio (CR) technology in both commercial and military applications. However, when the CR terminals receiving signals have little knowledge about the channel or signal types, these two tasks will become much more difficult. In this paper, we propose a reliable cooperative spectrum detection scheme, which combines the cooperative spectrum sensing with distributed cognitive signal recognition. A novel improved cooperative sensing algorithm is achieved by using a credibility weight factor and the “tug-of-war” rule, which is based on the double threshold detection and Dempster–Shafer theory, to determine whether the PU signals exist. In this scheme, cognitive signal recognition can be used to identify the signal type when the PU signal is present. During the cognitive signal recognition processing, the CR terminals make local classification of the received signals by using Daubechies5 wavelet transform and Fractional Fourier Transform, and send their recognition results to the globe decision making center. A distributed processing uses these cognitive terminals’ local results to make final decisions under the Maximum Likelihood estimation algorithm. Simulation results show that the proposed method can achieve good sensing probability and recognition accuracy under the Additive White Gaussian Noise channel.     

Secrecy outage analysis in a hybrid cognitive relay network with energy harvesting

In this paper, we investigate the physical layer security of a hybrid cognitive relay network using an energy harvesting relay in presence of an eavesdropper. In the hybrid scheme, a secondary user (SU) as well as a cognitive relay works either in underlay or in overlay mode. In underlay, the transmit power of the SU as well as the relay is limited by the maximum acceptable interference at primary user (PU) receiver as required by an outage constraint of PU, a quality of service for PU. The secondary network consists of a decode and forward relay that harvests energy from radio frequency signal of secondary transmitter as well as PU transmitter to assist the SU in forwarding the information signal to the destination. A time switching relaying protocol is used at the relay. We evaluate the secrecy outage probability of secondary relay network assuming that channel state information of the interfering links from both the SU and relay transmitter to PU receiver is imperfect. Our results reveal the impact of imperfect channel state information, energy harvesting time, tolerable interference threshold, and PU outage constraint on the secrecy outage probability of SU.     

An auction-based approach for spectrum leasing in cooperative cognitive radio networks: when to lease and how much to be leased

The problem of resource allocation in a spectrum leasing scenario in cooperative cognitive radio networks is addressed. The system model consists of a number of primary user (PU) pairs and a secondary user (SU) pair. The SU pair allocates the whole its transmission power in a portion of transmission frame to relay the primary signals. In return, the PU pairs lease their unused portion of transmission frame to the SU pair. In this way, the PU pairs take advantage of their unused portion of time to gain savings in their transmission power. However, a few important questions must be answered: When to lease and how much to be leased. We determine when is beneficial for PUs to lease their unused spectrum portion to the SU and how much of PUs’ resources is optimum to be leased. An efficient auction mechanism is proposed and the existence and uniqueness of the Nash Equilibrium (NE) for the proposed auction game is proved. Since the NE is the solution of a set of fixed point problems, two iterative algorithms, synchronous and asynchronous schemes, are proposed to reach the NE in an iterative manner and their convergence to the fixed point is also proved. Finally, the proposed auction is extended to a network with multiple secondary user pairs. Simulation results acknowledge the more efficient utilization of resources as a result of implementing the proposed auction based resource allocation.     

An adaptive handoff strategy for cognitive radio networks

Spectrum handoff plays an important role in spectrum management as it is the process of seamlessly shifting the on-going transmission of a secondary user (SU) to a free channel without degrading the quality of service. In this paper, we develop an adaptive handoff algorithm that allows an SU to detect the arrival of a primary user (via sensing) and adapt to a reactive or a proactive handoff strategy accordingly. The adaptive handoff scheme first allows an SU to decide whether to stay and wait on current channel or to perform handoff. Then, in case of handoff, an SU intelligently shifts between proactive or reactive handoff modes based on primary use (PU) arrival rate. Further, a PU prioritized Markov approach is presented in order to model the interactions between PUs and SUs for smooth channel access. Numerical results show that the proposed handoff scheme minimizes the blocking probability, number of handoffs, handoff delay and data delivery time while maintaining channel utilization and system throughput at maximal level compared to simple reactive and proactive schemes.     

Performance Analysis of the Primary User in the Secondary User Relay Assisted Spectrum Sharing Networks

In this paper, inaccurate spectrum detecting by the secondary user (SU) is taken into account. The impact of the interference caused by the SUs due to miss detection on the primary user (PU) in a spectrum sharing network is analyzed, and those SU nodes of correct detection are assumed to act as potential relays to assist the PU transmission process based on two proposed cooperative transmission schemes, referred to as, the distance based and the signal-to-noise-ratio (SNR) based schemes. We utilize stochastic geometry to analyze the impact of the secondary network parameters and cooperative transmission schemes on a typical primary source–destination (S–D) pair for the SU relay assisted spectrum sharing networks in Rayleigh fading environment. Using this approach, closed-form expressions for the primary system success probabilities with those cooperative transmission schemes as well as the PU direct re-transmission scheme are derived respectively. Simulations confirm our analytical derivations and results demonstrate that significant improvement on the PU success probability by using SU cooperative transmission schemes, and the SNR based scheme is superior to the distance based scheme.     

Cooperative spectrum sensing using amplify-and-forward relaying with partial relay selection in cognitive radio networks

Cooperative spectrum sensing has been shown to be an effective approach to improve the detection performance by exploiting the spatial diversity among multiple cognitive nodes. By using the amplify-and-forward relaying with partial relay selection, this paper proposes a novel cooperative spectrum sensing scheme, which provides higher detection performance and is interesting in distributed cognitive radio networks. In the proposed sensing scheme, the “best” cognitive relay by means of partial relay selection technique amplifies and forwards the signals transmitted from the primary user (PU) to the cognitive user (CU). Then the CU detects PU’s states (i.e., presence or absence) via an energy detector. Moreover, the average missed-detection probability of proposed sensing scheme is studied over Nakagami-m fading channels, where m is a positive integer. In particular, the tight closed-form lower bounds of the average missed-detection probability are presented for the convenience of performance evaluation in practice. Finally, numerical results are provided to validate the derived closed-form lower bounds and the influence of the number of cognitive relays on the detection performance is also discussed.     

一种动态时变衰落信道下的频谱感知算法

针对时变慢衰落信道中频谱感知问题,提出一种新颖的动态状态空间系统模型,将授权用户状态与时变衰落信道状态看作2个隐藏系统状态;在此基础上,提出一种联合估计时变信道增益与授权用户状态的新型频谱感知方法。仿真结果表明,提出的新方案能够显著提高动态时变衰落信道中的频谱感知性能。     

Adaptive code symbol assignment in a rateless coded multichannel cognitive radio network

Because of its robustness to packet loss and adaptivity to channel conditions, rateless codes have been used in cognitive radio networks to improve the secondary system performance. In this paper, we investigate an adaptive code symbol assignment scheme for the secondary user (SU) in a multichannel cognitive radio network based on rateless coding. In particular, the SU transmitter first encodes its information data through rateless coding and then assigns the unceasingly generated code symbols adaptively to each available channel obtained by spectrum sensing. Thanks to the forward incremental redundancy provided by rateless codes, it is unnecessary for the SU receiver to request the retransmission of lost symbols and the code symbols collected from any channel at any time contribute to the final data recovery. With an alternating channel occupancy model of the primary user (PU), we conduct a weight enumerator analysis to derive the optimal number of code symbols to be assigned to each available channel, thus to maximize the system throughput while protecting PU from interference. Both theoretical analysis and numerical results demonstrate the good performance of our proposed scheme. Copyright © 2012 John Wiley & Sons, Ltd.     

认知网络中的能量回收技术：性能分析及优化设计

通信网络中有限的能源和频带资源限制了网络容量的进一步提升.对能量回收技术在认知网络中的应用进行研究,量化评估用户可回收的能量以及可达吞吐率,并进行优化设计很有必要.在所分析的系统中,当授权用户进行通信时,非授权用户可回收无线信号中所带有的能量,并利用回收的能量进行频谱检测;当检测到授权用户空闲时,非授权用户将接入频谱,利用回收到的能量进行数据传输.采用马尔科夫链模型对通信场景进行描述分析,发现授权用户的活跃程度对非授权用户可回收的能量、获得的传输机会带来影响,进而决定了非授权用户的可达吞吐量.在此基础上,提出一种通过控制授权用户业务量,以最大化网络能量效用和频谱效用的优化方案,并通过仿真证实了理论分析的正确性.     

Channel assignment scheme in clustered multichannel cognitive radio networks with outdated CSI over Rayleigh fading channels

This work investigates channel assignment for cooperative spectrum sensing in multichannel cognitive radio networks, where the heterogeneity of primary user (PU) activity and the effect of varying channel condition on the received signal‐to‐noise ratio during cluster formation are considered. With the objective to minimize interference to the PU while enhancing multiple spectrum utilization of the secondary user (SU), an overlapping cluster‐based assignment is formulated into a nonlinear integer optimization problem. To obtain an efficient solution, the nonlinear integer problem is transformed into a mixed integer linear problem, based on which, this paper proposes an exact solution and then two new heuristic algorithms for suboptimal solutions, respectively. Furthermore, a comparative study of four different cluster head selection schemes with respect to their performance in cooperative spectrum sensing, under cluster's heterogeneity in terms of SUs distribution relative to PU transmitter location is presented. Based on the study, a robust cluster head selection scheme is proposed. Simulation results show that good sensing performance and increased opportunistic spectrum utilization in multichannel cognitive radio networks are two sides of a coin that depend on the ratio of the SUs to the number of PU channels. How far away the PU is from the cluster center is also seen to be key in the optimal selection of cluster heads in cooperative spectrum sensing.     

L-CR系统中分布式压缩感知最小角回归信号重构

在低轨（LEO）微小卫星感知无线电（L-CR）系统中,多个LEO卫星节点具备一定的频谱感知功能,卫星节点通过分布式组网对地面信关站发射的信息进行感知、传输和处理,地面汇聚节点对LEO卫星节点转发信号进行重构。考虑LEO系统中授权频带的主用户（PU）对卫星认知用户（SU）的干扰,认知用户感知到的信号同时存在PU干扰和噪声,地面汇聚节点通过高效的重构算法进行含噪信号恢复是L-CR系统实现的重要问题。论文研究了L-CR系统中基于分布式压缩感知的信号重构方法。针对L-CR特点,分别分析了汇聚节点在低信噪比情况下采用凸松弛法中的基追踪去噪（BPDN）、同伦（Homotopy）法和最小角回归（Lars）的重构均方误差（MSE）与重构复杂度。研究表明,BPDN具有最小的重构MSE,但其重构复杂度最高。Lars可以有效折衷重构MSE与复杂度。在此基础上,提出了基于分布式压缩感知的最小角回归（DCS-Lars）信号重构方案。仿真结果表明,所提DCS-Lars方法可以在低信噪比情况下有效重构感知信号,并具有良好的频谱检测能力,同时重构复杂度大大降低。      

Cooperative spectrum sensing scheduling scheme based on discrete particle swarm optimization algorithm

The statistical characteristics of the network state changes were analyzed by using the CTMC model.Considering the difference of each secondary user’s sensing ability,two integer programming problems on cooperative sensing scheduling scheme were established from two aspects:the primary users and the secondary users respectively.A discrete particle swarm optimization algorithm was proposed to solve the integer programming problems,and compared with the traditional random scheduling scheme and greedy scheduling scheme based on SNR.The simulation results show that the cooperative sensing scheduling scheme based on discrete particle swarm optimization algorithm is superior to random scheduling scheme and greedy scheduling scheme based on the SNR,which gets a higher spectrum sensing accuracy.     

Equation Chapter 1 Section 1基于中继的协作频谱感知性能分析及优化

提出了一种基于目标的中继协作频谱感知方案,证明了SU到SR链路上的信道条件对系统性能有较大的影响;鉴于此,提出了一种优化的最佳中继协作频谱感知(optimized BRCSS)方案,通过联合考虑目标SU到SR链路上的信道条件和 SR 到 FC 链路上的信道条件选择最佳认知中继;最后,从更实际的应用场景考虑,为了节约系统开销,进一步提出了一种自适应的最佳中继协作频谱感知方案（A-BRCSS）,即 SU 根据其信道条件,自适应地选择是否需要认知中继的协作传输。分析和仿真结果均表明,相比传统最佳中继协作频谱感知方案, Optimized BRCSS方案可以实现更高的感知性能;所提A-BRCSS方案可以实现几乎最佳的感知性能。     

基于自适应决策融合的合作频谱感知方法

频谱感知是认知无线电(CR)的关键技术之一。在该机制中,对主用户(PU)信号的可靠检测是实现CR的前提。提出一种基于自适应决策融合的合作频谱感知算法用于频谱感知,该算法通过估计PU的先验概率与各个CR用户(SU)的漏检及虚警概率,然后运用Chair-Varshney准则对局部判决进行决策融合以得到全局判决。仿真结果表明,采用该方案的全局虚警和漏检概率明显低于单个SU,可有效提高CR系统频谱感知的可靠性。