# Age Optimal Information Gathering and Dissemination on Graphs

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

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Jan 2019.

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

- [To Compute or not to Compute? Adaptive Smart Sensing in Resource-Constrained Edge Computing](https://mlsanity.com/paper/2209.02166/) (2022)
- [Empowering Targeted Neighborhood Search via Hyper Tour for Large-Scale TSP](https://mlsanity.com/paper/2510.20169/) (2025)
- [Minimizing Age of Information for Mobile Edge Computing Systems: A Nested Index Approach](https://mlsanity.com/paper/2307.01366/) (2023)

## Abstract (arXiv)

We consider the problem of timely exchange of updates between a central station and a set of ground terminals V, via a mobile agent that traverses across the ground terminals along a mobility graph G = (V, E). We design the trajectory of the mobile agent to minimize peak and average age of information (AoI), two newly proposed metrics for measuring timeliness of information. We consider randomized trajectories, in which the mobile agent travels from terminal i to terminal j with probability Pi,j. For the information gathering problem, we show that a randomized trajectory is peak age optimal and factor-8H average age optimal, where H is the mixing time of the randomized trajectory on the mobility graph G. We also show that the average age minimization problem is NP-hard. For the information dissemination problem, we prove that the same randomized trajectory is factor-O(H) peak and average age optimal. Moreover, we propose an age-based trajectory, which utilizes information about current age at terminals, and show that it is factor-2 average age optimal in a symmetric setting.