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

Bo Zhou, Walid Saad|arXiv (Cornell University)|Jun 29, 2020

Age of Information Optimization36 references19 citations

TL;DR

This paper proposes a mean-field game (MFG)-based optimization framework for age of information (AoI) in ultra-dense IoT systems using CSMA-based uncoordinated channel access. It characterizes average and peak AoI under preemption and non-preemption service policies, proves existence and convergence of mean-field equilibrium, and shows that the MFG approach achieves lower AoI than fixed and dynamic baseline schemes, even with small device populations.

ABSTRACT

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.

Motivation & Objective

• To analyze the average and peak age of information (AoI) in ultra-dense IoT systems with uncoordinated CSMA-based channel access.
• To compare the performance of two packet management schemes—preemption in service versus no preemption—in terms of AoI metrics.
• To formulate a distributed noncooperative medium access control game where each device minimizes its AoI under energy cost constraints.
• To develop a mean-field game (MFG) approach to analyze the asymptotic equilibrium behavior in large-scale IoT systems.
• To validate the accuracy of the MFG framework and demonstrate its superiority over baseline schemes with fixed and dynamic waiting rates.

Proposed method

• Models an ultra-dense IoT system with a large number of devices contending for channel access via a CSMA protocol.
• Derives closed-form expressions for average AoI and average peak AoI under both preemption and non-preemption service policies.
• Proposes a noncooperative game where each device selects its waiting rate to minimize AoI subject to an average energy cost constraint.
• Applies mean-field game (MFG) theory to analyze the asymptotic equilibrium in the large-population limit, reducing the complexity of full-scale game-theoretic analysis.
• Establishes conditions for the existence, uniqueness, and convergence of the mean-field equilibrium (MFE) using contraction mapping and fixed-point analysis.
• Uses iterative learning to compute the MFE, where devices update their waiting rates based on the estimated fraction of busy channels.

Experimental results

Research questions

• RQ1 How does preemption in service affect the average and peak AoI in ultra-dense IoT systems with CSMA access?
• RQ2 What is the performance limit of AoI in ultra-dense IoT systems under uncoordinated CSMA access with random packet arrivals?
• RQ3 Can a mean-field game approach accurately approximate the equilibrium behavior of a large-scale, distributed AoI optimization game?
• RQ4 Does the optimal waiting rate in the MFE depend on the system's channel busy fraction and energy cost parameters?
• RQ5 How does the AoI behave as a function of the device arrival rate, and does it always decrease with increasing traffic?

Key findings

• The scheme with preemption in service achieves strictly lower average AoI and average peak AoI compared to the non-preemptive scheme.
• The mean-field game (MFG) framework accurately predicts system performance even for small numbers of devices, with simulation results validating its convergence and accuracy.
• The average AoI and average peak AoI under the mean-field equilibrium do not monotonically decrease with increasing device arrival rate, indicating a non-trivial trade-off.
• The MFG-based CSMA scheme outperforms three baseline schemes—two with fixed waiting rates and one with dynamic waiting rates—across all tested scenarios.
• Existence and uniqueness of the mean-field equilibrium (MFE) are proven under specific conditions on energy costs and system parameters.
• Convergence of the MFE is established via the contraction mapping theorem, showing that iterative learning of waiting rates converges to a stable equilibrium.