认知无线电中基于感知门限的频谱预测研究

频谱感知为未获得频谱授权的次用户提供频谱空穴,并监测主用户以防止对其造成干扰。然而频谱感知会带来时间和能量消耗,采用准确、主动的频谱预测技术可以改善频谱感知过程。文中通过研究感知门限对平均感知时间和频谱利用率的影响,提出了基于感知门限的频谱预测-感知机制,并利用频谱预测结果按照空闲概率从大到小的顺序进行感知。仿真结果表明,文中所提出的机制能够减少感知时间并提高频谱利用率。     

基于监督学习的协作宽带压缩频谱检测方案

宽带压缩频谱检测存在信号稀疏度未知和次用户检测开销过大的问题.因此,本文提出一种高效的协作宽带压缩频谱检测方案.首先,推导了一种基于学习的稀疏度自适应预测模型.其次,设计了一种宽带频谱筛选算法.最后,提出一种协作宽带压缩频谱检测方案.仿真结果表明,自适应预测模型的拟合效果优于现有预测模型,并且所提检测方案也有效地降低了次用户采样率和频谱重构时延.     

模拟人群信任和决策机制的协作频谱感知方法

通过模拟人群内部的信任和决策机制,针对多用户的频谱协作感知一致性问题,提出了一种分布式算法。该算法首先通过网络的历次协作过程预测出各感知用户的动态可信值,据此产生用户的相对可信值,并结合决策机制使得用户之间进行数据交互,随着数据的可信、迭代交互,所有用户状态将趋于一致,最后通过判定算法得出最终结果。算法充分考虑了实际环境中各用户频带感知能力的不平衡性,而且各次级用户只需要进行少量局部数据交换即可实现协作感知,与传统的OR-rule、1-out-of-N rule以及普通迭代法有较大区别。对3种数据篡改攻击进行了分析,并在预测算法的基础上提出了相应的安全策略。理论分析与仿真结果表明,新算法在准确性和安全性上均优于传统合作频谱感知算法,能显著提高频谱感知准确率,同时兼具较强的防攻击能力。     

基于POMDP的认知无线电自适应频谱感知算法

针对如何建立适合毫秒级频谱空洞场景的频谱感知机制这一问题,推导出最佳次级用户单次数据传输时间长度,解决了数据传输量最大化的问题;其次提出一种基于部分可观测马尔科夫决策过程（POMDP,partially observable Markov decision process）的自适应频谱感知算法,解决了快速接入毫秒级频谱空洞的问题。该算法根据上一决策时段的信念向量和感知结果自适应确定在当前决策时段内进行频谱感知或数据传输行为。仿真结果表明,该自适应频谱感知算法能够有效控制次级用户和主用户的冲突概率并增加频谱利用率。     

Optimization algorithm of periodical cooperative spectrum sensing in cognitive radio

To decrease the interference to the primary user (PU) and improve the detected performance of cognitive radio (CR), a single‐band sensing scheme wherein the CR periodically senses the PU by cooperative spectrum sensing is proposed in this paper. In this scheme, CR first senses and then transmits during each period, and after the presence of the PU is detected, CR has to vacate to search another idle channel. The joint optimization algorithm based on the double optimization is proposed to optimize the periodical cooperative spectrum sensing scheme. The maximal throughput and minimal search time can be respectively obtained through the joint optimization of the local sensing time and the number of the cooperative CRs. We also extend this scheme to the periodical wideband cooperative spectrum sensing, and the joint optimization algorithm of the numbers of the sensing time slots and cooperative CRs is also proposed to obtain the maximal throughput of CR. The simulation shows that the proposed algorithm has lower computational quantity, and compared with the previous algorithms, when SNR = 5 dB, the throughput and search time of the proposed algorithm can respectively improve 0.3 kB and decrease 0.4 s. The simulation also indicates that the wideband cooperative spectrum sensing can achieve higher throughput than the single‐band cooperative spectrum sensing. Copyright © 2012 John Wiley & Sons, Ltd.     

Exploiting temporal and spatial diversities for spectrum sensing and access in cognitive vehicular networks

In cognitive vehicular networks (CVNs), spectrum sensing and access are introduced as the promising technologies to fully exploit the underutilized licensed spectrum. Because the sensing ability of a single secondary vehicular user (SVU) is affected by high mobility, dynamic topology, and unreliable wireless environment, collaborative sensing is developed to increase the sensing accuracy and efficiency. Generally, the synchronization is required in the collaborative sensing in CVN. However, it is difficult to keep all SVUs synchronized with others for sensing under the high dynamic network topology, and the sensing overhead of the synchronous cooperative action may be significant. In this paper, we first propose an asynchronous cooperative sensing scheme in which each SVU provides an energy information (EI) that is tagged with location and time information. The sensing decision will be made on account of the EI. Considering the temporal and spatial diversities of each SVU, we assign different weights to each EI and formulate the probabilities of detection and false alarm as the optimization problems to find the optimal weight of each EI. Then, based on the asynchronous sensing, the specifications of the opportunistic spectrum access mechanism are elaborated in both centralized and decentralized CVNs for the sake of practical implementation. We analyze the system performance in terms of achievable throughput and transmission delay. Numerical results show that the proposed scheme is able to achieve substantially higher throughput and lower delay, as compared with existing schemes. Copyright © 2014 John Wiley & Sons, Ltd.     

Joint power control and spectrum sensing for capacity maximisation in spectrum sharing systems

We study the problem of joint power control and spectrum sensing for maximising the capacity at the secondary user while protecting the primary user's transmissions in spectrum sharing cognitive radio systems. Power control regulates the transmission power of the secondary user and spectrum sensing regulates the sensing time and the sensing threshold that care for the primary user's protection. This problem is a capacity maximisation problem that we formulate and solve using an iterative greedy algorithm due to its complex form. The solution of the proposed algorithm leads to the global optimal solution that represents the optimal triplet values of transmission power, sensing time and threshold. The obtained results show the potential capacity maximisation that is achieved by the proposed joint design as long as the primary user's protection is provided. Finally the convergence behaviour of the proposed algorithm is assessed in terms of the needed iterations for enhancing the capacity of spectrum sharing systems.     

Asynchronous perception algorithm based on energy detection

In the future heterogeneous wireless networks,since primary user (PU) and cognitive secondary user (SU) are not coordinated to be synchronous,it will result in sense timing difference between PU’s transmitter and SU’s receiver.For this asynchronous sense case,a new asynchronous sensing algorithm based on Bayesian estimation theory was proposed.A unified dynamic state space model was first proposed to describe the observable energy relationship with dynamic PU state and unknown timing difference.Then,an iterative estimation scheme was designed using stochastic finite set and the rules of maximum posterior probability.Finally,approximated estimation results were obtained by using a particle filter.The simulation results show that the proposed asynchronous scheme significantly eliminates the uncertainty of the received signal information and thus improves the spectrum sensing performance by obtaining the time difference accurately.     

基于预测的差分信号压缩感知算法

基于压缩感知的频谱感知方法可以较低的采样速率快速获取信号,并利用获得的稀疏数据样本来判断信道的占用情况。然而,压缩感知技术中信号重构算法的复杂度很高,难以满足无线通信中的实时性要求。本文提出一种基于预测的差分信号压缩感知算法,该算法利用信道占用时间上的相关性,建立了一种信道占用情况的预测模型,依此模型预测出信道占用的变化情况;基于预测结果,在重构信号时可减少频点的搜索范围,两次降低重构算法的运算量。仿真结果表明,在保证感知性能的前提下,新算法可大幅降低迭代次数,减少算法复杂度。      

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.     

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

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

基于加权平均一致算法的宽带压缩频谱感知

在认知无线电(CR)网络中进行频谱共享接入,首要的任务是进行频谱感知,并发现频谱空洞。基于认知无线网络中信号频域的固有稀疏性,本文结合了压缩感知(CS)技术与加权平均一致(weighted average consensus)算法,建立了分布式宽带压缩频谱感知模型。频谱感知分为两个阶段,在感知阶段,各个CR节点对接收到的主用户信号进行压缩采样以减少对宽带信号采样的开销和复杂度,并做出本地频谱估计;在信息融合阶段,各CR节点的本地频谱估计结果以分布式的方式进行信息融合,并得到最终的频谱估计结果,获得分集增益。仿真结果表明,结合压缩感知与加权平均一致算法增强了频谱感知的性能,比在相同的CR网络中使用平均一致算法时有了性能上的提升。      

基于OMP算法的宽带频谱感知

频谱感知是认知无线电的一项关键技术,其能够检测出未被主用户占用的频谱空穴供次用户接入使用,提高频谱利用率.宽带频谱感知要求对数GHz 的带宽进行检测,过高的采样速率、大的数据量对现有的硬件设备提出了巨大的挑战.本文利用宽带频谱的稀疏性提出一种基于OMP算法的宽带频谱感知方法.该方法利用MWC采样实现对宽带模拟信号直接压缩采样;利用自相关矩阵对称分解特性和主用户信号独立性,得到有限维压缩采样信号模型,利用AIC/MDL准则估计稀疏度作为OMP算法迭代停止的条件,大大减少了算法复杂度;该方法不需要重构接收信号的PSD,直接在时域根据低速率采样信号,检测被占用信道.仿真结果表明,当带内信噪比大于9dB时,频谱检测概率高于90％.     

Joint spectrum sensing and resource allocation optimization using genetic algorithm for frequency hopping–based cognitive radio networks

In cognitive radio (CR) networks, secondary users should effectively use unused licensed spectrums, unless they cause any harmful interference to the primary users. Therefore, spectrum sensing and channel resource allocation are the 2 main functionalities of CR networks, which play important roles in the performance of a CR system. To maximize the CR system utility, we propose a joint out‐of‐band spectrum sensing and operating channel allocation scheme based on genetic algorithm for frequency hopping–based CR networks. In this paper, to effectively sense the primary signal on hopping channels at each hopping slot time, a set of member nodes sense the next hopping channel, which is called out‐of‐band sensing. To achieve collision‐free cooperative sensing reporting, the next channel detection notification mechanism is presented. Using genetic algorithm, the optimum sensing and data transmission schedules are derived. It selects a sensing node set that participate the spectrum sensing for the next expected hopping channel during the current channel hopping time and another set of nodes that take opportunity for transmitting data on the current hopping channel. The optimum channel allocation is performed in accordance with each node's individual traffic demand. Simulation results show that the proposed scheme can achieve reliable spectrum sensing and efficient channel allocation.     

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

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

SNR-based weighted cooperative spectrum sensing in cognitive radio networks

Cooperative spectrum sensing (CSS) is an approach to confront fading environment. However, in conventional cooperative spectrum sensing (CCSS), the difference among the secondary users (SUS) is ignored when SUS suffer from different fading. In this article, a signal-to-noise ratio (SNR)-based weighted spectrum sensing scheme is proposed to improve the sensing performance. The sensing performance of the weighted spectrum sensing scheme is then derived. Considering the minor contribution of the SUS with small weighted factor, a selective CSS scheme is proposed, where SUS with low SNR are not selected into cooperative spectrum sensing. The simulation results confirm the analytical results. And the performance of weighted scheme is better than that of conventional schemes. In the case where the SNR of SUS are randomly distributed, the performance of selective scheme is almost the same as the weighted scheme while the number of cooperative SUS is reduced to save the consumption of system resource in cooperation with little additional complexity.     

基于随机矩阵理论的DET合作频谱感知算法

针对认知无线电系统中的频谱感知问题,该文采用随机矩阵理论(Random Matrix Theory, RMT)对多认知用户(Secondary User, SU)接收信号采样协方差矩阵的最大特征值的分布特性进行了分析和研究,提出了一种新的基于双特征值判决门限(Double Eigenvalue Threshold, DET)的合作频谱感知算法。由该算法感知性能的理论分析可知:DET合作感知算法无需主用户(Primary User, PU)发射机信号的先验知识,也不需要预先知道信道背景噪声功率。仿真结果表明,与传统的频谱感知方法相比,该方法只需较少的认知用户就能获得较高的感知性能,并且对噪声的不确定性具有较强的鲁棒性。     

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.     

Optimization of Time-Domain Combining Cooperative Spectrum Sensing in Cognitive Radio Networks

In cognitive radio networks, the secondary users take chances to access the spectrum without causing interference to the primary users so that the spectrum access is dynamic and somewhat opportunistic. Therefore, spectrum sensing is of significant importance. In this paper, we propose a novel time-domain combining cooperative spectrum sensing framework, in which the time consumed by reporting for one secondary user is also utilized for other secondary users’ sensing. We focus on the optimal sensing settings of the proposed sensing scheme to maximize the secondary users’ throughput and minimize the average sensing error probability under the constraint that the primary users are sufficiently protected. Some simple algorithms are also derived to calculate the optimal solutions. Simulation results show that fundamental improvement of the achievable throughput and sensing performance can be obtained by optimal sensing settings. In addition, our proposed scheme outperforms the general frame structure on either achievable throughput or the performance of average sensing error probability.     

A sparsity and compression ratio joint adjustment method for collaborative spectrum sensing

Spectrum sensing is the fundamental task for Cognitive Radio (CR). To overcome the challenge of high sampling rate in traditional spectral estimation methods, Compressed Sensing (CS) theory is developed. A sparsity and compression ratio joint adjustment algorithm for compressed spectrum sensing in CR network is investigated, with the hypothesis that the sparsity level is unknown as priori knowledge at CR terminals. As perfect spectrum reconstruction is not necessarily required during spectrum detection process, the proposed algorithm only performs a rough estimate of sparsity level. Meanwhile, in order to further reduce the sensing measurement, different compression ratios for CR terminals with varying Signal-to-Noise Ratio (SNR) are considered. The proposed algorithm, which optimizes the compression ratio as well as the estimated sparsity level, can greatly reduce the sensing measurement without degrading the detection performance. It also requires less steps of iteration for convergence. Corroborating simulation results are presented to testify the effectiveness of the proposed algorithm for collaborative spectrum sensing.