Deadline-constrained Bursty Traffic in Random Access Wireless Networks

Nikolas Nomikos; Nikolaos Pappas; Themistoklis Charalambous; Yvonne-Anne Pignolet

doi:10.1109/SPAWC.2018.8445861

Deadline-constrained Bursty Traffic in Random Access Wireless Networks

Nikolas Nomikos, Nikolaos Pappas, Themistoklis Charalambous, Yvonne-Anne Pignolet

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

7 Citations (Scopus)

235 Downloads (Pure)

Abstract

We consider a network of buffer-aided wireless devices having to transmit deadline-constrained data packets on a slotted-ALOHA random-access channel. While retransmission-based communication enhances reliability, the transmission of packets in the queue is delayed and as a result, they might get dropped before they are transmitted successfully. In this work, we study the performance of deadline-constrained bursty traffic with retransmissions providing a Markov chain-based analysis. The aim is to reveal the trade-off between the packet deadline and the number of retransmissions as a function of the arrival rate, and pave the way towards finding the optimal number of retransmissions, given the packet deadline and packet arrival rate. Furthermore, performance evaluation is conducted for a user with varying transmit probability and different number of retransmissions. The results reveal the effect of these parameters on the drop probability and average throughput showing the values under which, improved performance can be obtained.

Original language	English
Title of host publication	Proceedings of the IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018
Publisher	IEEE
Number of pages	5
Volume	2018-June
ISBN (Print)	9781538635124
DOIs	https://doi.org/10.1109/SPAWC.2018.8445861
Publication status	Published - 24 Aug 2018
MoE publication type	A4 Conference publication
Event	IEEE International Workshop on Signal Processing Advances in Wireless Communications - Kalamata, Greece Duration: 25 Jun 2018 → 28 Jun 2018 Conference number: 19

Publication series

Name	IEEE International Workshop on Signal Processing Advances in Wireless Communications
Publisher	IEEE
ISSN (Print)	2325-3789

Workshop

Workshop	IEEE International Workshop on Signal Processing Advances in Wireless Communications
Abbreviated title	SPAWC
Country/Territory	Greece
City	Kalamata
Period	25/06/2018 → 28/06/2018

Keywords

deadline-constrained traffic
Markov chains
Packet deadlines
queueing
real-time communications

Access to Document

10.1109/SPAWC.2018.8445861

ELEC Nomikos etal Deadline-Constrained SPAWC2018 Accepted author manuscript, 525 KB

Cite this

Nomikos, N., Pappas, N., Charalambous, T., & Pignolet, Y.-A. (2018). Deadline-constrained Bursty Traffic in Random Access Wireless Networks. In Proceedings of the IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018 (Vol. 2018-June). Article 8445861 (IEEE International Workshop on Signal Processing Advances in Wireless Communications). IEEE. https://doi.org/10.1109/SPAWC.2018.8445861

Nomikos, Nikolas ; Pappas, Nikolaos ; Charalambous, Themistoklis et al. / Deadline-constrained Bursty Traffic in Random Access Wireless Networks. Proceedings of the IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018. Vol. 2018-June IEEE, 2018. (IEEE International Workshop on Signal Processing Advances in Wireless Communications).

@inproceedings{ae5d4db23867455496c0ba6de2211189,

title = "Deadline-constrained Bursty Traffic in Random Access Wireless Networks",

abstract = "We consider a network of buffer-aided wireless devices having to transmit deadline-constrained data packets on a slotted-ALOHA random-access channel. While retransmission-based communication enhances reliability, the transmission of packets in the queue is delayed and as a result, they might get dropped before they are transmitted successfully. In this work, we study the performance of deadline-constrained bursty traffic with retransmissions providing a Markov chain-based analysis. The aim is to reveal the trade-off between the packet deadline and the number of retransmissions as a function of the arrival rate, and pave the way towards finding the optimal number of retransmissions, given the packet deadline and packet arrival rate. Furthermore, performance evaluation is conducted for a user with varying transmit probability and different number of retransmissions. The results reveal the effect of these parameters on the drop probability and average throughput showing the values under which, improved performance can be obtained.",

keywords = "deadline-constrained traffic, Markov chains, Packet deadlines, queueing, real-time communications",

author = "Nikolas Nomikos and Nikolaos Pappas and Themistoklis Charalambous and Yvonne-Anne Pignolet",

year = "2018",

month = aug,

day = "24",

doi = "10.1109/SPAWC.2018.8445861",

language = "English",

isbn = "9781538635124",

volume = "2018-June",

series = "IEEE International Workshop on Signal Processing Advances in Wireless Communications",

publisher = "IEEE",

booktitle = "Proceedings of the IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018",

address = "United States",

note = "IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC ; Conference date: 25-06-2018 Through 28-06-2018",

}

Nomikos, N, Pappas, N, Charalambous, T & Pignolet, Y-A 2018, Deadline-constrained Bursty Traffic in Random Access Wireless Networks. in Proceedings of the IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018. vol. 2018-June, 8445861, IEEE International Workshop on Signal Processing Advances in Wireless Communications, IEEE, IEEE International Workshop on Signal Processing Advances in Wireless Communications, Kalamata, Greece, 25/06/2018. https://doi.org/10.1109/SPAWC.2018.8445861

Deadline-constrained Bursty Traffic in Random Access Wireless Networks. / Nomikos, Nikolas; Pappas, Nikolaos; Charalambous, Themistoklis et al.
Proceedings of the IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018. Vol. 2018-June IEEE, 2018. 8445861 (IEEE International Workshop on Signal Processing Advances in Wireless Communications).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - Deadline-constrained Bursty Traffic in Random Access Wireless Networks

AU - Nomikos, Nikolas

AU - Pappas, Nikolaos

AU - Charalambous, Themistoklis

AU - Pignolet, Yvonne-Anne

N1 - Conference code: 19

PY - 2018/8/24

Y1 - 2018/8/24

N2 - We consider a network of buffer-aided wireless devices having to transmit deadline-constrained data packets on a slotted-ALOHA random-access channel. While retransmission-based communication enhances reliability, the transmission of packets in the queue is delayed and as a result, they might get dropped before they are transmitted successfully. In this work, we study the performance of deadline-constrained bursty traffic with retransmissions providing a Markov chain-based analysis. The aim is to reveal the trade-off between the packet deadline and the number of retransmissions as a function of the arrival rate, and pave the way towards finding the optimal number of retransmissions, given the packet deadline and packet arrival rate. Furthermore, performance evaluation is conducted for a user with varying transmit probability and different number of retransmissions. The results reveal the effect of these parameters on the drop probability and average throughput showing the values under which, improved performance can be obtained.

AB - We consider a network of buffer-aided wireless devices having to transmit deadline-constrained data packets on a slotted-ALOHA random-access channel. While retransmission-based communication enhances reliability, the transmission of packets in the queue is delayed and as a result, they might get dropped before they are transmitted successfully. In this work, we study the performance of deadline-constrained bursty traffic with retransmissions providing a Markov chain-based analysis. The aim is to reveal the trade-off between the packet deadline and the number of retransmissions as a function of the arrival rate, and pave the way towards finding the optimal number of retransmissions, given the packet deadline and packet arrival rate. Furthermore, performance evaluation is conducted for a user with varying transmit probability and different number of retransmissions. The results reveal the effect of these parameters on the drop probability and average throughput showing the values under which, improved performance can be obtained.

KW - deadline-constrained traffic

KW - Markov chains

KW - Packet deadlines

KW - queueing

KW - real-time communications

UR - http://www.scopus.com/inward/record.url?scp=85053450016&partnerID=8YFLogxK

U2 - 10.1109/SPAWC.2018.8445861

DO - 10.1109/SPAWC.2018.8445861

M3 - Conference article in proceedings

AN - SCOPUS:85053450016

SN - 9781538635124

VL - 2018-June

T3 - IEEE International Workshop on Signal Processing Advances in Wireless Communications

BT - Proceedings of the IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018

PB - IEEE

T2 - IEEE International Workshop on Signal Processing Advances in Wireless Communications

Y2 - 25 June 2018 through 28 June 2018

ER -

Nomikos N, Pappas N, Charalambous T, Pignolet YA. Deadline-constrained Bursty Traffic in Random Access Wireless Networks. In Proceedings of the IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018. Vol. 2018-June. IEEE. 2018. 8445861. (IEEE International Workshop on Signal Processing Advances in Wireless Communications). doi: 10.1109/SPAWC.2018.8445861

Deadline-constrained Bursty Traffic in Random Access Wireless Networks

Abstract

Publication series

Workshop

Keywords

Access to Document

Other files and links

Fingerprint

Cite this