西安电子科技大学综合业务网理论及关键技术国家重点实验室,西安,710071
网络首发:2012-12-10,
纸质出版:2012
移动端阅览
李晓艳, 张海林, 郭超平, 等. 一种异步的认知无线电网络跳频算法[J]. 西安交通大学学报, 2012,46(12):30-35.
Asynchronous Channel Hopping Algorithm for Cognitive Radio Networks[J]. 2012, 46(12): 30-35.
针对认知无线电网络中次用户对之间的交会问题
即次用户对在同一时间接入到相同的信道
提出了一种异步的基于循环请求集的跳频算法(ACHA).首先
次用户将可用的空闲信道按照循环请求集的结构生成跳频序列
然后再跟随跳频序列依次接入到可用信道中.利用循环请求集系统的旋转相交特性
ACHA算法能够保证任意2个次用户之间的交会必然发生在一个基本跳频序列周期之内.仿真结果表明:与正交序列跳频算法和基于三角形数的跳频算法相比
ACHA算法能将平均交会时间降低20%和40%
An asynchronous channel hopping algorithm(ACHA)based on the cyclic quorum is proposed to realize rendezvous in cognitive radio networks(CRNs). Rendezvous means that secondary users(SUs)access the same channel at the same time. SU uses the structure of the cyclic quorum and generates the channel hopping sequences from its available idle channels. Then SUs tune themselves to their available channels following the channel hopping sequences. The ACHA makes use of the rotation closure property of the cyclic quorum system
and ensures the rendezvous between any two SUs to be realized within a basic channel hopping sequence period. Simulation results and comparisons with the generated orthogonal sequence-based algorithm and the triangular numbers-based algorithm show that the proposed algorithm can reduce the average time of rendezvous by 20% and 40%
respectively.
张正浩, 裴昌幸, 陈南,等. 宽带认知无线电网络分布式协作压缩频谱感知算法[J].西安交通大学学报,2011, 45(4):67-72.
ZHANG Zhenghao, PEI Changxing, CHEN Nan, et al. A sensing algorithm based on distributed cooperative compressed spectrum for wideband cognitive radio networks[J].Journal of Xi'an Jiaotong University, 2011, 45(4):67-72.
AKYILDIZ I F, LEE W Y, CHOWDHURY K R. CRAHNs: cognitive radio ad hoc networks[J]. Ad Hoc Networks, 2009,7(1):810-836.
冯志勇, 张平, 郎保真,等. 认知无线电网络理论与关键技术[M]. 北京: 人民邮电出版社,2011.
CHOWDHURY K R, AKYILDIZ I F. OFDM-based common control channel design for cognitive radio ad hoc networks[J]. IEEE Transactions on Mobile Computing, 2011, 10(2): 228-238.
THEIS N S, THOMAS R W, DASILVA L A. Rendezvous for cognitive radios [J]. IEEE Transactions on Mobile Computing, 2011, 10(2): 216-227.
BIAN K, PARK J M. Asynchronous channel hopping for establishing rendezvous in cognitive radio networks[C]∥Proceedings of IEEE INFOCOM 2011. Piscataway, NJ, USA: IEEE, 2011: 236-240.
SHIN J, YANG D, KIM C. A channel rendezvous scheme for cognitive radio networks [J]. IEEE Communications Letters, 2010,14(10): 954-956.
IANG J R, TSENG Y C, HSU C S, et al. Quorum-based asynchronous power-saving protocols for IEEE 802.11 Ad Hoc networks [J]. ACM Mobile Networks and Applications, 2005,10(1):169-181.
李美安, 刘心松, 王征.一种基于松弛循环差集的高性能分布式互斥算法[J]. 电子学报, 2007, 35(1):58-63.
LI Meian, LIU Xinsong, Wang Zheng. A high performance distributed mutual exclusion algorithm based on relaxed cyclic different set[J]. Acta Electronica Sinica, 2007, 35(1):58-63.
LUK W S, WONG T T. Two new quorum based algorithms for distributed mutual exclusion[C]∥Proceedings of International Conference on Distributed Computing Systems 1997. Piscataway, NJ, USA: IEEE, 1997: 100-106.
LIN Zhiyong, LIU Hai, CHU Xiaowen, et al. Jump-stay based channel-hopping algorithm with guaranteed rendezvous for cognitive radio[C]∥Proceedings of IEEE INFOCOM 2011. Piscataway, NJ, USA: IEEE, 2011: 2444-2452.
JAIN R. The art of computer system performance analysis: techniques for experimental design, measurement, simulation, and modeling[M]. New York, USA: John Wiley Sons, 1991.
0
浏览量
4
下载量
2
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621