首页 | 官方网站   微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
张晓格  张士兵  邱恭安 《通信学报》2011,32(11):176-182
为获得最佳感知,系统在n个备选用户中选择最佳中继进行协作感知。但实际系统可能由于各种原因选择了第二佳或乃至更为一般的第N佳中继。为此,提出基于第N佳中继选择的协作频谱感知,推导了其在瑞利平坦衰落下的检测概率,并给出闭合表达式。数值计算表明,随着N的增加,系统检测概率不断下降,乃至低于任意选择;随着n的增加,基于最佳或接近最佳选择的系统检测概率明显提高,而基于最差或接近最差选择的系统检测概率则有所下降。  相似文献   

2.
The proposed cooperative spectrum sensing (CSS) network is equipped with multiple antennas and an improved energy detector (IED) scheme at each cognitive radio (CR). Each CR in the network receives the information about the primary user (PU) in the form of binary decisions at multiple antennas. Diversity technique called selection combining (SC) scheme is used at multiple antennas to select the maximum value of sensing information present at multiple antennas. Finally, sensing information will be passed to the fusion center (FC) through reporting channel, and the final decision about PU is made at FC using fusion rules. Initially, we have derived the novel missed detection probability expressions for AWGN channel, Rayleigh, and Rician fading environments. Later, the closed form of optimized expressions for proposed CSS network parameters are derived to achieve an optimal performance. The closed form of optimized expressions such as number of CR users (Nopt ), normalize threshold value (λn,opt ), and an arbitrary power of the received signal (popt ) are derived under various fading environments. The performance is evaluated using complementary receiver operating characteristics (CROC) and total error rate curves. The MATLAB‐based simulations are evaluated with the strong support of theoretical expressions. Finally, various simulation parameters such as sensing channel SNR, the error rate in reporting channel, threshold value, and number of antennas at each CR are considered in the simulation to show the effect on the performance of proposed CSS network.  相似文献   

3.
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.  相似文献   

4.
This paper analyzes the spectrum sensing performance over fading channel,in which a licensee and multiple unlicensed users coexist and operate in the licensed channel in a local area. The overall average probabilities of detection and false alarm by jointly taking the fading and the locations of all secondary users into account are derived,and a statistical model of cumulate interference is constructed. Based on the cumulate interference,a closed-form expression of outage probability at the primary user's receiver according to a specific distribution of the fading is obtained. Finally,the sensing parameters so as to minimize the total spectrum sensing error and maximize the average opportunistic throughput are obtained. It is noted that the overall average performance analysis and results here enable to benchmark the design of specific spectrum sensing algorithms.  相似文献   

5.
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.  相似文献   

6.
张晓格  张士兵  邱恭安 《通信学报》2012,33(Z2):111-117
该算法把协作中继分为前N个与后K?N个两部分,首先在前N个中继中感知,若不多于mL个中继检测到主用户或不少于mH个中继检测到主用户,则全局判定为存在或不存在频谱空洞;否则继续在后K?N个中继中感知,只有当前后两次感知不少于n个中继检测到主用户时则才全局判定不存在频谱空洞。在满足虚警概率与检测概率的前提下,构建最小化时隙消耗的目标函数,优化参数mL、mH与N。模拟表明,通过合理设置这些参数,在保证感知性能的前提下,所提增量协作算法的平均时隙消耗明显低于传统协作感知。  相似文献   

7.
Increasing the number of terminals in a cognitive radio network is known to improve the accuracy of cooperative spectrum sensing at the cost of reducing the useful communication time. This downside can be partially mitigated using decision‐based fusion and/or sequential reporting. This paper proposes a novel selective decision‐based cooperative spectrum sensing strategy that limits the reporting time to a single reporting slot with a possibility for retransmissions using automatic repeat request. The terminal with the highest energy estimate sends its local decision to the fusion center to make a final decision. Potential decoding errors are mitigated using threshold‐based automatic repeat request. The performance of the proposed strategy is studied using rigorous mathematical analysis and intensive computer simulations. Results show observable performance enhancements compared with some benchmark strategies in terms of detection accuracy and agility. Copyright © 2015 John Wiley & Sons, Ltd.  相似文献   

8.
The analysis of spectrum sensing performance of energy detection (ED)-based wireless cognitive radio sensor network (ED-WCRSN) with hard-decision combining (HDC) is presented in this paper. Particularly, several network parameters are derived to estimate the performance of ED-WCRSN, considering channel errors, noise, and generalized α μ fading. In the considered network, first, cognitive radio sensor (CRS) senses a primary user (PU), gets sensing data, and then uses an ED to make a local binary decisions about PU's active or inactive status. In both sensing and reporting channels, the channel error probability is also taken into account. Next, HDC technique is used at control center (CC) to combine the locally obtained decisions, and a final decision about the status of the PU is made. To do so, first, the expression for the novel and analytical, which incorporates noise and α μ fading, detection probability in a CRS is derived and validated using Monte Carlo simulations in MATLAB and using an experimental setup. Then, utilizing derived mathematical expressions, closed-form expressions of an average error rate (AER), optimal numbers of CRSs, and detection thresholds under noisy and α μ fading conditions are developed. The substantial influence of channel and network factors is assessed using receiver operating characteristics (ROC), complementary ROC, and AER. Finally, the impacts of channel and network parameters on ED-WCRSN performance are explored. For numerous parameters of the considered network, the optimal values detection threshold and number of CRSs are also found.  相似文献   

9.
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.  相似文献   

10.
频谱感知是通信系统抗干扰和智能化的关键能力.针对认知无线电系统窄带频谱感知技术受制于数模转换器件的发展水平,难以解决认知无线电系统宽带、实时频谱感知的问题,提出一种多节点协作的认知无线电系统宽带频谱感知方法.该方法设计由多个认知节点对目标频段执行次奈奎斯特采样来降低采样速率,采用能量检测方式对采样矢量进行集中式融合判决,实现宽频段范围内干扰信号的谱定位和判断,降低各个感知节点的采样速率,支撑认知网络系统构建高实时、宽频带频谱感知的能力.计算机仿真试验结果表明,所提方法达到90%检测概率时压缩比要求为0.025,具有可靠性与有效性.  相似文献   

11.
苏健  宁国勤  秦峰 《通信学报》2012,33(Z2):256-261
为了实现绿色节能认知通信的目标,针对协作感知和传输过程中的能量消耗问题,提出了一种基于能量约束的集中式协作频谱感知算法。建立了系统检测寿命最大化的频谱感知模型,对其进行了详细分析,给出了检测寿命最大化对应参数的搜索方法。仿真结果显示,该方法可以在满足检测精度的条件下有效延长认知网络的检测寿命,并提高低信噪比用户参与协作的几率。  相似文献   

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

13.
基于信道统计特征的认知无线电协作频谱检测   总被引:1,自引:0,他引:1  
针对认知无线电到融合中心间的控制信道为Nakagami-m衰落信道的情况,研究了认知无线电协作频谱检测问题,推导出融合中心利用衰落信道统计特征的似然比协作频谱检测公式.该方法不需要瞬时信道状态信息,简化了协作频谱检测过程,便于实际应用.通过仿真对融合中心的协作频谱检测性能进行了分析,结果表明:利用衰落信道统计特征的似然比协作频谱检测的性能较利用瞬时信道状态信息的似然比频谱检测性能略有下降,但是在高信噪比或衰落不严重的情况下,二者的性能非常接近,认知无线电节点个数对两种频谱检测方法间的性能差距几乎没有影响.  相似文献   

14.
In order to provide more accurate detection of the primary user's activity in cognitive radio (CR) systems, cooperative spectrum sensing is proposed. The transmit diversity can also be employed by cooperative spectrum sensing to improve the performance of decision reporting. Hence, in the reporting channels between the cognitive users and the base station (BS), space time block code (STBC) scheme is considered in each cluster with time division multiple access (TMDA) method. In this paper, to improve the time efficiency in the case that one cluster makes sensing report, whereas the others do nothing but wait for their orders, we set each cluster with different sensing durations and the clusters will not stop the spectrum sensing until their results are reported. Furthermore, we also adopt the flexible sensing durations to decrease unnecessary energy consumption based on the clusters’ sensing sensitivities. Simulation results and analysis show the better detection performance and time efficiency of the proposed scheme. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

15.
针对传统认知无线电网络中频谱状态转换频繁和频谱检测时延长的问题,提出基于随机线性网络编码的累积和能量检测频谱感知算法。该算法在主用户信道中引入随机线性网络编码,利用网络编码对频谱的整形作用,使频谱状态转换稀疏,频谱结构更规律化,减小频谱检测时延,提高系统吞吐率。此外,针对传统累积和能量检测算法抗衰落性能差的问题,通过比较该算法在五种衰落信道下的检测时延和吞吐率,研究该算法的抗衰落性能。实验结果表明,在一定的虚警概率下,该算法有效降低了检测时延,提高了吞吐率及抗衰落能力,能够更好地适应复杂的衰落信道环境。  相似文献   

16.
频谱感知是认知无线电(CR)的关键技术之一。在该机制中,对主用户(PU)信号的可靠检测是实现CR的前提。提出一种基于自适应决策融合的合作频谱感知算法用于频谱感知,该算法通过估计PU的先验概率与各个CR用户(SU)的漏检及虚警概率,然后运用Chair-Varshney准则对局部判决进行决策融合以得到全局判决。仿真结果表明,采用该方案的全局虚警和漏检概率明显低于单个SU,可有效提高CR系统频谱感知的可靠性。  相似文献   

17.
李美玲 《通信学报》2013,34(9):33-40
提出了一种基于目标的中继协作频谱感知方案,证明了SU到SR链路上的信道条件对系统性能有较大的影响;鉴于此,提出了一种优化的最佳中继协作频谱感知(optimized BRCSS)方案,通过联合考虑目标SU到SR链路上的信道条件和 SR 到 FC 链路上的信道条件选择最佳认知中继;最后,从更实际的应用场景考虑,为了节约系统开销,进一步提出了一种自适应的最佳中继协作频谱感知方案(A-BRCSS),即 SU 根据其信道条件,自适应地选择是否需要认知中继的协作传输。分析和仿真结果均表明,相比传统最佳中继协作频谱感知方案, Optimized BRCSS方案可以实现更高的感知性能;所提A-BRCSS方案可以实现几乎最佳的感知性能。  相似文献   

18.
针对认知无线电中协作频谱感知能耗高的问题,提出一种基于节点选择的能量高效的协作频谱感知算法。该算法在保证感知性能的同时优化感知节点数量,从而达到高效节能的目的,其核心是采用能量高效的节点选择算法。该算法综合考虑了感知性能和能耗,仿真结果表明该算法在保证感知性能的同时能有效降低协作频谱感知的系统能耗。  相似文献   

19.
为了同时对多个异构信道进行有效地合作频谱感知,并克服现有方法中只考虑检测准确性而忽略感知开销和系统效益,忽略不同认知用户对不同异构信道感知性能的差异以及参与合作感知的认知用户较多等问题,提出了一种贪婪的异构多信道并行合作频谱感知方法。根据对感知开销和传输收益的定义,充分考虑不同认知用户对不同异构信道感知性能的差异,利用贪婪算法在多个认知用户和多个异构信道间最优地进行感知任务分配,使总系统效益最大。仿真结果表明,所提方法与基于迭代匈牙利的并行合作频谱感知方法、改进的基于迭代匈牙利的并行合作频谱感知方法和随机的合作频谱感知方法相比,能够获得较高的总系统效益,且所需的参加合作感知的认知用户数较少。  相似文献   

20.
In this paper, we investigate the optimal sensing settings for a cognitive radio (CR) network consisting a number of CR users and a fusion center (FC). Our objective is to maximize the channel utilization under the constraint that the signals from the primary user (PU) are sufficiently protected. We focus on the utilization of the channel in which PUs dynamically enter the network with burst nature. Thus, we apply the average error probability (AEP) as the metric of channel utilization. Moreover, in order to protect the PU signal from being interfered, the missing detection probability is applied as the constraint function. Assuming that counting rules are utilized in the FC, we derive the false alarm probability, the missing detection probability, and the AEP in the maximum a posteriori (MAP) fashion. Then, after proving the monotonic properties of the objective function and the constraint function, we propose an efficient algorithm named Algorithm I that can derive the optimal settings for maximizing the channel utilization. Moreover, a simplified algorithm named Algorithm II is also proposed to minimize the AEP, supposing that perfect synchronization exists between the CR users and the PU. Finally, we show our numerical results and compare our optimal results with those found by exhaustive searches. We conclude that our Algorithm I produces optimal results very close to those found by exhaustive searches. Performance comparison between Algorithms I and II is also provided in terms of the AEP and the probability of missing detection. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号