Grant-Free Access with Multipacket Reception: Analysis and Reinforcement Learning Optimization

Augustin Jacquelin, Mikhail Vilgelm, W. Kellerer
{"title":"Grant-Free Access with Multipacket Reception: Analysis and Reinforcement Learning Optimization","authors":"Augustin Jacquelin, Mikhail Vilgelm, W. Kellerer","doi":"10.23919/WONS.2019.8795459","DOIUrl":null,"url":null,"abstract":"Grant-free access has been identified by 3GPP as a potential solution for Industrial Internet-of-Things applications in 5G networks. It allows to decrease overhead and delay, but it is also prone to collisions in the high-load regime. To reduce the effects of collisions, Non-Orthogonal Multiple Access or other Successive Interference Cancellation (SIC) protocols can be applied, allowing to partially recover collisions. In this paper, we abstract the grant-free access protocols with SIC with a $K$-Multipacket Reception ($K$-MPR) model. Based on this abstraction, we analyze its one-frame and steady-state throughput, delay and failure probability under different backoff schemes. Furthermore, we propose a reinforcement learning approach to allocate grant-free resources dynamically in order to maximize the normalized throughput of the protocol. Monte-Carlo simulations are employed to confirm the accuracy of analytical results and to evaluate the throughput, delay, and reliability of the proposed resource allocation approach.","PeriodicalId":185451,"journal":{"name":"2019 15th Annual Conference on Wireless On-demand Network Systems and Services (WONS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th Annual Conference on Wireless On-demand Network Systems and Services (WONS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WONS.2019.8795459","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Grant-free access has been identified by 3GPP as a potential solution for Industrial Internet-of-Things applications in 5G networks. It allows to decrease overhead and delay, but it is also prone to collisions in the high-load regime. To reduce the effects of collisions, Non-Orthogonal Multiple Access or other Successive Interference Cancellation (SIC) protocols can be applied, allowing to partially recover collisions. In this paper, we abstract the grant-free access protocols with SIC with a $K$-Multipacket Reception ($K$-MPR) model. Based on this abstraction, we analyze its one-frame and steady-state throughput, delay and failure probability under different backoff schemes. Furthermore, we propose a reinforcement learning approach to allocate grant-free resources dynamically in order to maximize the normalized throughput of the protocol. Monte-Carlo simulations are employed to confirm the accuracy of analytical results and to evaluate the throughput, delay, and reliability of the proposed resource allocation approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多包接收的免授权访问:分析和强化学习优化
3GPP已将免授权接入确定为5G网络中工业物联网应用的潜在解决方案。它允许减少开销和延迟,但在高负载状态下也容易发生碰撞。为了减少碰撞的影响,可以应用非正交多址或其他连续干扰消除(SIC)协议,允许部分恢复碰撞。在本文中,我们用一个$K$-多包接收($K$-MPR)模型抽象了具有SIC的免授权访问协议。在此基础上,分析了不同回退方案下的单帧和稳态吞吐量、时延和失效概率。此外,我们提出了一种强化学习方法来动态分配免费资源,以最大限度地提高协议的规范化吞吐量。蒙特卡罗模拟被用来确认分析结果的准确性,并评估所提出的资源分配方法的吞吐量、延迟和可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
C-ITS PKI protocol: Performance Evaluation in a Real Environment SEmulate: Seamless Network Protocol Simulation and Radio Channel Emulation for Wireless Sensor Networks DVFS-Power Management and Performance Engineering of Data Center Server Clusters Benefits and Challenges of Software Defined Satellite-5G Communication No way back? An SDN protocol for directed IoT networks
×
引用
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