# Age of Information in the Presence of an Adversary

arXiv: https://arxiv.org/abs/2202.04050 · HTML: https://mlsanity.com/paper/2202.04050/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Feb 2022.

## Built on by (most cited first, 1 of 1)

- [Learning-augmented Online Minimization of Age of Information and Transmission Costs](https://mlsanity.com/paper/2403.02573/) (2024)

## Abstract (arXiv)

We consider a communication system where a base station serves N users, one user at a time, over a wireless channel. We consider the timeliness of the communication of each user via the age of information metric. A constrained adversary can block at most a given fraction, α, of the time slots over a horizon of T slots, i.e., it can block at most α T slots. We show that an optimum adversary blocks α T consecutive time slots of a randomly selected user. The interesting consecutive property of the blocked time slots is due to the cumulative nature of the age metric.