{"title":"Minimizing Age-of-Information in Heterogeneous Multi-Channel Systems: A New Partial-Index Approach","authors":"Yihan Zou, Kwang Taik Kim, Xiaojun Lin, M. Chiang","doi":"10.1145/3466772.3467030","DOIUrl":null,"url":null,"abstract":"We study how to schedule data sources in a wireless time-sensitive information system with multiple heterogeneous and unreliable channels to minimize the total expected Age-of-Information (AoI). Although one could formulate this problem as a discrete-time Markov Decision Process (MDP), such an approach suffers from the curse of dimensionality and lack of insights. For single-channel systems, prior studies have developed lower-complexity solutions based on the Whittle index. However, Whittle index has not been studied for systems with multiple heterogeneous channels, mainly because indexability is not well defined when there are multiple dual cost values, one for each channel. To overcome this difficulty, we introduce new notions of partial indexability and partial index, which are defined with respect to one channel's cost, given all other channels' costs. We then combine the ideas of partial indices and max-weight matching to develop a Sum Weighted Index Matching (SWIM) policy, which iteratively updates the dual costs and partial indices. The proposed policy is shown to be asymptotically optimal in minimizing the total expected AoI, under a technical condition on a global attractor property. Extensive performance simulations demonstrate that the proposed policy offers significant gains over conventional approaches by achieving a near-optimal AoI. Further, the notion of partial index is of independent interest and could be useful for other problems with multiple heterogeneous resources.","PeriodicalId":444729,"journal":{"name":"Proceedings of the Twenty-second International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Twenty-second International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3466772.3467030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
We study how to schedule data sources in a wireless time-sensitive information system with multiple heterogeneous and unreliable channels to minimize the total expected Age-of-Information (AoI). Although one could formulate this problem as a discrete-time Markov Decision Process (MDP), such an approach suffers from the curse of dimensionality and lack of insights. For single-channel systems, prior studies have developed lower-complexity solutions based on the Whittle index. However, Whittle index has not been studied for systems with multiple heterogeneous channels, mainly because indexability is not well defined when there are multiple dual cost values, one for each channel. To overcome this difficulty, we introduce new notions of partial indexability and partial index, which are defined with respect to one channel's cost, given all other channels' costs. We then combine the ideas of partial indices and max-weight matching to develop a Sum Weighted Index Matching (SWIM) policy, which iteratively updates the dual costs and partial indices. The proposed policy is shown to be asymptotically optimal in minimizing the total expected AoI, under a technical condition on a global attractor property. Extensive performance simulations demonstrate that the proposed policy offers significant gains over conventional approaches by achieving a near-optimal AoI. Further, the notion of partial index is of independent interest and could be useful for other problems with multiple heterogeneous resources.
研究了在具有多个异构和不可靠信道的无线时敏信息系统中,如何调度数据源以最小化总期望信息年龄(AoI)。尽管人们可以将这个问题表述为离散时间马尔可夫决策过程(MDP),但这种方法受到维度和缺乏洞察力的困扰。对于单通道系统,先前的研究基于Whittle指数开发了较低复杂性的解决方案。然而,Whittle指数尚未对具有多个异构通道的系统进行研究,主要是因为当存在多个双成本值时,索引性没有很好地定义,每个通道一个。为了克服这个困难,我们引入了部分索引和部分索引的新概念,它们是根据一个渠道的成本来定义的,给定所有其他渠道的成本。然后,我们将部分索引和最大权重匹配的思想结合起来,开发了一个和加权索引匹配(Sum Weighted Index matching, SWIM)策略,该策略迭代地更新双代价和部分索引。在全局吸引子性质的技术条件下,所提出的策略在最小化总期望AoI方面是渐近最优的。大量的性能模拟表明,通过实现接近最优的AoI,所提出的策略比传统方法提供了显着的增益。此外,部分索引的概念具有独立的意义,可以用于具有多个异构资源的其他问题。