Peak Age of Information Optimization of Slotted Aloha: FCFS Versus LCFS

Abstract

This paper aims at optimizing the Peak Age of Information (PAoI) performance of slotted Aloha networks with two representative data queue service disciplines, i.e., first-come first-served (FCFS) and last-come first-served (LCFS). Specifically, by assuming a unit-size buffer and Bernoulli packet arrivals, the average PAoI are derived and minimized by properly tuning the packet arrival rate and the channel access probability of each sensor. Depending on whether the packet arrival rate can be tuned or not, the individual optimization and joint optimization are both considered. The optimal system parameters and corresponding minimum PAoI are explicitly characterized. The analysis shows that in the joint optimization case, the PAoI linearly increases with the network scale and the minimum PAoI with LCFS is 16.8% lower than that with FCFS in the massive access scenario. Yet, for achieving such performance gain over FCFS, each sensor with LCFS should generate a new sample in each time slot, indicating soaring energy consumption due to the sampling operation. The analysis shows that the energy efficiency with LCFS is always lower than that with FCFS, and the gap keeps increasing with the number of sensors, which reveals a clear age-energy tradeoff in terms of service disciplines.