Expected time to rendezvous in multi-hop cognitive radio networks

Liliana Cruz Flores, V. A. Reguera, Erik Ortiz Guerra, David R. Suarez Mora, Fabián Blanco Garrido, E. A. Lopez
{"title":"Expected time to rendezvous in multi-hop cognitive radio networks","authors":"Liliana Cruz Flores, V. A. Reguera, Erik Ortiz Guerra, David R. Suarez Mora, Fabián Blanco Garrido, E. A. Lopez","doi":"10.1109/LATINCOM.2017.8240151","DOIUrl":null,"url":null,"abstract":"The design of blind rendezvous strategies for dynamic spectrum access in multi-users, multi-hop networks is a challenging task. In this paper, a two radios synchronization strategy that minimizes the time to rendezvous in multi-users networks is analyze. In fact, it has been recently demonstrated that this synchronization strategy provides optimum results in terms of maximum time to rendezvous (MTTR). In this paper, the analysis to the expected time to rendezvous (ETTR) and derive analytical expressions for its numerical computation is extended. The estimated ETTR is compared with those obtained by simulation, using a representative blind rendezvous channel hopping sequence. The results indicate that the numerical expressions provide good estimates of the actual ETTR. Moreover, the ETTR achieved by the proposed synchronization strategy has proven to be bounded by the MTTR of a pair-wise rendezvous process irrespective of the number of users and the network topology. This property makes the analyzed rendezvous mechanism, and particularly the synchronization strategy, suitable for the deployment of large and dense networks.","PeriodicalId":190644,"journal":{"name":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","volume":"6 3‐4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LATINCOM.2017.8240151","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The design of blind rendezvous strategies for dynamic spectrum access in multi-users, multi-hop networks is a challenging task. In this paper, a two radios synchronization strategy that minimizes the time to rendezvous in multi-users networks is analyze. In fact, it has been recently demonstrated that this synchronization strategy provides optimum results in terms of maximum time to rendezvous (MTTR). In this paper, the analysis to the expected time to rendezvous (ETTR) and derive analytical expressions for its numerical computation is extended. The estimated ETTR is compared with those obtained by simulation, using a representative blind rendezvous channel hopping sequence. The results indicate that the numerical expressions provide good estimates of the actual ETTR. Moreover, the ETTR achieved by the proposed synchronization strategy has proven to be bounded by the MTTR of a pair-wise rendezvous process irrespective of the number of users and the network topology. This property makes the analyzed rendezvous mechanism, and particularly the synchronization strategy, suitable for the deployment of large and dense networks.
多跳认知无线电网络中预期的集合时间
多用户、多跳网络动态频谱接入的盲交会策略设计是一项具有挑战性的任务。本文分析了一种在多用户网络中减少交会时间的双无线电同步策略。事实上,最近已经证明,这种同步策略在最大交会时间(MTTR)方面提供了最佳结果。本文对期望交会时间(ETTR)进行了分析,并推导了其数值计算的解析表达式。利用一个典型的盲交会信道跳频序列,对仿真得到的估计ETTR进行了比较。结果表明,数值表达式能较好地估计实际的ETTR。此外,无论用户数量和网络拓扑如何,所提出的同步策略所实现的etr都受到双向会合过程的MTTR的限制。这一特性使得所分析的集合机制,特别是同步策略,更适合于大型密集网络的部署。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信