Abstract
In this paper, a dynamic access probability adjustment strategy for coded random access schemes based on successive interference cancellation (SIC) is proposed. The developed protocol consists of judiciously tuning the access probability, therefore controlling the number of transmitting users, in order to resolve medium access control (MAC) layer congestion states in high load conditions. The protocol is comprised of two steps: Estimation of the number of transmitting users during the current MAC frame and adjustment of the access probability to the subsequent MAC frame, based on the performed estimation. The estimation algorithm exploits a posteriori information, i.e., available information at the end of the SIC process, in particular it relies on both the frame configuration (residual number of collision slots) and the recovered users configuration (vector of recovered users) to effectively reduce mean-square error (MSE). During the access probability adjustment phase, a target load threshold is employed, tailored to the packet loss rate in the finite frame length case. Simulation results revealed that the developed estimator was able to achieve remarkable performance owing to the information gathered from the SIC procedure. It also illustrated how the proposed dynamic access probability strategy can resolve congestion states efficiently.
Highlights
In machine-type and Internet-of-Things (IoT) communications, users generate a large amount of bursty traffic to transmit over a shared communication medium
The values of G ◦ have been obtained via a Monte Carlo simulation, for medium access control (MAC) frame length m = 200 and target packet loss rate PL◦ = 0.01
We present the simulation results for dynamic access probability based coded random access schemes using the mentioned estimation methods
Summary
In machine-type and Internet-of-Things (IoT) communications, users generate a large amount of bursty traffic to transmit over a shared communication medium. The throughput has substantially increased which makes it a practical and efficient solution to support uncoordinated access Despite their numerous advantages, coded random access schemes exhibit lower critical points in traffic load. The proposed random access control mechanisms in [18] are based on random access schemes without SIC at the receiver, which is not applicable for coded random access schemes In both [19,20], users directly employ the load threshold from [5], which is obtained via asymptotic analysis (frame length and user population size tending to infinity, their ratio remaining constant).
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call