
The rapid growth of digitalization in recent years has resulted in billions of devices that interact with one another. As such, Internet of Things (IoT) networks receive great attention during the development of next-generation technologies. In many IoT applications, timely delivery of the information packets is crucial over which the performance of the network is evaluated. In recent years, there has been a growing interest in the optimization of Age of Information in random access channels with a great number of devices. In our research group, we have developed the following ALOHA variants to improve information freshness:
Threshold ALOHA
In 2020, we have proposed an age-aware modification on the slotted ALOHA policy [1]. We suggest that instead of having all the nodes eligible for transmission at any time, the age of the nodes shall be greater than a predetermined age threshold before being allowed to make a transmission through the channel. In [2], we have presented a complete analysis of this Threshold ALOHA policy and showed that the average age of information can be improved by 48% with respect to the slotted ALOHA.
Mini Slotted Threshold ALOHA (MiSTA)
Threshold ALOHA policy provides a great advancement over slotted ALOHA over information freshness; however, the performance of both policies is set back by the low throughput of e-1. Further reduction of age of information can be made possible by reworking the structure of the policy so that the throughput cap of slotted ALOHA can be exceeded. In MiSTA [3], we affix a mini slot to the time slots for control purposes. In the mini slot, the nodes that wish to use the channel send very small packets before transmitting the actual data, so that the event of a collision is predicted. MiSTA can transmit up to 0.53 packets per time slot and reduce average age of information by 63% compared to slotted Aloha.
Multiple Mini Slotted Threshold ALOHA (MuMiSTA)
In many of the IoT applications, the devices are at a relatively close proximity to the base station and the transmission delay dominates the round-trip time. In such cases, multiple mini slots can be used to fully benefit from the control sequence. In a practical scenario of 5 ms data slots and 10 μs mini slots, data slots can be utilized at a 95% rate. The average age of information is reduced by 79% compared to slotted ALOHA, achieving a very close level of performance to the theoretical upper limit of Round-Robin policy (centralized and by order).
The table below compares the performance improvements of aforementioned policies with respect to the slotted ALOHA.
Improvement w.r.t. Slotted ALOHA | Threshold ALOHA [1,3] | SAT [2] | MiSTA [4] | MuMiSTA [9] | Round Robin (theoretical limit) |
Spectral Efficiency gain | None | None | 43% | 140% | 171% |
Age reduction | 48% | 50% | 63% | 79% | 81% |
Avg. number of sources in Tx mode in a time slot | 0.90 | 0.36 | 0.61 (on avg.) | 0.98 (on avg.) | 1 |
Avg. number of sources in Rx mode in a time slot | 0.90 | n | 0.61 (on avg.) | 0.98 (on avg.) | 1 |
[1] D. C. Atabay, E. Uysal and O. Kaya, “Improving Age of Information in Random Access Channels,” IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2020.
[2] X. Chen, K. Gatsis, H. Hassani and S. S. Bidokhti, “Age of Information in Random Access Channels,” 2020 IEEE International Symposium on Information Theory (ISIT), 2020.
[3]O. T. Yavascan and E. Uysal, “Analysis of Slotted ALOHA With an Age Threshold,” in IEEE Journal on Selected Areas in Communications, vol. 39, no. 5, pp. 1456-1470, May 2021.
[4] M. Ahmetoglu, O. T. Yavascan and E. Uysal, “MiSTA: Threshold-ALOHA with Mini Slots,” 2021 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom), 2021.
[5] M Emrullah Ildiz, Semanur Avşar, Elif Uysal, “An inequality for query age of information and age of information“, Signal Processing and Communications Applications Conference (SIU), May 2022.
[6] Mutlu Ahmetoglu, Orhan Tahir Yavascan, Elif Uysal, “Mista: An age-optimized slotted aloha protocol“, IEEE Internet of Things Journal, May 2022.
[7] M Emrullah Ildiz, Orhan T Yavascan, Elif Uysal, O Tugberk Kartal, “Query age of information: Optimizing AoI at the right time“, 2022 IEEE International Symposium on Information Theory (ISIT), June 2022.
[8] Muratcan Ayik, Elif Tugce Ceran, Elif Uysal, “Optimization of aoii and qaoii in multi-user links“, EEE INFOCOM 2023-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), May 2023.
[9] O.T. Yavascan, M. Ahmetoglu and E. Uysal, MuMiSTA: An Age-Aware Reservation-Based Random Access Policy, MOSC (Modeling and Optimization for Semantic Communications) Workshop, (in conj. with WiOpt 2023), Singapore, August 2023.
[10] M Emrullah Ildiz, Orhan T Yavascan, Elif Uysal, O Tugberk Kartal, “Pull or wait: How to optimize query age of information“, IEEE Journal on Selected Areas in Information Theory, December 2023.
[11] O.T. Yavascan, U. Gurbuz, M. Ahmetoglu, E. Uysal, O. Gencay, A. Balci, DCCTA: Age of Information in Slotted ALOHA under Duty Cycle Constraints, ICNC 2024.
This paper analyzes the performance of an age-threshold-based random access policy for LP-Wan under duty cycle constraints inspired by LoRaWan. It numerically evaluates the performance under LoRa type B node constraints.
[12] O. Gencay, A. Balci, E.T. Ceran, E. Uysal, Ensuring a Semantically Effective IoT Network Through Blockchain with Delayed Feedback, ICNC, February 2024.
[13] A. Balci, B. Saatçi, E. Atak, E. Uysal, “Implementation of an AoI-Aware Wi-Fi Network,” IEEE Signal Processing and Communications Applications Conference (SIU), 2024.
[14] S. Baghaee, E.Uysal, “A3L-FEC: Age-Aware Application Layer Forward Error Correction Flow Control,” arXiv preprint arXiv:2410.05852 (2024).
[15] M Ahmetoglu, OT Yavascan, E Uysal, “Mini slotted random access protocol with an age threshold“, US Patent App. 18/684,694, 2024.
[16] Mevlüt Metin, Sude Özcan, Ayşe Betül Yıldırım, Sajjad Baghaee, Elif Uysal, “LoRaFRESH®: AoI Optimization in Duty Cycle-Constrained LoRa-Based IoT Networks“, Advanced Satellite Multimedia Systems Conference, ASMSC (2025)