analyze age of information

Conventional Age of Information (AoI) analysis assumes zero initial age for update packets, neglecting non-negligible prior delays—introducing systematic bias in freshness evaluation. Method: We model AoI in a single-server queue with updates possessing non-zero initial age, leveraging queuing theory and stochastic processes to accommodate forwarding, tandem, and retransmission configurations. Contribution/Results: We derive the first general closed-form expression for average AoI incorporating an initial-age correction term; rigorously establish its upper and lower bounds; and prove that, under independent arrivals, the correction term scales linearly with initial age. Experimental validation on multi-stage tandem networks confirms tight bound convergence and demonstrates substantial improvement in AoI estimation accuracy—particularly critical for multi-hop communication and distributed sensing—thereby rectifying the inherent inaccuracy of the zero-initial-age assumption.

To address frequent Age-of-Information (AoI) violations in real-time data streams and the lack of AoI awareness in existing transport protocols, this paper proposes an application-layer, Age-Aware forward error correction (FEC)-based flow control mechanism built atop UDP. The mechanism jointly optimizes dynamic packet generation, FEC encoding, and adaptive retransmission—constituting the first practical, lightweight UDP extension that realizes theoretically optimal AoI minimization. Evaluated via co-simulation in Mininet-WiFi and MATLAB under representative wireless network conditions, the proposed scheme significantly reduces AoI violation rates compared to TCP-BBR and ACP+, while reliably satisfying end-to-end data freshness constraints. This work bridges a critical gap between AoI theory and deployable network protocol design.

In vehicular networks (IoV), conventional Age of Information (AoI) modeling suffers from inaccuracy due to dynamic channel conditions and high vehicle mobility, particularly under Doppler-induced channel errors and deterministic service delays. Method: This paper proposes the first joint D/M/1 and M/M/1 queueing model to jointly capture error-prone channel behavior (caused by Doppler shift) and deterministic service latency; it further introduces an environment-aware online data sampling rate adaptation algorithm that relaxes the ideal-channel assumption. Contribution/Results: Theoretical analysis and simulations demonstrate that the proposed hybrid model better reflects real-world vehicular communications, with D/M/1 significantly outperforming M/M/1 in AoI characterization. Under typical high-speed scenarios, the mechanism reduces average system AoI by up to 18.7%, validating the critical role of deterministic service modeling and adaptive transmission rate control in enhancing information freshness.

This work addresses dynamic update scheduling in energy-constrained wireless status update systems, aiming to jointly mitigate high-risk states characterized by elevated Age of Information (AoI), Query-based AoI (QAoI), and Age of Incorrect Information (AoII). We introduce the novel concept of “risk state”—defined as instances where age metrics exceed critical thresholds—and propose risk-state occurrence frequency as a new risk metric. To optimize update timing under this metric, we design two risk-sensitive strategies: (i) a prior-knowledge-based threshold-triggered policy, and (ii) a model-free enhanced Q-learning algorithm. Leveraging stochastic process modeling and risk-sensitive optimization, our approach achieves joint energy efficiency and risk control without compromising update fidelity. Numerical experiments demonstrate that the proposed methods significantly reduce the frequency of high-risk states while maintaining stringent update quality requirements.

This paper investigates the timeliness of status updates in energy-harvesting Internet-of-Things (IoT) networks employing Slotted ALOHA without feedback. The problem centers on jointly optimizing average Age of Information (AoI) and Age Violation Probability (AVP), complicated by stochastic battery dynamics and uncertain retransmissions due to the absence of ACK feedback. To address this, we propose a battery-aware adaptive transmission probability control scheme: it is the first to jointly model battery energy level and slot-level retransmission intervals, and integrates Successive Interference Cancellation (SIC) for multi-packet decoding to enhance concurrent reception capability. Using Markov chain modeling and analytical characterization of AoI and AVP, our approach achieves significant improvements—reducing both average AoI and AVP while boosting throughput by up to 37%—outperforming two baseline policies: “transmit whenever possible” and “transmit only when fully charged.”

Existing studies on version-aware age of information (VAoI) focus solely on its time-average, neglecting the full distribution—a critical limitation for characterizing content freshness and timeliness. This paper bridges that gap by systematically characterizing the steady-state distribution of VAoI in both single-hop and multi-hop networks. Leveraging queueing theory and stochastic processes, we derive closed-form expressions for the steady-state distribution and mean of VAoI under randomized, uniform, and threshold-based scheduling policies. We further propose the first analytically tractable method for optimal threshold design and rigorously prove the optimality of threshold policies in minimizing the VAoI distribution in the stochastic dominance sense. Our framework enables joint, fine-grained modeling of content novelty and timeliness, establishing a novel theoretical foundation and practical design principles for communication network scheduling aimed at optimizing data freshness.

This study addresses the lack of timeliness consistency in status update systems by introducing “age dispersion” as a novel metric, defined as the difference in age between the two most recently received updates, and generalizing it to a k-th order form. Leveraging an M/G/1/1 queueing model, the authors employ stochastic process analysis and mathematical modeling to establish, for the first time, an intrinsic relationship between age dispersion and k-th order Age of Information (AoI). The work not only characterizes the statistical properties of age dispersion but also expands the dimensional framework for evaluating information timeliness, thereby offering new theoretical foundations and optimization criteria for the design of status update systems.

This paper addresses the exact age-of-information (AoI) performance analysis in a discrete-time two-queue status update system, where generate-and-forward (GAW), discrete-phase-type (DPH) service times, and transmission freezing coexist—posing significant modeling challenges. We propose the first absorbing Markov chain model that explicitly captures the coupled impact of transmission freezing on queue dynamics and AoI evolution. Leveraging this model, we derive closed-form expressions for the exact distributions and arbitrary-order moments of AoI and peak AoI. Furthermore, we quantify the performance gains of freezing under representative service time distributions—including geometric, uniform, and triangular—revealing substantial reductions in average AoI. Our analysis demonstrates that heterogeneous server configurations and service-time statistics critically influence both the optimal freezing threshold and the magnitude of achievable gain. This work establishes the first rigorous analytical framework for AoI in low-latency status-aware systems incorporating transmission freezing.

This paper addresses the Age-of-Information (AoI) minimization problem in goal-oriented communication systems, jointly optimizing source sampling/processing costs and action execution error (CAE) constraints. To tackle the coupled challenges of dynamically evolving environmental states, semantic distortion costs, and unreliable transmission, we propose the first joint AoI–CAE optimization framework. We model the environment as a discrete-time Markov chain and integrate reliability-aware signal processing with unreliable channel transmission. Theoretical analysis reveals fundamental trade-offs among AoI, processing overhead, and CAE, leading to a static randomized policy with provable performance guarantees. Numerical experiments demonstrate that the proposed policy achieves near-optimal AoI across diverse parameter regimes, explicitly characterizing system feasibility boundaries and the structural properties of near-optimal policies.

This paper addresses the age-of-information (AoI)-minimization problem in single-source multi-server status update systems, where dynamic server selection is performed under transmission cost constraints. We propose a novel discrete-time multi-regime absorbing Markov chain (MR-AMC) analytical framework, enabling the first exact characterization of the steady-state AoI distribution and the joint cost (AoI penalty plus transmission cost). Leveraging phase-type (DPH) service time modeling and a multi-threshold decision policy, we derive a closed-form expression for the constrained bi-objective optimization cost. Optimal multi-threshold policies are obtained via exhaustive search for small-scale systems. Numerical results demonstrate that the proposed policy significantly outperforms static or random server selection schemes. Our work establishes a new analytically tractable and optimization-enabled paradigm for AoI-driven real-time communication resource scheduling.