On the Timeliness of Radio Channel Access: Random Access or Scheduled Access?

We investigate the role of channel access schemes in enhancing the timeliness of status updates in sensor networks. Specifically, we model the large-scale sensor network as a Poisson cellular network and derive the network average age of information (AoI) under five different channel access schemes: slotted ALOHA, frame slotted ALOHA, random scheduling, round robin, and channel-aware. These schemes are categorized based on random vs. scheduled access and non-channel-aware vs. channel-aware. Our goal is to investigate when the additional overhead and complexity introduced by scheduling and channel state information (CSI) are beneficial, enabling better decisions in network design. Our findings reveal that the effectiveness of these schemes is influenced by the signal-to-interference ratio (SIR) decoding threshold, which often reflects the length of communication data. For short-packet communications, the performance differences among various channel access strategies are minimal, and the gains from scheduling are limited. Additionally, the inclusion of extra CSI does not yield performance improvements; in fact, some simple scheduling strategies, along with channelaware strategy that leverage CSI, may not outperform basic random access methods. Among the protocols we examined, the round robin scheme achieves the best performance. In contrast, scheduled access schemes exhibit a clear performance advantage in long-packet communications. Furthermore, the channel-aware scheme significantly enhances the network AoI performance, particularly in networks with higher transmitter competition.