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

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

多天线认知系统中最优协作用户数的选择研究

针对非理想控制信道传输错误对认知系统中多天线多用户协作频谱感知性能影响的问题,提出一种使得认知系统误检概率最小的最优协作用户数选择方案,并推导给出其闭式表达式。该方案首先根据单根天线错误检测概率最小的原则推导出认知用户单根天线最优的判决门限。然后利用“K秩”准则对多天线进行合并,根据认知用户错误检测概率最小的原则推导出最优的“K”值。最后根据认知系统误检概率最小的原则推导出最优的协作感知用户数。通过仿真验证了该方案理论的正确性,并分析给出了控制信道错误概率对认知系统检测性能的影响。相比于传统的协作检测算法,本方案具有更好的检测性能。      

一种认知无线电网络频谱分配策略

频谱分配技术是认知无线电的关键技术之一,为适应认知无线电系统的时变特性,频谱分配算法必须有较快的收敛速度。在干扰温度模型下,提出一种基于Kuhn-Munkras算法的认知无线电频谱分配策略。该策略利用Kuhn-Munkras算法可以实现最佳匹配并且收敛速度快的特性,根据不同的用户在不同信道上所产生的效益的差异性,实现认知用户和信道的最佳匹配。仿真表明,基于Kuhn-Munkras算法的频谱分配在性能上优于传统的配对算法和greedy算法。     

多天线OFDM系统中的自适应子信道分配和天线选择

针对多用户MIMO-OFDM系统,提出自适应子信道分配算法.首先将相邻的子载波分块成若干子信道,在分配子信道的时候优先考虑平均信道容量小的用户,并且将相对利用度大的子信道分配给该用户,从而在频谱利用率和公平性上具有较好的性能.为了降低发送端的硬件复杂度以及非线性因素的影响,将自适应信道分配和发送天线选择相结合,提出联合自适应子信道分配和天线选择算法.仿真结果表明,本文提出的联合算法具有较高的频谱效率和较低的中断概率.     

认知无线电网络中基于协作中继的资源分配算法

在认知无线电网络的协作中继机制下,中继节点利用其和源节点以及目的节点的不同公共信道为二者的通信转发数据,可以有效解决次用户的通信需求和可用带宽之间的矛盾,提高频谱利用率和系统吞吐量。基于协作中继的认知无线电网络中,不同通信链路上可能存在公共可用信道,使信道和中继的分配问题变得复杂。本文研究了公共信道存在的情况下系统的资源分配问题,基于网络最大流理论提出了两种算法:并行算法和贪婪算法,并分析了算法复杂度。仿真结果表明,两种算法都能够更有效地分配资源,提高频谱利用率,改善网络吞吐量。并行算法可以得到最优解,但其复杂度随信道公用程度的上升增长迅速,受节点并行处理能力的限制,只适用于信道公用程度较低的情况。贪婪算法不一定能得到最优解,但其复杂度较低,并且信道公用程度高时接近最优解,因此超出节点的并行处理能力后,可以选择贪婪算法。      

认知无线电网络中基于功率有效性的最优功率分配

在资源受限的认知无线电网络中,如何提高次用户网络的功率利用率是一个值得考虑的问题。针对这个问题,本文首先提出了认知无线电网络中基于功率有效性的次用户最优功率分配算法,该算法不仅考虑主用户网络中断概率对次用户发射功率的限制,而且兼顾次用户网络本身的中断概率要求。其次,为了进一步降低节点的计算复杂度,本文通过降维处理将目标最优化问题转化为两个子问题进行求解,从而提出一种次优的低复杂度功率分配算法。仿真结果表明,次优算法相比最优算法仅带来有限的性能损失,但是却有效地节省了计算时间和存储空间;此外,当中继节点靠近源节点时更有利于系统功率效率的提高,源节点到目的节点链路相比中继链路对系统的性能影响更大。      

有限用户数多认知网络部分信道共享性能分析

认知网络中动态信道共享是提高频谱资源利用率的关键.针对有限用户数下多认知网络共存场景,该文建立3维马尔科夫链部分信道共享模型,仿真分析用户有/无信道切换功能下认知网络间部分信道共享的性能.分别就阻塞概率、强迫终止概率、切换概率和系统吞吐量等,与静态频谱分配策略和分级共享策略进行比较仿真测试,结果表明,采用部分信道共享策略的系统在容忍较小的切换概率和强迫终止概率下可以获得较大的系统吞吐量.     

一种多天线智能谱感知方法研究

频谱感知和多天线分集合并技术是目前无线通信研究的热点.为了在复杂的信道衰落环境下实施有效的检测,融合多种检测方法是目前频谱感知技术的发展趋势.提出了一种基于匹配滤波器检测、能量检测和循环平稳检测的多天线合并智能频谱感知算法.通过建立高斯信道下二元假设检验模型,得出了总检测概率的封闭表达式.各种条件下的检测概率和检测时间的接收机工作特性(Receiver Operating Characteristic,ROC)实验结果表明所提算法优于单天线的性能,有效地利用了分集技术并减小了信号瞬时波动,保证在衰落信道条件下也能得到较高的检测概率.这对发展新型频谱感知技术,促进认知无线电技术应用具有重要意义.     

多用户分布式MIMO-OFDM系统中天线与子载波分配算法研究

本文针对多用户分布式MIMO-OFDM系统中的资源联合分配问题,提出了一种基于端口选择的天线与子载波分配算法。该算法依据计算复杂度容限设定用户通信静态端口数,以此为每个用户选取信道状况最好的通信端口进行通信,进而通过天线端口与下属用户的相互配合,并行地完成天线与子载波的分配。仿真结果表明,该算法在系统天线数大于用户数的情况下容量性能优于MASA算法,且其端口并行处理机制可以有效提高资源分配效率。     

利用有向图实现多用户下行多天线系统的用户选择

在多用户下行多天线系统中,基站可利用信道状态信息将独立的数据流同时发送到多个用户以得到更高的信道容量.由于在实际系统中基站很难实时得到各用户的完全信道状态信息,可以基于有限的信道反馈量进行用户选择来提高系统的和速率.提出了一种部分信道状态信息下利用有向图实现多用户下行多天线系统用户选择的算法.该算法将用户选择的问题变成了在有向图中寻找闭合环的问题,可以大幅度降低用户选择的复杂度;克服了常规的随机波束成形算法只有在用户数非常多的时候才能有效工作的弱点,在用户数少或中等的时候能得到比其更好的性能.因此该算法更适合在实际系统中应用.     

A Framework for Cognitive WiMAX With Frequency Agility

Cognitive radios have the ability to sense the radio spectrum environment and to switch dynamically to available frequency ranges. Mobile WiMax is an emerging wireless networking standard that could potentially benefit from cognitive radio technology. We develop a framework for applying cognitive radio technology to mobile WiMax networks to increase capacity and simplify network operations. In the proposed cognitive WiMax architecture, base stations are equipped with sensitive detectors and assign channels to subscriber stations dynamically based on spectrum availability. Power control is employed to increase frequency reuse in conjunction with spectrum sensing. Using computer simulation, we evaluate the performance of ldquocognitive channel assignmentrdquo relative to conventional dynamic channel assignment. Our numerical results show that cognitive radios can substantially increase the capacity of emerging WiMax networks by exploiting inherent spectrum hole opportunities. The key performance parameters determining the achievable capacity of cognitive WiMax networks are the detection and interference range, which depend in turn on characteristics of the radio propagation environment.     

Harmonic power detection in wideband cognitive radios

An analysis for simultaneous sensing of multiple primary user activity in cognitive radios has been presented here from a signal-processing perspective. First, the drawbacks of using simple harmonic power detection in wideband cognitive radios is demonstrated. Then, the impact of preprocessing the received signal to improve detection performance is highlighted along with its tradeoff involving complexity and corresponding delays in cognitive radio networks. It has been shown that a polyphase DFT filter bank with an optimal window as prototype filter can lead to reliable as well as efficient sensing and detection architecture in cognitive radios with minimal overhead. A detailed account of challenges, performance limits and computational complexity comparisons for various spectrum-sensing solutions is also provided. The study is supported through simulations with parameters corresponding to the IEEE 802.22 standard.     

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.     

低信噪比条件下基于随机共振的感知方法与性能分析

针对认知网络实际环境中常呈现出噪声高动态变化、低信噪比特征,无法快速准确进行频谱感知的问题,本文将物理学非线性领域中的随机共振理论引入到频谱感知中,提出了一种基于广义随机共振的能量检测算法.该算法引入匹配噪声,通过匹配非线性系统、噪声和信号三者的关系,从而改变能量检测统计量的分布,有效地检测信号的存在性.本文从理论上推导了最佳匹配噪声的表达式,并得到了检测性能、受噪声不确定度的影响、感知时间等方面的重要理论结论.仿真结果验证了理论推导的正确性,表明所提算法能够在信噪比为-20dB等低信噪比条件下较现有能量检测算法提高3dB以上,且具有感知速度快、受噪声不确定度影响小等特点.     

Analysis of secondary user performance in cognitive radio networks with reactive spectrum handoff

Cognitive radio networks use dynamic spectrum access of secondary users (SUs) to deal with the problem of radio spectrum scarcity . In this paper, we investigate the SU performance in cognitive radio networks with reactive-decision spectrum handoff. During transmission, a SU may get interrupted several times due to the arrival of primary (licensed) users. After each interruption in the reactive spectrum handoff, the SU performs spectrum sensing to determine an idle channel for retransmission. We develop two continuous-time Markov chain models with and without an absorbing state to study the impact of system parameters such as sensing time and sensing room size on several SU performance measures. These measures include the mean delay of a SU, the variance of the SU delay, the SU interruption probability, the average number of interruptions that a SU experiences, the probability of a SU getting discarded from the system after an interruption and the SU blocking probability upon arrival.     

Novel distributed algorithm for coalition formation in cognitive radio networks for throughput enhancement using matching theory

In this paper, a novel algorithm is proposed for increasing the throughput in cognitive radio networks by forming coalitions among cognitive radio users in AWGN and fading channel environment. Although there have been numerous studies exploring the benefits of coalition formation in cognitive radio networks from the game theory perspective, there are several limitations in their application. To overcome the limitations of game theory, concepts from matching theory are used. Specifically, the stable marriage problem is used to formulate the interactions among the cognitive radio users as a matching game for collaborative distributed spectrum sensing under target detection probability constraint. The utility function is defined as the average probability of false alarm per cognitive radio user. The advantage of stable marriage is that it always converges to a stable matching and is Pareto optimal when the preferences of cognitive radios are strict. In the proposed model, the stable matching problem is extended to propose a novel algorithm to form coalitions of varying sizes for improving the utility of CR (false alarm and throughput). The coalitions formed using the algorithm are stable and do not deviate from the final matching. Using simulations and mathematical analysis, it is shown that the proposed algorithm leads to stable coalitions and returns significant improvement in terms of reduced probability of false alarm and improved throughput per cognitive radio user as compared to the noncooperative scenario.     

Dynamically optimized spatiotemporal prioritization for spectrum sensing in cooperative cognitive radio

In this paper, an enhanced cooperative, statistics-driven spectrum sensing algorithm, called Dynamically Optimized Spatiotemporal Prioritization (DOSP), is developed for improving spectrum sensing efficiency in the media access control (MAC) layer of cognitive radio (CR) systems. The target of the DOSP algorithm is to improve spectrum sensing efficiency and achieve better spectrum access opportunities by prioritizing channels for fine sensing. The sensing priority is determined dynamically and intelligently based on an optimal statistical fusion that jointly considers both the local statistics obtained by the individual cognitive radios as well as the long-term spatiotemporal statistics obtained by other cognitive radios in the network. As such, the individual cognitive radio peers work together to get the most out of available spectrum opportunities. Numerical results demonstrate that the proposed DOSP algorithm is capable of achieving better performance compared with recently reported cooperative spectrum sensing methods in terms of overhead and percentage of missed spectrum opportunities. Furthermore, results show that the DOSP algorithm is more robust to the environment of low cognitive radio densities than that by using other state-of-the-art cooperative spectrum sensing methods.     

Overhead-Throughput Tradeoff Under a Novel Frame Structure in Centralized Cooperative Cognitive Networks

Cooperative spectrum sensing plays an important role in cognitive radio networks since it improves the detection performance by exploiting spatial diversity. However, the cooperation among terminals also brings additional communication overhead. In this paper, overhead-throughput tradeoff issues are investigated in four scenarios namely (1) identical sensing channel and perfect reporting channel, (2) identical sensing channel and imperfect reporting channel, (3) different sensing channel and perfect reporting channel, (4) different sensing channel and imperfect reporting channel of each secondary user (SU). Taking the reporting overhead into consideration, a novel frame structure consisting of an initial subframe and M consecutive subframes, is proposed to maximize the achievable throughput of the secondary network. And for each scenario, the overhead-throughput tradeoff is formulated as an optimization problem with respect to the number of reporting SUs. A brute-force approach is then used to resolve such optimization problem. Given the optimal number of reporting SUs, a set of candidate SUs is then selected according to the probability of detection, the probability of false alarm and the probability of reporting error. Numerical results show that an optimal overhead-throughput tradeoff is achieved given the optimal number of reporting SUs. In addition, the probability of false alarm is shown to be the most important factor affecting the performance of achievable throughput within the secondary network because the lower probability of false alarm corresponds to the case that the secondary network can use the channel with a higher chance.     

认知网络中的多用户MIMO线性协作频谱感知问题研究

研究了多用户MIMO的线性协作频谱感知问题以提高频谱检测的可靠性,推导了多用户MIMO线性协作感知系统的局部检测和全局检测策略,建立了在给定误警概率的情况下控制中心通过优化给各个用户的信号所分配的权值来最大化全局检测概率的优化模型。进一步,引入了遗传算法来求解上述全局检测优化问题的最优权值,期望能够有效降低算法在频谱感知过程中检测时间。仿真结果表明,多入多出能够明显提高协作频谱感知系统频谱检测可靠性,而遗传算法高效且稳定,相比较其他算法能够有效改善系统的检测性能。