We introduce Mini Slotted 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. When a node with age above the threshold has data to send, it becomes active in the next time frame with a certain probability. The active node first transmits a short control sequence in a mini-slot 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 behaviour. 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 achievable throughput to approximately 53%, from the 37% achievable by Threshold ALOHA and regular slotted ALOHA.
翻译:我们引入了微软阈值ALOHA(MISTA),这是一个有时间档的ALOHA修改,目的是最大限度地减少整个网络的平均信息年龄(AoI)。在MISTA,其年龄低于某一阈值的来源保持沉默。当一个超过门槛值的节点需要数据发送时,它就会在下一个时间框架内以一定的概率活跃。主动节点首先在实际数据传输之前以一个小点传送一个短控制序列,如果发现碰撞,它就会以一定的概率后退。我们得出了活跃源数量的稳定分布并分析了其限制行为。我们表明,MISTA的概率会与一个“极限”的ALOHA相趋近,在“极限”的ALOHA中,处于稳定状态的活跃用户数量会调整到最优化的年龄。在最佳选择参数后,MISTA实现了A的缩放,比早先提议的源数(n,即0.9641n,这比ALHA政策有所改进(可能的最低缩幅为1.4169n),同时,通过可实现ALOA的定期递减幅数,从大约37页。