Timeliness of wireless sensor networks with random multiple access

Abstract

In this paper, we consider a wireless sensor network in which N sensor nodes deliver the observed information of interest to a remote receiver by competing for a sharing channel through the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol or the slotted ALOHA protocol. For this network, we evaluate the information freshness of the two random multiple access protocols using the age of information (AoI) metric. In order to explicitly express the average AoI of the CSMA/CA based network, we establish an equivalent and tractable transmission model for the network, in which the transmission probabilities and the collision probabilities are assumed to be identical over time and among sensor nodes. For the slotted ALOHA based network, we derive the average AoI by focusing on a randomly chosen reference node. Our theoretical results show that 1) the transmission probability and collision probability of the two networks increase with both the arrival rate and the number of sensor nodes; 2) with the same transmission probability, the average AoI of the CSMA/CA based network is always smaller than that of the slotted ALOHA based network, no matter how the arrival rate and the number of nodes change. Our Monte Carlo simulation results also validate the correctness of our theoretical calculations.