TY - JOUR
T1 - Service Rate Allocation for Age of Information Minimization in a Dual-Sensor Monitor System
AU - Jia, Yunjian
AU - Jiang, Jianwen
AU - Chen, Zhengchuan
AU - Wang, Min
AU - Quek, Tony Q.S.
N1 - Funding Information:
This work was supported in part by the National Natural Science Foundation of China under Grant 62271092, Grant 61971077, and Grant 62001074; in part by the Fundamental Research Funds for the Central Universities under Project No. 2023CDJXY-037; in part by Project funded by Chongqing Postdoctoral Special Research Program Grant No. 2022XM2006; and in part by Opening Project of Guangxi Wireless Broadband Communication and Signal Processing Key Laboratory Grant No. GXKL06230206
Publisher Copyright:
© 2023 IEEE.
PY - 2023/8/1
Y1 - 2023/8/1
N2 - This work investigates the service rate allocation (SRA) for age of information (AoI) minimization in a dual-sensor monitor system where two sensors update status of two processes to a common monitor collaboratively. Both sensors sample and generate updates of the two processes by following a zero-wait discipline and transmit the updates to the monitor with exponentially distributed service times using service rate allocated to each process. Aiming at minimizing the maximal peak (average) AoI of the two processes, the optimal SRA problem is boiled down to a one-dimensional search in a short interval, which can be quickly found by bisection method. Accordingly, a closed-form suboptimal SRA is also proposed, where it requires the sensor with less service rate to monitor only one process. Numerical results validate the effectiveness of the suboptimal scheme in achieving the optimal AoI.
AB - This work investigates the service rate allocation (SRA) for age of information (AoI) minimization in a dual-sensor monitor system where two sensors update status of two processes to a common monitor collaboratively. Both sensors sample and generate updates of the two processes by following a zero-wait discipline and transmit the updates to the monitor with exponentially distributed service times using service rate allocated to each process. Aiming at minimizing the maximal peak (average) AoI of the two processes, the optimal SRA problem is boiled down to a one-dimensional search in a short interval, which can be quickly found by bisection method. Accordingly, a closed-form suboptimal SRA is also proposed, where it requires the sensor with less service rate to monitor only one process. Numerical results validate the effectiveness of the suboptimal scheme in achieving the optimal AoI.
UR - http://www.scopus.com/inward/record.url?scp=85161486309&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85161486309&partnerID=8YFLogxK
U2 - 10.1109/LCOMM.2023.3283279
DO - 10.1109/LCOMM.2023.3283279
M3 - Article
AN - SCOPUS:85161486309
SN - 1089-7798
VL - 27
SP - 2113
EP - 2117
JO - IEEE Communications Letters
JF - IEEE Communications Letters
IS - 8
ER -