Battle between Rate and Error in Minimizing Age of Information

by   Guidan Yao, et al.

In this paper, we consider a status update system, in which update packets are sent to the destination via a wireless medium that allows for multiple rates, where a higher rate also naturally corresponds to a higher error probability. The data freshness is measured using age of information, which is defined as the age of the recent update at the destination. A packet that is transmitted with a higher rate, will encounter a shorter delay and a higher error probability. Thus, the choice of the transmission rate affects the age at the destination. In this paper, we design a low-complexity scheduler that selects between two different transmission rate and error probability pairs to be used at each transmission epoch. This problem can be cast as a Markov Decision Process. We show that there exists a threshold-type policy that is age-optimal. More importantly, we show that the objective function is quasi-convex or non-decreasing in the threshold, based on to the system parameters values. This enables us to devise a low-complexity algorithm to minimize the age. These results reveal an interesting phenomenon: While choosing the rate with minimum mean delay is delay-optimal, this does not necessarily minimize the age.



page 1

page 2

page 3

page 4


When to Preempt? Age of Information Minimization under Link Capacity Constraint

In this paper, we consider a scenario where a source continuously monito...

To Skip or to Switch? Minimizing Age of Information under Link Capacity Constraint

Consider a scenario where a source continuously monitors an object and s...

Optimal Sampling and Scheduling for Timely Status Updates in Multi-source Networks

In this paper, we consider a joint sampling and transmission scheduling ...

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

Timely Synchronization with Sporadic Status Changes

In this paper, we consider a status updating system where the transmitte...

Optimizing Sampling for Data Freshness: Unreliable Transmissions with Random Two-way Delay

In this paper, we study a sampling problem, in which freshly sampled dat...

Age of Information Scaling in Large Networks with Hierarchical Cooperation

Given n randomly located source-destination (S-D) pairs on a fixed area ...
This week in AI

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