Average Age Upon Decisions of Wireless Networks with Truncated HARQ in the Finite Blocklength Regime
We consider an update-and-decide IoT-based wireless network, where information packets generated from dual sources are co-stored in the transmitter's buffer, while decisions are made at the destination. Two practical assumptions about the communications between the transmitter and destination are taken into account: the communications are operating with finite blocklength (FBL) codes, and truncated hybrid automatic repeat request (HARQ) schemes are exploited to improve the FBL reliability, i.e., the number of allowed rounds of (re)transmissions is finite. For the first time, this paper characterizes the timeliness of status updates, namely age upon decisions (AuD) (which highlights the timeliness of the information at decisions in comparison to the concept of age of information), for such truncated HARQ-assisted wireless network. First, we characterize the inter-arrival time between two adjacent successfully transmitted packets, while taking into consideration the preemption policy and the randomness of the number of preempted packets from the same source. In particular, the probability density function, statistical performance of such inter-arrival time are derived. Following these characterizations, we propose a new approach to determine the average AuD and obtain a closed-form expression accordingly. Via simulations, we evaluate the performance and conclude a set of guidelines for designs on the considered network.
