A Reinforcement Learning Approach to Age of Information in Multi-User Networks with HARQ

by   Elif Tuğçe Ceran, et al.

Scheduling the transmission of time-sensitive information from a source node to multiple users over error-prone communication channels is studied with the goal of minimizing the long-term average age of information (AoI) at the users. A long-term average resource constraint is imposed on the source, which limits the average number of transmissions. The source can transmit only to a single user at each time slot, and after each transmission, it receives an instantaneous ACK/NACK feedback from the intended receiver, and decides when and to which user to transmit the next update. Assuming the channel statistics are known, the optimal scheduling policy is studied for both the standard automatic repeat request (ARQ) and hybrid ARQ (HARQ) protocols. Then, a reinforcement learning(RL) approach is introduced to find a near-optimal policy, which does not assume any a priori information on the random processes governing the channel states. Different RL methods including average-cost SARSAwith linear function approximation (LFA), upper confidence reinforcement learning (UCRL2), and deep Q-network (DQN) are applied and compared through numerical simulations



There are no comments yet.


page 1

page 2

page 3

page 4


A Reinforcement Learning Approach to Age of Information in Multi-User Networks

Scheduling the transmission of time-sensitive data to multiple users ove...

Learning to Minimize Age of Information over an Unreliable Channel with Energy Harvesting

The time average expected age of information (AoI) is studied for status...

MEETING BOT: Reinforcement Learning for Dialogue Based Meeting Scheduling

In this paper we present Meeting Bot, a reinforcement learning based con...

3-Competitive Policy for Minimizing Age of Information in Multi-Source M/G/1 Queuing Model

We consider a multi-source network with a common monitor, where fresh up...

A Reinforcement Learning Approach for the Multichannel Rendezvous Problem

In this paper, we consider the multichannel rendezvous problem in cognit...

Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints

In this paper, we study how to collect fresh data in time-varying networ...

Competitive Algorithms for Minimizing the Maximum Age-of-Information

In this short paper, we consider the problem of designing a near-optimal...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.