Estimating Age of Information Using Finite Order Moments

被引:1
作者
Chen, Licheng [1 ]
Dong, Yunquan [1 ,2 ]
机构
[1] Nanjing Univ Informat Sci & Technol, Sch Elect Informat Engn, Nanjing, Peoples R China
[2] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing, Peoples R China
来源
2022 14TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING, WCSP | 2022年
基金
中国国家自然科学基金;
关键词
Age of information; block Rayleigh fading channel; queueing analysis; estimation of age; moments; NETWORKS;
D O I
10.1109/WCSP55476.2022.10039102
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Age of information (AoI) has been proposed as a more suitable metric for characterizing the freshness of information than traditional metrics like delay and throughput. However, the calculation of AoI requires complex analysis and strict end-to-end synchronization. Most existential AoI-related works have assumed that the statistical characterizations of the arrival process and the service process are known. In fact, due to the randomness of the sources and the channel noises, these processes are often unavailable in reality. To this end, we propose a method to estimate the average AoI on a point-to-point wireless Rayleigh channel, which uses the available finite order statistical moments of the arrival process. Based on this method, we explicitly present the upper and lower bounds on the average AoI of the system. Our results show that 1) with the increase of the traffic intensity, the absolute error of the estimated average AoI bounds is first increasing and then decreasing, while the average AoI is monotonically increasing; 2) the average AoI can be effectively approximated by using the first two order moment estimation bounds, especially when traffic intensity is small or approaches unity; 3) tighter bounds can be obtained by using more moments.
引用
收藏
页码:197 / 202
页数:6
相关论文
共 25 条
  • [1] Alfa AS, 2010, QUEUEING THEORY FOR TELECOMMUNICATIONS: DISCRETE TIME MODELLING OF A SINGLE NODE SYSTEM, P1, DOI 10.1007/978-1-4419-7314-6
  • [2] Age-Optimal Service and Decision Processes in Internet of Things
    Bao, Zhiwei
    Dong, Yunquan
    Chen, Zhengchuan
    Fan, Pingyi
    Ben Letaief, Khaled
    [J]. IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (04) : 2826 - 2841
  • [3] Bedewy AM, 2016, IEEE INT SYMP INFO, P2569, DOI 10.1109/ISIT.2016.7541763
  • [4] Beytur Hasan Burhan, 2020, 2020 International Conference on Computing, Networking and Communications (ICNC), P353, DOI 10.1109/ICNC47757.2020.9049792
  • [5] Beytur H.B., 2019, SIG PROCESS COMMUN
  • [6] On the Age of Information in Status Update Systems With Packet Management
    Costa, Maice
    Codreanu, Marian
    Ephremides, Anthony
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (04) : 1897 - 1910
  • [7] Hunter J J, 1985, DISCRETE TIME MODELS, V2
  • [8] A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues
    Inoue, Yoshiaki
    Masuyama, Hiroyuki
    Takine, Tetsuya
    Tanaka, Toshiyuki
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (12) : 8305 - 8324
  • [9] On the convex functions and inequalities between mean values
    Jensen, JLWV
    [J]. ACTA MATHEMATICA, 1906, 30 (02) : 175 - 193
  • [10] Kam C, 2016, IEEE MILIT COMMUN C, P301, DOI 10.1109/MILCOM.2016.7795343