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. We derive the closed-form Whittle Index formulation for a push-based multi-user network over unreliable channels with AoII-dependent cost functions. 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.
翻译:我们考虑一个网络,其中有多个源和一个基站,它们向远程客户端发送时间敏感的信息。错误信息的年龄(AoII)捕获了目的地状态更新包中信息的新鲜度。我们在具有AoII相关成本函数的不可靠信道上推出了基于射频多用户网络的闭式Whittle指数公式。我们还提出了一种新的针对拉式系统的语义性能指标,称为查询时错误信息的年龄(QAoII),该指标量化客户端生成查询时的特定瞬间的AoII。模拟结果表明,针对AoII和QAoII相关成本函数的Whittle指数调度策略比基准策略优越,并且采用查询感知调度可以显着提高单个用户或多个用户同时调度的情况下的及时性。