Abstract
This letter analyzes the impact of packet retransmissions on the performance of wireless random access protocols. In particular, we focus on the effects of two controllable parameters, namely the rate at which retransmissions occur and the number of allowed retransmissions. In a scenario where packets are generated according to a Poisson process and new packets substitute old ones upon arrival, we determine the conditions in which a given throughput or packet success probability constraint is achievable. We also prove, for a general packet success probability function of the traffic, that selecting the smallest feasible value of the number of allowed retransmissions along with an appropriate retransmission rate is optimal in terms of mean delay to transmit packets and mean <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Peak-Age-of-Information</i> . We illustrate this result with numerical examples.
Highlights
T HE INTRINSIC characteristics of wireless transmissions and the specific policies of spectrum use based on frequency bands have led to several theoretical and practical challenges for the deployment of wireless systems
The authors propose a random access scheme to optimize the AoI for a set of arrival rates and a large number of nodes; in [10] the authors propose a random access scheme to optimize the AoI based on the instantaneous AoI of each node; in [11] the authors show that random access perform worse than scheduled access with feedback by a factor of approximately 2e in the AoI
We studied a single class random access wireless network with homogeneous traffic, general transmission success probability function, and a retransmission scheme where packets are dropped when new packets arrive at the node or the number of allowed retransmissions is reached
Summary
T HE INTRINSIC characteristics of wireless transmissions and the specific policies of spectrum use based on frequency bands have led to several theoretical and practical challenges for the deployment of wireless systems. In the emerging scenarios of massive connectivity for machine-type devices [2], random access is essential for allowing efficient access from a large population of devices with unpredictable and intermittent activity In this case, the challenge is how to coordinate random transmissions so that each individual link has an acceptable performance. An increase in traffic leads to a greater chance of collision, and a decrease in the probability that a packet is successfully received at its first transmission. We consider a scenario where only the most recent event matters, and a packet waiting to be retransmitted is dropped whenever a new packet arrives In this scenario, in addition to delay, another metric of interest is the Age-of-Information (AoI) defined in [7], [8]. The authors propose a random access scheme to optimize the AoI for a set of arrival rates and a large number of nodes; in [10] the authors propose a random access scheme to optimize the AoI based on the instantaneous AoI of each node; in [11] the authors show that random access perform worse than scheduled access with feedback by a factor of approximately 2e in the AoI
Sign-in/Register to view highlights & summary 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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
