一种用于认知网络的短交会跳频算法

doi:10.3969/j.issn.1001-2400.2015.04.011

J4 ›› 2015, Vol. 42 ›› Issue (4): 63-69.doi: 10.3969/j.issn.1001-2400.2015.04.011

一种用于认知网络的短交会跳频算法

钟鸣;张海林;程文驰;郭超平

(西安电子科技大学通信工程学院，陕西西安 710071)

收稿日期:2014-06-10 出版日期:2015-08-20 发布日期:2015-10-12
通讯作者: 钟鸣
作者简介:钟鸣(1981-)，男，西安电子科技大学博士研究生，E-mail:mingzhong1981@gmail.com．
基金资助:
国家自然科学基金资助项目(61072069)；国家重大专项资助项目(2012ZX03003012)；中央高校基本科研业务费专项资金资助项目(72136037)

Short rendezvous channel-hopping algorithm for cognitive radio networks

ZHONG Ming;ZHANG Hailin;CHENG Wenchi;GUO Chaoping

(School of Telecommunication Engineering, Xidian Univ., Xi'an 710071, China)

Received:2014-06-10 Online:2015-08-20 Published:2015-10-12
Contact: ZHONG Ming

摘要/Abstract

摘要：

根据网络拓扑结构认知网络可分为有中心控制设施的网络和认知Ad-hoc网络(CR Ad-Hoc Networks， CRAHNs)．在CRAHNs中，由于无法预知主要用户(Primary User，PU)何时占用信道次要用户(Secondary User，SU)不能使用固定的公共控制信道(Common Control Channel， CCC)．针对这种情况，提出一种交会跳频算法通过设计分布式的CCC方案使次要用户短时间内交会在共同的可用信道上，并建立通信链路．将文中提出的算法与其他同类算法比较后发现，文中算法提供的交会时间(Time To Rendezvous， TTR)最小．

关键词: 认知无线电, 认知网络, 公共控制信道, 交会, 交会时间

Abstract:

According to the network topology structure, cognitive networks can be divided into the network with a centralized controller and CRAHNs(CR Ad-Hoc Networks, CRAHNs). Because it is difficult to predict when primary users(PU) appear, secondary users(SU) can not use the fixed common control channel(CCC). This paper presents a short rendezvous channel-hopping algorithm for CRAHNs. By the distributed CCC scheme, secondary users rendezvous on the available channels in common and establish a link in a short time. Compared with previous guaranteed algorithms, our algorithm outperforms the state of the art in terms of TTR(Time To Rendezvous).

Key words: cognitive radio, cognitive networks, common control channels, rendezvous, time to rendezvous

钟鸣;张海林;程文驰;郭超平 . 一种用于认知网络的短交会跳频算法[J]. J4, 2015, 42(4): 63-69.

ZHONG Ming;ZHANG Hailin;CHENG Wenchi;GUO Chaoping. Short rendezvous channel-hopping algorithm for cognitive radio networks[J]. J4, 2015, 42(4): 63-69.

参考文献

［1］ Mitola J, Maguire Jr G Q. Cognitive Radio: Making Software Radio More Personal ［J］. IEEE Personal Communications, 1999, 6(4): 13-18.
［2］ Thomas R W, Friend D H, DaSilva L A.Cognitive Networks: Adaptation and Learning to Achieve End-to-end Performance Objectives［J］. IEEE Communications Magazine, 2006, 44(12): 51-57.
［3］ Akyildiz I F, Lee W Y, Chowdhury K R. CRAHNs: Cognitive Ad Hoc Networks ［J］. Ad Hoc Networks, 2009, 7(5): 810-836.
［4］ Zhang X, Su H.CREAM-MAC: Cognitive Radio-enabled Multi-channel MAC Protocol over Dynamic Spectrum Access Networks ［J］. IEEE Selected Topics in Signal Processing, 2011, 5(1): 110-123.
［5］ Liu S, Lazos L, Krunz M. Cluster-based Control Channel Allocation in Opportunistic Cognitive Radio Networks ［J］. IEEE Transactions on Mobile Computing, 2012, 11(10): 1436-1449.
［6］ Li X Y, Hu F, Zhang H L, et al. A Cluster-based MAC Protocol for Cognitive Radio Ad Hoc Networks ［J］. Wireless Personal Communications, 2013, 69(2): 937-955.
［7］ Bian K, Park J M. Maximizing Rendezvous Diversity in Rendezvous Protocols for Decentralized Cognitive Radio Networks ［J］. IEEE Transactions on Mobile Computing, 2012, 12(7): 1294-1307.
［8］ Lin Z, Liu H, Chu X, et al. Jump-stay Based Channel-hopping Algorithm with Guaranteed Rendezvous for Cognitive Radio Networks ［C］//Proceedings of IEEE INFOCOM. Piscataway: IEEE, 2011: 2444-2452.
［9］ Chuang I, Wu H Y, Lee K R. Alternate Hop-and-wait Channel Rendezvous Method for Cognitive Radio Networks ［C］//Proceedings of IEEE INFOCOM. Piscataway: IEEE, 2013: 746-754.
［10］ Chuang I, Wu H, Kuo Y. A Fast Blind Rendezvous Method by Alternate Hop-and-wait Channel Hopping in Cognitive Radio Networks［J］. IEEE Transactions on Mobile Computing, 2014, 13(10): 2171-2184.
［11］ Chang G Y, Huang J F. A Fast Rendezvous Channel-hopping Algorithm for Cognitive Networks［J］. IEEE Communications Letters, 2013, 17(7): 1475-1478.
［12］ Reguera V, Guerra E, Souza R, et al. Short Channel Hopping Sequence Approach to Rendezvous for Cognitive Networks ［J］. IEEE Communications Letters, 2014, 18(2): 289-292.
［13］ Ke C T, Sheu J P. A Comment on “Short Channel Hopping Sequence Approach to Rendezvous for Cognitive Networks”［J］. IEEE Communications Letters, 2014, 18(9): 1631-1632.
［14］ Menon R, Buehrer R M, Reed J H. Outage Probability Based Comparison of Underlay and Overlay Spectrum Sharing Techniques ［C］//2005 First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks. Piscataway: IEEE, 2005: 101-109.
［15］ Shin J, Yang D, Kim C. Deterministic Rendezvous Scheme in Multi-channel Access Networks［J］. IEEE Communications Letters, 2010, 46(20): 1402-1404.

[1]	周杰,徐梦颖,王娇娇,卢毅. 认知无线传感器网络频谱分配的一种改进方法[J]. 西安电子科技大学学报, 2020, 47(3): 80-85.
[2]	孙颖,吕慧芬,张雪英,马江河. 情感维度下的深度情感关联模型[J]. 西安电子科技大学学报, 2019, 46(5): 24-30.
[3]	黄杰;曾孝平;简鑫;杜得荣;朱斌;田蜜. 认知无线电中考虑机会容量的多业务资源分配[J]. 西安电子科技大学学报, 2018, 45(2): 84-89+96.
[4]	刘明骞;陈钱;吴芸;王江宏. Underlay认知下时频重叠信号的分量个数估计[J]. 西安电子科技大学学报, 2017, 44(6): 43-47+64.
[5]	杨明;李翔;杨昊;刘鑫;陈琨奇. 能量效率认知无线电协作感知和传输联合优化[J]. 西安电子科技大学学报, 2017, 44(3): 101-107.
[6]	黄杰;曾孝平;简鑫;谭晓衡;张耀乐. 认知无线电中频谱空洞统计特性分析与分配[J]. 西安电子科技大学学报, 2017, 44(2): 107-113.
[7]	阔永红;贺冰涛;陈健. 携能通信协作认知网络稳态吞吐量分析和优化[J]. 西安电子科技大学学报, 2016, 43(6): 1-7.
[8]	齐小刚;秦凤娟;刘立芳. 抗伪装SSDF恶意攻击的合作频谱感知方法[J]. 西安电子科技大学学报, 2016, 43(4): 86-91+159.
[9]	黄影;严定宇;李男. 动态频谱接入的Q学习优化算法[J]. J4, 2015, 42(6): 179-183.
[10]	秦臻;周剑刚;薛峰. 最小信道检测开销的协作频谱感知算法 [J]. J4, 2015, 42(2): 206-212.
[11]	吴慧欣;王秉;柴争义. 一种采用并行免疫优化的频谱分配算法[J]. J4, 2014, 41(4): 111-115+136.
[12]	高锐;李赞;齐佩汉;关磊;刘进. 低信噪比下基于双检测长度的频谱感知算法[J]. J4, 2014, 41(3): 88-94.
[13]	齐佩汉;司江勃;李赞;高锐. 新型抗噪声不确定度谱分段对消频谱感知算法[J]. J4, 2013, 40(6): 19-24.
[14]	郑文秀. 时频聚集性分析的频谱感知方法[J]. J4, 2012, 39(6): 176-180+194.
[15]	徐扬;盛敏;张琰. 认知无线网具有业务感知功能的新型路由协议[J]. J4, 2012, 39(5): 1-5+11.

一种用于认知网络的短交会跳频算法

Short rendezvous channel-hopping algorithm for cognitive radio networks

PDF (PC)

赞

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

Metrics

本文评价

推荐阅读 10