Please use this identifier to cite or link to this item: http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/1906
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPandey, S.-
dc.contributor.authorShandilya, K.-
dc.contributor.authorAgarwal, S.-
dc.date.accessioned2021-06-23T23:46:28Z-
dc.date.available2021-06-23T23:46:28Z-
dc.date.issued2021-06-24-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/1906-
dc.description.abstractUltra reliable low latency communication (URLLC) is one of the main goals in 5G. URLLC requires highly reliable and low latency transmission of safety critical and control packets. Slotted ALOHA forms one of the widely used access schemes in cellular communication. In this paper, we study the performance of URLLC packet transmissions utilizing slotted ALOHA and propose a prioritized access mechanism to provide low latency and high reliability transmission of delay critical packets. We consider two types of traffic, namely, regular traffic and URLLC traffic. URLLC packets have stringent delay requirements, thus, they are provided high priority access to the channel. Via analytical formulation, we obtain the packet delay distribution function for both URLLC and regular packets and formulate an optimization problem to maximize the reliability of regular packets given that the URLLC packets meet their required reliability threshold. Results show that by enabling prioritized access to URLLC packets, their reliability requirements can be met, while at the same time, regular packet transmission can make most use of the remaining channel.en_US
dc.language.isoen_USen_US
dc.subjectURLLCen_US
dc.subjectSlotted ALOHAen_US
dc.subjectPriority based accessen_US
dc.subjectMarkov chainen_US
dc.subjectpacket delayen_US
dc.subjectreliabilityen_US
dc.titlePrioritized S-ALOHA for URLLCen_US
dc.typeArticleen_US
Appears in Collections:Year-2020

Files in This Item:
File Description SizeFormat 
Fulltext.pdf204.5 kBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.