Making channel hopping sequences for self-organized mobile networks

Widist Bekulu Tessema, Keuchul Cho, Gihyuk Seong, Gisu Park, K. Han
{"title":"Making channel hopping sequences for self-organized mobile networks","authors":"Widist Bekulu Tessema, Keuchul Cho, Gihyuk Seong, Gisu Park, K. Han","doi":"10.1109/ITST.2013.6685586","DOIUrl":null,"url":null,"abstract":"In cognitive radio networks, secondary users must establish a link to exchange control information. Assuming a common control channel (CCC) simplifies the establishment of a link, but the dynamically changing availability of the spectrum makes it difficult to relay on a CCC. This letter presents CHS, Channel Hopping sequences, to establish a link in cognitive radio networks. We proposed synchronous CHS under the assumption of global clock synchronization and asynchronous CHS without assuming global clock synchronization. Our schemes provide successful communication rendezvous within a bounded time interval. Asynchronous CHS also achieves smaller time-to-rendezvous (TTR) which is governed linearly.","PeriodicalId":117087,"journal":{"name":"2013 13th International Conference on ITS Telecommunications (ITST)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 13th International Conference on ITS Telecommunications (ITST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITST.2013.6685586","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In cognitive radio networks, secondary users must establish a link to exchange control information. Assuming a common control channel (CCC) simplifies the establishment of a link, but the dynamically changing availability of the spectrum makes it difficult to relay on a CCC. This letter presents CHS, Channel Hopping sequences, to establish a link in cognitive radio networks. We proposed synchronous CHS under the assumption of global clock synchronization and asynchronous CHS without assuming global clock synchronization. Our schemes provide successful communication rendezvous within a bounded time interval. Asynchronous CHS also achieves smaller time-to-rendezvous (TTR) which is governed linearly.
自组织移动网络的信道跳频序列制作
在认知无线网络中,辅助用户必须建立链路来交换控制信息。假设一个公共控制通道(CCC)简化了链路的建立,但是频谱可用性的动态变化使得在CCC上中继变得困难。这封信提出了CHS,频道跳频序列,以建立认知无线电网络的链接。提出了在全局时钟同步前提下的同步CHS和在全局时钟不同步前提下的异步CHS。我们的方案在有限的时间间隔内提供成功的通信会合。异步CHS还实现了更小的线性控制的集合时间(TTR)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信