Age Optimal Information Gathering and Dissemination on Graphs
Name
CV_C_219.pdf
Description
Accepted version
Size
677.03 KB
Format
Adobe PDF
Checksum (MD5)
4f0217212b958b7f4428b01563b13b82
Author(s)
Tripathi, Vishrant
Talak, Rajat Rajendra
Modiano, Eytan H
Date Issued
April 2019
Journal
IEEE INFOCOM 2019
Publisher
IEEE
Citation
Tripathi, Vishrant, Rajat Talak and Eytan Modiano. “Age Optimal Information Gathering and Dissemination on Graphs.” IEEE INFOCOM 2019, Paris France, April 29-May 2, 2019 © 2019 The Author(s)
Version
Author's final manuscript
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 PiJ. 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.
MIT Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFOCOM.2019.8737642
