Application-Oriented Scheduling for Optimizing the Age of Correlated Information: A Deep-Reinforcement-Learning-Based Approach

被引:51
作者
Yin, Bo [1 ]
Zhang, Shuai [1 ]
Cheng, Yu [1 ]
机构
[1] IIT, Dept Elect & Comp Engn, Chicago, IL 60616 USA
基金
美国国家科学基金会;
关键词
Job shop scheduling; Internet of Things; Correlation; Machine learning; Real-time systems; Dynamic scheduling; Age of Information (AoI); deep reinforcement learning (DRL); information correlations; scheduling; THROUGHPUT;
D O I
10.1109/JIOT.2020.2996562
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recent advances in communications technologies and the proliferation of connected devices have spawned a variety of information-centric Internet-of-Things (IoT) systems, where timely information updating is normally required. Age of Information (AoI) has recently been introduced to quantify the freshness of the knowledge the controller has about the remote information sources. With the development of IoT applications, it is becoming increasingly common that the application-level services, e.g., status updates, rely on the timely delivery of fresh information from a number of information sources. In this article, we study the application-oriented scheduling for optimizing information freshness in the presence of correlated information sources. To this end, we adopt the concept of Age of Correlated Information (AoCI) and formulate the scheduling problem as an episodic Markov decision process (MDP) problem with an application-oriented policy. Given the complexity of the above problem, we develop a learning-based approach that not only leverages the emerging deep reinforcement learning (DRL) techniques but also exploits diverse-domain knowledge. The numerical results show that the proposed approach achieves better performance in terms of AoCI, compared to some typical baseline methods.
引用
收藏
页码:8748 / 8759
页数:12
相关论文
共 47 条
[1]  
[Anonymous], 2015, Tiny ImageNet Visual Recognition Challenge., DOI DOI 10.1109/ICCV.2015.123
[2]  
Bedewy AM, 2016, IEEE INT SYMP INFO, P2569, DOI 10.1109/ISIT.2016.7541763
[3]  
Ceran ET, 2018, 2018 IEEE 29TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC), P1967
[4]   A Systematic Study of Maximal Scheduling Algorithms in Multiradio Multichannel Wireless Networks [J].
Cheng, Yu ;
Li, Hongkun ;
Shila, Devu Manikantan ;
Cao, Xianghui .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (04) :1342-1355
[5]  
Chowdhury M, 2012, PROCEEDINGS OF THE 11TH ACM WORKSHOP ON HOT TOPICS IN NETWORKS (HOTNETS-XI), P31
[6]  
Costa M, 2014, IEEE INT SYMP INFO, P1583, DOI 10.1109/ISIT.2014.6875100
[7]  
Devin M., 2015, TensorFlow: Large-Scale Machine Learning on Heterogeneous Systems
[8]   Enabling Seamless Container Migration in Edge Platforms [J].
Elgazar, Ali E. ;
Harras, Khaled A. .
PROCEEDINGS OF THE 14TH WORKSHOP ON CHALLENGED NETWORKS (CHANTS '19):, 2019, :1-6
[9]   The dense k-subgraph problem [J].
Feige, U ;
Kortsarz, G ;
Peleg, D .
ALGORITHMICA, 2001, 29 (03) :410-421
[10]  
Glorot X., 2010, P 13 INT C ART INT S, P249, DOI DOI 10.1109/LGRS.2016.2565705