无授权 NR 频谱中具有备份寻呼功能的高效波束扫描方案

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2024-09-19 DOI:10.1016/j.comnet.2024.110811
Eshita Rastogi , Abhishek Roy , Ayush Rastogi , Jaehoon (Paul) Jeong , Navrati Saxena
{"title":"无授权 NR 频谱中具有备份寻呼功能的高效波束扫描方案","authors":"Eshita Rastogi ,&nbsp;Abhishek Roy ,&nbsp;Ayush Rastogi ,&nbsp;Jaehoon (Paul) Jeong ,&nbsp;Navrati Saxena","doi":"10.1016/j.comnet.2024.110811","DOIUrl":null,"url":null,"abstract":"<div><div>With the increasing demand of user applications and the shortage of cellular spectrum, New Radio (NR) access to Unlicensed Spectrum (NR-U) is getting significant attention. Listen Before Talk (LBT) procedure is used to sense unlicensed channel availability prior to transmission. The transmissions are subjected to LBT procedure failure, which brings extra delay as they are postponed to the next available transmission opportunity. This excess delay also affects time-critical procedures, such as paging. The directional communication in NR requires beamforming, which further complicates paging procedure as additional paging message transmissions are needed to cover all the beams. In this work, we propose an NR-U paging mechanism (called <span><math><mrow><mi>F</mi><mi>F</mi><mtext>_</mtext><mi>B</mi><mi>P</mi></mrow></math></span>) consisting of Full and Fast Paging Cycles with Backup Paging Occasions (POs). Full Paging uses a normal NR-U paging cycle and broadcasts a paging message on all the beams. On the other hand, Fast Paging, which targets delay-sensitive mobile users, uses a shorter paging cycle and broadcasts a paging message on selected beams only. The Backup POs deal with LBT procedure failure impairments while paging broadcast on selective beams reduces paging resource usage. We analyze <span><math><mrow><mi>F</mi><mi>F</mi><mtext>_</mtext><mi>B</mi><mi>P</mi></mrow></math></span> using a discrete-time semi-Markov chain model and validate the model by extensive simulations. The simulation results show that <span><math><mrow><mi>F</mi><mi>F</mi><mtext>_</mtext><mi>B</mi><mi>P</mi></mrow></math></span> outperforms several baseline mechanisms in terms of average paging delay and paging resource usage.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"254 ","pages":"Article 110811"},"PeriodicalIF":4.4000,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient beam sweeping scheme with backup paging occasions in NR-Unlicensed Spectrum\",\"authors\":\"Eshita Rastogi ,&nbsp;Abhishek Roy ,&nbsp;Ayush Rastogi ,&nbsp;Jaehoon (Paul) Jeong ,&nbsp;Navrati Saxena\",\"doi\":\"10.1016/j.comnet.2024.110811\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>With the increasing demand of user applications and the shortage of cellular spectrum, New Radio (NR) access to Unlicensed Spectrum (NR-U) is getting significant attention. Listen Before Talk (LBT) procedure is used to sense unlicensed channel availability prior to transmission. The transmissions are subjected to LBT procedure failure, which brings extra delay as they are postponed to the next available transmission opportunity. This excess delay also affects time-critical procedures, such as paging. The directional communication in NR requires beamforming, which further complicates paging procedure as additional paging message transmissions are needed to cover all the beams. In this work, we propose an NR-U paging mechanism (called <span><math><mrow><mi>F</mi><mi>F</mi><mtext>_</mtext><mi>B</mi><mi>P</mi></mrow></math></span>) consisting of Full and Fast Paging Cycles with Backup Paging Occasions (POs). Full Paging uses a normal NR-U paging cycle and broadcasts a paging message on all the beams. On the other hand, Fast Paging, which targets delay-sensitive mobile users, uses a shorter paging cycle and broadcasts a paging message on selected beams only. The Backup POs deal with LBT procedure failure impairments while paging broadcast on selective beams reduces paging resource usage. We analyze <span><math><mrow><mi>F</mi><mi>F</mi><mtext>_</mtext><mi>B</mi><mi>P</mi></mrow></math></span> using a discrete-time semi-Markov chain model and validate the model by extensive simulations. The simulation results show that <span><math><mrow><mi>F</mi><mi>F</mi><mtext>_</mtext><mi>B</mi><mi>P</mi></mrow></math></span> outperforms several baseline mechanisms in terms of average paging delay and paging resource usage.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"254 \",\"pages\":\"Article 110811\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2024-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1389128624006431\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624006431","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

随着用户应用需求的不断增长和蜂窝频谱的短缺,新无线电(NR)接入非授权频谱(NR-U)正受到极大关注。先听后说(LBT)程序用于在传输前感知非授权信道的可用性。传输会因 LBT 程序失败而推迟到下一次可用的传输机会,从而带来额外的延迟。这种多余的延迟也会影响寻呼等时间关键程序。NR 中的定向通信需要波束成形,这使得寻呼程序更加复杂,因为需要额外的寻呼信息传输才能覆盖所有波束。在这项工作中,我们提出了一种 NR-U 寻呼机制(称为 FF_BP),该机制由带有备份寻呼事件 (PO) 的完整和快速寻呼循环组成。全寻呼使用正常的 NR-U 寻呼周期,并在所有波束上广播寻呼信息。另一方面,快速寻呼针对对延迟敏感的移动用户,使用较短的寻呼周期,只在选定波束上广播寻呼信息。后备 PO 可处理 LBT 程序故障损害,而在选定波束上进行寻呼广播则可减少寻呼资源的使用。我们使用离散时间半马尔可夫链模型分析了 FF_BP,并通过大量仿真验证了该模型。仿真结果表明,在平均寻呼延迟和寻呼资源使用方面,FF_BP 优于几种基准机制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An efficient beam sweeping scheme with backup paging occasions in NR-Unlicensed Spectrum
With the increasing demand of user applications and the shortage of cellular spectrum, New Radio (NR) access to Unlicensed Spectrum (NR-U) is getting significant attention. Listen Before Talk (LBT) procedure is used to sense unlicensed channel availability prior to transmission. The transmissions are subjected to LBT procedure failure, which brings extra delay as they are postponed to the next available transmission opportunity. This excess delay also affects time-critical procedures, such as paging. The directional communication in NR requires beamforming, which further complicates paging procedure as additional paging message transmissions are needed to cover all the beams. In this work, we propose an NR-U paging mechanism (called FF_BP) consisting of Full and Fast Paging Cycles with Backup Paging Occasions (POs). Full Paging uses a normal NR-U paging cycle and broadcasts a paging message on all the beams. On the other hand, Fast Paging, which targets delay-sensitive mobile users, uses a shorter paging cycle and broadcasts a paging message on selected beams only. The Backup POs deal with LBT procedure failure impairments while paging broadcast on selective beams reduces paging resource usage. We analyze FF_BP using a discrete-time semi-Markov chain model and validate the model by extensive simulations. The simulation results show that FF_BP outperforms several baseline mechanisms in terms of average paging delay and paging resource usage.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
期刊最新文献
Performance modeling and comparison of URLLC and eMBB coexistence strategies in 5G new radio systems Integrating Unmanned Aerial Vehicles (UAVs) with Vehicular Ad-hoc NETworks (VANETs): Architectures, applications, opportunities Deep reinforcement learning for autonomous SideLink radio resource management in platoon-based C-V2X networks: An overview Robust and energy-efficient RPL optimization algorithm with scalable deep reinforcement learning for IIoT Privacy-preserving local clustering coefficient query on structured encrypted graphs
×
引用
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