Age of Information in Ultra-Dense IoT Systems: Performance and Mean-Field Game Analysis

被引:3
作者
Zhou, Bo [1 ]
Saad, Walid [2 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Elect & Informat Engn, Nanjing 210016, Peoples R China
[2] Virginia Tech, Bradley Dept Elect & Comp Engn, Wireless VT, Blacksburg, VA 24061 USA
关键词
Internet of Things; Games; Sensors; Performance evaluation; Receivers; Multiaccess communication; Costs; Age of Information; game theory; mean field; optimization; INTERNET; ACCESS; THINGS;
D O I
10.1109/TMC.2023.3292515
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a dense Internet of Things (IoT) monitoring system is considered in which a large number of IoT devices contend for channel access so as to transmit timely status updates to the corresponding receivers using a carrier sense multiple access (CSMA) scheme. Under two packet management schemes with and without preemption in service, the closed-form expressions of the average age of information (AoI) and the average peak AoI of each device is characterized. It is shown that the scheme with preemption in service always leads to a smaller average AoI and a smaller average peak AoI, compared to the scheme without preemption in service. Then, a distributed noncooperative medium access control game is formulated in which each device optimizes its waiting rate so as to minimize its average AoI or average peak AoI under an average energy cost constraint on channel sensing and packet transmitting. To overcome the challenges of solving this game for an ultra-dense IoT, a mean-field game (MFG) approach is proposed to study the asymptotic performance of each device for the system in the large population regime. The accuracy of the MFG is analyzed, and the existence, uniqueness, and convergence of the mean-field equilibrium (MFE) are investigated. Simulation results show that the proposed MFG is accurate even for a small number of devices; and the proposed CSMA-type scheme under the MFG analysis outperforms three baseline schemes with fixed and dynamic waiting rates. Moreover, it is observed that the average AoI and the average peak AoI under the MFE do not necessarily decrease with the arrival rate.
引用
收藏
页码:4533 / 4547
页数:15
相关论文
共 41 条
  • [1] AoI-Optimal Joint Sampling and Updating for Wireless Powered Communication Systems
    Abd-Elmagid, Mohamed A.
    Dhillon, Harpreet S.
    Pappas, Nikolaos
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2020, 69 (11) : 14110 - 14115
  • [2] Age-Minimal Transmission for Energy Harvesting Sensors With Finite Batteries: Online Policies
    Arafa, Ahmed
    Yang, Jing
    Ulukus, Sennur
    Poor, H. Vincent
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (01) : 534 - 556
  • [3] Bedewy A. M., 2019, P ACM MOBIHOC, P51
  • [4] Minimizing the Age of Information Through Queues
    Bedewy, Ahmed M.
    Sun, Yin
    Shroff, Ness B.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (08) : 5215 - 5232
  • [5] Cecchi F., 2015, ACM SIGMETRICS Performance Evaluation Review, V43, P13
  • [6] Chen H, 2020, IEEE CONF COMPUT, P930, DOI [10.1109/INFOCOMWKSHPS50562.2020.9162973, 10.1109/infocomwkshps50562.2020.9162973]
  • [7] Age of Information in Random Access Channels
    Chen, Xingran
    Gatsis, Konstantinos
    Hassani, Hamed
    Bidokhti, Shirin Saeedi
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (10) : 6548 - 6568
  • [8] On the Asymptotic Validity of the Decoupling Assumption for Analyzing 802.11 MAC Protocol
    Cho, Jeong-woo
    Le Boudec, Jean-Yves
    Jiang, Yuming
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (11) : 6879 - 6893
  • [9] 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
  • [10] Doncel J., 2020, Probability Eng. Inf. Sci., P1