Optimizing the Age-of-Information for Mobile Users in Adversarial and Stochastic Environments

by   Abhishek Sinha, et al.

We study a multi-user downlink scheduling problem for optimizing the freshness of information available to users roaming across multiple cells. We consider both adversarial and stochastic settings and design scheduling policies that optimize two distinct information freshness metrics, namely the average age-of-information and the peak age-of-information. We show that a natural greedy scheduling policy is competitive with the optimal offline policy in the adversarial setting. We also derive fundamental lower bounds to the competitive ratio achievable by any online policy. In the stochastic environment, we show that a Max-Weight scheduling policy that takes into account the channel statistics achieves an approximation factor of 2 for minimizing the average age of information in two extreme mobility scenarios. We conclude the paper by establishing a large-deviation optimality result achieved by the greedy policy for minimizing the peak age of information for static users situated at a single cell.



There are no comments yet.


page 1


Fundamental Limits of Age-of-Information in Stationary and Non-stationary Environments

We study the multi-user scheduling problem for minimizing the Age of Inf...

Competitive Algorithms for Minimizing the Maximum Age-of-Information

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

Fluctuation Bounds for the Max-Weight Policy, with Applications to State Space Collapse

We consider a multi-hop switched network operating under a Max-Weight (M...

Optimizing Age-of-Information in Adversarial Environments with Channel State Information

This paper considers a multi-user downlink scheduling problem with acces...

Age Optimal Information Gathering and Dissemination on Graphs

We consider the problem of timely exchange of updates between a central ...

Optimal Age over Erasure Channels

Previous works on age of information and erasure channels have dealt wit...

Remote Estimation in Decentralized Random Access Channels

Efficient sampling and remote estimation is critical for a plethora of w...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.