Age-Aware Random Access for Large-Scale Internet of Things Under Strict Delivery Deadline

This paper considers minimizing the age of information (AoI) of large-scale networks with periodic traffic and packet deadlines under an age-aware random access protocol, accounting for the spatial distributions of transmitter-receiver pairs and the mutual interference under age-aware behaviors. We develop a nested Markov chain model to characterize such behaviors, which manages the jumps between consecutive beginnings of periods and the evolution during an arbitrary period. Based on this model, we derive the network average AoI using tools from stochastic geometry. Numerical results verify our analytical findings and demonstrate the benefit of the age awareness.