Asynchronous Channel-Hopping Sequences With the Best Maximum-Time-to-Rendezvous and Period for Cognitive-Radio Wireless Networks

被引:6
作者
Zhang, Wei-Zhe [1 ,2 ]
Yang, Guu-Chang [1 ,2 ]
Yang, Li-Hsin [1 ,2 ]
Kwong, Wing C. [3 ]
机构
[1] Natl Chung Hsing Univ, Dept Elect Engn, Taichung 40227, Taiwan
[2] Natl Chung Hsing Univ, Grad Inst Commun Engn, Taichung 40227, Taiwan
[3] Hofstra Univ, Dept Engn, Hempstead, NY 11549 USA
关键词
Throughput; Sensors; Wireless networks; Indexes; Heuristic algorithms; Delays; Cognitive radio; Channel hopping sequences; cognitive radio; wireless communications;
D O I
10.1109/LCOMM.2021.3076394
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
A new family of asynchronous channel-hopping (CH) sequences for cognitive-radio wireless networks (CRWNs) is constructed by a novel 2-D method. The new construction applies two different algorithms to create the columns and rows of a base matrix, which is mapped row-by-row to form the 1-D CH sequences. In addition to full degree-of-rendezvous, the new CH sequences have the shortest period and maximum-time-to-rendezvous and allow more flexible choices of period and number of licensed channels than their counterparts. While short period saves memory in small sensors and mobile devices, the new construction is shown to support the largest throughput with the fewest licensed channels (i.e., spectral resources) in practical CRWNs.
引用
收藏
页码:2472 / 2476
页数:5
相关论文
共 14 条
[1]  
Chang C.-S., 2021, IEEE ACM T NETW 0326
[2]   Matrix-Based Channel Hopping Algorithms for Cognitive Radio Networks [J].
Chang, Guey-Yun ;
Huang, Jen-Feng ;
Wang, Yao-Shian .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2015, 14 (05) :2755-2768
[3]   RELATIVE DIFFERENCE SETS [J].
ELLIOTT, JEH ;
BUTSON, AT .
ILLINOIS JOURNAL OF MATHEMATICS, 1966, 10 (03) :517-&
[4]   CHANNEL HOPPING PROTOCOLS FOR DYNAMIC SPECTRUM MANAGEMENT IN 5G TECHNOLOGY [J].
Li, Aohan ;
Han, Guangjie ;
Rodrigues, Joel J. P. C. ;
Chan, Sammy .
IEEE WIRELESS COMMUNICATIONS, 2017, 24 (05) :102-109
[5]   Sender-Jump Receiver-Wait: A Simple Blind Rendezvous Algorithm for Distributed Cognitive Radio Networks [J].
Li, Jiaxun ;
Zhao, Haitao ;
Wei, Jibo ;
Ma, Dongtang ;
Zhou, Li .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2018, 17 (01) :183-196
[6]   Criss-Cross Construction of Synchronous-Symmetric Channel-Hopping Sequences for Cognitive Radio Networks With Arbitrary Number of Licensed Channels [J].
Lin, Yu-Chien ;
Yang, Guu-Chang ;
Yao, Ming-Jia ;
Kwong, Wing C. .
IEEE COMMUNICATIONS LETTERS, 2019, 23 (10) :1672-1675
[7]   Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks [J].
Liu, Hai ;
Lin, Zhiyong ;
Chu, Xiaowen ;
Leung, Yiu-Wing .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2012, 23 (10) :1867-1881
[8]   A Channel Rendezvous Scheme for Cognitive Radio Networks [J].
Shin, Jongmin ;
Yang, Dongmin ;
Kim, Cheeha .
IEEE COMMUNICATIONS LETTERS, 2010, 14 (10) :954-956
[9]   Multi-MTTR Asynchronous-Asymmetric Channel-Hopping Sequences for Scalable Cognitive Radio Networks [J].
Wang, Yi-Tang ;
Yang, Guu-Chang ;
Huang, Sheng-Hao ;
Chang, Min-Kuan ;
Kwong, Wing C. .
IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING, 2018, 4 (04) :692-703
[10]   Contention Resolution Mechanisms for Multi-Channel Cognitive Radio Ad Hoc Networks [J].
Wang, Yi-Tang ;
Yang, Guu-Chang ;
Chang, Min-Kuan ;
Kwong, Wing C. .
IEEE COMMUNICATIONS MAGAZINE, 2018, 56 (04) :149-155