Optimal Age over Erasure Channels

01/06/2019
by   Elie Najm, et al.
0

Previous works on age of information and erasure channels have dealt with specific models and computed the average age or average peak age for certain settings. In this paper, we ask a more fundamental question: Given a single source and an erasure channel, what is the optimal coding scheme from an age point of view and what is the optimal achievable age? We answer these questions in the following two scenarios: (i) the source alphabet and the erasure-channel input-alphabet are the same, and (ii) the source alphabet and the channel input-alphabet are different. We show that, in the first case, no coding is required and we derive a closed form formula for the average age. Whereas, in the second case, we use a random coding argument to bound the average age and show that the average age achieved using random codes converges to the optimal average age as the source alphabet becomes large.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2018

Optimal Source Codes for Timely Updates

A transmitter observing a sequence of independent and identically distri...
research
12/22/2022

Coding Gain for Age of Information in a Multi-source System with Erasure Channel

In our work, we study the age of information () in a multi-source system...
research
02/26/2018

Timeliness in Lossless Block Coding

We examine lossless data compression from an average delay perspective. ...
research
01/02/2019

Minimizing The Age of Information in a CSMA Environment

In this paper, we investigate a network of N interfering links contendin...
research
03/24/2021

Information Freshness Analysis of Slotted ALOHA in Gilbert-Elliot Channels

This letter analyzes a class of information freshness metrics for large ...
research
01/02/2023

Age-Optimal Multi-Channel-Scheduling under Energy and Tolerance Constraints

We study the optimal scheduling problem where n source nodes attempt to ...
research
03/24/2023

Statistical Age-of-Information Bounds for Parallel Systems: When Do Independent Channels Make a Difference?

This paper contributes tail bounds of the age-of-information of a genera...

Please sign up or login with your details

Forgot password? Click here to reset