TY - GEN
T1 - Random Access with and without Sensing in Non-Terrestrial Networks for Timely Updates
AU - Wu, Yuchen
AU - Wu, Shaohua
AU - Zhang, Lingyan
AU - Jiao, Jian
AU - Zhang, Ning
AU - Zhang, Qinyu
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/6
Y1 - 2021/6
N2 - The growing boom in time-critical applications such as remote sensing and monitoring has made low latency of information an important requirement. Age of information (AoI) has been proposed to measure the freshness of information from the receiver side. In this paper, we analyze that multiple sources transmit their status packets to a remote controller for timely updates. Characterized by long transmission distances, satellite networks are commonly using Aloha as a random access protocol by preconceiving channel sensing is low efficient. Yet, for some non-terrestrial networks where the propagation delay is comparable to the transmission time, the performance comparison between Aloha and CSMA requires more detailed consideration. By building the node-centric discrete-time Markov chain, we quantify the performance of Aloha and CSMA on AoI and give the performance break-even point. Only when the ratio of propagation delay to transmission time is larger than this point, Aloha performs better on the timeliness metric. Furthermore, we derive the optimal attempt probability of CSMA to achieve the lowest latency. In the end, simulation results confirmed the validity of the theoretical analysis.
AB - The growing boom in time-critical applications such as remote sensing and monitoring has made low latency of information an important requirement. Age of information (AoI) has been proposed to measure the freshness of information from the receiver side. In this paper, we analyze that multiple sources transmit their status packets to a remote controller for timely updates. Characterized by long transmission distances, satellite networks are commonly using Aloha as a random access protocol by preconceiving channel sensing is low efficient. Yet, for some non-terrestrial networks where the propagation delay is comparable to the transmission time, the performance comparison between Aloha and CSMA requires more detailed consideration. By building the node-centric discrete-time Markov chain, we quantify the performance of Aloha and CSMA on AoI and give the performance break-even point. Only when the ratio of propagation delay to transmission time is larger than this point, Aloha performs better on the timeliness metric. Furthermore, we derive the optimal attempt probability of CSMA to achieve the lowest latency. In the end, simulation results confirmed the validity of the theoretical analysis.
KW - Age of information
KW - non-terrestrial networks
KW - propagation delay
KW - random access
UR - https://www.scopus.com/pages/publications/85115712086
U2 - 10.1109/ICC42927.2021.9500930
DO - 10.1109/ICC42927.2021.9500930
M3 - 会议稿件
AN - SCOPUS:85115712086
T3 - IEEE International Conference on Communications
BT - ICC 2021 - IEEE International Conference on Communications, Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 IEEE International Conference on Communications, ICC 2021
Y2 - 14 June 2021 through 23 June 2021
ER -