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

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

Cooperative Spectrum Sensing Scheme with Hard Decision Based on Location Information in Cognitive Radio Networks

Without an efficient way to achieve the reliability of the decision, the implementation of weighted data fusion is limited in the hard decision combination for cooperative spectrum sensing. To address this problem, a new cooperative spectrum sensing scheme based on the location information of the primary user (PU) and cognitive radio (CR) is proposed. In the new scheme, depending on the location information, the channel condition between the PU and each CR is obtained at the fusion center (FC), with which the local sensing reliability is first achieved. Then we calculate the transmission reliability between the CR and FC. Based on both the local sensing reliability and the transmission reliability, the combining weighting factor is determined for optimal data fusion. On the basis of this proposed scheme, we study the global sensing false alarm and detection probabilities, derive the expressions to obtain the optimal local sensing threshold, and perform an error analysis that demonstrates the impact of imperfect channel knowledge. Using both analytical and simulation methods, we find that the proposed scheme achieves better performance compared with the conventional logical fusion rules in the hard decision combination for cooperative spectrum sensing.     

基于非参量累积和的合作频谱感知

针对认知无线电网络中频谱感知的检测时延降低问题,提出了基于非参量累积和的合作频谱感知算法。本地认知用户预处理频谱观测数据,获得观测数据相对于信念值的正向漂移和负向漂移。为了缩短检测延迟,认知用户只将数据的正向漂移同步传输至融合中心。融合中心融合正向漂移得到判决信息,采用非参量累积和算法依时间序列顺序累加判决信息,判断主用户是否正在使用授权频段。为了解决不传输负向漂移引起的虚警问题,改进算法提出融合中心可以保留首次判决,经过等待时间间隔后再作出最终判决。相对于传统的软融合算法,改进融合规则的合作频谱感知算法具有较低的检测延迟。     

Sensor node-assisted asynchronous cooperative spectrum sensing for cognitive radio network

In order to take advantage of the asynchronous sensing information, alleviate the sensing overhead of secondary users （SUs） and improve the detection performance, a sensor node-assisted asynchronous cooperative spectrum sensing （SN-ACSS） scheme for cognitive radio （CR） network （CRN） was proposed. In SN-ACSS, each SU is surrounded by sensor nodes （SNs）, which asynchronously make hard decisions and soft decisions based on the Bayesian fusion rule instead of the SU. The SU combines these soft decisions and makes the local soft decision. Finally, the fusion center （FC） fuses the local soft decisions transmitted from SUs with different weight coefficients to attain the final soft decision. Besides, the impact of the statistics of licensed band occupancy on detection performance and the fact that different SNs have different sensing contributions are also considered in SN-ACSS scheme. Numerical results show that compared with the conventional synchronous cooperative spectrum sensing （SCSS） and the existing ACSS schemes, SN-ACSS algorithm achieves a better detection performance and lower cost with the same number of SNs.     

Performance Evaluation of Cooperative Spectrum Sensing Scheme with Censoring of Cognitive Radios in Rayleigh Fading Channel

In this paper, the performance of cooperative spectrum sensing (CSS) with censoring of cognitive radio (CR) users in Rayleigh fading channel is analyzed. More precisely, CR users which employ energy detectors are censored depending on the quality of radio channels between them and a fusion center (FC). Each CR makes a hard decision about primary user (PU) using energy detection and transmits the information to FC using BPSK signaling if that CR user is selected to transmit. A training based channel estimator is used at the FC to estimate the complex Gaussian fading coefficients characterizing the channels between the CR users and the FC. This channel state information on fading coefficients is used for censoring the CR users. Two fusion rules such as majority logic fusion and maximal ratio combining (MRC) fusion rules are applied at the FC for estimating the performance in terms of probability of missed detection (P_m). We develop a simulation test bed for evaluating the performance of CSS scheme. Probability of missed detection has been evaluated for both perfect and imperfect channel estimation for various probabilities of false alarm (P_f), reporting and sensing channel SNR values.     

集中式双非参量累积和的合作频谱感知技术

针对认知无线电网络频谱感知的检测时延降低问题，提出了一种采用双非参量累积和的合作频谱感知方法。在单主用户认知网络中，本地认知用户执行非参量累积和算法，处理能量观测数据，以缩短检测时延，减少对主用户先验信息的需求，同时为了降低带宽开销，只向融合中心传输1比特的预判决结果。融合中心在噪声干扰下接收融合预判决结果，执行非参量累积和算法，累加判决统计量，对主用户信号是否存在进行最终判决。仿真结果表明，在10%的虚警概率下，相比于传统的非参量合作频谱感知算法，双非参量累积和算法具有较低的检测延迟。      

Scalable and Robust ANN Based Cooperative Spectrum Sensing for Cognitive Radio Networks

Cognitive radio network (CRN) supports dynamic spectrum access addressing spectrum scarcity issue experienced by today’s wireless communication network. Sensing is an important task and cooperative spectrum sensing is used for improving detection performance of spectrum. The sensing information from individual secondary users is sent to fusion center to infer a common global decision regarding primary user’s presence. Various fusion schemes for decision making are proposed in the literature but they lack scalability and robustness. We have introduced artificial neural network (ANN) at fusion center thereby achieving significant improvement in detection performance and reduction in false alarm rate as compared to conventional schemes. The proposed ANN scheme is found capable to deal with scalability of CRN with consistent performance. Further, SNR of individual Secondary user is taken into consideration in decision making at fusion center. Moreover the proposed scheme is tested against security attack (malicious users) and inadvertent errors occurring at SUs are found to be robust.     

Fault-Tolerant Cooperative Spectrum Sensing Scheme for Cognitive Radio Networks

In order to solve the uncertainty resulting from shadowing effect and resist the attack from malicious cognitive radio (CR) users, we propose a fault-tolerant cooperative spectrum sensing scheme for CR networks, where an energy detection-based local spectrum sensing is performed at each CR user, a coefficient is used to weight each CR user’s sensing result, a linear weighted fusion process is performed at the fusion center (FC) to combine received sensing results. For a fault-tolerant cooperative spectrum sensing scheme, the most important issue is to distinguish whether the CR user is reliable or not. In this paper, a reputation-based cooperative mechanism is presented to alleviate the influence of the unreliable sensing results from CR users suffering shadowing and the false sensing data from malicious CR users on the detection result at the FC. In proposed fault-tolerant cooperative scheme, each cooperative CR user has a reputation degree which is initialized and adjusted by the FC and used to weight the sensing result from the corresponding user in the fusion process at the FC. And then, two reputation degree adjusting methods are presented to manage the reputation degree of each CR user. Simulation results show that the proposed scheme can not only weaken the harmful influence caused by malicious CR users, but also alleviate the corrupted detection problem resulting from destructive channel condition between the primary transmitter and the CR user. Moreover, the detection performance of the fault-tolerant cooperative scheme, which has a feasible computational complexity and needs no instantaneous SNRs, is close to that of the optimal scheme.     

Iterative optimization of detection threshold and throughput for secondary users in multiband cognitive radio systems

In cognitive radio(CR) systems,efficient spectrum sensing ensures the secondary user(SU) to successfully access the spectrum hole.Typically,the detection problem has been considered separately from the optimization of transmission strategy.However,in practice,due to non-zero probabilities of miss detection and false alarm,the sensing phase has an impact on the throughput of SUs as well as on the transmission of primary user(PU).In this paper,using energy detection,we maximize the total throughput of SUs by ...     

Optimization of Cluster-Based Cooperative Spectrum Sensing Scheme in Cognitive Radio Networks with Soft Data Fusion

This paper investigates cluster-based cooperative spectrum sensing issues in two-layer hierarchical cognitive radio networks with soft data fusion. We first define a two-phase reporting protocol in the paper. In the first phase, secondary users forward their soft sensing information to cluster heads (CHs) over large-scale fading. In the second phase, all CHs transmit the aggregated soft energy information to the fusion center (FC) with different weights. Thus we derive the network false alarm (FA) and the detection probabilities as functions of the FC decision threshold, the clustering algorithm and different weights. Given a target on the detection probability, minimizing the FA probability is then formulated as a constraint optimization problem within two scenarios including additive white Gaussian noise environment and Rayleigh fading environment. A close-form upper bound of the FA probability is derived and a novel clustering scheme is also proposed for each scenario. Numerical results show that the proposed schemes achieve a satisfying performance.     

一种基于能量检测的协作式频谱感知算法

为提高认知无线电系统中频谱检测的可靠性,提出了一种基于能量检测的协作式频谱感知算法。利用授权用户的状态在相邻感知帧之间变化的概率小这一特性,通过将当前感知帧的能量值与相邻值相结合来判断授权用户状态,这样当授权用户使用授权频段时,所提算法能有效减小采样信号能量值骤减时发生误判的概率。另外给出了所提算法检测概率和虚警概率的闭式表达式。理论分析和仿真结果表明,所提算法比传统的协作式频谱检测算法检测性能好。     

基于特征值极限分布的合作频谱感知算法

采用最新的随机矩阵理论,对多个认知用户接收信号采样协方差矩阵的最小特征值的极限分布进行了分析,提出了一种改进的最大最小特征值合作感知和门限判决方法。该算法不需预知授权用户信号的先验知识,且能有效克服噪声不确定度的影响。与现有算法相比,在给定虚警概率时,仿真结果显示该算法判决门限更低、检测概率更高;而且在认知用户和采样数较少时,也能获得很好的检测性能。     

认知无线电中基于感知信息量化的合作频谱感知

针对认知无线电频谱感知性能的提高与传输开销的矛盾,本文提出了一种基于感知信息量化的合作频谱感知方案。该方法对各认知用户的本地检测结果采用3个判决门限进行2比特位的量化,在融合中心处对量化信息加权处理后,得到最终主用户是否存在的判决。本文详细研究了采用该方案的检测概率,虚警概率和吞吐量,理论分析和仿真结果表明,该方法在每个认知用户只增加1bit传输开销的前提下能够极大的改善检测性能,实现了检测性能与传输开销的较好权衡。     

Robust spectrum sensing under noise uncertainty for spectrum sharing

Spectrum sensing plays an important role in spectrum sharing. Energy detection is generally used because it does not require a priori knowledge of primary user, (PU) signals; however, it is sensitive to noise uncertainty. An order statistics (OS) detector provides inherent protection against nonhomogeneous background signals. However, no analysis has been conducted yet to apply OS detection to spectrum sensing in a wireless channel to solve noise uncertainty. In this paper, we propose a robust spectrum sensing scheme based on generalized order statistics (GOS) and analyze the exact false alarm and detection probabilities under noise uncertainty. From the equation of the exact false alarm probability, the threshold value is calculated to maintain a constant false alarm rate. The detection probability is obtained from the calculated threshold under noise uncertainty. As a fusion rule for cooperative spectrum sensing, we adopt an OR rule, that is, a 1‐out‐of‐N rule, and we call the proposed scheme GOS‐OR. The analytical results show that the GOS‐OR scheme can achieve optimum performance and maintain the desired false alarm rates if the coefficients of the GOS‐OR detector can be correctly selected.     

基于DOA估计的认知无线网络频谱感知

认知无线电技术中频谱感知性能的优劣直接影响认知通信系统的性能。针对该特点提出了认知无线电网络中基于波达方向（ DOA)估计的主用户频谱感知模型,即单主用户多次用户和多主用户多次用户的系统模型,选取基于特征分解的多重信号分类（ MUSIC)算法分析两种模型的感知性能,包括虚警概率、漏检概率、最小总错误概率、算法复杂度等,获得了闭值表达式,最后在两种模型下对算法进行了仿真。仿真结果表明：各参数主要影响虚警概率,而漏检概率几乎不受影响,验证了方法的有效性。     

Double‐threshold cooperative detection for cognitive radio based on weighing

In cognitive radio (CR), the single‐threshold cooperative detection is sensitive to the noise power. In this paper, a double‐threshold cooperative detection scheme based on weighed combination is proposed to improve the global detected performance of the cooperative detection. The double thresholds that are decided by the restriction probability are adopted to divide the energy statistics observed by CRs into three subareas, and the detected performance of the CRs locating in the confusion area is fortified through the weighed data fusion by the coordinator. The CRs in the other two areas can make local binary decisions because of their exact sensing performance and then forward their 1‐bit decisions to the coordinator that will combine all the received decisions to give the final decision on the presence of the primary user. In this paper, both the periodic single‐band and wideband cooperative detections are investigated, and the probabilities of spectrum utilization by these two patterns are respectively analyzed. The simulation shows that the detection probability of the proposed scheme is better than that of the single‐threshold cooperative detection with decision fusion but slightly worse than that of the single‐threshold cooperative detection with data fusion. However, the average number of the bits sent to the coordinator by the proposed algorithm is less than that by the data fusion, and it may increase by the decreasing of the restriction probability. The simulation also shows that the periodic wideband sensing can obtain higher spectrum utilization than the periodic single‐band sensing. Copyright © 2012 John Wiley & Sons, Ltd.     

A dynamic and weighted spectrum decision mechanism based on SNR Tracking in CRAHNs

The spectrum decision concept in Cognitive Radio Ad-Hoc Networks (CRAHNs) introduces important challenges. These include the time-dependent SNR observations of individual CRAHN users due to the fading and shadowing effects in the licensed channels, the necessity of fusion mechanisms for accurate decisions, and the difficulties depending on multi-hop deployment. Considering these challenges, in this paper, we propose a dynamic, cooperative and distributed spectrum decision mechanism in order to decide the channel usage in CRAHNs accurately. The proposed mechanism introduces the SNR Tracking System which considers the time-varying local SNR observations and decisions of the CRAHN users. The proposed mechanism employs a distributed Weighted Fusion Scheme (WFS), to combine the individual decisions and hence, to obtain the cooperative decision. The proposed spectrum decision mechanism adapts itself dynamically to the multi-hop architecture of the network. The performance of the proposed mechanism is compared to some conventional fusion mechanisms based on the AND, OR and MAJORITY rules, and it is shown that the proposed weighted mechanism gives lower false alarm and higher detection probabilities compared to the conventional fusion mechanisms.     

A Distance Based Reliable Cooperative Spectrum Sensing Algorithm in Cognitive Radio

Spectrum sensing is the most critical task in cognitive radio (CR) which needs to be performed very precisely in order to efficiently utilize the underutilized spectrum and to provide sufficient protection to the primary users (PUs). To improve the sensing performance under fading, shadowing and hidden terminal problems more than one CR users collaboratively perform the spectrum sensing called as cooperative spectrum sensing (CSS). In conventional CSS the decision of each CR is fused at fusion center with equal weights. But due to variable distance of each CR from the PU all decisions are not equally reliable and therefore should be assigned different weights according to their reliability. In this paper we propose a new weighting scheme for CSS under Rayleigh faded channel. In proposed weighting scheme, based on the distance of each CR from the PU reliability of CR nodes is determined and correspondingly appropriate weights are assigned to different users. The CSS algorithm using new weighting scheme gives better performance than conventional CSS algorithm.     

Adaptively Controlled Cooperative Spectrum Sensing Using OR Fusion Rule for Throughput Maximization in Cognitive Radio

Utilization of wireless spectrum resources should be improved with the great increase of using wireless services. Cognitive radio (CR) has been proposed to overcome the problem of inefficient use of spectrum holes. Spectrum sensing is the most important functional block, which is used to estimate the spectrum holes in the CR system. Cooperative spectrum sensing improves the detection performance and minimizes miss-detection of the primary user. The objective of this paper is to achieve the maximum throughput for all values signal-to-noise ratio (SNR). Cooperative spectrum sensing with fixed sensing time does not provide efficient throughput performance for all values of SNR. In this paper, we propose an adaptively controlled cooperative spectrum sensing scheme using OR fusion rule for throughput maximization in CR system. The proposed scheme estimates the required optimal sensing time for each value of the SNR to achieve the maximum throughput. Simulation results of the proposed scheme demonstrate that it maximizes the achieved throughput for all values of SNR and minimizes the probability of false alarm.

     

Sensing‐throughput tradeoff for cooperative multiple‐input single‐output cognitive radio

In this paper, we propose a new cooperative multiple‐input single‐output (MISO) cognitive radio (CR) system, which can use some of the antennas to transmit its data and the others to help to transmit the data of the primary user (PU) by performing cooperative communication if the presence of the PU is detected through the cooperative spectrum sensing. A new cooperative sensing‐throughput tradeoff model is proposed, which maximizes the aggregate rate of the CR by jointly optimizing sensing time and spatial sub‐channel power, subject to the constraints of the aggregate rate of the PU, the false alarm and detection probabilities, the aggregate interference to the PU and the aggregate power of the CR. Simulation results show that compared with the conventional scheme, the proposed cooperative scheme can achieve the larger aggregate rate of the CR, while keeping the aggregate rate of the PU invariable with the increasing of the interference. Copyright © 2013 John Wiley & Sons, Ltd.