TY - JOUR
T1 - Minimizing Age of Information in Nonorthogonal Random Access Networks
AU - Liu, Yong
AU - Cai, Lin X.
AU - Chen, Qingchun
AU - Zhang, Han
AU - Hou, Fen
AU - Luan, Tom H.
N1 - Publisher Copyright:
© 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
PY - 2024
Y1 - 2024
N2 - —In this article, 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 nonorthogonal 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 first 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 the 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.
AB - —In this article, 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 nonorthogonal 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 first 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 the 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.
KW - Age of Information (AoI)
KW - nonorthogonal multiple access (NOMA)
KW - random access
KW - saturated/nonsaturated traffic
UR - https://www.scopus.com/pages/publications/85190330549
U2 - 10.1109/JIOT.2024.3388019
DO - 10.1109/JIOT.2024.3388019
M3 - 文章
AN - SCOPUS:85190330549
SN - 2327-4662
VL - 11
SP - 24886
EP - 24902
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
IS - 14
ER -