Age-Aware Dynamic Frame Slotted ALOHA for Machine-Type Communications

TL;DR

The paper tackles timely information delivery in large IoT/MTC networks by introducing T-DFSA, an AoI-aware dynamic framing scheme for contention resolution. It develops both an ideal variant (with full knowledge of nodes’ age-gains) and a practical variant (with frame-by-frame learning of the age-gain distribution via four coordinated steps), demonstrating substantial AoI reductions compared to state-of-the-art thresholding and framing strategies. The key contributions include a rigorous four-step estimation procedure, stability considerations, and complexity analyses, supported by numerical results showing up to 65% AoI gains over optimal framed ALOHA and strong performance against TA, SAT, and AAT across varied arrival rates. The approach offers a scalable pathway to maintain data freshness in dense, energy-constrained IoT deployments, highlighting the value of centralized, AoI-informed frame control in random-access networks.

Abstract

Information aging has gained prominence in characterizing communication protocols for timely remote estimation and control applications. This work proposes an Age of Information (AoI)-aware threshold-based dynamic frame slotted ALOHA (T-DFSA) for contention resolution in random access machine-type communication networks. Unlike conventional DFSA that maximizes the throughput in each frame, the frame length and age-gain threshold in T-DFSA are determined to minimize the normalized average AoI reduction of the network in each frame. At the start of each frame in the proposed protocol, the common Access Point (AP) stores an estimate of the age-gain distribution of a typical node. Depending on the observed status of the slots, age-gains of successful nodes, and maximum available AoI, the AP adjusts its estimation in each frame. The maximum available AoI is exploited to derive the maximum possible age-gain at each frame and thus, to avoid overestimating the age-gain threshold, which may render T-DFSA unstable. Numerical results validate our theoretical analysis and demonstrate the effectiveness of the proposed T-DFSA compared to the existing optimal frame slotted ALOHA, threshold-ALOHA, and age-based thinning protocols in a considerable range of update generation rates.

Figures (12)

• Figure 1: System model with $N$ source nodes generating updates with probability $\lambda$ and transmitting them to a common AP over a shared medium.
• Figure 2: An example of $x_t^i$ and $y_t^i$ evolving over time under the T-DFSA protocol. The red arrows (with asterisk tails) represent instances when update packets are generated at node $i$, whereas the blue arrows (with bullet tails) represent instances when they are received at the AP.
• Figure 3: Flowchart of T-DFSA illustrating the four main steps given in Algorithm \ref{['alg1']}.
• Figure 4: Verification of (a) Lemma \ref{['lemma1']} where $N=20$, $M=4$, $n^0_t=4$, $n^1_t=1$, $n^2_t=n^3_t=6$, and $n^4_t=3$, and (b) Proposition \ref{['prop1']} where $\mathcal{S}_t=\{2,5\}$, $n^2_{t,s}=2$, $n^5_{t,s}=1$, $l=10$, and $w_t=10$.
• Figure 5: AAG comparison of T-DFSA with optimal FSA and TA protocols under varying packet arrival rates ($\lambda$) for $N = \{50, 100\}$.

Theorems & Definitions (13)

• Lemma 1
• proof
• Proposition 1
• proof
• Lemma 2
• proof
• Lemma 3
• proof
• Proposition 2
• proof