Delay and Peak-Age Violation Probability in Short-Packet Transmissions

Date

2018-06-22

Author

Devassy, Rahul
Durisi, Giuseppe
Ferrante, Guido Carlo
Simeone, Osvaldo
Uysal, Elif

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

233
views

0
downloads

This paper investigates the distribution of delay and peak age of information in a communication system where packets, generated according to an independent and identically distributed Bernoulli process, are placed in a single-server queue with first-come first-served discipline and transmitted over an additive white Gaussian noise (AWGN) channel. When a packet is correctly decoded, the sender receives an instantaneous error-free positive acknowledgment, upon which it removes the packet from the buffer. In the case of negative acknowledgment, the packet is retransmitted. By leveraging finite-blocklength results for the AWGN channel, we characterize the delay violation and the peak-age violation probability without resorting to approximations based on large deviation theory as in previous literature. Our analysis reveals that there exists an optimum blocklength that minimizes the delay violation and the peak-age violation probabilities. We also show that one can find two blocklength values that result in very similar average delay but significantly different delay violation probabilities. This highlights the importance of focusing on violation probabilities rather than on averages.

Subject Keywords

Delay, Finite blocklength, Age of information, Queuing

URI

https://hdl.handle.net/11511/54465

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

DELAY ESTIMATION BASED ON KINEMATIC TRACK INFORMATION WITHOUT TIME STAMPS Ozgen, Selim; Sarıtaş, Elif; Orguner, Umut; Acar, Duygu (2014-04-25) An algorithm to estimate the delay between two track files without time stamps in a distributed track fusion architecture is proposed. The main aim in delay estimation is to make the proceeding track fusion more accurately. The performance of the proposed algorithm is illustrated on an example in which two radars observe a common surveillance area with one radar sending the track information with a deterministic delay. Moreover, a method is proposed if the delay estimation algorithm presents a bad performan...
Particle Filtering with Propagation Delayed Measurements Orguner, Umut (2010-03-13) This paper investigates the problem of propagation delayed measurements in a particle filtering scenario. Based on implicit constraints specified by target dynamics and physics rules of signal propagation, authors apply the ideas that were first proposed in their previous work to the case of particle filters. Unlike the deterministic sampling based approach called propagation delayed measurement filter (PDMF) in their previous work, the new algorithm proposed here (called as PDM particle filter (PDM-PF)) ha...
Optimizing Information Freshness in Random Access Channels Yavaşcan, Orhan Tahir; Uysal, Elif; Department of Electrical and Electronics Engineering (2022-8-31) In this work, a number of transmission strategies aimed at optimizing information freshness in random access channels are developed and studied. Threshold-ALOHA, an age-aware modification of slotted ALOHA, suggests a fixed age threshold on the terminals before they can become active and attempt transmissions with a constant probability. Threshold ALOHA nearly halves the average Age of Information (AoI) whilst the loss of throughput compared to slotted ALOHA is less than one percent. Mumista, multiple mini s...
Remote estimation of the Wiener process over a channel with random delay Sun, Yin; Polyanskiy, Yury; Uysal, Elif (2017-06-25) In this paper, we consider a problem of sampling a Wiener process, with samples forwarded to a remote estimator via a channel that consists of a queue with random delay. The estimator reconstructs a real-time estimate of the signal from causally received samples. Motivated by recent research on age of-information, we study the optimal sampling strategy that minimizes the mean square estimation error subject to a sampling frequency constraint. We prove that the optimal sampling strategy is a threshold policy...
Reliable Transmission of Short Packets Through Queues and Noisy Channels Under Latency and Peak-Age Violation Guarantees Devassy, Rahul; Durisi, Giuseppe; Ferrante, Guido Carlo; Simeone, Osvaldo; Uysal, Elif (Institute of Electrical and Electronics Engineers (IEEE), 2019-04-01) This paper investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary memoryless Bernoulli process, placed in a single-server queue and then transmitted over a wireless channel. A variable-length stop-feedback coding scheme-a general strategy that encompasses simple automatic repetition request (ARQ) and more sophisticated hybrid ARQ techniq...

Citation Formats

R. Devassy, G. Durisi, G. C. Ferrante, O. Simeone, and E. Uysal, “Delay and Peak-Age Violation Probability in Short-Packet Transmissions,” 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/54465.