Deadline-constrained Bursty Traffic in Random Access Wireless Networks

2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2018-06-01 DOI:10.1109/SPAWC.2018.8445861

Nikolaos Nomikos, N. Pappas, Themistoklis Charalambous, Y. Pignolet

{"title":"Deadline-constrained Bursty Traffic in Random Access Wireless Networks","authors":"Nikolaos Nomikos, N. Pappas, Themistoklis Charalambous, Y. Pignolet","doi":"10.1109/SPAWC.2018.8445861","DOIUrl":null,"url":null,"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.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2018.8445861","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

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.

查看原文本刊更多论文

随机接入无线网络中受截止日期约束的突发流量

我们考虑一个由缓冲辅助无线设备组成的网络，这些设备必须在一个开槽aloha随机访问信道上传输受截止日期限制的数据包。虽然基于重传的通信增强了可靠性，但队列中数据包的传输被延迟，因此，它们可能在成功传输之前被丢弃。在这项工作中，我们研究了具有重传的截止日期约束突发流量的性能，提供了基于马尔可夫链的分析。目的是揭示数据包截止日期和重传次数作为到达率的函数之间的权衡，并为在给定数据包截止日期和数据包到达率的情况下找到最优重传次数铺平道路。进一步，对具有不同传输概率和不同重传次数的用户进行性能评估。结果显示了这些参数对丢包概率和平均吞吐量的影响，表明在这些参数下可以获得更好的性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

自引率

0.00%

发文量