Age Optimal Information Gathering and Dissemination on Graphs

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 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.

A stochastic process on a network with connections to Laplacian systems of equations

“…Finally, using (32) in Claim 2 we get the result. Now, since the chains Q 1 t and Q 2 t operate in parallel, the expected time for the two chains to couple, i.e., for all red and blue packets to get sunk, is the maximum of the time taken by each to get its respective packets sunk.…”

“…In the area of distributed computing we have shown in another work that the Data Collection Process can be used to analyze an in-network function computation scenario [11]. In the area of information dissemination, Markov chains similar to our Data Collection Process have been used to analyze the timeliness of information received by nodes in a network; see, e.g., the work of Tripathi, Talak and Modiano [32].…”

Fundamental Limits of Age-of-Information in Stationary and Non-stationary Environments

“…The problem of AoI minimization in a multi-hop network with static UEs has been studied in [13]. The paper [14] considers the problem of designing an AoI-optimal trajectory for a mobile agent which facilitates information dissemination from a central station to a set of ground terminals. The effect of mobility on the capacity of wireless networks has been investigated in the classic work of [15].…”

Age-Optimal UAV Scheduling for Data Collectionwith Battery Recharging

“…They proposed a new data acquisition model for uploading data, consisting of three modes, namely hovering, flying, and hybrid. In [6], an AoI-optimal data collection and dissemination problem on graphs is studied, where a UAV flies along the randomized trajectory to minimize the average and maximum AoIs. In [7], UAV is used as a mobile relay between a source-destination pair to minimize the maximum AoI.…”