检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘全[1,2] 郭云玮[1] 高俊[1] 刘思洋[1]
机构地区:[1]海军工程大学通信工程系,湖北武汉430033 [2]总参第六十一研究所,北京100141
出 处:《四川大学学报(工程科学版)》2011年第6期163-167,共5页Journal of Sichuan University (Engineering Science Edition)
基 金:国家"863"计划资助项目(2009AAJ2082009AAJ116)
摘 要:频谱感知是认知无线电网络中需要解决的首要问题。为了提高频谱感知的整体性能,该文对链路层的协作频谱感知机制进行了研究,针对其中的信道搜索感知场景,提出了一种联合优化信道搜索方案。在该方案中,基站根据各信道的空闲概率大小,选择最优的信道搜索次序,并对不同信道的搜索时长进行一定的加权处理,确保以较长的时间优先搜索空闲概率较大的信道,从而使按需信道搜索过程的切换延迟以及由此造成的QoS损失最小化。仿真实验的结果显示,这种联合优化搜索方案在信道搜索场景下的平均搜索时长始终小于现有的2种搜索方案,这说明其搜索性能具有明显的改善。Spectrum sensing has been identified as the fundamental issue in cognitive radio networks(CRNs).To improve the overall sensing performance,the mechanisms of cooperative spectrum sensing are investigated.Specifically,aiming at the sensing scenario of channel searching,a joint optimized channel-searching scheme is proposed.In this scheme,the base station chooses the optimal searching sequence according to the channels' static probabilities of being idle,and meanwhile,sets the searching durations of each candidate with different weights.Utilizing this optimal mechanism,the channels with higher idle probabilities can be guaranteed to be searched with higher priorities and longer durations,and thus,the delay due to channel switching and the corresponding QoS loss are minimized.The simulation results show that the average time for finding a new available channel by the proposed searching scheme is always much shorter than that of two existing schemes,and thus,visible performance improvement can be obtained.
关 键 词:认知无线电 频谱感知 协作频谱感知 感知机制 信道搜索
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145