An Adjustable Channel Hopping Algorithm Based on Channel Usage Ratio for Multi-Radio CRNs

C. Chao, Chia-Tsun Chen, Sin-Jhong Huang
{"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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于信道利用率的多无线电crn可调信道跳频算法
在认知无线网络中,两个节点相互通信的前提是它们有一个交会,这意味着它们在同一时间切换到同一频道。实现会合的一种常用机制是应用信道跳频。大多数现有的信道跳变协议在单无线电环境下工作,并均匀地使用所有可用的信道。仅使用单个无线电限制了节点间的交会概率,而不考虑不同信道时变信道条件导致信道分配效率低下。为了有效地解决交会问题,本文提出了一种工作在多无线电CRN中的可调多无线电信道跳变(AMCH)协议。AMCH使节点能够调整使用不同信道的比例,而不是均匀地使用可用信道。仿真结果验证了这种可调比信道跳变方案为解决交会问题提供了一种有效的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Mobile Edge Computing (MEC)-Based VANET Data Offloading Using the Staying-Time-Oriented k-Hop Away Offloading Agent Cooperative Server-Client HTTP Adaptive Streaming System for Live Video Streaming An Efficient Gateway Routing Scheme for Disaster Recovery Scenario Gigabit Ethernet with Wireless Extension: OPNET Modelling and Performance Study Experimental Evaluation of Mobile Core Networks on Simultaneous Access from M2M/IoT Terminals
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1