认知无线电网络中基于信道跳频序列的异步交汇算法研究  

Study on asynchronous rendezvous algorithms based on channel hopping sequence in cognitive radio networks

作　　者：孔得凯[1] 吴克宇[1] 韩方景[1] 韩方剑[1] 

机构地区：[1]国防科学技术大学电子科学与工程学院,湖南长沙410073

出　　处：《计算机工程与科学》2014年第10期1872-1879,共8页Computer Engineering & Science

摘　　要：认知无线电技术被公认为是未来通信网络中解决频谱资源稀缺和提高频谱利用率的关键技术。认知无线电用户以频谱共享方式机会式地接入授权用户的频段。异步认知无线电网络中的认知无线电用户在相互通信之前,首先需要完成交汇(Rendezvous)和信道协商。对近几年来基于信道跳频序列的异步交汇算法进行了综述,对文献中提出的三类算法进行理论分析,并通过Matlab仿真验证这三类中的八个算法在ETTR、MTTR和公平性三方面的性能表现,对比分析了这八个算法的优缺点。Cognitive radios have been envisioned as a chief technique for alleviating the severe short- age of available spectrum as well as improving the efficiency in using licensed spectrum in next genera- tion communicating networks. Cognitive Radio Users （CRUs） coexist with Licensed Users through dy namically accessing licensed spectrum when it is idle. Before communication,it is vital for CRUs in asynchronous Cognitive Radio Networks （CRNs） to accomplish rendezvous and channel negotiation. We re view recent studies on rendezvous schemes based on channel hopping sequences, analyze three classes of these schemes and conduct Matlab simulations to evaluate the performance of eight specific algorithms in terms of ETTR, MTTR and Fairness, concluding their respective merits and demerits.

关 键 词：认知无线电 交汇 信道跳频序列 TTR(Time To Rendezvous) 公平性 

分 类 号：TN929.5[电子电信—通信与信息系统]