MiSTA: An Age-Optimized Slotted ALOHA Protocol

被引:22
作者
Ahmetoglu, Mutlu [1 ]
Yavascan, Orhan Tahir [1 ]
Uysal, Elif [1 ]
机构
[1] Middle East Tech Univ, Dept Elect & Elect Engn, TR-06800 Ankara, Turkey
关键词
Age of information (AoI); minislots; random access; slotted ALOHA; stabilized ALOHA; threshold ALOHA (TA); threshold policy; RANDOM-ACCESS; INFORMATION;
D O I
10.1109/JIOT.2022.3179132
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We introduce minislotted threshold ALOHA (MiSTA), a slotted ALOHA modification designed to minimize the network-wide time average Age of Information (AoI). In MiSTA, sources whose ages are below a certain threshold stay silent. A node with the age above the threshold becomes active in the next time frame with a certain probability. The active node first transmits a short control sequence in a minislot ahead of actual data transmission, and if collision is sensed, it backs off with a certain probability. We derive the steady-state distribution of the number of active sources and analyze its limiting behavior. We show that MiSTA probabilistically converges to a "thinned" slotted ALOHA, where the number of active users at steady state adjusts to optimize age. With an optimal selection of parameters, MiSTA achieves an AoI scaling with the number of sources, n, as 0.9641n, which is an improvement over the threshold ALOHA policy proposed earlier (for which the lowest possible scaling is 1.4169n). While achieving this reduction in age, MiSTA also increases the theoretically achievable throughput to approximately 53 %, from the 37% achievable by threshold ALOHA and regular slotted ALOHA.
引用
收藏
页码:15484 / 15496
页数:13
相关论文
共 23 条
[1]  
Altman E, 2011, Arxiv, DOI arXiv:1009.4733
[2]  
Atabay DC, 2020, IEEE CONF COMPUT, P912, DOI 10.1109/INFOCOMWKSHPS50562.2020.9163053
[3]  
Chen H, 2020, Arxiv, DOI arXiv:2001.04780
[4]  
Chen X., 2019, arXiv
[5]   Age of Information of SIC-Aided Massive IoT Networks With Random Access [J].
Grybosi, Jorge Felipe ;
Rebelatto, Joao Luiz ;
Moritz, Guilherme Luiz .
IEEE INTERNET OF THINGS JOURNAL, 2022, 9 (01) :662-670
[6]  
Han ZX, 2020, IEEE IND ELEC, P4374, DOI [10.1109/iecon43393.2020.9254614, 10.1109/IECON43393.2020.9254614]
[7]   A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues [J].
Inoue, Yoshiaki ;
Masuyama, Hiroyuki ;
Takine, Tetsuya ;
Tanaka, Toshiyuki .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (12) :8305-8324
[8]  
Jiang ZY, 2018, Arxiv, DOI arXiv:1801.03975
[9]  
Kadota I., 2021, PROC IEEE C COMPUT C, P1
[10]  
Kaul S, 2012, IEEE INFOCOM SER, P2731, DOI 10.1109/INFCOM.2012.6195689