基于信任度的双门限协作频谱感知算法

提出了一种兼顾认知无线电系统可靠性和低负载的基于信任度的双门限协作频谱检测算法.系统首先使满足双门限要求的认知节点参与协作感知,当满足双门限要求的认知节点数目不足时,增加满足信任度参数要求的认知节点参与协作感知.融合中心存储了认知节点的检测记录,并以此为局部检测结果设置融合权重.理论分析和仿真结果表明,该算法所需传输的感知参数减少了,占用的信道带宽降低.同时,由于不可靠用户的减少,算法的检测性能进一步提高了.此外,算法通过调整参数nt使系统适应于不同类型的无线业务,具有一定的灵活性.     

基于改进混合蛙跳算法的认知无线电协作频谱感知

提出了一种改进的混合蛙跳算法（shuffled frog leaping algorithm,SFLA）,并提出了基于改进SFLA的认知无线电协作频谱感知方法,通过仿真对改进SFLA算法性能与传统SFLA算法性能进行了比较,并对本文提出的基于改进SFLA的协作感知方法与已有的基于修正偏差因子（modified deflection coefficient,MDC）的协作感知方法性能进行了比较.结果表明改进SFLA算法性能优于传统SFLA;基于改进SFLA的协作感知方法比MDC方法能获得更大的检测概率,验证 关键词： 认知无线电 频谱感知 混合蛙跳算法     

基于量子遗传算法的认知无线电频谱分配

提出了基于量子遗传算法的认知无线电频谱分配算法,通过仿真比较了本文算法与颜色敏感图论着色频谱分配算法的性能.结果表明基于量子遗传算法的频谱分配算法性能明显优于颜色敏感图论着色算法,它能更好地实现网络效益最大化;当用户数和频带数较少时,量子遗传算法在进化代数很少时就能找到理想最优解,而颜色敏感图论着色算法所得到的解与理想最优解偏差较大. 关键词： 认知无线电 频谱分配 量子遗传算法 图论着色     

用于认知无线电协作频谱感知的混合蛙跳算法群体初始化技术

提出了一种用于认知无线电线性加权协作频谱感知的改进混合蛙跳算法(shuffled frog leaping algorithm, SFLA) 的群体初始化技术, 提出在SFLA初始群体中包含基于修正偏差因子所得的解, 从而改进算法初期性能. 仿真结果表明相比于传统群体初始化技术, 本文所提出的群体初始化技术能够以更快的速率得到期望解, 从而节约计算时间, 更有利于实时应用 关键词： 认知无线电 频谱感知 混合蛙跳算法 群体初始化     

一种面向中继协作频谱感知系统的自适应全局最优化算法

该文研究了冗余中继, 次用户及中继用户数目, 检测门限, 信道传输错误率等因素对中继协作频谱感知系统性能的影响, 并提出一种新的自适应全局最优化算法.该算法基于获得最大无干扰功率的自适应中继选择方法, 确定备选认知中继集合;单个次用户以信道传输错误率最小为准则, 从备选认知中继集合中自适应选择最佳中继, 使总体检测率最大;在给定目标检测率的条件下, 以系统吞吐量最大为准则, 给出了自适应全局最优化算法.仿真实验结果表明新算法信道传输精度高, 信道吞吐量大, 节约带宽资源.     

拟态物理学优化的认知无线电网络频谱分配

针对认知无线电网络中基于图着色模型的频谱分配问题,基于其非确定性多项式特性,以最大化网络收益总和为目标,提出了一种基于拟态物理学优化的求解算法. 在拟态物理学优化算法中,将频谱分配问题的解映射为一个具有质量的微粒,通过建立微粒的质量与其适应值之间的关系,并利用万有引力定律定义微粒间的虚拟作用力的大小,使整个群体向更好的方向运动,实现群体寻优. 给出了频谱分配问题的具体求解过程,并根据分配问题的二进制编码特点,改进了微粒的位置更新方程. 仿真实验表明：本文算法能更好地实现网络收益最大化. 关键词： 拟态物理学优化 认知无线电网络 频谱分配 网络收益     

一种基于选择性测量的自适应压缩感知方法

针对低信噪比条件下现有压缩感知系统重构性能严重恶化的问题,提出了一种基于选择性测量的自适应压缩感知结构.首先推导并分析了经过压缩测量的噪声的统计特性及其对重构性能的影响;然后基于输出能量最小化准则,设计了一种压缩域投影滤波联合噪声检测的自适应感知器,感知获得噪声子空间的位置信息;进一步利用该信息构造选择性压缩测量矩阵,智能选择测量信号,同时"屏蔽"噪声分量,极大提高了压缩测量值的信噪比.仿真结果表明,相对于现有压缩感知结构,选择性测量的压缩感知结构明显改善了含噪稀疏信号的重构性能,可更好地应用于吸波材料的前端特性分析、认知无线电的频谱感知等领域.     

基于改进的稀疏度自适应匹配追踪算法的宽带压缩频谱感知

针对在实际宽带压缩频谱感知中难以预先获知宽带频谱稀疏度的问题,提出一种改进的稀疏度自适应匹配追踪(modified sparsity adaptive matching pursuit, MSAMP)算法,该算法在支撑集选择过程中对稀疏度进行了预估计。结合序贯压缩检测技术,给出了一种基于该算法的多认知用户合作场景下的宽带压缩频谱感知方法,理论分析和实验仿真结果表明,该方法可在频谱稀疏度先验知识缺少的情况下,有效提高宽带频谱感知性能。     

基于改进的稀疏度自适应匹配追踪算法的宽带压缩频谱感知（英文）

针对在实际宽带压缩频谱感知中难以预先获知宽带频谱稀疏度的问题,提出一种改进的稀疏度自适应匹配追踪(modified sparsity adaptive matching pursuit,MSAMP)算法,该算法在支撑集选择过程中对稀疏度进行了预估计。结合序贯压缩检测技术,给出了一种基于该算法的多认知用户合作场景下的宽带压缩频谱感知方法,理论分析和实验仿真结果表明,该方法可在频谱稀疏度先验知识缺少的情况下,有效提高宽带频谱感知性能。     

认知无线电网络中基于抢占式排队论的频谱切换模型

针对认知无线电网络中认知用户广义传输时间的优化问题, 提出了一种基于抢占式续传优先权M/G/m排队理论的频谱切换模型. 在该排队模型中, 为了最小化认知用户广义传输时间, 采用混合排队-并列式服务的排队方式. 在此基础上, 深入分析多个认知用户、多个授权信道、多次频谱切换条件下认知用户信道使用情况, 从而推导出广义传输时间表达式. 最后探讨了该模型下自适应频谱切换策略. 仿真结果表明, 相比于已有的频谱切换模型, 该模型不仅能够更加完整地描述认知用户频谱切换行为, 而且使得认知用户传输时延更小, 广义传输时间更短. 此外, 认知无线电网络允许的认知用户服务强度增加, 能够容纳的认知用户数量增多. 因此, 该模型提升了认知用户频谱切换的性能, 更好地实现了认知用户与授权用户的频谱共享.     

Outlier-aware cooperative spectrum sensing in cognitive radio networks

This paper considers the problem of cooperative spectrum sensing in cognitive radio networks (CRN). Communication in CRNs may be disrupted due to the presence of malicious secondary users (SU) or channel impairments such as shadowing. This paper proposes a spatio-frequency framework that can detect and track malicious users and anomalous measurements in CRNs. The joint problem of spectrum sensing and malicious user identification is posed as an optimization problem that aims to exploit the sparsity inherent to both, spectrum occupancy and malicious user occurrence. Proposed scheme obtains improved performance by utilizing node location information, and can handle missing or inaccurate location information, and noisy SU reports. A distributed block-coordinate descent-based algorithm is proposed that is shown to outperform the state-of-the-art PCA-based approach, and is flexible enough to defeat a variety of attacks encountered in SU networks. An online algorithm, that can handle incorporate multiple SU readings sequentially and adapt to time-varying channels, primary user, and malicious user activity, is also proposed and shown to be consistent. Simulation results demonstrate the efficacy of the proposed algorithms.     

Cooperative spectrum sensing protocols and evaluation with IEEE 802.15.4 devices

Spectrum Sensing is one of the important tasks for wireless devices. By sensing the spectrum, wireless devices sense their radio environment and perform spectrum access accordingly to reduce collisions. Due to radio propagation effects and inherent noise in the measurements, performance of todays wireless technologies with individual spectrum sensing cannot solve the hidden node problem. Cooperative sensing is seen as a way to improve the performance of wireless devices improving the radio bandwidth utilization and minimizing interference among wireless devices. To the best of our knowledge, this is the first work which provides protocols for cooperative sensing and presents experimental results with IEEE 802.15.4 devices. We present and implement protocols and applications for primary, secondary and cooperative users with a dedicated control channel. Thereby, the secondary user receiver serves as a first cooperative node in the system which reduces collisions between primary and secondary users. We evaluate the system performance with receiver sensing and additional cooperative nodes. We also propose a mechanism to extend the protocol for multiple secondary users sharing the same control channel. Based on the evaluations, we also provide recommendations for usage of cooperative sensing with focus on IEEE 802.15.4.     

Robust detection analysis of linear cooperative spectrum sensing for cognitive radio networks

Robust detection is employed in this work to cope with uncertainties on the channel gains and the noise power levels in a cognitive radio system based on linear cooperative spectrum sensing. The minimum number of samples required to achieve given false-alarm and missed-detection probabilities is derived as a function of the system parameter uncertainty levels and the nominal SNRs. A lower bound to the received symbol energy required to achieve reliable system operation is derived. This lower bound extends the concept of SNR wall to the case of a cooperative CR system with multiple secondary users. Then, a symmetric CR system scenario is investigated analytically and by numerical simulations. Simple asymptotic results are obtained in this case to relate the minimum number of samples required and the system parameters.     

Joint optimal fair cooperative spectrum sensing and transmission in cognitive radio

Since the sensing power consumption of cooperative spectrum sensing (CSS) will decrease the throughput of secondary users (SU) in cognitive radio (CR), a joint optimal model of fair CSS and transmission is proposed in this paper, which can compensate the sensing overhead of cooperative SUs. The model uses the periodic listen-before-transmission method, where each SU is assigned a portion of channel bandwidth, when the primary user (PU) is estimated to be free by the coordinator. Then, a joint optimization problem of local sensing time, number of cooperative SUs, transmission bandwidth and power is formulated, which can compensate the sensing overhead of cooperative SUs appropriately through choosing suitable compensating parameter. The proposed optimization problem can be solved by the Polyblock algorithm. Simulation results show that compared with the traditional model, the total system throughput of the fairness cooperation model decreases slightly, but the total throughput of the cooperative SUs improves obviously.     

Quadratic covariance matrix-based cooperative spectrum sensing method by using an evolutionary algorithm

Cognitive radio (CR) is a practical technology to solve the current low utilization of spectrum resources, and spectrum sensing is the most critical technique in a CR network. In this paper, a genetic simulated annealing algorithm based on quadratic covariance matrix and information geometry is proposed for cooperative spectrum sensing (CSS) to enhance the performance in the low signal-noise ratio (SNR). Firstly, the quadratic covariance matrix of cooperative secondary users (SUs) is used as the characteristic matrix to perform feature extraction. Secondly, based on the information geometry, the characteristic matrix is mapped on the statistical manifold to avoid information loss. Furthermore, the genetic simulated annealing algorithm is used to obtain a classifier on the statistical manifold, and the mutation process is improved by a new mutation operator to accelerate the convergence speed of the whole algorithm. Finally, the classifier is employed to implement spectrum sensing. In the simulation analysis, the proposed method has better spectrum sensing performance than the popular various methods under low SNR and faster convergence speed.     

Optimal satisfaction degree in energy harvesting cognitive radio networks

A cognitive radio(CR) network with energy harvesting(EH) is considered to improve both spectrum efficiency and energy efficiency. A hidden Markov model(HMM) is used to characterize the imperfect spectrum sensing process. In order to maximize the whole satisfaction degree(WSD) of the cognitive radio network, a tradeoff between the average throughput of the secondary user(SU) and the interference to the primary user(PU) is analyzed. We formulate the satisfaction degree optimization problem as a mixed integer nonlinear programming(MINLP) problem. The satisfaction degree optimization problem is solved by using differential evolution(DE) algorithm. The proposed optimization problem allows the network to adaptively achieve the optimal solution based on its required quality of service(Qos). Numerical results are given to verify our analysis.     

标志位频谱感知方法研究

文章提出了一种新的标志位频谱感知方法,主要由数据采集和频谱感知两部分组成.前者主要基于标准的压缩感知技术,研究了一种标志位数据采集方法,仅保留测量数据的标志位信息,从而减少了测量数据的存储量.后者基于一致恢复原理和共轭梯度算法来构造频谱感知算法.仿真结果表明,标志位频谱感知方法可以在降低数据采集量及存储量的同时完美获取原始信号的频谱信息.该方法可以应用于无线通信、电子对抗、智能吸波结构以及感知无线电的前端频谱测量设计阶段中. 关键词： 频谱感知 标志位压缩感知 智能吸波结构