{"title":"无授权 NR 频谱中具有备份寻呼功能的高效波束扫描方案","authors":"Eshita Rastogi , Abhishek Roy , Ayush Rastogi , Jaehoon (Paul) Jeong , 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":null,"pages":null},"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 , Abhishek Roy , Ayush Rastogi , Jaehoon (Paul) Jeong , 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\":null,\"pages\":null},\"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}
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 ) 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 using a discrete-time semi-Markov chain model and validate the model by extensive simulations. The simulation results show that outperforms several baseline mechanisms in terms of average paging delay and paging resource usage.
期刊介绍:
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.