Volume 11 • Issue 1 • PP: 34–45 • 2027
Freshness–Transmission Trade-offs in Wireless Ad Hoc Communication: An Analysis of Age-Threshold Random Access
Open Access & Copyright
© 2027 The Author(s). Published by ASPG. This article is licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).
Abstract
Wireless ad hoc monitoring requires access rules that keep received information fresh without excessive contention. Age-threshold random access suppresses recently successful transmitters, but its performance depends on the transmission probability used after the silent interval. This study examines that dependence through renewal analysis and 1,280 reproducible simulation runs covering network size, independent erasures, correlated outages, and unequal link quality. Twenty independent replications are used per configuration. Exact slotted ALOHA and round-robin expressions provide implementation checks; a decoupling approximation links age, throughput, and transmission attempts for threshold access. At 50 peers and an independent erasure probability of 0.2, a silent interval of 50 slots with access probability 0.04 lowers mean age from 168.59 to 140.02 slots, while increasing attempts from 1.00 to 1.45 per slot. A longer silent interval of 100 slots combined with probability 0.08 raises mean age to 398.94 slots. Reducing that probability to 0.04 instead produces 101.46 slots and 0.84 attempts per slot. The results locate a collision-driven reversal that disappears from comparisons reporting only a preferred configuration. Correlated outages and link heterogeneity further show why mean age, deadline violations, and fairness require separate evaluation. The findings support joint threshold–probability selection within an explicit transmission budget. They apply to a synchronized, single collision domain with ideal acknowledgments; spatial reuse and multi-hop forwarding require further analysis.
Keywords
References
[1] Q. Abbas, S. A. Hassan, H. K. Qureshi, K. Dev, and H. Jung, “A comprehensive survey on age of informa-tion in massive IoT networks,” Computer Communica-tions, vol. 197, pp. 199–213, 2023.
[2] I. Kahraman, A. Köse, M. Koca, and E. Anarim, “Age of information in Internet of Things: A survey,” IEEE Internet of Things Journal, vol. 11, no. 6, pp. 9896–9914, 2024.
[3] F. Zhao, N. Pappas, C. Ma, X. Sun, T. Q. S. Quek, and H. H. Yang, “Age-threshold slotted ALOHA for optimiz-ing information freshness in mobile networks,” IEEE Transactions on Wireless Communications, vol. 23, no. 11, pp. 17 236–17 251, 2024.
[4] M. Moradian, A. Dadlani, A. Khonsari, and H. Tabas-sum, “Age-aware dynamic frame slotted ALOHA for machine-type communications,” IEEE Transactions on Communications, vol. 72, no. 5, pp. 2639–2654, 2024.
[5] S.-S. Tzeng, Y.-J. Lin, and S.-W. Wang, “Packet error-aware threshold ALOHA protocol in wireless networks,” Wireless Personal Communications, vol. 142, pp. 21–38, 2025.
[6] D. Fiems and A. Vinel, “Mean value analysis of the age of information in slotted ALOHA,” IEEE Communica-tions Letters, vol. 27, no. 10, pp. 2588–2592, 2023.
[7] D. Fiems and A. Vinel, “The age-of-information distri-bution in slotted ALOHA,” IEEE Access, vol. 12, pp. 159 462–159 472, 2024.
[8] J. Wang, J. Yu, X. Chen, L. Chen, C. Qiu, and J. An, “Age of information for frame slotted ALOHA,” IEEE Transactions on Communications, vol. 71, no. 4, pp. 2121–2135, 2023.
[9] Z. Yue, H. H. Yang, M. Zhang, and N. Pappas, “Age of information under frame slotted ALOHA-based status updating protocol,” IEEE Journal on Selected Areas in Communications, vol. 41, no. 7, pp. 2071–2089, 2023.
[10] A. Buratto, A. Munari, and L. Badia, “Strategic backoff of slotted ALOHA for minimal age of information,” IEEE Communications Letters, vol. 29, no. 1, pp. 155–159, 2025.
[11] F. Zhao, N. Pappas, M. Zhang, and H. H. Yang, “Age of information in random access networks with energy harvesting,” IEEE Journal on Selected Areas in Com-munications, vol. 43, no. 11, pp. 3813–3829, 2025.
[12] W. Fan, P. Fan, and Z. Ding, “On the throughput of NOMA-ALOHA in massive IoT with sparse active users,” IEEE Wireless Communications Letters, vol. 13, no. 3, pp. 582–586, 2024.
[13] Y. Zhu, Y. Zhu, A. Gong, Y. Lin, Y.-H. Lo, and Y. Zhang, “Age-gain-dependent random access for event-driven periodic updating,” IEEE Transactions on Communica-tions, vol. 73, no. 8, pp. 5774–5787, 2025.
Cite This Article
Choose your preferred format
Publisher's Note
The statements, opinions, and data presented in this article are solely those of the author(s) and do not necessarily represent those of ASPG, the journal, or its editors. ASPG and the editors disclaim responsibility for any harm arising from the use of any ideas, methods, instructions, or products described in this article, to the fullest extent permitted by applicable law.