基于频谱感知结果的认知无线电用户分簇方法

认知无线电用户的分簇由于不同位置频谱环境的巨大差异而成为亟待解决的问题之一。该文分析了认知无线电用户频谱感知结果之间相关性,基于分析结论提出一种基于频谱感知结果相关性的分簇算法,并考察了频谱感知结果量化对该算法的性能影响,得出增加频段数量的方式能够部分补偿量化带来的性能损失的结论。仿真显示,该文的分簇算法能够有效地对认知无线电用户进行分簇,在频谱感知结果量化的条件下,也能达到较好的分簇性能。从可靠性、准确性和自适应能力等方面,相较传统基于地理位置的分簇方法,该文所提出的分簇算法能综合考虑频谱环境的特点,更加具实用价值。     

一种基于融合规则的自适应分簇协作频谱感知算法

为适应无线信道的动态性,提出了一种基于融合规则的自适应分簇协作频谱感知算法.首先,根据融合中心应用的融合规则推导分簇协作时能满足系统检测性能的信道门限值.然后,由簇首检测当前信道状态,当信道条件好于分簇门限值时,仅簇首进行本地检测,并上传检测结果至数据融合中心,实现分簇协作;否则,由本簇节点进行全节点协作检测,并分别上传检测结果至数据融合中心,或选择退出协作检测,仅接收融合中心的判决信息.最终,由数据融合中心进行融合计算,并做出系统全局判决.仿真结果显示,采用OR融合方法时,所提算法能极大地提高控制信道资源效率;采用AND融合方法时,算法能将系统有效工作区间扩大30％左右,且能选择信道状态好的簇进行协作频谱检测.     

基于最小生成树的分簇协作频谱感知改进算法

为减少分簇过程中的时延,基于最小生成树的单向比较优势提出簇首快速推举方法,并提出改进的分簇协作频谱感知算法,分析了算法的时间复杂度。算法首先基于最小划分对所有次用户节点进行分簇,簇内节点根据设置的评价条件进行性能比较,推举簇首。由簇首进行本地簇内频谱检测,并上传检测结果,最后融合中心在簇首间实现协作的频谱检测。在瑞利信道条件下,仿真显示在大信噪比时,融合中心应用AND规则,系统具有较小的虚警率,所提算法检测性能优;小信噪比时,应用OR规则能扩展系统的有效检测区间,所提算法在满足系统要求的前提下检测性能较差,但簇内信道效率提高了n-1倍。     

多天线感知无线电中的协作频谱感知算法

不同于以往单天线感知用户的频谱感知研究,该文提出多天线情形下基于最优功率分配和协作分集的频谱感知算法。根据信道条件利用奇异值分解(SVD)在每根天线上进行功率注水,并考虑多天线情况下两用户网络协作频谱感知授权用户的判决检测过程,利用基于指数衰减的路径损耗模型,分析多天线感知网络的各态历经容量和检测授权用户的概率及时间。理论分析及仿真结果表明,多天线感知用户通过最优功率分配和协作频谱感知不仅使感知网络具有最大的各态历经容量,同时改善系统的检测性能。     

认知无线电网络的一种协作频谱感知方案

认知无线电技术能够让非授权用户利用已经分配给授权用户的频段.为了不对首要用户的工作造成干扰,认知用户需要对频谱进行不间断的监测来判断首要用户是否存在.因此,频谱的感知是认知无线电技术的关键.协作频谱感知能够充分的利用网络资源,提高网络中的认知用户的检测概率.文中笔者简单地介绍了一种协作频谱感知的方案.仿真结果表明,通过该方法能够提高网络中认知用户的检测概率,提高网络的检测灵敏度.     

认知无线电协作频谱感知技术综述

频谱感知是实现认知无线电功能的前提条件,也是认知无线电领域的一个研究热点.近年来人们提出了很多种频谱感知方法,尤其协作感知技术日益受到关注.综述了协作频谱感知技术的最新研究进展,先描述典型的认知无线电协作频谱感知模型,然后讨论了协作感知中信息融合及性能分析等关键问题,最后指出了协作感知的研究挑战和发展趋势.     

认知无线电中协作频谱感知技术研究

由于无线通信用户的增多和采用的固定频谱分配模式,使频谱资源越来越紧缺,认知无线电的出现极大地提高了频谱的利用率。该文对基于能量检测的单节点检测和协作检测技术进行了分析和讨论,重点分析了协作检测中的数据融合算法,并对几种融合算法和能量检测算法进行了性能的仿真分析。通过分析及仿真结果可以看出,协作检测与单节点检测相比,有效地提高了检测概率。     

多天线认知无线电网络多信道联合频谱感知策略

当前,以单天线认知用户组成的认知无线电网络同时协作检测多个信道的分配策略得到了广泛研究,而在认知用户可以灵活选取自身天线进行空间分集接收的条件下,当联合感知多信道时,多天线认知无线电网络如何获取最优的天线分配策略仍有待进一步研究。为解决这一问题,在限制各信道最大虚警概率的前提下,以最小化所有信道漏检概率之和为目标,建立了优化模型,并提出了基于分支定界的算法和基于贪婪思想的启发式算法。前者可以获得最优策略,但复杂度较高,后者以牺牲较小检测性能为代价,明显降低了复杂度,有效实现了检测性能与复杂度的平衡,并且在保护各个信道上主用户免受认知用户干扰层面,一定程度上兼顾了公平性。      

认知系统中多天线协作频谱感知方案

针对认知无线电的核心问题——频谱感知,采用性能好的协作频谱感知,这里研究了认知无线电系统中一种多天线协作频谱感知方案,此方案中的噪声信号和主用户的信号均认为是独立复高斯随机信号。同时,次用户将检测到的信号通过波束成形后传向融合中心,而优化函数为发射功率受限的条件下,最大化全局的检测概率。理论推导和方针结果表明,所提出的方案有效地提高了检查概率,充分发挥了空间分集和多用户分集的优势,普遍提高了系统的感知概率。     

认知无线电最优线性协作宽带频谱感知

本文提出了基于最优线性协作的宽带频谱感知方案。通过次级用户之间的协作,为认知网络的频谱感知提供分集,利用融合中心融合多个次级用户的宽带频谱感知数据来获取最优权重,并生成全局判决统计量,最终使用全局阈值完成最后的检测判决。由于所提出的两种协作宽带感知方案或需要精确地估计授权用户的信号强度和噪声方差,或感知性能不足,因而,还提出一种更易实现的方案。理论分析和仿真结果表明,本文所提出的协作感知方案可以有效地提高频谱感知性能,并且性能优于传统等增益合并方案。      

基于 DS 证据理论的协作频谱感知改进方法

提出了一种新的协作频谱感知方法,该方法采用DS证据理论。首先,在本地感知通过投影近似法分解感知结果以减少次级用户上报至融合中心的感知数据,从而降低协作带宽开销。其次,在融合中心根据次级用户证据矢量之间的距离计算可信度,以可信度为权重对每个次级用户的基本概率分配进行加权平均来减小高度冲突数据对检测性能的影响。仿真结果表明,该方法减少了协作感知的带宽开销,改善了数据高度冲突时的检测性能。     

认知网络中协作感知吞吐量的优化

为了提高集中式认知网络的吞吐量,提出了基于信任度的吞吐量优化算法.该算法在主用户充分保护的前提下,以认知用户的吞吐量为目标函数,融合中心采用双门限值对本地感知结果进行融合.从理论上证明了吞吐量是全局漏检概率的增函数,当全局漏检概率等于门限值时,吞吐量达到最大值.并利用牛顿迭代法求出单节点概率,然后采用遍历法可得到认知用户吞吐量最大值.仿真结果表明,当信噪比为-14 dB时认知用户融合优化算法相对"AND准则"OR准则"以及"HALF准则"归一化吞吐量分别提高了0.62、0.3和0.09.     

Detection efficiency of cooperative spectrum sensing in cognitive radio network

Sensing the spectrum in a reliable and efficient manner is crucial to cognitive radio. To combat the channel fading suffered by the single radio, cooperative spectrum sensing is employed, to associate the detection of multiple radios. In this article, the optimization problem of detection efficiency under the constraint of detection probability is investigated, and an algorithm to evaluate the required radio number and sensing time for maximal detection efficiency is presented. To show the effect of cooperation on the detection efficiency, the proposed algorithm is applied to cooperative sensing using the spectral correlation detector under the Rayleigh flat fading channel.     

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.     

基于人工神经网络的认知无线电频谱感知研究

认知无线电是一种新的智能无线通信技术,通过感知周围环境特征,并采用构建理解的方法进行学习。频谱感知技术是认知无线电系统设计的重要组成部分,本文提出了基于人工神经网络（ANN）算法的认知无线电感知技术。由于单用户检测存在检测精度不高的问题,本文通过采用ANN的自主学习能力设计频谱检测分类器,对以往分类器所收集的环境信息进行学习和储存,从而对以后感知新的环境时起到先验信息的作用,能快速准确地判决出主用户的存在与否。通过与能量检测和循环平稳检测对不同调制方式信号进行信号识别仿真实验可以看出,相比原有的单用户频谱检测技术,ANN具有更高的有效性和可靠性。     

基于认知无线电的合作频谱感知算法研究

在认知无线电网络中,认知无线电用户需要准确、实时地检测到授权用户的存在以及闲置的频带。认知无线电中的合作频谱感知类比于无线传感网络中的分布式决策,即每一个传感器做出本地判决并将这些判决结果汇报给融合中心,再根据某种融合准则做出最终的判决。融合准则主要分为OR规则和AND规则。传统合作频谱感知是指所有的认知用户都参与合作。文中通过分析传统合作频谱检测的不足之处,提出只选择具有较高信噪比的认知用户参与合作。从仿真结果看出,此方法的检测性能较之传统的合作检测算法有了很大的提高。     

Different sensing durations‐based cooperative spectrum sensing in cognitive radio systems

In order to provide more accurate detection of the primary user's activity in cognitive radio (CR) systems, cooperative spectrum sensing is proposed. The transmit diversity can also be employed by cooperative spectrum sensing to improve the performance of decision reporting. Hence, in the reporting channels between the cognitive users and the base station (BS), space time block code (STBC) scheme is considered in each cluster with time division multiple access (TMDA) method. In this paper, to improve the time efficiency in the case that one cluster makes sensing report, whereas the others do nothing but wait for their orders, we set each cluster with different sensing durations and the clusters will not stop the spectrum sensing until their results are reported. Furthermore, we also adopt the flexible sensing durations to decrease unnecessary energy consumption based on the clusters’ sensing sensitivities. Simulation results and analysis show the better detection performance and time efficiency of the proposed scheme. Copyright © 2012 John Wiley & Sons, Ltd.     

Cross‐layer optimization for full‐duplex cognitive radio network with cooperative spectrum sensing

In this paper, the cross‐layer optimal design of multihop ad hoc network employing full‐duplex cognitive radios (CRs) is investigated. Firstly, the analytical expressions of cooperative spectrum sensing performance for multihop CR networks over composite fading channels are derived. Then, the opportunistic throughput and transmit power of CRs are presented based on the derivation of false alarm and missed detection probability. Finally, a multiobjective optimization model is proposed to maximize the opportunistic throughputs and minimize the transmitting power. Simulation results indicate that Pareto optimal solution of sensing duration, decision threshold, and transmit power can be achieved by cross‐layer multiobjective optimization, it can balance the conflicts between different objective functions and reap the acceptable outcomes for multihop CR network.     

Joint cooperative spectrum sensing and channel selection optimization for satellite communication systems based on cognitive radio

Cognitive radio has attracted considerable attention because of its ability to make full use of the available spectrum resources for wireless terrestrial communication networks. In addition, the satellite communication scenario, which requires a transparent air interface to integrated/hybrid Satellite–Terrestrial communication systems and provides a supplement for other multimedia services, will cause frequency scarcity. Satellite communication systems based on cognitive radio are available under scenarios that involve transmission with changing communications. In this paper, a cooperative spectrum‐sensing algorithm based on a time or bandwidth‐based cooperative spectrum‐sensing model of an integrated/hybrid cooperative satellite communication system is proposed. Moreover, the concept of weighted cooperative spectrum sensing is introduced. Compared with the traditional single‐user spectrum‐sensing algorithm, the cooperative spectrum sensing is able to cope with the interference to the primary user caused by a secondary user better. In addition, multiple earth stations that use some part of the bandwidth cooperatively to perform spectrum sensing throughout the whole frame can detect the presence of primary user in time. The satellite component combines the sensing results from earth stations to reach a final decision, and the optimal combination weights to maximize the detection probability of the secondary user are obtained. Numerical results that demonstrate the performance of the proposed algorithm are presented. Copyright © 2015 John Wiley & Sons, Ltd.     

Optimal multi-threshold quantization scheme for bioinformatics inspired cooperative spectrum sensing in cognitive radio networks

Hard decision combination provides bandwidth efficiency but the results produced are unreliable while soft decision combination has better results but at the expense of much consumption of bandwidth. An acceptable trade-off is achieved between the two in case of quantized decision combination. In this paper an optimal quantization scheme is proposed in which the local sensing information is quantized so the maximum detection probability is met while the false alarm probability remains under a certain constraint. The proposed optimal scheme works on the basis of energy detection and the local quantization thresholds are found through iterative search. Smith–Waterman algorithm (SWA) is used to compare the local sensing reports of the CR users and similarity indexes are found for the CR users. The local sensing decisions of the CR users below a certain calculated threshold are rejected and are not included in the final decision combination at the FC. For detailed analysis, SWA-based rules of decision combination with optimal quantization thresholds are compared with a scheme that employs SWA-based rules of decision combination with heuristically selected quantization thresholds and a conventional majority combination scheme. Simulation results show that the proposed scheme performs better than the other two schemes.