Information Aging Through Queues: A Mutual Information Perspective

Yin Sun, Benjamin Cyr
{"title":"Information Aging Through Queues: A Mutual Information Perspective","authors":"Yin Sun, Benjamin Cyr","doi":"10.1109/SPAWC.2018.8445873","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new measure for the freshness of information, which uses the mutual information between the real-time source value and the delivered samples at the receiver to quantify the freshness of the information contained in the delivered samples. Hence, the “aging” of the received information can be interpreted as a procedure that the above mutual information reduces as the age grows. In addition, we consider a sampling problem, where samples of a Markov source are taken and sent through a queue to the receiver. In order to optimize the freshness of information, we study the optimal sampling policy that maximizes the time-average expected mutual information. We prove that the optimal sampling policy is a threshold policy and find the optimal threshold exactly. Specifically, a new sample is taken once a conditional mutual information reduces to a threshold, and the threshold is equal to the optimum value of the time-average expected mutual information that is being maximized. Numerical results are provided to compare different sampling policies.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"396 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"64","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2018.8445873","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 64

Abstract

In this paper, we propose a new measure for the freshness of information, which uses the mutual information between the real-time source value and the delivered samples at the receiver to quantify the freshness of the information contained in the delivered samples. Hence, the “aging” of the received information can be interpreted as a procedure that the above mutual information reduces as the age grows. In addition, we consider a sampling problem, where samples of a Markov source are taken and sent through a queue to the receiver. In order to optimize the freshness of information, we study the optimal sampling policy that maximizes the time-average expected mutual information. We prove that the optimal sampling policy is a threshold policy and find the optimal threshold exactly. Specifically, a new sample is taken once a conditional mutual information reduces to a threshold, and the threshold is equal to the optimum value of the time-average expected mutual information that is being maximized. Numerical results are provided to compare different sampling policies.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过队列的信息老化:一个相互信息的视角
本文提出了一种新的信息新鲜度度量方法,即利用实时源值与接收端送出样品之间的互信息来量化送出样品中所含信息的新鲜度。因此,接收到的信息的“老化”可以理解为上述互信息随着年龄的增长而减少的过程。此外,我们还考虑了采样问题,其中马尔可夫源的样本通过队列发送到接收器。为了优化信息的新鲜度,我们研究了使时间平均期望互信息最大化的最优抽样策略。我们证明了最优抽样策略是一个阈值策略,并准确地找到了最优阈值。具体来说,一旦条件互信息减少到一个阈值,就会取一个新的样本,该阈值等于正在最大化的时间平均期望互信息的最优值。数值结果比较了不同的采样策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Neural Successive Cancellation Decoding of Polar Codes Analysis of Some Well-Rounded Lattices in Wiretap Channels Two-Way Full-Duplex MIMO with Hybrid TX-RX MSE Minimization and Interference Cancellation Minimum Energy Resource Allocation in FOG Radio Access Network with Fronthaul and Latency Constraints A Distance and Bandwidth Dependent Adaptive Modulation Scheme for THz Communications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1