Abstract

In this paper, we study a slotted-time system where a base station needs to update multiple users at the same time. Due to the limited resources, only part of the users can be updated in each time slot. We consider the problem of minimizing the Age of Incorrect Information (AoII) when imperfect Channel State Information (CSI) is available. Leveraging the notion of the Markov Decision Process (MDP), we obtain the structural properties of the optimal policy. By introducing a relaxed version of the original problem, we develop the Whittle’s index policy under a simple condition. However, indexability is required to ensure the existence of Whittle’s index. To avoid indexability, we develop Indexed priority policy based on the optimal policy for the relaxed problem. Finally, numerical results are laid out to showcase the application of the derived structural properties and highlight the performance of the developed scheduling policies.

Highlights

  • Scheduling to Minimize Age ofThe Age of Incorrect Information (AoII) is introduced in [1] as a combination of agebased metrics (e.g., Age of Information (AoI)) and error-based metrics (e.g., MinimumMean Square Error)

  • We provide the expected average AoII achieved by the Indexed priority policy and Whittle’s index policy when M = 1

  • The resulting expected average AoII is obtained via simulations

Read more

Summary

Introduction

The Age of Incorrect Information (AoII) is introduced in [1] as a combination of agebased metrics (e.g., Age of Information (AoI)) and error-based metrics AoII captures the information mismatch between the source and the destination and the aging process of inconsistent information. By adopting different time penalty functions, AoII can capture different aging processes of the mismatch in different systems. The authors of [4] study the problem of minimizing the AoII that takes the general time penalty function. We consider the problem of minimizing AoII in scheduling. Different from [6], we consider the generic time penalty function and study the minimization problem in the presence of imperfect Channel State Information (CSI). The scheduling problems with the goal of minimizing an error-based performance measure are considered in [14,15,16].

Communication Model
Age of Incorrect Information
System Dynamic
Problem Formulation
Structural Properties of the Optimal Policy
Whittle’s Index Policy
Relaxed Problem
Decoupled Model
Indexability
Optimal Policy for Relaxed Problem
Optimal Policy for Single User
Optimal Policy for RP
Indexed Priority Policy
Primal-Dual Heuristic
Numerical Results
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call