异构认知无线网络的可调信道跳频增强

C. Chao, Chia-Tsun Chen
{"title":"异构认知无线网络的可调信道跳频增强","authors":"C. Chao, Chia-Tsun Chen","doi":"10.1109/ICCW.2017.7962804","DOIUrl":null,"url":null,"abstract":"In a cognitive radio network (CRN), a premise for two nodes to communicate is having a rendezvous which means that they switch to the same channel simultaneously. Most existing channel hopping solutions for the rendezvous problem is for a homogeneous CRN where nodes have the same type of cognitive radio and thus can sense the same spectrum. In reality, nodes have different types of cognitive radios and hence the spectrums being sensed are different. In such a heterogeneous CRN, designing a channel hopping mechanism to provide rendezvous guarantee is challenging. Besides, while determining the channel hopping sequences, existing channel hopping protocols enable nodes to switch to different channels with predefined channel hopping sequences. Such mechanisms are suboptimal since they do not consider different channel conditions. In this paper, we propose a ratio adjustable channel hopping protocol (RACH) for heterogeneous CRNs. RACH provides rendezvous guarantee between any pair of nodes and enables a node to dynamically adjust the ratio of each channel being used. Nodes running RACH use three consecutive odd numbers to determine the schedule for a particular channel. Utilizing the property that two different sets of three consecutive odd numbers are relatively primes, RACH provides rendezvous guarantee for two nodes on each channel. RACH allows nodes to change the set of consecutive odd numbers to adjust the ratio of a channel being switched to. Such a mechanism enables a node to tune to a better channel more frequently to enhance its rendezvous probability to other nodes. Simulation results verify that RACH improves network performance in terms of time to rendezvous and throughput when compared with an existing channel hopping protocol for heterogeneous CRNs.","PeriodicalId":6656,"journal":{"name":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"11 1","pages":"1093-1098"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Ratio adjustable channel hopping enhancement for heterogeneous cognitive radio networks\",\"authors\":\"C. Chao, Chia-Tsun Chen\",\"doi\":\"10.1109/ICCW.2017.7962804\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a cognitive radio network (CRN), a premise for two nodes to communicate is having a rendezvous which means that they switch to the same channel simultaneously. Most existing channel hopping solutions for the rendezvous problem is for a homogeneous CRN where nodes have the same type of cognitive radio and thus can sense the same spectrum. In reality, nodes have different types of cognitive radios and hence the spectrums being sensed are different. In such a heterogeneous CRN, designing a channel hopping mechanism to provide rendezvous guarantee is challenging. Besides, while determining the channel hopping sequences, existing channel hopping protocols enable nodes to switch to different channels with predefined channel hopping sequences. Such mechanisms are suboptimal since they do not consider different channel conditions. In this paper, we propose a ratio adjustable channel hopping protocol (RACH) for heterogeneous CRNs. RACH provides rendezvous guarantee between any pair of nodes and enables a node to dynamically adjust the ratio of each channel being used. Nodes running RACH use three consecutive odd numbers to determine the schedule for a particular channel. Utilizing the property that two different sets of three consecutive odd numbers are relatively primes, RACH provides rendezvous guarantee for two nodes on each channel. RACH allows nodes to change the set of consecutive odd numbers to adjust the ratio of a channel being switched to. Such a mechanism enables a node to tune to a better channel more frequently to enhance its rendezvous probability to other nodes. Simulation results verify that RACH improves network performance in terms of time to rendezvous and throughput when compared with an existing channel hopping protocol for heterogeneous CRNs.\",\"PeriodicalId\":6656,\"journal\":{\"name\":\"2017 IEEE International Conference on Communications Workshops (ICC Workshops)\",\"volume\":\"11 1\",\"pages\":\"1093-1098\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Communications Workshops (ICC Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCW.2017.7962804\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2017.7962804","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在认知无线网络(CRN)中,两个节点通信的前提是有一个交会,这意味着它们同时切换到同一频道。大多数现有的信道跳变交会问题的解决方案是针对同质CRN,其中节点具有相同类型的认知无线电,因此可以感知相同的频谱。实际上,节点具有不同类型的认知无线电,因此被感知的频谱是不同的。在这种异构CRN中,设计一种信道跳变机制来提供交会保证是一个挑战。此外,在确定信道跳频序列的同时,现有的信道跳频协议允许节点通过预定义的信道跳频序列切换到不同的信道。这种机制不是最优的,因为它们没有考虑不同的通道条件。在本文中,我们提出了一种用于异构crn的比率可调信道跳变协议(RACH)。RACH提供了任何对节点之间的交会保证,并使节点能够动态调整每个信道的使用比例。运行RACH的节点使用三个连续的奇数来确定特定通道的调度。RACH利用由三个连续奇数组成的两个不同集合是相对素数的特性,为每个信道上的两个节点提供交会保证。RACH允许节点更改连续奇数的集合,以调整被切换到的通道的比率。这种机制使节点能够更频繁地调谐到更好的信道,以提高其与其他节点的交会概率。仿真结果表明,与现有的异构crn信道跳频协议相比,RACH在交会时间和吞吐量方面提高了网络性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Ratio adjustable channel hopping enhancement for heterogeneous cognitive radio networks
In a cognitive radio network (CRN), a premise for two nodes to communicate is having a rendezvous which means that they switch to the same channel simultaneously. Most existing channel hopping solutions for the rendezvous problem is for a homogeneous CRN where nodes have the same type of cognitive radio and thus can sense the same spectrum. In reality, nodes have different types of cognitive radios and hence the spectrums being sensed are different. In such a heterogeneous CRN, designing a channel hopping mechanism to provide rendezvous guarantee is challenging. Besides, while determining the channel hopping sequences, existing channel hopping protocols enable nodes to switch to different channels with predefined channel hopping sequences. Such mechanisms are suboptimal since they do not consider different channel conditions. In this paper, we propose a ratio adjustable channel hopping protocol (RACH) for heterogeneous CRNs. RACH provides rendezvous guarantee between any pair of nodes and enables a node to dynamically adjust the ratio of each channel being used. Nodes running RACH use three consecutive odd numbers to determine the schedule for a particular channel. Utilizing the property that two different sets of three consecutive odd numbers are relatively primes, RACH provides rendezvous guarantee for two nodes on each channel. RACH allows nodes to change the set of consecutive odd numbers to adjust the ratio of a channel being switched to. Such a mechanism enables a node to tune to a better channel more frequently to enhance its rendezvous probability to other nodes. Simulation results verify that RACH improves network performance in terms of time to rendezvous and throughput when compared with an existing channel hopping protocol for heterogeneous CRNs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信