University of Oulu

A. Elgabli, H. Khan, M. Krouka and M. Bennis, "Reinforcement Learning Based Scheduling Algorithm for Optimizing Age of Information in Ultra Reliable Low Latency Networks," 2019 IEEE Symposium on Computers and Communications (ISCC), Barcelona, Spain, 2019, pp. 1-6, https://doi.org/10.1109/ISCC47284.2019.8969641

Reinforcement learning based scheduling algorithm for optimizing age of information in ultra reliable low latency networks

Saved in:
Author: Elgabli, Anis1; Khan, Hamza1; Krouka, Mounssif1;
Organizations: 1Center of Wireless Communications, University of Oulu, Oulu, Finland
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 0.6 MB)
Persistent link: http://urn.fi/urn:nbn:fi-fe2020040912063
Language: English
Published: IEEE Computer Society, 2019
Publish Date: 2020-04-09
Description:

Abstract

Age of Information (AoI) measures the freshness of the information at a remote location. AoI reflects the time that is elapsed since the generation of the packet by a transmitter. In this paper, we consider a remote monitoring problem (e.g., remote factory) in which a number of sensor nodes are transmitting time sensitive measurements to a remote monitoring site. We consider minimizing a metric that maintains a trade-off between minimizing the sum of the expected AoI of all sensors and minimizing an Ultra Reliable Low Latency Communication (URLLC) term. The URLLC term is considered to ensure that the probability the AoI of each sensor exceeds a predefined threshold is minimized. Moreover, we assume that sensors tolerate different threshold values and generate packets at different sizes. Motivated by the success of machine learning in solving large networking problems at low complexity, we develop a low complexity reinforcement learning based algorithm to solve the proposed formulation. We trained our algorithm using the state-of-the-art actor-critic algorithm over a set of public bandwidth traces. Simulation results show that the proposed algorithm outperforms the considered baselines in terms of minimizing the expected AoI and the threshold violation of each sensor.

see all

Series: IEEE Symposium on Computers and Communications proceedings
ISSN: 1530-1346
ISSN-L: 1530-1346
ISBN: 978-1-7281-2999-0
ISBN Print: 978-1-7281-3000-2
Pages: 1 - 6
Article number: 8969641
DOI: 10.1109/ISCC47284.2019.8969641
OADOI: https://oadoi.org/10.1109/ISCC47284.2019.8969641
Host publication: 2019 IEEE Symposium on Computers and Communications (ISCC)
Conference: IEEE Symposium on Computers and Communications
Type of Publication: A4 Article in conference proceedings
Field of Science: 213 Electronic, automation and communications engineering, electronics
Subjects:
AoI
Copyright information: © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.