Age Optimal Information Gathering and Dissemination on Graphs
Authors:
- 1 April 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2422-2430
Abstract
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 P i,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.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Update or Wait: How to Keep Your Data FreshIEEE Transactions on Information Theory, 2017
- Development and Validation of a UAV Based System for Air Pollution MeasurementsSensors, 2016
- An optimal control approach for the persistent monitoring problem2011
- Minimizing age of information in vehicular networks2011
- Persistent monitoring of changing environments using a robot with limited range sensing2011
- Dynamic vehicle routing for data gathering in wireless networks2010
- Cooperative Control for Ocean Sampling: The Glider Coordinated Control SystemIEEE Transactions on Control Systems Technology, 2008
- On Clusters in Markov ChainsLecture Notes in Computer Science, 2006
- Fastest Mixing Markov Chain on a GraphSIAM Review, 2004
- Border patrol and surveillance missions using multiple unmanned air vehicles2004