Consensus-based decentralized clustering for cooperative spectrum sensing in cognitive radio networks

A large number of previous works have demonstrated that cooperative spectrum sensing(CSS) among multiple users can greatly improve detection performance.However,when the number of secondary users(SUs;i.e.,spectrum sensors) is large,the sensing overheads(e.g.,time and energy consumption) will likely be intolerable if all SUs participate in CSS.In this paper,we proposed a fully decentralized CSS scheme based on recent advances in consensus theory and unsupervised learning technology.Relying only on iteratively information exchanges among one-hop neighbors,the SUs with potentially best detection performance form a cluster in an ad hoc manner.These SUs take charge of CSS according to an average consensus protocol and other SUs outside the cluster simply overhear the sensing outcomes.For comparison,we also provide a decentralized implementation of the existing centralized optimal soft combination(OSC) scheme.Numerical results show that the proposed scheme has detection performance comparable to that of the OSC scheme and outperforms the equal gain combination scheme and location-awareness scheme.Meanwhile,compared with the OSC scheme,the proposed scheme significantly reduces the sensing overheads and does not require a priori knowledge of the local received signal-to-noise ratio at each SU.     

Consensus-based decentralized clustering for cooperative spectrum sensing in cognitive radio networks

A large number of previous works have demonstrated that cooperative spectrum sensing (CSS) among multiple users can greatly improve detection performance. However, when the number of secondary users (SUs; i.e., spectrum sensors) is large, the sensing overheads (e.g., time and energy consumption) will likely be intolerable if all SUs participate in CSS. In this paper, we proposed a fully decentralized CSS scheme based on recent advances in consensus theory and unsupervised learning technology. Relying only on iteratively information exchanges among one-hop neighbors, the SUs with potentially best detection performance form a cluster in an ad hoc manner. These SUs take charge of CSS according to an average consensus protocol and other SUs outside the cluster simply overhear the sensing outcomes. For comparison, we also provide a decentralized implementation of the existing centralized optimal soft combination (OSC) scheme. Numerical results show that the proposed scheme has detection performance comparable to that of the OSC scheme and outperforms the equal gain combination scheme and location-awareness scheme. Meanwhile, compared with the OSC scheme, the proposed scheme significantly reduces the sensing overheads and does not require a priori knowledge of the local received signal-to-noise ratio at each SU.     

基于OFDM的认知无线电系统中最优功率分配

在基于正交频分复用(OFDM)的认知无线电系统中,主用户会受到次用户带内子载波以及邻带子载波的带外泄漏功率的干扰。为了在保护主用户通信性能的前提下高效利用机会频谱,该文提出了求解次用户子载波间的最优功率分配方案的方法,通过求解一个凸优化问题获得最优功率分配方案。较之迭代分块注水算法,该方法特别考虑了邻带子载波功率泄漏的影响。仿真结果表明:采用这种方法所获得的功率分配方案在满足各主用户干扰功率上限的条件下使得次用户信道容量最大化。     

基于迭代用户选择的合作频谱感知算法

针对认知无线电中经典频谱感知算法 (能量检测、算术几何平均、信号特征值子空间、最大特征值检测)存在不同程度缺陷的问题,为了进一步提高频谱感知算法的检测性能,提出了基于迭代用户选择(iterative user selection, IUS)的合作频谱感知算法。该算法先对参与合作感知的全部认知用户进行选择,然后在选出的部分用户频谱观测数据的基础上,生成全局检验统计量(global decision statistic, GTS),以此做出授权用户(primary user, PU)信号是否存在的全局判决。仿真结果显示,在虚警概率保持不变的情况下,进行迭代用户选择后,合作频谱感知的检测概率要优于未进行用户选择时的算法。与经典频谱感知算法相比较, IUS的合作频谱感知算法不需要任何先验信息,且以较少的频谱观测数据达到较好的检测性能。     

Delay performance analysis and access strategy design for a multichannel cognitive radio network

For a hierarchical cognitive radio network (CRN), the secondary users (SUs) may access the licensed spectrum opportunistically, whenever it is not occupied by the primary users (PUs). An important issue for this kind of CRN is the achievable quality-of-service (QoS) performance, such as traffic transmission delay, which is critical to the SUs?? traffic experience. In this paper, we focus on the delay performance analysis of the SU system and the design of the corresponding optimal access strategy for the case of SUs sharing multiple licensed channels. In our analysis, the transmission of PU and SU traffic is modeled as M/G/1 queues. By merging the PU and SU traffic, we propose the model of a priority virtual queue on the licensed channels. Based on this model, we obtain the expected system delay expression for SU traffic through M/G/1 preemptive repeat priority queuing analysis. For the case of multiple licensed channel access, the access strategy is further investigated with respect to the expected system delay for SU traffic. By minimizing the expected transmission delay, the optimal access strategy is modeled as a nonlinear programming problem, which can be resolved by means of the classic Genetic Algorithm (GA). Numerical results validate our analysis and design of an optimal access strategy. Meanwhile, by considering the time taken by the GA approach, we can also adopt the inverse proportional access strategy to obtain near-optimal results in practice.     

基于用户集合势估计的认知无线电合作频谱感知

频谱感知技术是认知无线电系统的基本功能,是实现已授权频段的次级动态接入和共享的前提。提出基于用户集合势估计的合作频谱感知方案,旨在通过GEEF（gerschgorin exponentially embedded families）,SPEEF（sam-pled power exponentially embedded families）等算法估计出用户的集合势,即适合参与合作频谱感知的最优用户个数,再从全部合作用户中筛选出相应的频谱观测数据生成全局检测统计量,通过与判决门限进行对比,最终对授权用户状态做出判决。理论分析与实验结果表明,提出的方案能够有效地提高频谱感知的性能。     

Compressive Wideband Spectrum Sensing Based on Random Matrix Theory

Spectrum sensing in a wideband regime for cognitive radio network(CRN) faces considerably technical challenge due to the constraints on analog-to-digital converters(ADCs).To solve this problem,an eigenvalue-based compressive wideband spectrum sensing(ECWSS) scheme using random matrix theory(RMT) was proposed in this paper.The ECWSS directly utilized the compressive measurements based on compressive sampling(CS) theory to perform wideband spectrum sensing without requiring signal recovery,which could greatly reduce computational complexity and data acquisition burden.In the ECWSS,to alleviate the communication overhead of secondary user(SU),the sensors around SU carried out compressive sampling at the sub-Nyquist rate instead of SU.Furthermore,the exact probability density function of extreme eigenvalues was used to set the threshold.Theoretical analyses and simulation results show that compared with the existing eigenvalue-based sensing schemes,the ECWSS has much lower computational complexity and cost with no significant detection performance degradation.     

基于异步分布式检测的协作频谱感知研究

构建了一种基于异步分布式检测的协作频谱感知(CSS)模型,推导了此模型在贝叶斯准则下的最优融合方案,并提出了一种不需要主用户先验信息的次优方案——最大后验概率(MAP)检测-K/N规则融合方案.分别对采用这两种方案时,协作频谱检测的虚警概率和检测(漏检)概率性能进行了理论分析和仿真,仿真结果显示两种方案都能有效提高频谱...     

基于协作频谱感知的多无人机通信网络谱效优化研究

针对无人机应用场景频谱效率较低的问题,提出一种结合认知无线电技术的多无人机通信网络谱效优化方案.首先基于协作频谱感知,建立空地信道下多机协作的认知无人机网络模型,设置无人机（unmanned air vehicle,UAV）数量、感知时间和判决门限等优化参数,在此基础上提出高谱效联合优化算法对构建的非凸优化问题求解,最后分析无人机飞行过程中谱效的变化情况.仿真结果表明,存在最优感知时间使系统谱效获得最大值,且UAV数量和判决门限等因素会影响该谱效最优值;提出的高谱效联合优化算法具有较好的收敛性,有效提高了UAV次级认知网络的频谱效率.      

认知无线电频谱共享的一种博弈论方法

提出了基于博弈论的认知无线电静态频谱共享模型,研究多个次级用户竞争一个主用户系统的空闲频谱。建立了基于自我约束机制的主用户系统的效益函数,主用户系统兼顾自身频谱需求与不浪费剩余的空闲频谱两方面来确定合适的价格,并引入了动态频谱共享算法,次级用户能不断调整自己的策略最终趋于纳什均衡,最大化自身效益。     

基于协作的动态频谱租赁序贯博弈

针对认知无线电频谱共享问题,在主用户与多接入感知用户共存的场景下,提出并分析了一种频谱租赁分层模型。该模型中感知用户间的竞争接入采用分布式异构机会功率控制方式;主从网络之间的竞争与协作采用序贯博弈。对博弈的完全信息模型给出了逆向归纳法求解方案,对不完全信息场景给出了一种近似求解方案。理论分析与仿真结果证明了所提出的模型与算法能够保证主用户的保留支付,并在两个层次(主从网络之间以及感知网络内)上公平的共享频谱。     

基于CP-ABE的自定义读写策略的云数据共享方案

为解决现有研究中用户权限分类的云存储数据共享的研究少,且已存研究算法复杂、通信开销大、安全漏洞多等问题,提出一种去中心化的用户自定义读写权限的数据安全共享方案.本文采用密文政策的基于属性的加密算法与短群签名相结合,使数据拥有者自定义只读用户和修改用户的属性条件,并将条件绑定密文托管至云服务器中,使得符合条件的用户能够自行解密数据.实验结果表明,所提云数据共享方案保证数据读写机密性,算法简单、计算量通信量小、参数少、签名长度短并且能弥补同类方案的安全漏洞.      

基于粒子群优化的认知无线电功率分配算法

针对认知无线电网络（CRN）中主用户（PU）的干扰功率阈值、 次用户（SU）的传输速率限制和信干噪比（SINR）需求, 提出一种基于蒸发因子的粒子群优化（LTPSO）算法, 其中蒸发因子根据粒子群学习因子设定, 建立新的粒子群记忆形式, 并对适应度值按比例进行筛选. 仿真结果表明, LTPSO算法获得了较好的优化效果.     

一种新的基于自适应用户协作的数据融合方案

频谱感知是认知无线电网络中的关键环节,针对次用户独立检测效果欠佳的实际问题,提出一种基于自适应用户协作的数据融合方案,通过利用认知无线网络中次用户间的自适应协作,实现相应的数据融合以改善对主用户的检测性能。在瑞利衰落环境下,理论推导了所提自适应协作数据融合方案的检测概率和检测时间。根据推导得到的性能解析表达式,对非协作方案和所提出的协作融合方案,进行了相应的数值实验和性能比较。结果表明:与非协作方案相比,自适应协作融合方案显著提高了系统检测概率,同时检测时间也明显减少。     

异构网络中基于马尔可夫过程的区分业务无线资源管理研究

文中提出了一种基于UTMS蜂窝网络和WLAN异构网络的协同无线资源管理算法.该算法的关键参数包括业务类型、用户终端移动性和位置信息等,协同地利用异构网络中的资源,并同时能保证业务的QoS和业务成本的最小化.通过马尔可夫模型分析了算法的有效性.仿真结果表明,在不同的移动性和网络负荷条件下,文中算法能够明显降低不必要的垂直切换到达率,提供稳定的通信,并有效地提高了系统吞吐量.     

Interference Alignment Algorithm for Considering the Throughput of Cognitive Users in Cognitive MIMO Network

The cognitive multiple input multiple output( MIMO)network can utilize radio spectrum efficiently and satisfy the demand of high data rate. In order to decrease the interference during transmission,a new interference alignment( IA) algorithm based on cognitive MIMO networks is proposed in this paper. The algorithm is realized by designing two-level pre-coding, the first-level precoding aligns the interference generated by the cognitive users( CUs) to unused sub-channels of the primary user( PU),thereby eliminating the interference of CUs to PU; the second-level precoding is used to improve the throughput of CUs. Simulation shows that the proposed IA algorithm can eliminate the interference that the CUs produce on the PU and improve the throughput of CUs spontaneously.     

Joint Optimization Strategy for Video Transmission over Distributed Cognitive Radio Networks

A novel joint optimization strategy for the secondary user( SU) was proposed to consider the short-term and long-term video transmissions over distributed cognitive radio networks( DCRNs).Since the long-term video transmission consisted of a series of shortterm transmissions, the optimization problem in the video transmission was a composite optimization process. Firstly,considering some factors like primary user’s( PU’s) collision limitations,non-synchronization between SU and PU,and SU’s limited buffer size, the short-term optimization problem was formulated as a mixed integer non-linear program( MINLP) to minimize the block probability of video packets. Secondly,combining the minimum packet block probability obtained in shortterm optimization and SU’s constraint on hardware complexity,the partially observable Markov decision process( POMDP) framework was proposed to learn PU’s statistic information over DCRNs.Moreover,based on the proposed framework,joint optimization strategy was designed to obtain the minimum packet loss rate in long-term video transmission. Numerical simulation results were provided to demonstrate validity of our strategies.     

Uplink user allocation scheme in cognitive coexistent cellular network

In order to address spectrum resource scarcity in traditional cellular networks,television （TV） white space is considered as a potential solution to offload a portion of network traffic and enlarge network capacity.This paper describes a cognitive cellular network which allocates low geometry users to the TV white space based on a proportional fair criterion.An uplink user allocation scheme is proposed and the validity of the proposed scheme is established by simulation of the cellular network usage in conjunction with the TV white space.The simulation results show clear improvements in both the user and the system performance with the cognitive coexistent cellular network compared with the traditional cellular network,and that the performance of the proposed user allocation scheme is superior to other user allocation schemes.     

一种新型的多址接入中继协作方案

现有多址中继协作方案的编码增益有限且用户之间不能相互辅助,为此,文中提出了一种结合网络与信道编码的多址中继协作方案:在中继端利用网络编码将不同用户的编码冗余同时转发,目的端通过对某个用户信息的正确译码恢复出其他用户的编码冗余.通过对译码错误事件概率的分析,推导了该方案的中断率与误码率近似值表达式.仿真结果表明,随着信噪比的提升,文中方案可获得比编码协作更好的中断率和误码率性能,同时信噪比较高的用户还可辅助提升信噪比较低的用户的性能.     

Utility-optimization dynamic subcarrier allocation algorithm for SC-FDMA systems

Two utility-optimization dynamic subcarrier allocation （DSA） algorithms are designed for single carrier frequency division multiple access system （SC-FDMA）. The two proposed algorithms aim to support diverse transmission capacity requirements in wireless networks, which consider both the channel state information （CSI） and the capacity requirements of each user by setting appropriate utility functions. Simulation results show that with considerable lower computational complexity, the first utility-optimization algorithm can meet the system capacity requirements of each user effectively. However, the rate-sum capacity performance is poor. Furthermore, the second proposed utility-opti- mization algorithm can contribute a better trade-off between system rate-sum capacity requirement and the capacity requirements of each user by introducing the signal to noise ratio （SNR） informa- tion to the utility function based on the first utility-optimization algorithm, which can improve the us- er requirements processing capability as well as achieve a better sum-rate capacity.