Age Analysis of Status Updating System with Probabilistic Packet Preemption
Open Access
Abstract
The age of information (AoI) metric was proposed to measure the freshness of messages obtained at the terminal node of a status updating system. In this paper, the AoI of a discrete time status updating system with probabilistic packet preemption is investigated by analyzing the steady state of a three-dimensional discrete stochastic process. We assume that the queue used in the system is , which represents that the system size is 2 and the packet in the buffer can be preempted by a fresher packet with probability . Instead of considering the system’s AoI separately, we use a three-dimensional state vector to simultaneously track the real-time changes of the AoI, the age of a packet in the server, and the age of a packet waiting in the buffer. We give the explicit expression of the system’s average AoI and show that the average AoI of the system without packet preemption is obtained by letting . When is set to 1, the mean of the AoI of the system with a queue is obtained as well. Combining the results we have obtained and comparing them with corresponding average continuous AoIs, we propose a possible relationship between the average discrete AoI with the queue and the average continuous AoI with the queue. For each of two extreme cases where and , we also determine the stationary distribution of AoI using the probability generation function (PGF) method. The relations between the average AoI and the packet preemption probability , as well as the AoI’s distribution curves in two extreme cases, are illustrated by numerical simulations. Notice that the probabilistic packet preemption may occur, for example, in an energy harvest (EH) node of a wireless sensor network, where the packet in the buffer can be replaced only when the node collects enough energy. In particular, to exhibit the usefulness of our idea and methods and highlight the merits of considering discrete time systems, in this paper, we provide detailed discussions showing how the results about continuous AoI are derived by analyzing the corresponding discrete time system and how the discrete age analysis is generalized to the system with multiple sources. In terms of packet service process, we also propose an idea to analyze the AoI of a system when the service time distribution is arbitrary.
Keywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (61901105, 62171119, BK20190343)
- Natural Science Foundation of Jiangsu Province (61901105, 62171119, BK20190343)
- Zhi Shan Young Scholar Program of Southeast University (61901105, 62171119, BK20190343)
This publication has 62 references indexed in Scilit:
- Age of Information: A New Concept, Metric, and ToolFoundations and Trends® in Networking, 2017
- Minimizing age-of-information in multi-hop wireless networks2017
- Age of information with a packet deadline2016
- On the Age of Information in Status Update Systems With Packet ManagementIEEE Transactions on Information Theory, 2016
- Effect of Message Transmission Path Diversity on Status AgeIEEE Transactions on Information Theory, 2015
- Age of information with packet management2014
- Probabilistic preemption control using frequency scaling for sporadic real-time tasks2012
- Status updates through queues2012
- Minimizing age of information in vehicular networks2011
- Modelling and analysis of stochastic hybrid systemsIEE Proceedings - Control Theory and Applications, 2006