在无线多址信道中,去中心化状态更新能否实现普遍接近最优的信息时代?

Zhiyuan Jiang, B. Krishnamachari, Sheng Zhou, Z. Niu
{"title":"在无线多址信道中,去中心化状态更新能否实现普遍接近最优的信息时代?","authors":"Zhiyuan Jiang, B. Krishnamachari, Sheng Zhou, Z. Niu","doi":"10.1109/ITC30.2018.00031","DOIUrl":null,"url":null,"abstract":"In an Internet-of-Things system where status data are collected from sensors and actuators for time-critical applications, the freshness of data is vital and can be quantified by the recently proposed age-of-information (AoI) metric. In this paper, we first consider a general scenario where multiple terminals share a common channel to transmit or receive randomly generated status packets. The optimal scheduling problem to minimize AoI is formulated as a restless multi-armed bandit problem. To solve the problem efficiently, we derive the Whittle's index in closed-form and establish the indexability thereof. Compared with existing work, we extend the index policy for AoI optimization to incorporate stochastic packet arrivals and optimal packet management (buffering the latest packet). Inspired by the index policy which has near-optimal performance but is centralized by nature, a decentralized status update scheme, i.e., the index-prioritized random access policy (IPRA), is further proposed, achieving universally near-optimal AoI performance and outperforming state-of-the-arts in the literature.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"71","resultStr":"{\"title\":\"Can Decentralized Status Update Achieve Universally Near-Optimal Age-of-Information in Wireless Multiaccess Channels?\",\"authors\":\"Zhiyuan Jiang, B. Krishnamachari, Sheng Zhou, Z. Niu\",\"doi\":\"10.1109/ITC30.2018.00031\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In an Internet-of-Things system where status data are collected from sensors and actuators for time-critical applications, the freshness of data is vital and can be quantified by the recently proposed age-of-information (AoI) metric. In this paper, we first consider a general scenario where multiple terminals share a common channel to transmit or receive randomly generated status packets. The optimal scheduling problem to minimize AoI is formulated as a restless multi-armed bandit problem. To solve the problem efficiently, we derive the Whittle's index in closed-form and establish the indexability thereof. Compared with existing work, we extend the index policy for AoI optimization to incorporate stochastic packet arrivals and optimal packet management (buffering the latest packet). Inspired by the index policy which has near-optimal performance but is centralized by nature, a decentralized status update scheme, i.e., the index-prioritized random access policy (IPRA), is further proposed, achieving universally near-optimal AoI performance and outperforming state-of-the-arts in the literature.\",\"PeriodicalId\":159861,\"journal\":{\"name\":\"2018 30th International Teletraffic Congress (ITC 30)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"71\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 30th International Teletraffic Congress (ITC 30)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITC30.2018.00031\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 30th International Teletraffic Congress (ITC 30)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITC30.2018.00031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 71

摘要

在物联网系统中,从传感器和执行器收集状态数据用于时间关键型应用,数据的新鲜度至关重要,可以通过最近提出的信息年龄(AoI)度量来量化。在本文中,我们首先考虑一个通用场景,其中多个终端共享一个公共通道来发送或接收随机生成的状态数据包。将AoI最小的最优调度问题表述为一个不宁多臂强盗问题。为了有效地解决这一问题,我们导出了封闭形式的惠特尔指数,并建立了其可索引性。与已有的工作相比,我们扩展了AoI优化的索引策略,将随机数据包到达和最优数据包管理(缓冲最新数据包)结合起来。受具有接近最优性能但本质上是中心化的索引策略的启发,进一步提出了一种分散的状态更新方案,即索引优先随机访问策略(index- priority random access policy, IPRA),实现了普遍接近最优的AoI性能,优于文献中最先进的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Can Decentralized Status Update Achieve Universally Near-Optimal Age-of-Information in Wireless Multiaccess Channels?
In an Internet-of-Things system where status data are collected from sensors and actuators for time-critical applications, the freshness of data is vital and can be quantified by the recently proposed age-of-information (AoI) metric. In this paper, we first consider a general scenario where multiple terminals share a common channel to transmit or receive randomly generated status packets. The optimal scheduling problem to minimize AoI is formulated as a restless multi-armed bandit problem. To solve the problem efficiently, we derive the Whittle's index in closed-form and establish the indexability thereof. Compared with existing work, we extend the index policy for AoI optimization to incorporate stochastic packet arrivals and optimal packet management (buffering the latest packet). Inspired by the index policy which has near-optimal performance but is centralized by nature, a decentralized status update scheme, i.e., the index-prioritized random access policy (IPRA), is further proposed, achieving universally near-optimal AoI performance and outperforming state-of-the-arts in the literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信