On the Interplay between Deadline-Constrained Traffic and the Number of Allowed Retransmissions in Random Access Networks
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2024-08
Major/Subject
Mcode
Degree programme
Language
en
Pages
19
Series
Entropy, Volume 26, issue 8
Abstract
In this paper, a network comprising wireless devices equipped with buffers transmitting deadline-constrained data packets over a slotted-ALOHA random-access channel is studied. Although communication protocols facilitating retransmissions increase reliability, a packet awaiting transmission from the queue experiences delays. Thus, packets with time constraints might be dropped before being successfully transmitted, while at the same time causing the queue size of the buffer to increase. To understand the trade-off between reliability and delays that might lead to packet drops due to deadline-constrained bursty traffic with retransmissions, the scenario of a wireless network utilizing a slotted-ALOHA random-access channel is investigated. The main focus is to reveal the trade-off between the number of retransmissions and the packet deadline as a function of the arrival rate. Towards this end, analysis of the system is performed by means of discrete-time Markov chains. Two scenarios are studied: (i) the collision channel model (in which a receiver can decode only when a single packet is transmitted), and (ii) the case for which receivers have multi-packet reception capabilities. A performance evaluation for a user with different transmit probabilities and number of retransmissions is conducted. We are able to determine numerically the optimal probability of transmissions and the number of retransmissions, given the packet arrival rate and the packet deadline. Furthermore, we highlight the impact of transmit probability and the number of retransmissions on the average drop rate and throughput.Description
Publisher Copyright: © 2024 by the authors.
Keywords
deadline-constrained traffic, delay-sensitive communications, discrete-time Markov chains, low-latency communications, multi-packet reception, packet deadlines, queuing
Other note
Citation
Nomikos, N, Charalambous, T, Wichman, R, Pignolet, Y A & Pappas, N 2024, ' On the Interplay between Deadline-Constrained Traffic and the Number of Allowed Retransmissions in Random Access Networks ', Entropy, vol. 26, no. 8, 655 . https://doi.org/10.3390/e26080655