TY - JOUR
T1 - Wireless scheduling for information freshness and synchrony
T2 - Drift-based design and heavy-traffic analysis
AU - Joo, Changhee
AU - Eryilmaz, Atilla
N1 - Funding Information:
Manuscript received December 14, 2017; revised June 20, 2018 and August 15, 2018; accepted August 30, 2018; approved by IEEE/ACM TRANS-ACTIONS ON NETWORKING Editor K. Jagannathan. Date of publication September 28, 2018; date of current version December 14, 2018. This work was supported in part by NRF under Grant NRF-2017R1E1A1A03070524, in part by IITP through the Korean Government (MSIT) under Grant 2017-0-00562 (UDP-Based Ultra Low-Latency Transport Protocol with Mobility Support), in part by NSF under Grants CCSS-EARS-1444026, CNS-NeTS-1514260, CNS-NeTS-1717045, CMMI-SMOR-1562065, CNS-SpecEES-1824337, and CNS-ICN-WEN-1719371, and in part by the DTRA under Grants HDTRA1-15-1-0003 and HDTRA1-18-1-0050. The work of A. Eryilmaz was supported by QNRF under Grant NPRP 7-923-2-344. This paper was presented at IEEE WiOpt’17 [1]. (Corresponding author: Changhee Joo.) C. Joo is with the Department of Electrical and Computer Engineering, Ulsan National Institute of Science and Technology, Ulsan 44919, South Korea (e-mail: cjoo@unist.ac.kr).
Publisher Copyright:
© 1993-2012 IEEE.
PY - 2018/12
Y1 - 2018/12
N2 - We consider the problem of scheduling in wireless networks with the aim of maintaining up-to-date and synchronized (also called, aligned) information at the receiver across multiple flows. This is in contrast to the more conventional approach of scheduling for optimizing long-term performance metrics such as throughput, fairness, or average delay. Maintaining the age of information at a low and roughly equal level is particularly important for distributed cyber-physical systems, in which the effectiveness of the control decisions depends critically on the freshness and synchrony of information from multiple sources/sensors. In this paper, we first expose the weakness of several popular MaxWeight scheduling solutions that utilize queue-length, delay, and age information as their weights. Then, we develop a novel age-based scheduler that combines age with the interarrival times of incoming packets in its decisions, which yields significant gains in the information freshness at the receiver. We characterize the performance of our strategy through a heavy-traffic analysis that establishes upper and lower bounds on the freshness of system information.
AB - We consider the problem of scheduling in wireless networks with the aim of maintaining up-to-date and synchronized (also called, aligned) information at the receiver across multiple flows. This is in contrast to the more conventional approach of scheduling for optimizing long-term performance metrics such as throughput, fairness, or average delay. Maintaining the age of information at a low and roughly equal level is particularly important for distributed cyber-physical systems, in which the effectiveness of the control decisions depends critically on the freshness and synchrony of information from multiple sources/sensors. In this paper, we first expose the weakness of several popular MaxWeight scheduling solutions that utilize queue-length, delay, and age information as their weights. Then, we develop a novel age-based scheduler that combines age with the interarrival times of incoming packets in its decisions, which yields significant gains in the information freshness at the receiver. We characterize the performance of our strategy through a heavy-traffic analysis that establishes upper and lower bounds on the freshness of system information.
KW - Age of information
KW - heavy-traffic analysis
KW - information freshness
KW - wireless scheduling
UR - http://www.scopus.com/inward/record.url?scp=85054349993&partnerID=8YFLogxK
U2 - 10.1109/TNET.2018.2870896
DO - 10.1109/TNET.2018.2870896
M3 - Article
AN - SCOPUS:85054349993
SN - 1063-6692
VL - 26
SP - 2556
EP - 2568
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 6
M1 - 8476220
ER -