This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Open AccessArticle
On the Interplay between Deadline-Constrained Traffic and the Number of Allowed Retransmissions in Random Access Networks
1
Department of Ports Management and Shipping, National and Kapodistrian University of Athens, 34400 Euboea, Greece
2
Department of Electrical and Computer Engineering, School of Engineering, University of Cyprus, 1678 Nicosia, Cyprus
3
Department of Electrical Engineering and Automation, School of Electrical Engineering, Aalto University, 02150 Espoo, Finland
4
Department of Information and Communications Engineering, School of Electrical Engineering, Aalto University, 02150 Espoo, Finland
5
Dfinity Foundation, 6300 Zurich, Switzerland
6
Department of Computer and Information Science, Linköping University, SE-60174 Linköping, Sweden
*
Author to whom correspondence should be addressed.
Entropy 2024, 26(8), 655; https://doi.org/10.3390/e26080655 (registering DOI)
Submission received: 20 May 2024
/
Revised: 26 July 2024
/
Accepted: 29 July 2024
/
Published: 30 July 2024
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.
Share and Cite
MDPI and ACS Style
Nomikos, N.; Charalambous, T.; Wichman, R.; Pignolet, Y.-A.; Pappas, N.
On the Interplay between Deadline-Constrained Traffic and the Number of Allowed Retransmissions in Random Access Networks. Entropy 2024, 26, 655.
https://doi.org/10.3390/e26080655
AMA Style
Nomikos N, Charalambous T, Wichman R, Pignolet Y-A, Pappas N.
On the Interplay between Deadline-Constrained Traffic and the Number of Allowed Retransmissions in Random Access Networks. Entropy. 2024; 26(8):655.
https://doi.org/10.3390/e26080655
Chicago/Turabian Style
Nomikos, Nikolaos, Themistoklis Charalambous, Risto Wichman, Yvonne-Anne Pignolet, and Nikolaos Pappas.
2024. "On the Interplay between Deadline-Constrained Traffic and the Number of Allowed Retransmissions in Random Access Networks" Entropy 26, no. 8: 655.
https://doi.org/10.3390/e26080655
Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details
here.
Article Metrics
Article metric data becomes available approximately 24 hours after publication online.