Number of channels adjustment for cognitive radio networks

被引:8
作者
Chao, Chih-Min [1 ]
Ling, Yun-Ting [1 ]
Jiang, Cheng-Hong [1 ]
机构
[1] Natl Taiwan Ocean Univ, Dept Comp Sci & Engn, Keelung, Taiwan
关键词
Cognitive radio networks; Channel hopping protocols; Throughput enhancement; WIRELESS NETWORKS; ASSIGNMENT; PROTOCOL; ACCESS;
D O I
10.1016/j.jnca.2017.08.003
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Cognitive radio networks (CRNs) are considered as a promising approach to enhance the spectrum utilization for large-scale Internet of Things (IoTs). In a CRN, two secondary users (SU nodes) must have a rendezvous before they can communicate with each other. Applying channel hopping is widely adopted to achieve rendezvous between any pair of users. In most of the existing channel hopping protocols, SU nodes switch among all the available channels. Because time to rendezvous (TTR) is in general proportional to the number of channels being used, these channel hopping protocols suffer from long TTR. When the number of SU nodes in the network is not large, using a small portion of the whole available channels may help reduce TIR. A fundamental problem to realize such an idea is to determine the number of channels to be used given the number of SU nodes in a CRN. In this paper, we define the optimal number of channels problem. To the best of our knowledge, it is the first work to theoretically handle the optimal number of channels problem. The proposed dynamic number of channel adjustment scheme (DNCA) operates on top of existing channel hopping protocols and can enhance the performance of them. Simulation results verify the improvement of DNCA when applied to existing channel hopping protocols, Jump-Stay and E-AHW.
引用
收藏
页码:1 / 13
页数:13
相关论文
共 42 条
[1]   Channel Assignment Algorithms in Cognitive Radio Networks: Taxonomy, Open Issues, and Challenges [J].
Ahmed, Ejaz ;
Gani, Abdullah ;
Abolfazli, Saeid ;
Yao, Liu Jie ;
Khan, Samee U. .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2016, 18 (01) :795-823
[2]   NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey [J].
Akyildiz, Ian F. ;
Lee, Won-Yeol ;
Vuran, Mehmet C. ;
Mohanty, Shantidev .
COMPUTER NETWORKS, 2006, 50 (13) :2127-2159
[3]  
Bahl P., 2004, P ACM MOBICOM
[4]   Maximizing Rendezvous Diversity in Rendezvous Protocols for Decentralized Cognitive Radio Networks [J].
Bian, Kaigui ;
Park, Jung-Min 'Jerry' .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2013, 12 (07) :1294-1307
[5]   Performance analysis,of the IEEE 802.11 distributed coordination function [J].
Bianchi, G .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (03) :535-547
[6]   OPERA: Optimal Routing Metric for Cognitive Radio Ad Hoc Networks [J].
Caleffi, Marcello ;
Akyildiz, Ian F. ;
Paura, Luigi .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2012, 11 (08) :2884-2894
[7]   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
[8]   Novel Channel-Hopping Schemes for Cognitive Radio Networks [J].
Chang, Guey-Yun ;
Teng, Wen-Hung ;
Chen, Hao-Yu ;
Sheu, Jang-Ping .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2014, 13 (02) :407-421
[9]   Supporting Fast Rendezvous Guarantee by Randomized Quorum and Latin Square for Cognitive Radio Networks [J].
Chao, Chih-Min ;
Fu, Hsiang-Yuan .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2016, 65 (10) :8388-8399
[10]   Efficient Asynchronous Channel Hopping Design for Cognitive Radio Networks [J].
Chao, Chih-Min ;
Hsu, Chien-Yu ;
Ling, Yun-Ting .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2016, 65 (09) :6888-6900