Optimal Scheduling Policy for Minimizing Age of Information with a Relay

09/06/2020
by   Jaeyoung Song, et al.
0

We consider IoT sensor network where multiple sensors are connected to corresponding destination nodes via a relay. Thus, the relay schedules sensors to sample and destination nodes to update. The relay can select multiple sensors and destination nodes in each time. In order to minimize average weighted sum AoI, joint optimization of sampling and updating policy of the relay is investigated. For errorless and symmetric case where weights are equally given, necessary and sufficient conditions for optimality is found. Using this result, we obtain that the minimum average sum AoI in a closed-form expression which can be interpreted as fundamental limit of sum AoI in a single relay network. Also, for error-prone and symmetric case, we have proved that greedy policy achieves the minimum average sum AoI at the destination nodes. For general case, we have proposed scheduling policy obtained via reinforcement learning.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2020

You Snooze, You Lose: Minimizing Channel-Aware Age of Information

We propose a variant of the Age of Information (AoI) metric called Chann...
research
07/06/2020

Optimizing Information Freshness in Two-Hop Status Update Systems under a Resource Constraint

This paper considers a two-hop status update system, in which an informa...
research
03/20/2023

Timely Status Update in Relay-Assisted Cooperative Communications

We investigate the age of information (AoI) of a relay-assisted cooperat...
research
05/07/2021

When an Energy-Efficient Scheduling is Optimal for Half-Duplex Relay Networks?

This paper considers a diamond network with interconnected relays, name...
research
08/18/2019

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 ...
research
09/28/2020

Partially Observable Minimum-Age Scheduling: The Greedy Policy

This paper studies the minimum-age scheduling problem in a wireless sens...
research
06/17/2020

Optimizing Information Freshness in Two-Way Relay Networks

In this paper, we investigate an amplify-and-forward (AF) based two-way ...

Please sign up or login with your details

Forgot password? Click here to reset