Query age of incorrect information in multi-user links

Date

2023-8

Author

Ayık, Muratcan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

104
views

57
downloads

Cite This

We consider a network with multiple sources and a base station that send time-sensitive information to remote clients. The age of incorrect information (AoII) captures the freshness of the informative pieces of status update packets at the destinations. Formulation of the AoII-based multi-user scheduling problem belongs to the family of restless multi-armed bandit (RMAB) problem. To solve the problem, we derive the closed-form Whittle index formulation for a push-based multi-user network over unreliable channels with AoII-dependent cost functions. We use a deep reinforcement learning approach to solve the RMAB problem when the system characteristics are unknown. We also propose a new semantic performance metric for pull-based systems, named the age of incorrect information at query (QAoII), that quantifies AoII at particular instants when clients generate queries. Simulation results demonstrate that the proposed Whittle index-based scheduling policies for both AoII and QAoII-dependent cost functions are superior to benchmark policies, and adopting query-aware scheduling can significantly improve the timeliness for scenarios where a single user or multiple users are scheduled at a time.

Subject Keywords

Age of incorrect information, Query age of incorrect information, Scheduling, Restless multi-amed bandits, Whittle index policies

URI

https://hdl.handle.net/11511/105463

Collections

Graduate School of Natural and Applied Sciences, Thesis