Skip to content
Preprint

Analysis and Optimization of Age of Information in Large-Scale Random Access Networks

Oct 2026 · 0 citations · 21 references
Computer Science

TL;DR

This paper develops a tractable analytical framework for analyzing and optimizing the Age of Information (AoI) and validate the proposed AoI analysis via extensive simulations, demonstrating a tight agreement between analysis and simulation.

Abstract

We consider a large-scale network where multiple nodes transmit time-sensitive information via a shared channel to a wireless base station using a Carrier-Sense Multiple Access (CSMA) protocol. In this network, packet transmissions from different nodes are interdependent, making it challenging to analyze and optimize information freshness, captured by the Age of Information (AoI) metric. In this paper, we develop a tractable analytical framework for analyzing and optimizing the AoI. By combining mean-field approximation with first return time and renewal reward analysis, the proposed approach provides a fast, tractable, and accurate AoI approximation that explicitly accounts for carrier sensing, enabling us to quickly find the network parameters that minimize AoI. Since the framework is built on a finite-state Markov representation of the CSMA protocol, it applies to a broad class of Random Access systems. As a concrete example, we study age-threshold CSMA protocols and derive closed-form or efficiently computable AoI approximations under different protocol settings. We validate the proposed AoI analysis via extensive simulations, demonstrating a tight agreement between analysis and simulation.

View source

Similar papers

Sep 2026

Joint Freshness and Age-Dispersion Control over Finite-State Markov Wireless Channels

Joint freshness and dispersion control for a generate-at-will status update link modeled as a finite-state Markov wireless channel is studied to minimize the long-run probability that either AoI or age dispersion exceeds a prescribed threshold under an average transmission rate constraint.

A. Dadlani, H. Tabassum, M. Senthil Kumar et al. · 0 citations
Preprint Oct 2026

Structure-Aware Online Optimization of the Age of Information with Unknown System Statistics

Timely information dissemination is essential in modern communication systems, where low informational latency is critical for networked control, monitoring, and real-time decision-making. The Age of Information (AoI) has emerged as a fundamental metric for quantifying information freshness at the receiver. A key chall...

Yoshiaki Inoue, M. Mandjes, L. Ravner · 0 citations
Open access Nov 2026

Adaptive Cost-Based Probabilistic Offloading for Wireless Networks

This paper investigates adaptive, cost-based probabilistic offloading between two coexisting wireless systems: a type-1 system and a type-2 system that opportunistically exploits idle type-1 resources. The coupled dynamics are modeled as a finite level-dependent quasi-birth–death (LD-QBD) process with explicit block st...

Shen-Sheng Tang · 0 citations
Preprint Nov 2026

Optimal Sampling and Transmission Policy for Information Freshness in Gossip Networks

We study the optimal sampling and transmission policies for a transmitter communicating with n gossiping receivers with the objective of tracking a source's status over time using a semantic freshness metric: Version Age of Information (VAoI). The transmitter observes the version changes in the source, and can acquire...

Irtiza Hasan, Ahmed M. Arafa · 0 citations
Open access 2026

Relationship between power and energy in random multiple access transmission with minimum average delay

For a long time, research into random multiple access proceeded along two independent lines: multiple access information theory and random multiple access theory. In recent years, studies combining these two approaches have begun to appear. However, existing literature typically fails to jointly address the relationshi...

A. Burkov, A. Turlikov · 0 citations

UvA-DARE (Digital Academic Repository) Importance sampling in rate-sharing networks

This work considers a network supporting elastic traffic, where the service capacity is shared among the various classes according to an alpha-fair sharing policy, and presents an IS algorithm to accelerate the simulation that is based on large deviations results.

Unknown authors · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.