K-Preferential Slotted ALOHA for Ultra Reliable Low Latency Communications

S. Agarwal, Shubham Pandey
{"title":"K-Preferential Slotted ALOHA for Ultra Reliable Low Latency Communications","authors":"S. Agarwal, Shubham Pandey","doi":"10.1109/NCC52529.2021.9530039","DOIUrl":null,"url":null,"abstract":"Ultra-reliable low-latency communication (URLLC), one of the key component of 5G, provides a set of features required to support mission-critical applications. Slotted ALOHA is one of the most popular mechanism to share a channel among multiple users. However, slotted ALOHA cannot meet high reliability requirements of URLLC when large number of users are present in the network. In this paper, we propose a preferential medium access control scheme to match the high reliability requirement of URLLC. It is ensured by dedicating every Kth slot exclusively for URLLC transmission. We analytically obtain the packet delay distribution and reliability of both the URLLC and regular packets. An optimization problem is framed to maximize the reliability of regular packets subject to meeting the URLLC reliability constraints. Extensive simulations indicate that our proposed $K$-preferential S-ALOHA protocol can meet the URLLC requirements even when the network traffic is high.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC52529.2021.9530039","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Ultra-reliable low-latency communication (URLLC), one of the key component of 5G, provides a set of features required to support mission-critical applications. Slotted ALOHA is one of the most popular mechanism to share a channel among multiple users. However, slotted ALOHA cannot meet high reliability requirements of URLLC when large number of users are present in the network. In this paper, we propose a preferential medium access control scheme to match the high reliability requirement of URLLC. It is ensured by dedicating every Kth slot exclusively for URLLC transmission. We analytically obtain the packet delay distribution and reliability of both the URLLC and regular packets. An optimization problem is framed to maximize the reliability of regular packets subject to meeting the URLLC reliability constraints. Extensive simulations indicate that our proposed $K$-preferential S-ALOHA protocol can meet the URLLC requirements even when the network traffic is high.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
超可靠低延迟通信的k -优先开槽ALOHA
超可靠低延迟通信(URLLC)是5G的关键组件之一,它提供了一组支持关键任务应用所需的功能。槽式ALOHA是在多个用户之间共享通道的最流行的机制之一。但是,当网络中有大量用户时,槽位ALOHA不能满足URLLC的高可靠性要求。为了满足URLLC的高可靠性要求,本文提出了一种优先介质访问控制方案。这是通过将每个第k个时隙专门用于URLLC传输来确保的。分析得到了URLLC和常规数据包的时延分布和可靠性。在满足URLLC可靠性约束的前提下,构造一个优化问题,使规则报文的可靠性最大化。大量的仿真表明,我们提出的$K$优先S-ALOHA协议即使在网络流量很大的情况下也能满足URLLC的要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Biomedical Image Retrieval using Muti-Scale Local Bit-plane Arbitrary Shaped Patterns Forensics of Decompressed JPEG Color Images Based on Chroma Subsampling Optimized Bio-inspired Spiking Neural Models based Anatomical and Functional Neurological Image Fusion in NSST Domain Improved Hankel Norm Criterion for Interfered Nonlinear Digital Filters Subjected to Hardware Constraints The Capacity of Photonic Erasure Channels with Detector Dead Times
×
引用
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