TY - GEN
T1 - Analysis of AoI violation probability in wireless networks
AU - Song, Meiyan
AU - Yang, Howard H.
AU - Shan, Hangguan
AU - Lee, Jemin
AU - Lin, Huaming
AU - Quek, Tony Q.S.
N1 - Funding Information:
This work was supported in part by the National Key Research and Development Program of China under Grant 2018YFB1801104, in part by the National Natural Science Foundation Program of China (NSFC) under Grant 61771427, in part by the SUTD-ZJU IDEA Grant for Visiting Professor ZJUVP1800104. (Corresponding author: Huaming Lin.)
Publisher Copyright:
© 2021 IEEE
PY - 2021/9/6
Y1 - 2021/9/6
N2 - The rapid development of the Internet of Things has led to the rise of many real-time applications, which are highly dependent on timely information delivery to respond correctly to changes in the surrounding environment. Therefore, age of information (AoI) has aroused widespread attention as a new metric to evaluate information freshness at the destination. In this paper, we investigate the effect of the retransmission mechanism and updating patterns on the AoI performance. Different from the existing work that considers the average value of AoI, we adopt violation probability, the probability that AoI exceeds a certain threshold, as the metric for meeting the strict timeliness requirements of different applications. We obtain closed-form expressions of AoI violation probability for active sources and buffered sources under last-come-first-served discipline with packet discarding. The accuracy of the analyses is verified through simulations. Numerical results show that the buffered sources with periodic arrivals have better performance in terms of information freshness given service rate and updating rate.
AB - The rapid development of the Internet of Things has led to the rise of many real-time applications, which are highly dependent on timely information delivery to respond correctly to changes in the surrounding environment. Therefore, age of information (AoI) has aroused widespread attention as a new metric to evaluate information freshness at the destination. In this paper, we investigate the effect of the retransmission mechanism and updating patterns on the AoI performance. Different from the existing work that considers the average value of AoI, we adopt violation probability, the probability that AoI exceeds a certain threshold, as the metric for meeting the strict timeliness requirements of different applications. We obtain closed-form expressions of AoI violation probability for active sources and buffered sources under last-come-first-served discipline with packet discarding. The accuracy of the analyses is verified through simulations. Numerical results show that the buffered sources with periodic arrivals have better performance in terms of information freshness given service rate and updating rate.
UR - http://www.scopus.com/inward/record.url?scp=85118146510&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85118146510&partnerID=8YFLogxK
U2 - 10.1109/ISWCS49558.2021.9562141
DO - 10.1109/ISWCS49558.2021.9562141
M3 - Conference contribution
AN - SCOPUS:85118146510
T3 - Proceedings of the International Symposium on Wireless Communication Systems
BT - 2021 17th International Symposium on Wireless Communication Systems, ISWCS 2021
PB - VDE Verlag GmbH
T2 - 17th International Symposium on Wireless Communication Systems, ISWCS 2021
Y2 - 6 September 2021 through 9 September 2021
ER -