TY - JOUR
T1 - AoI and PAoI in the IoT-based Multi-Source Status Update System
T2 - Violation Probabilities and Optimal Arrival Rate Allocation
AU - Zhang, Tianci
AU - Chen, Shutong
AU - Chen, Zhengchuan
AU - Tian, Zhong
AU - Jia, Yunjian
AU - Wang, Min
AU - Wu, Dapeng Oliver
PY - 2023/12/1
Y1 - 2023/12/1
N2 - Abundant real-time applications over Internet of things (IoT) have imperative demands on timely information. Compared to average age of information (AoI), distribution of AoI characterizes the timeliness in more details. This paper studies the timeliness of an IoT-based multi-source status update system. By modeling the system as a multi-source M/G/1/1 bufferless preemptive queue, general formulas of violation probabilities and probability density functions (p.d.f.s) of AoI and PAoI are derived based on a time-domain approach. For the case with exponentially distributed service time, the violation probabilities and p.d.f.s are obtained in closed form. To fully characterize the overall timeliness of the multi-source system, the maximal violation probabilities of AoI and PAoI are proposed. To improve the overall timeliness under the resource constraint of IoT device, the arrival rate allocation is optimized to control the maximal violation probabilities. It is proved that the optimal arrival rates can be found by convex optimization. In particular, we show that the minimum of maximal violation probability of AoI (PAoI) is achieved only if all violation probabilities of AoI (PAoI) are equal. Finally, numerical results verify the theoretical analysis and show the effectiveness of the arrival rate allocation in improving the overall timeliness. © 2023 IEEE
AB - Abundant real-time applications over Internet of things (IoT) have imperative demands on timely information. Compared to average age of information (AoI), distribution of AoI characterizes the timeliness in more details. This paper studies the timeliness of an IoT-based multi-source status update system. By modeling the system as a multi-source M/G/1/1 bufferless preemptive queue, general formulas of violation probabilities and probability density functions (p.d.f.s) of AoI and PAoI are derived based on a time-domain approach. For the case with exponentially distributed service time, the violation probabilities and p.d.f.s are obtained in closed form. To fully characterize the overall timeliness of the multi-source system, the maximal violation probabilities of AoI and PAoI are proposed. To improve the overall timeliness under the resource constraint of IoT device, the arrival rate allocation is optimized to control the maximal violation probabilities. It is proved that the optimal arrival rates can be found by convex optimization. In particular, we show that the minimum of maximal violation probability of AoI (PAoI) is achieved only if all violation probabilities of AoI (PAoI) are equal. Finally, numerical results verify the theoretical analysis and show the effectiveness of the arrival rate allocation in improving the overall timeliness. © 2023 IEEE
KW - Age of information
KW - Internet of Things
KW - Internet of things
KW - multi-source status update system
KW - Resource management
KW - Sensors
KW - Time-domain analysis
KW - Transmitters
KW - violation probability
KW - Wireless communication
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=85166755342&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85166755342&origin=recordpage
U2 - 10.1109/JIOT.2023.3297617
DO - 10.1109/JIOT.2023.3297617
M3 - RGC 21 - Publication in refereed journal
SN - 2327-4662
VL - 10
SP - 20617
EP - 20632
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
IS - 23
ER -