DeepAI AI Chat
Log In Sign Up

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


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...

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...

A Reinforcement Learning Framework for Optimizing Age-of-Information in RF-powered Communication Systems

In this paper, we study a real-time monitoring system in which multiple ...

Minimizing Age of Information via Scheduling over Heterogeneous Channels

In this paper, we investigate how to minimize the age of information whe...

Age-Optimal Multi-Channel-Scheduling under Energy and Tolerance Constraints

We study the optimal scheduling problem where n source nodes attempt to ...