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

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

面向认知无线电网络能量高效协作感知的在线节点选择算法

面向认知无线电网络中能量高效协作感知任务需求,提出了面向单次协作感知过程的能量最小化节点选择问题EMNS和面向在线协作感知的能量高效节点选择问题OENS。证明了两问题均为NP-hard难题。针对EMNS问题,提出采用分枝定界算法BAB求最优解和贪婪节点选择算法GS求近似解。针对OENS问题,提出为每个节点引入考虑能量消耗负载均衡的动态权重系数,基于BAB和GS算法设计了启发式的在线节点选择算法OBAB、OGS1。仿真实验结果表明,提出的算法可显著增加网络完成的协作感知过程次数,可有效延长网络"生存期"。     

认知无线电中协作压缩频谱感知算法

针对宽带频谱认知无线电环境中,传统能量检测法在信噪比较低时,容易出现误检而使系统的检测性能下降的问题,文中提出了一种新型高性能的协作频谱感知算法,它是基于压缩理论的多节点频谱感知方法,各节点之间采用基于双判决门限的协作方式。仿真结果显示,双门限协作压缩频谱感知算法在低信噪比的情况下,检测性能明显优于传统能量检测法。     

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

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

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

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

认知无线电中基于自相关矩阵的协作盲感知

为了克服传统的认知无线电频谱感知算法存在的不足,提出了一种基于自相关矩阵的协作式盲频谱感知方法,以提高频谱感知能力.该方法从样本自相关矩阵中提取检测统计量,采用双门限混合判决方法得到本地检测结果.认知基站将本地检测信息分成两类,并对软判决信息实施可靠性融合,最后给出全局判决结果.该方法是一种盲感知方法,不需要知道主用户...     

协作认知网络中基于融合准则与感知时间联合优化的策略

在协作频谱感知网络中,感知时间和数据融合准则均影响着感知性能.假设控制信道为二进制对称信道的前提下,基于“k秩准则”建立了协作感知网络吞吐量优化问题的数学模型,目的是在保护主用户利益的前提下联合优化感知时间和k值使认知网络吞吐量最大化.理论分析了最优感知时间和k值的存在性,并进行了相关的计算机仿真.仿真结果表明:所提议...     

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

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

认知无线电网络中基于协作水平的协作门限与功率联合优化

将协作传输技术用于认知无线电网络不仅增强了系统抗衰落能力,而且有效提高了频带利用率。但是,中继节点何时必须参与协助源节点传输信息是一个值得考虑的问题。该文提出一种基于协作水平的中继协作准则。首先给出协作水平的定义和表达式,并基于此式推导了系统平均带宽利用率和误符号率公式,然后由二者的折中得到关于协作门限和功率比的性能函数。为了使系统获得最优性能,文中采用粒子群优化算法联合优化协作门限和功率比。仿真结果表明,良好的源节点到目的节点的链路状态和尽量使用中继参与协作均有助于系统性能的最优化。     

基于多层分簇优化的认知无线电网络协作频谱感知策略

针对认知无线电网络(CRN)中基于簇的频谱感知策略的检测性能和能耗问题,提出一种基于多层分簇优化的协作频谱感知策略。首先,将CRN分成多个簇,进而将簇分成多个组,再将组分成多个子组,构建三层分簇结构;然后,利用提出的优化算法获得最优的分簇参数和决策阈值;最后,通过投票机制和K-out-of-N规则对各级决策进行聚合,进行频谱感知。实验结果表明,该方案在获得较高主要用户(PU)频谱占用检测率的同时,能够最大限度地减少信道开销,提高了网络的吞吐量。     

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.     

Parameters optimization for cooperative sensing in multi‐channel cognitive radio networks

In this paper, we propose a relatively complete and robust optimization model under the scenario where multisecondary users cooperatively sense multi‐channels. The objective of this model is to maximize the system throughput, meanwhile aims to jointly optimize the parameters including the sensing time and the weight coefficients of the sampling results. Because this model is a nonlinear optimization model, we instead adopt a heuristic sequential parameters optimization method (SPO) to solve the model. The method begins with deriving the lower bound of the objective function of the optimization model. Then, it maximizes this lower bound by optimizing the weight coefficients through solving a series of suboptimal problems using Lagrange method. Given that the weight coefficients are found, it finally transforms the problem into another monotonic programming problem and exploits a fast‐convergent polyblock algorithm to find an optimized sensing time parameter. We finally conduct extensive experiments by simulations. The results demonstrate that, in terms of the throughput gained by the system, SPO can deliver a solution that is up to 99.3% of the optimal on average, which indicates that SPO can solve the proposed optimization model effectively. In addition, we also show the performance advantage of the proposed model on improving the system throughput by comparing with other state‐of‐the‐art optimization models. Wireless Communications and Mobile Computing. Copyright © 2012 John Wiley & Sons, Ltd.     

认知自组网分布式频谱感知最优协作算法

认知无线电技术使得自组织网络节点能够充分利用空闲频谱资源,提高了传输性能。通过协作频谱感知,可有效解决由于无线信道存在阴影、噪声和衰落等情况导致的单节点感知准确性偏低。为了解决梯度算法随着协作节点数量增大后计算复杂度变高,文中提出部分梯度算法ψ-GBCS,该模型通过基于SNR的动态阈值保证了感知准确性,同时通过最佳协作节点数提高了感知效率。仿真结果表明,该模型下,综合评估系统效率和性能的J函数值提高37%,能耗降低50%,有效保证大规模认知自组网频谱感知的鲁棒性,降低了对主用户的干扰及设备功耗。     

Improved cooperative spectrum sensing based on the reputation in cognitive radio networks

Cognitive radio (CR) is a promising technology to improve the utilisation of wireless spectrum resources. Spectrum sensing is the core functionality in CR networks (CRN). When there exist malicious users (MUs) in CRN and MUs start to attack the network after accumulating reputation to some extent, the performance is deteriorated. In this paper, a scheme is proposed by employing Orthogonalized Gnanadesikan–Kettenring (OGK) to mitigate the effect of MUs without the assistance of trusted nodes, and it can improve the robustness of CRN. Simulations verify the effectiveness of the proposed scheme.     

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.     

Optimal fusion rule for cooperative spectrum sensing in cognitive radio networks

In this paper,we analyze performance of cooperative spectrum sensing under counting rules when exponential model is utilized to characterize the burst nature of primary user(PU) link.Our objective is to minimize the average error probability(AEP) so that the link utilization in the considered link achieves its maximum.We derive a closed-form expression of AEP as well as the probability of interference(PoI) by classifying cognitive transmission into six events.Then,we consider the minimization of AEP over counting rules under the constraint of interference.As the solution,we develop an efficient algorithm to evaluate the optimal fusion rule.Finally,we verify our analysis in numerical results.     

Cluster‐based coordination scheme for cooperative cognitive radio networks

In this paper, a cluster‐based two‐phase coordination scheme for cooperative cognitive radio networks is proposed considering both spectrum efficiency and network fairness. Specifically, candidate secondary users (SUs) are first selected by a partner selection algorithm to enter the two‐phase cooperation with primary users (PUs). In phase I, the selected SUs cooperate with PUs to acquire a fraction of time slot as a reward. In phase II, all SUs including the unselected ones share the available spectrum resources in local clusters; each of which is managed by a cluster head who participated in the cooperation in phase I. To improve the total network utility of both PUs and SUs, the maximum weighted bipartite matching is adopted in partner selection. To further improve the network performance and communication reliability, network coding is exploited during the spectrum sharing within the cluster. Simulation results demonstrate that, with the proposed cluster‐based coordination scheme, not only the PUs' transmission performance is improved, but also SUs achieve spectrum access opportunities. Copyright © 2015 John Wiley & Sons, Ltd.     

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

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