Jointly Minimizing AoI Penalty and Network Cost Among Coexisting Source-Destination Pairs

被引:7
作者
Tsai, Cho-Hsin [1 ]
Wang, Chih-Chun [1 ]
机构
[1] Purdue Univ, Sch ECE, W Lafayette, IN 47907 USA
来源
2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2021年
关键词
LOW-LATENCY;
D O I
10.1109/ISIT45174.2021.9518170
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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 Aolmarket-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.
引用
收藏
页码:3255 / 3260
页数:6
相关论文
共 32 条
  • [31] Yao Guidan, 2020, ARXIV201202958
  • [32] Yates RD, 2015, IEEE INT SYMP INFO, P3008, DOI 10.1109/ISIT.2015.7283009