Minimizing Age of Information in Non-orthogonal Random Access Networks

IEEE Internet of Things Journal(2024)

引用 0|浏览2
暂无评分
摘要
In this paper, we aim to minimize the age of information (AoI) for a random access internet of things (IoT) network, where AoI is a metric to measure the freshness of information delivery. Since non-orthogonal multiple access (NOMA) can improve network throughput and connectivity, we exploit an AoI-oriented NOMA-based random access scheme, wherein devices simultaneously access wireless channel over multiple power levels with different access probabilities when their AoIs is not smaller than a threshold. We firstly study the comprehensive steady-state analysis of an AoI-independent NOMA-based random access scheme, which is a special case when the threshold is one. The AoI evolution is formulated as a markov chain based on the analyzed transmission success probability, and the probabilities of AoI states and the achieved AoI under generate-at-will are derived. Then, an AoI minimization algorithm is proposed to optimize the power access probabilities. Concerning stochastic-arrival, the steady-state probabilities of devices’ active state, successful transmission, and number of active devices, are derived to analyze the expected AoI. Finally, the steady-state probabilities of AoI states and the achieved AoI of AoI-dependent NOMA-based scheme are obtained. Simulation results validate our analysis, and demonstrate the significant performance improvement in terms of AoI. In specific, the proposed scheme can achieve AoI reduction by 65%, compared with random access without NOMA.
更多
查看译文
关键词
Age of information,non-orthogonal multiple access,random access,saturated/non-saturated traffic
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要