基于认知无线电的无线局域网中多切换目标信道序列选择研究

Nitin Gupta, S. K. Dhurandher, I. Woungang, J. Rodrigues
{"title":"基于认知无线电的无线局域网中多切换目标信道序列选择研究","authors":"Nitin Gupta, S. K. Dhurandher, I. Woungang, J. Rodrigues","doi":"10.1504/IJSSC.2018.098691","DOIUrl":null,"url":null,"abstract":"In cognitive radio networks, handoff occurs when an unlicensed spectrum user has to switch to a new target channel from its current operating channel which a secondary user was using opportunistically. This situation raises whenever either the licensed primary user appears again or the channel's condition get worst. Substantial sensing time can be saved if a secondary user can make a proactive decision about selecting the future vacant target channel to resume the unfinished transmission before starting its transmission. This paper proposes a novel target channel sequence selection scheme for cognitive radio networks, which minimises the estimated service time of a secondary user by reducing the multiple handoffs. A non-iterative algorithm is implemented, which does not require the use of an exhaustive search technique as usual to determine the target channel sequence. Simulation results show that the proposed scheme outperforms both the random scheme and a considered benchmark scheme in terms of service time, cumulative handoff delay and throughput achieved by the secondary user.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"14 1","pages":"214-224"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the target channel sequence selection for multiple handoffs in cognitive radio-based wireless regional area networks\",\"authors\":\"Nitin Gupta, S. K. Dhurandher, I. Woungang, J. Rodrigues\",\"doi\":\"10.1504/IJSSC.2018.098691\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In cognitive radio networks, handoff occurs when an unlicensed spectrum user has to switch to a new target channel from its current operating channel which a secondary user was using opportunistically. This situation raises whenever either the licensed primary user appears again or the channel's condition get worst. Substantial sensing time can be saved if a secondary user can make a proactive decision about selecting the future vacant target channel to resume the unfinished transmission before starting its transmission. This paper proposes a novel target channel sequence selection scheme for cognitive radio networks, which minimises the estimated service time of a secondary user by reducing the multiple handoffs. A non-iterative algorithm is implemented, which does not require the use of an exhaustive search technique as usual to determine the target channel sequence. Simulation results show that the proposed scheme outperforms both the random scheme and a considered benchmark scheme in terms of service time, cumulative handoff delay and throughput achieved by the secondary user.\",\"PeriodicalId\":43931,\"journal\":{\"name\":\"International Journal of Space-Based and Situated Computing\",\"volume\":\"14 1\",\"pages\":\"214-224\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Space-Based and Situated Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJSSC.2018.098691\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Space-Based and Situated Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJSSC.2018.098691","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在认知无线电网络中,当一个未授权的频谱用户必须从其当前的操作频道切换到一个新的目标频道时,就会发生切换。每当获得许可的主用户再次出现或通道状况变得更糟时,就会出现这种情况。如果辅助用户能够在开始传输之前主动决定选择未来的空闲目标信道以恢复未完成的传输,则可以节省大量的传感时间。本文提出了一种新的认知无线网络目标信道序列选择方案,该方案通过减少多次切换来最小化辅助用户的估计服务时间。实现了一种非迭代算法,它不需要像通常那样使用穷举搜索技术来确定目标信道序列。仿真结果表明,该方案在服务时间、累积切换延迟和辅助用户吞吐量方面均优于随机方案和基准方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the target channel sequence selection for multiple handoffs in cognitive radio-based wireless regional area networks
In cognitive radio networks, handoff occurs when an unlicensed spectrum user has to switch to a new target channel from its current operating channel which a secondary user was using opportunistically. This situation raises whenever either the licensed primary user appears again or the channel's condition get worst. Substantial sensing time can be saved if a secondary user can make a proactive decision about selecting the future vacant target channel to resume the unfinished transmission before starting its transmission. This paper proposes a novel target channel sequence selection scheme for cognitive radio networks, which minimises the estimated service time of a secondary user by reducing the multiple handoffs. A non-iterative algorithm is implemented, which does not require the use of an exhaustive search technique as usual to determine the target channel sequence. Simulation results show that the proposed scheme outperforms both the random scheme and a considered benchmark scheme in terms of service time, cumulative handoff delay and throughput achieved by the secondary user.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Space-Based and Situated Computing
International Journal of Space-Based and Situated Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-
自引率
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学术官方微信