论文标题
基于AOI的有限层安排,用于异质网络控制系统
AoI-based Finite Horizon Scheduling for Heterogeneous Networked Control Systems
论文作者
论文摘要
信息年龄(AOI)测量接收器的信息新鲜度。 AOI可以提供有关通信系统服务质量的见解。因此,它已被用作无线通信协议的跨层公制。在这项工作中,我们采用AOI来计算集中资源调度问题的惩罚功能。我们考虑通过多个异构控制系统共享的单个无线链接,每个子系系统都有时间变化的数据包损耗概率。子系统正在争夺网络资源,以提高其远程估计过程的准确性。为了应对无线链接的动态变化条件,我们定义了一个有限的地平线年龄最小化问题,并提出了一个调度程序,该调度程序通过在未来中查看$ h $插槽来做出最佳决策。拟议中的算法具有最差的复杂性,并以$ h $呈指数增长。但是,通过在受约束的动作集中缩小我们的搜索空间,我们能够显着降低复杂性而不会失去最优性。相反,我们通过模拟表明增加$ h $ w.r.t.的好处一定的$ h $值后,远程状态估计性能会降低。
Age of information (AoI) measures information freshness at the receiver. AoI may provide insights into quality of service in communication systems. For this reason, it has been used as a cross-layer metric for wireless communication protocols. In this work, we employ AoI to calculate penalty functions for a centralized resource scheduling problem. We consider a single wireless link shared by multiple, heterogeneous control systems where each sub-system has a time-varying packet loss probability. Sub-systems are competing for network resources to improve the accuracy of their remote estimation process. In order to cope with the dynamically changing conditions of the wireless link, we define a finite horizon age-penalty minimization problem and propose a scheduler that takes optimal decisions by looking $H$ slots into the future. The proposed algorithm has a worst-case complexity that grows exponentially with $H$. However, by narrowing down our search space within the constrained set of actions, we are able to decrease the complexity significantly without losing optimality. On the contrary, we show by simulations that the benefit of increasing $H$ w.r.t. remote state estimation performance diminishes after a certain $H$ value.