All Dates/Times are Australian Eastern Standard Time (AEST)

Technical Program

Paper Detail

Paper IDD7-S5-T3.2
Paper Title Jointly Minimizing AoI Penalty and Network Cost Among Coexisting Source-Destination Pairs
Authors Cho-Hsin Tsai, Chih-Chun Wang, Purdue University, United States
Session D7-S5-T3: Age of Information III
Chaired Session: Tuesday, 20 July, 23:20 - 23:40
Engagement Session: Tuesday, 20 July, 23:40 - 00:00
Abstract One main objective of ultra-low-latency communications is to minimize the data staleness at the receivers, recently characterized by a metric called Age-of-Information (AoI). While the question of when to send the next update packet has been the central subject of AoI minimization, each update packet also incurs the cost of transmission that needs to be jointly considered in a practical design. With the exponential growth of interconnected devices and the increasing risk of excessive resource consumption in mind, this work derives an optimal joint cost-and-AoI minimization solution for multiple coexisting source-destination (S-D) pairs. The results admit a new AoI-market-price-based interpretation and are applicable to the setting of (a) general heterogeneous AoI penalty functions and Markov delay distributions for each S-D pair, and (b) a general network cost function of aggregate throughput of all S-D pairs. Extensive simulation is used to demonstrate the superior performance of the proposed scheme.