最优认知用户配对与协作感知算法研究

针对协作算法频谱感知和时隙消耗方面的不足,提出一种最优用户配对与协作感知算法。采用接收信噪比最优的认知用户为感知用户且以接收信噪比次优的认知用户为其中继的配对准则,获得最佳频谱感知性能。通过优化设置协作门限,选择性地采用非协作或协作模式,获得更低的时隙消耗。同时,推导了在瑞利平坦衰落环境下该算法的频谱检测概率下界与时隙消耗。数值计算结果表明,与原有算法相比,该算法不仅检测概率更高且时隙消耗更低。     

基于可靠次用户信息的协作频谱感知算法研究

对认知无线电系统最基本要求之一就是次用户必须有能力以高的精确率来确定主用户是否存在。而以前对认知无线电频谱感知的研究表明:在实际认知网络中次用户之间的相互协作可以提高其频谱检测性能。然而,对于协作频谱感知而言,随着协作次用户数目的增加,势必会增大用于传输本地检测结果到融合中心的专用控制信道带宽,从而增加系统开销。该文在控制信道带宽有限的约束条件下,提出一种通过考虑可靠次用户信息的协作频谱感知算法来进一步改善频谱检测的性能。该算法的基本思想:只有具有可靠的本地检测结果的次用户才发送自己的检测结果到融合中心,否则,该次用户不发送任何信息。同时,对提出的该算法在理论上进行了推导,通过仿真结果表明:在控制信道带宽受限的约束下,相比于传统的或门协作频谱感知算法,提出的算法能够大大改善对主用户的检测性能。     

采用最小最大准则的协作频谱感知融合

给出了采用最小最大准则实现认知无线电系统协作频谱感知融合的方法,以在主用户出现在授权频段的先验概率未知的情况下利用概率计算实现认知无线电系统的协作频谱感知融合。该方法可实现同步和异步感知信息的融合。仿真验证了算法的性能,并与采用估计主用户出现在授权频段的先验概率并进行基于概率的感知融合算法性能进行了比较。结果表明:给出的算法可有效实现主用户出现在授权频段的先验概率未知时的协作频谱感知融合。     

认知无线电多时隙联合频谱感知方法及优化

为了降低认知无线电中次用户对主用户的干扰,提出了次用户通过多个时隙的能量感知联合检测主用户的频谱感知方法。每个传输帧被分成若干个时隙,次用户在每个时隙的开始进行能量感知,通过合并多个时隙的感知结果,提高次用户对主用户的检测性能。为了最大化次用户的频谱效率,将主用户状态建模为二维马尔科夫随机过程,并根据该过程优化单时隙频谱感知时间。仿真结果表明：相比Liang的“先听后传”频谱感知方法,提出方法仅牺牲14％的频谱效率,却使干扰概率降低了28％;随着信噪比增加,提出方法的最大频谱效率逐渐接近“先听后传”频谱感知方法。     

优化的最佳中继协作频谱感知

在基于中继的协作频谱感知中,尽管通过引入认知中继可有效提高协作频谱感知性能,然而认知中继的引入也会带来额外的系统开销及复杂度增加问题。为了节约系统开销,本文在前期取得研究成果的基础上,进一步提出了一种基于删余的最佳中继协作频谱感知方案,只有当次用户检测到主用户信号且目标次用户的报告信道衰落严重时,才申请认知中继的协作传输,同时目标次用户将其检测到的感知信息发送到认知中继;最后,分别从检测性能和次系统可获得的容量角度对所提方案下的协作频谱感知性能进行了理论分析。分析和仿真结果表明,所提方案可以有效提高检测性能,当确保主用户受到足够保护的前提下,利用所提方案可以获得更高的次系统容量。      

基于表决融合的带宽受限的协作频谱感知算法

协作的频谱感知使认知无线电（CR）网络对主用户进行可靠的检测,并避免了对主用户通信的干扰。数据融合是协作的频谱感知的关键技术。但是当协作认知无线电用户较多时,它们向融合中心汇报的感知信息就会占用大量的带宽。本文提出了将表决融合准则与检查策略相结合的协作频谱感知的方法,来减少发往融合中心的平均感知比特数,从而有效节约传输带宽。推导分析了该算法在理想信道和非理想信道中的频谱感知性能,并给出了这两种情况检测概率的闭合式。仿真结果表明,此种基于表决融合准则的检查协作频谱感知算法的性能最优,即在较高的感知性能下有大量的感知比特的节约。      

认知无线电网络中基于跨层设计的能效优化算法

为提高认知无线电网络中次用户节点的能量有效性,该文基于连续时间马尔科夫理论对次用户的频谱感知和接入过程进行联合建模,对影响次用户传输能效的主要因素进行了分析,提出了一种基于跨层设计的能量有效优化算法。该算法可有效减小主用户非时隙返回信道对次用户能量有效性的影响,并通过联合优化感知时间和接入概率,使次用户在感知性能和传输能效间实现了有效折衷。仿真结果表明,本文算法相对于仅考虑频谱感知或接入策略的单层优化算法,可使次用户的能量有效性得到较大提高。      

基于压缩感知信道能量观测的协作频谱感知算法

压缩感知为认知无线电宽带频谱感知提供了一种新思路。基于压缩感知原理,该文提出一种不需要重构宽带频谱本身,而是直接重构各信道能量的协作频谱感知方法。多个次用户使用宽带随机滤波器组获取信道能量的观测值。融合中心同步接收多个用户的能量观测,并利用同步稀疏自适应匹配追踪协作重构算法重构所有次用户的信道能量。仿真结果表明加性高斯白噪声环境下该协作感知方法所需的滤波器数目仅为传统方法的20%左右,瑞利衰落信道下也仅需传统方法的40%,有效降低了系统复杂度并改善感知性能。同时,该文提出的同步稀疏自适应匹配追踪算法对比经典的同步正交匹配追踪算法在重构精度及算法复杂度两方面都有所提升。     

基于统计可信度的压缩感知协作频谱检测算法

压缩感知为认知无线电的宽频谱感知提供了一种新的方法和思路。基于压缩感知的原理,提出了一种多认知用户协作场景下基于用户统计可信度的协作频谱检测算法。该算法使用正交匹配协作追踪算法获得认知区域内的频谱占用情况,根据不同认知用户频谱检测的历史准确度综合判定用户感知结果的统计可信度。仿真结果表明,该算法在不同用户数、不同采样值、不同信噪比变化范围下其检测性能均优于传统算术平均方法,有效改善了检测性能。     

双时隙多用户线性网络编码协作的中断概率分析

线性网络编码协作(LNCC)是一种将线性网络编码与协作通信相结合的技术,能够提高频带利用率,降低中断概率.该文从理论上分析了双时隙M(M≥2)用户LNCC的紧近似中断概率,并通过Monte Carlo仿真验证了理论分析的正确性.同时,通过分析渐近中断概率,该文给出了双时隙M用户LNCC的分集阶数.为了说明线性网络编码为协作通信带来的额外增益,该文将双时隙M用户LNCC与分集阶数相同的传统M用户放大-转发协作系统进行了性能比较.结果发现,给定相同的有效频谱效率,前者的中断概率要显著低于后者.     

Multi slot-throughput tradeoff in an improved energy detector based faded cognitive radio network

In this paper, the impact of a multi slot based cooperative spectrum sensing (CSS) on the performance of a cognitive radio (CR) network has been investigated. Each CR user, equipped with an improved energy detector (IED), uses a number of mini slots of the sensing time to perform the spectrum sensing. Each CR uses OR logic to combine the sub local decisions generated in each mini slot to obtain a local decision at CR level. Local decisions are sent to fusion centre (FC) over reporting channel. The FC obtains a final decision about the presence of primary user (PU) by combining the local decisions using a fusion rule: Majority or Maximal Ratio Combining. The performance of the CSS is assessed in terms of detection probability and false alarm probability considering both the sensing and reporting channels are Rayleigh faded. Furthermore, the impact of a number of sensing slots and IED parameter on throughput of CR network is also evaluated under the proposed spectrum sensing scenario. Impacts of several sensing parameters such as sensing channel SNR and reporting channel SNR on the performance of CR network are also evaluated. Performances of two fusion rules under study are compared. Effect of sensing error and synchronisation error is indicated. Further the study is extended for independent but non identically distributed (i.n.i.d.) Rayleigh faded channels as well as for a multiple PU scenario also.     

Spectrum-energy-efficient sensing with novel frame structure in cognitive radio networks

Cooperative spectrum sensing (CSS) is a promising technology in spectrum sensing with an admirable performance. In this paper, we define a utility function which jointly considers the spectrum-efficiency and the energy-efficiency. In a single-user sensing scenario, by maximizing the utility function, a rigorous analytical expression for the optimal threshold of the energy detector is derived. In CSS, the general frame structure is inefficient since the time consumed by reporting contributes little to the sensing performance. In this paper, we propose a novel CSS frame structure, in which one secondary user's (SU's) reporting time is also used for other SUs’ sensing. For time varying channels, collecting the sensing results at different time points is expected to achieve a time diversity gain for a SU, then the novel multi-minislot CSS scheme is proposed. In CSS, the optimal randomized rule and the optimal final decision threshold are derived. Simulation results show a significant improvement of the utility by using the proposed multi-minislot CSS scheme. It is also shown that there exists an optimal number of cooperating SUs that maximizes the utility, and the optimal number decreases as the price of the sensing energy increases.     

Cyclostationarity-based cooperative spectrum sensing over imperfect reporting channels

Reliable detection of weak primary user signals is a crucial problem for cognitive radio networks. To address the above issue, cooperative spectrum sensing (CSS) methods based on cyclostationary detection (CD) have been introduced in the literature. In this paper, a soft decision-based CSS method based on the second-order CD at secondary users (SUs) is proposed. The proposed scheme aims to maximize the deflection criterion at the fusion center (FC), while the reporting channels are characterized by Rayleigh fading. To this end, a fusion rule which does not require to know the noise variances of sensing channels is developed. Since the fusion rule assumes the perfect knowledge of channel state information (CSI) of reporting links, it has theoretical significance and provides an upper bound for the performance of cyclostationarity-based CSS. We have also proposed a more practical suboptimum fusion rule and studied its detection performance in the presence of uncertainties in noise variance and channel power gain estimations. Furthermore, in order to be able to evaluate the performance of the CSS, an analytic threshold estimation method has been proposed. Extensive simulation results have been illustrated the robustness of the proposed method compared to the existing cyclostationary detectors.     

Detection performance of cooperative spectrum sensing with hard decision fusion in fading channels

In this paper, we investigate the detection performance of cooperative spectrum sensing (CSS) using energy detector in several fading scenarios. The fading environments comprise relatively less-studied Hoyt and Weibull channels in addition to the conventional Rayleigh, Rician, Nakagami-m and log-normal shadowing channels. We have presented an analytical framework for evaluating different probabilities related to spectrum sensing, i.e. missed detection, false alarm and total error due to both of them, for all the fading/shadowing models mentioned. The major theoretical contribution is, however, the derivation of closed-form expressions for probability of detection. Based on our developed framework, we present performance results of CSS under various hard decision fusion strategies such as OR rule, AND rule and Majority rule. Effects of sensing channel signal-to-noise ratio, detection threshold, fusion rules, number of cooperating cognitive radios (CRs) and fading/shadowing parameters on the sensing performance have been illustrated. The performance improvement achieved with CSS over a single CR-based sensing is depicted in terms of total error probability. Further, an optimal threshold that minimises total error probability has been indicated for all the fading/shadowing channels.     

Efficient Spectrum Sensing with Minimum Transmission Delay in Cognitive Radio Networks

In cognitive radio (CR) networks, the secondary users (SUs) need to find idle channels via spectrum sensing for their transmission. In this paper, we study the problem of designing the sensing time to minimize the SU transmission delay under the condition of sufficient protection to primary users (PUs). Energy detection sensing scheme is used to prove that the formulated problem indeed has one optimal sensing time which yields the minimum SU transmission delay. Then, we propose a novel cooperative spectrum sensing (CSS) framework, in which one SU’s reporting time can be used for other SUs’ sensing. The analysis focuses on two fusion strategies: soft information fusion and hard information fusion. Under soft information fusion, it is proved that there exists one optimal sensing time that minimizes the SU transmission delay. Under hard information fusion, for time varying channels, the novel multi-slot CSS is derived. The performance of SU transmission delay is studied in both perfect and imperfect reporting channels. Some simple algorithms are derived to calculate the optimal sensing settings that minimize the SU transmission delay. Computer simulations show that fundamental improvement of delay performance can be obtained by the optimal sensing settings. In addition, the novel multi-slot CSS scheme shows a much lower transmission delay than CSS based on general frame structure.     

Efficient error detection in soft data fusion for cooperative spectrum sensing

The primary objective of cooperative spectrum sensing (CSS) is to determine whether a particular spectrum is occupied by a licensed user or not, so that unlicensed users called secondary users (SUs) can utilize that spectrum, if it is not occupied. For CSS, all SUs report their sensing information through reporting channel to the central base station called fusion center (FC). During transmission, some of the SUs are subjected to fading and shadowing, due to which the overall performance of CSS is degraded. We have proposed an algorithm which uses error detection technique on sensing measurement of all SUs. Each SU is required to re-transmit the sensing data to the FC, if error is detected on it. Our proposed algorithm combines the sensing measurement of limited number of SUs. Using Proposed algorithm, we have achieved the improved probability of detection (PD) and throughput. The simulation results compare the proposed algorithm with conventional scheme.     

A novel relay-aided centralized cooperative spectrum sensing scheme using radio frequency energy harvesting

In a cooperative spectrum sensing (CSS) network, the primary signal can be used as a radio frequency (RF) source in order to power the energy-constrained sensor nodes of the secondary network. This work presents a novel hybrid model combining an optimal relay selection scheme to incorporate RF energy harvesting in a centralized CSS network. The secondary users, which are equipped with RF energy harvesting capabilities, act as relays in order to forward the sensing information to a fusion center. Here, we have derived an enhanced multi-relay selection strategy to maximize the end-to-end signal-to-noise ratio of the links. Furthermore, a new voting rule is proposed based on the generalized K-out-of-M rule, such that it minimizes our objective error function. The performance analysis of our proposed model is presented with respect to the flexible relay positions. We have used complementary receiver operating characteristic curves for analyzing the detection performance of the CSS model with our derived voting rule. Simulation results using MATLAB show that the proposed model gives a better detection probability and a smaller error rate than some related existing works.     

Cooperative Cognitive Radio Networks: New Approach for Detection Accuracy Analysis Under Impaired Channels

The quality of the reporting channel and the relaying mechanism play a significant role in cooperative spectrum sensing (CSS). However, these factors are frequently overlooked when it comes to discussing the performance of CSS in cognitive radio (CR) networks. In this work we investigate the performance of a relay-based CSS approach proposed for CR applications. Specifically, we analyze the detection accuracy of a CR network considering channel impairments, amplify-and-forward relying protocol, and a selection combining scheme. First, a closed form expression for the average false alarm probability is derived. Then, the probability density function (PDF) of the end-to-end signal-to-noise ratio (SNR) is obtained and a closed-form expression for the average detection probability at high SNR applications is derived. The sensing and the reporting channels are assumed to be subjected to independent and identically distributed Rayleigh fading. The PDF approach is used in our analysis. This approach is not easily tractable as it involves higher orders of Bessel functions. However, an approximated polynomial representation of a first-order modified Bessel function of the second kind makes this task possible. The results obtained validate the derived closed form expressions and show the importance of considering reporting channel statistics and relaying mechanism for accurate performance analysis of the CSS in CR networks.     

Optimised fusion rule in cluster-based energy-efficient CSS for cognitive radio networks

Cooperative spectrum sensing (CSS) can solve the problem of the hidden terminal in cognitive radio (CR). Energy consumption and sensing time are high in CSS due to a large number of users. In CSS, the parameters that affect the energy efficiency (EE) of the system are fusion rule, sensing time, transmission power and number of users. In this paper, four fusion rules OR-OR, AND-OR, OR-AND and AND-AND are proposed for cluster-based CSS and optimum fusion rule is determined. It is found that in terms of EE metric, AND-OR rule outperforms the other fusion rules. An iterative algorithm has been proposed which finds the optimum number of CR users in a cluster and total number of clusters that maximises the EE. Quantitatively at SNR = ?20 dB, EE is maximum when number of clusters equals to 4 and number of users in the cluster equals to 3 for 12 fixed number of users. The maximum EE is 3.69 Mbits/Hz/joule at sensing time 1.5 ms.