Ying Wang, Shaohua Wu, J. Jiao, Ye Wang, Rongxing Lu, Qinyu Zhang
{"title":"Age-optimal Transmission Policy for Markov Source with Differential Encoding","authors":"Ying Wang, Shaohua Wu, J. Jiao, Ye Wang, Rongxing Lu, Qinyu Zhang","doi":"10.1109/GLOBECOM42002.2020.9348172","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a status update system, in which the source monitors a dynamic Markov process. The status updates are generated with a fixed rate, and delivered to the receiver over an unreliable channel instantaneously. The timeliness of the status updates is characterized by a recent metric, age of information (AoI). In this setting, error would occur in the transmission, deteriorating the reliability of updates. Thus, once an update is not decoded successfully, one should decide whether to retransmit the stale update or switch to transmit the newly generated one. Especially, differential encoding scheme is applied to the considered system to exploit the temporal correlations of the source. By differential encoding, each update can be actual or differential, based on the differential encoding level. To minimize the long-term average age, we formulate a Markov Decision Process (MDP). We prove that the optimal transmission policy has a threshold structure. We also show the existence of the optimal differential encoding level that minimizes the long-term average age under the optimal transmission policy. Numerical results are provided to validate our analytical results. Furthermore, numerical results show that the optimal differential encoding level is decreasing with higher erasure probability of the channel.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"9 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM42002.2020.9348172","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper, we consider a status update system, in which the source monitors a dynamic Markov process. The status updates are generated with a fixed rate, and delivered to the receiver over an unreliable channel instantaneously. The timeliness of the status updates is characterized by a recent metric, age of information (AoI). In this setting, error would occur in the transmission, deteriorating the reliability of updates. Thus, once an update is not decoded successfully, one should decide whether to retransmit the stale update or switch to transmit the newly generated one. Especially, differential encoding scheme is applied to the considered system to exploit the temporal correlations of the source. By differential encoding, each update can be actual or differential, based on the differential encoding level. To minimize the long-term average age, we formulate a Markov Decision Process (MDP). We prove that the optimal transmission policy has a threshold structure. We also show the existence of the optimal differential encoding level that minimizes the long-term average age under the optimal transmission policy. Numerical results are provided to validate our analytical results. Furthermore, numerical results show that the optimal differential encoding level is decreasing with higher erasure probability of the channel.
在本文中,我们考虑一个状态更新系统,其中源监控一个动态马尔可夫过程。状态更新以固定的速率生成,并通过不可靠的通道立即传递给接收者。状态更新的时效性由一个最新的度量标准来表征,即信息年龄(age of information, AoI)。在这种设置下,传输过程中会出现错误,从而降低更新的可靠性。因此,一旦更新没有成功解码,就应该决定是重新传输陈旧的更新还是切换到传输新生成的更新。特别地,在考虑的系统中采用差分编码方案来利用源的时间相关性。通过差分编码,基于差分编码级别,每次更新可以是实际的,也可以是差分的。为了最小化长期平均年龄,我们制定了马尔可夫决策过程(MDP)。我们证明了最优传输策略具有一个阈值结构。我们还证明了在最优传输策略下,存在使长期平均年龄最小的最优差分编码水平。数值结果验证了我们的分析结果。此外,数值结果表明,信道的擦除概率越高,最优差分编码电平越低。