Age-Optimal Transmission of Rateless Codes in an Erasure Channel
Songtao Feng, Jing Yang

TL;DR
This paper studies how to optimally transmit rateless coded updates over an erasure channel to minimize the Age of Information, using a Markov Decision Process to derive a threshold-based transmission policy.
Contribution
It formulates the AoI minimization as an MDP for rateless coding over erasure channels and proves the optimal policy has a monotonic threshold structure.
Findings
Optimal policy has a threshold structure.
Numerical results confirm the policy's effectiveness.
The approach improves information freshness in erasure channels.
Abstract
In this paper, we examine a status updating system where updates generated by the source are sent to the monitor through an erasure channel. We assume each update consists of symbols and the symbol erasure in each time slot follows an independent and identically distributed (i.i.d.) Bernoulli process. We assume rateless coding scheme is adopted at the transmitter and an update can be successfully decoded if coded symbols are received successfully. We assume perfect feedback available at the source, so that it knows whether a transmitted symbol has been erased instantly. Then, at the beginning of each time slot, the source has the choice to start transmitting a new update, or continue with the transmission of the previous update if it is not delivered yet. We adopt the metric "Age of Information" (AoI) to measure the freshness of information at the destination, where the AoI is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAge of Information Optimization · Congenital Heart Disease Studies · Cognitive Functions and Memory
