Variable-Length Stop-Feedback Coding for Minimum Age of Incorrect Information (2404.01276v5)
Abstract: The Age of Incorrect Information (AoII) is studied within the context of remote monitoring a Markov source using variable-length stop-feedback (VLSF) coding. Leveraging recent results on the non-asymptotic channel coding rate, we consider sources with small cardinality, where feedback is non-instantaneous as the transmitted information and feedback message have comparable lengths. We focus on the feedback sequence, i.e. the times of feedback transmissions, and derive AoII-optimal and delay-optimal feedback sequences. Our results showcase the impact of the feedback sequence on the AoII, revealing that a lower average delay does not necessarily correspond to a lower average AoII. We discuss the implications of our findings and suggest directions for coding scheme design.
- S. Kaul, R. Yates, and M. Gruteser, “Real-time status: How often should one update?” in 2012 Proceedings IEEE INFOCOM, 2012, pp. 2731–2735.
- R. D. Yates, Y. Sun, D. R. Brown, S. K. Kaul, E. Modiano, and S. Ulukus, “Age of information: An introduction and survey,” IEEE Journal on Selected Areas in Communications, vol. 39, no. 5, pp. 1183–1210, 2021.
- A. Maatouk, S. Kriouile, M. Assaad, and A. Ephremides, “The age of incorrect information: A new performance metric for status updates,” IEEE/ACM Transactions on Networking, vol. 28, no. 5, pp. 2215–2228, 2020.
- A. Maatouk, M. Assaad, and A. Ephremides, “Semantics-empowered communications through the age of incorrect information,” in ICC 2022 - IEEE International Conference on Communications, 2022, pp. 3995–4000.
- K. Bountrogiannis, A. Ephremides, P. Tsakalides, and G. Tzagkarakis, “Age of incorrect information with hybrid ARQ under a resource constraint for N-ary symmetric markov sources,” arXiv:2303.18128, 2023.
- S. Kriouile and M. Assaad, “Minimizing the age of incorrect information for unknown markovian source,” arXiv:2210.09681, 2022.
- Y. Chen and A. Ephremides, “Analysis of age of incorrect information under generic transmission delay,” in IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2023, pp. 1–8.
- Y. Polyanskiy, H. V. Poor, and S. Verdu, “Channel coding rate in the finite blocklength regime,” IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2307–2359, May 2010.
- ——, “Feedback in the non-asymptotic regime,” IEEE Transactions on Information Theory, vol. 57, no. 8, pp. 4903–4925, 2011.
- I. Papoutsidakis, R. J. Piechocki, and A. Doufexi, “An achievability bound for variable-length stop-feedback coding over the gaussian channel,” arXiv:2403.14360, 2024.
- H. Sac, T. Bacinoglu, E. Uysal-Biyikoglu, and G. Durisi, “Age-optimal channel coding blocklength for an m/g/1 queue with harq,” in 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2018, pp. 1–5.
- B. Yu, Y. Cai, D. Wu, and Z. Xiang, “Average age of information in short packet based machine type communication,” IEEE Transactions on Vehicular Technology, vol. 69, no. 9, pp. 10 306–10 319, 2020.
- M. Xie, J. Gong, X. Jia, and X. Ma, “Age and energy tradeoff for multicast networks with short packet transmissions,” IEEE Transactions on Communications, vol. 69, no. 9, pp. 6106–6119, 2021.
- R. Devassy, G. Durisi, G. C. Ferrante, O. Simeone, and E. Uysal-Biyikoglu, “Delay and peak-age violation probability in short-packet transmissions,” in 2018 IEEE International Symposium on Information Theory (ISIT), 2018, pp. 2471–2475.
- R. Devassy, G. Durisi, G. C. Ferrante, O. Simeone, and E. Uysal, “Reliable transmission of short packets through queues and noisy channels under latency and peak-age violation guarantees,” IEEE Journal on Selected Areas in Communications, vol. 37, no. 4, pp. 721–734, 2019.
- A. Ahmed, A. Al-Dweik, Y. Iraqi, H. Mukhtar, M. Naeem, and E. Hossain, “Hybrid automatic repeat request (HARQ) in wireless communications systems and standards: A contemporary survey,” IEEE Communications Surveys Tutorials, vol. 23, no. 4, pp. 2711–2752, 2021.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.