{"title":"An Adjustable Channel Hopping Algorithm Based on Channel Usage Ratio for Multi-Radio CRNs","authors":"C. Chao, Chia-Tsun Chen, Sin-Jhong Huang","doi":"10.1109/ICOIN.2019.8718181","DOIUrl":null,"url":null,"abstract":"In cognitive radio networks, a premise for two nodes to communicate with each other is that they have a rendezvous which means they switch to the same channel at the same time. A common mechanism to achieve rendezvous is applying channel hopping. Most existing channel hopping protocols operate in a single-radio environment and evenly use all the available channels. Utilizing only a single radio limits the rendezvous probability between nodes while without considering the time-varied channel conditions of different channels results in inefficient channel allocations. To solve the rendezvous problem efficiently, in this paper, we propose an Adjustable Multi-radio Channel Hopping (AMCH) protocol that operates in a multi-radio CRN. Instead of evenly using available channels, AMCH enables a node to adjust the ratio of using different channels. Simulation results verify that such a ratio adjustable channel hopping scheme provides an efficient way to solve the rendezvous problem.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Information Networking (ICOIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2019.8718181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In cognitive radio networks, a premise for two nodes to communicate with each other is that they have a rendezvous which means they switch to the same channel at the same time. A common mechanism to achieve rendezvous is applying channel hopping. Most existing channel hopping protocols operate in a single-radio environment and evenly use all the available channels. Utilizing only a single radio limits the rendezvous probability between nodes while without considering the time-varied channel conditions of different channels results in inefficient channel allocations. To solve the rendezvous problem efficiently, in this paper, we propose an Adjustable Multi-radio Channel Hopping (AMCH) protocol that operates in a multi-radio CRN. Instead of evenly using available channels, AMCH enables a node to adjust the ratio of using different channels. Simulation results verify that such a ratio adjustable channel hopping scheme provides an efficient way to solve the rendezvous problem.