On Minimizing the Maximum Age-of-Information For Wireless Erasure Channels

by   Arunabh Srivastava, et al.

Age-of-Information (AoI) is a recently proposed metric for quantifying the freshness of information from the UE's perspective in a communication network. Recently, Kadota et al. [1] have proposed an index-type approximately optimal scheduling policy for minimizing the average-AoI metric for a downlink transmission problem. For delay-sensitive applications, including real-time control of a cyber-physical system, or scheduling URLLC traffic in 5G, it is essential to have a more stringent uniform control on AoI across all users. In this paper, we derive an exactly optimal scheduling policy for this problem in a downlink cellular system with erasure channels. Our proof of optimality involves an explicit solution to the associated average-cost Bellman Equation, which might be of independent theoretical interest. We also establish that the resulting Age-process is positive recurrent under the optimal policy, and has an exponentially light tail, with the optimal large-deviation exponent. Finally, motivated by typical applications in small-cell residential networks, we consider the problem of minimizing the peak-AoI with throughput constraints to specific UEs, and derive a heuristic policy for this problem. Extensive numerical simulations have been carried out to compare the efficacy of the proposed policies with other well-known scheduling policies, such as Randomized scheduling and Proportional Fair.


Optimizing Information Freshness in Wireless Networks under General Interference Constraints

Age of information (AoI) is a recently proposed metric for measuring inf...

You Snooze, You Lose: Minimizing Channel-Aware Age of Information

We propose a variant of the Age of Information (AoI) metric called Chann...

On The Optimality of The Whittle's Index Policy For Minimizing The Age of Information

In this paper, we consider the average age minimization problem where a ...

On the Global Optimality of Whittle's index policy for minimizing the age of information

This paper examines the average age minimization problem where only a fr...

Minimizing Age-of-Information with Throughput Requirements in Multi-Path Network Communication

We consider the scenario where a sender periodically sends a batch of da...

Competitive Algorithms for Minimizing the Maximum Age-of-Information

In this short paper, we consider the problem of designing a near-optimal...

Transmission Scheduling for Multi-loop Wireless Networked Control Based on LQ Cost Offset

In this paper, transmission scheduling for multiloop wireless networked ...

Please sign up or login with your details

Forgot password? Click here to reset