Skip to content
Open access

Goal-Oriented Random Access: Optimizing Retransmissions for Age of Incorrect Information

2026 · IEEE Open Journal of the Communications Society · Vol 7, pp. 10083-10094 · 0 citations · 33 references
Computer Science

Abstract

This paper investigates the performance of uncoordinated medium access policies for Internet-of-Things (IoT) networks monitoring two-state Markov sources. Although recent literature demonstrates that reactive transmission strategies offer high energy efficiency, they suffer from severe performance degradation in terms of the Age of Incorrect Information (AoII) and missed detection probabilities due to channel collisions. Baseline Hybrid policies that complement reactive updates with steady-state transmissions can partially mitigate these errors, but they may waste energy and exacerbate contention by injecting updates even when state changes are sporadic. To overcome this limitation, we propose a replication-based (<inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula>-Rep) access scheme specifically targeted at the regime of sporadic state transitions. Furthermore, we mathematically derive the theoretically optimal burst size <inline-formula> <tex-math notation="LaTeX">$K^{*}$ </tex-math></inline-formula>, proving that it leads to an exponential asymptotic reduction in semantic error compared to the polynomial bounds of the baseline strategies. A truncated analysis of the <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula>-Rep scheme confirms that this burst-centric energy allocation complies with practical restrictions while still guaranteeing a lower average AoII and vastly outperforming the baseline Hybrid scheme in the sporadic regime. Finally, we establish the theoretical capacity limits and regime thresholds that dictate when steady-state updates become necessary. Based on these thresholds, we introduce a Generalized Hybrid <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula>-Rep scheme that dynamically adapts among pure <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula>-Rep, steady-state Hybrid, and Random access policies to maintain minimum AoII across all system dynamics and prevent congestion collapse.

Read PDF

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.