Benefits of Coding on Age of Information in Broadcast Networks

04/22/2019
by   Xingran Chen, et al.
0

Age of Information (AoI) is studied in two-user broadcast networks with feedback, and lower and upper bounds are derived on the expected weighted sum AoI of the users. In particular, a class of simple coding actions is considered and within this class, randomized and deterministic policies are devised. Explicit conditions are found for symmetric dependent channels under which coded randomized policies strictly outperform the corresponding uncoded policies. Similar behavior is numerically shown for deterministic policies.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/05/2018

Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks

We consider a wireless broadcast network with a base station sending tim...
research
02/17/2021

Timely Broadcasting in Erasure Networks: Age-Rate Tradeoffs

The interplay between timeliness and rate efficiency is investigated in ...
research
05/01/2019

Adaptive Coding for Information Freshness in a Two-user Broadcast Erasure Channel

In this paper, we investigate the impact of coding on the Age of Informa...
research
11/17/2021

Information Freshness in Multi-Hop Wireless Networks

We consider the problem of minimizing age of information in multihop wir...
research
08/02/2022

Optimizing Age of Information with Correlated Sources

We develop a simple model for the timely monitoring of correlated source...
research
12/26/2020

Analyzing Age of Information in Multiaccess Networks by Fluid Limits

In this paper, we adopt the fluid limits to analyze Age of Information (...
research
05/09/2023

Minimizing Moments of AoI for Both Active and Passive Users through Second-Order Analysis

In this paper, we address the optimization problem of moments of Age of ...

Please sign up or login with your details

Forgot password? Click here to reset