Age Optimal Information Gathering and Dissemination on Graphs
Age Optimal Information Gathering and Dissemination on Graphs
复制标题
DOI：
10.1109/infocom.2019.8737642
复制
发表时间：
2019-01
期刊：
影响因子：
--
通讯作者：
Vishrant Tripathi;Rajat Talak;E. Modiano
中科院分区：
文献类型：
--
作者：
Vishrant Tripathi;Rajat Talak;E. Modiano
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-$8\mathcal{H}$ average age optimal, where $\mathcal{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}(\mathcal{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.
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-$8\mathcal{H}$ average age optimal, where $\mathcal{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}(\mathcal{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.