Age-Optimal Transmission of Rateless Codes in an Erasure Channel

Songtao Feng, Jing Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 k 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 k 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 defined as the age of the latest decoded update at the destination. Our objective is to design an optimal online transmission scheme to minimize the time-average AoI. The transmission decision is based on the instantaneous AoI, the age of the update being transmitted, as well as the number of successfully delivered symbols of the update. We formulate the problem as a Markov Decision Process (MDP) and identify the monotonic threshold structure of the optimal policy. Numerical results corroborate the structural properties of the optimal solution.

Original languageEnglish (US)
Title of host publication2019 IEEE International Conference on Communications, ICC 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538680889
DOIs
StatePublished - May 1 2019
Event2019 IEEE International Conference on Communications, ICC 2019 - Shanghai, China
Duration: May 20 2019May 24 2019

Publication series

NameIEEE International Conference on Communications
Volume2019-May
ISSN (Print)1550-3607

Conference

Conference2019 IEEE International Conference on Communications, ICC 2019
CountryChina
CityShanghai
Period5/20/195/24/19

Fingerprint

Structural properties
Transmitters
Feedback
Optimal design

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Feng, S., & Yang, J. (2019). Age-Optimal Transmission of Rateless Codes in an Erasure Channel. In 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings [8761668] (IEEE International Conference on Communications; Vol. 2019-May). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2019.8761668
Feng, Songtao ; Yang, Jing. / Age-Optimal Transmission of Rateless Codes in an Erasure Channel. 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. (IEEE International Conference on Communications).
@inproceedings{3caf77e615304620b4b5faec96be4cd5,
title = "Age-Optimal Transmission of Rateless Codes in an Erasure Channel",
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 k 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 k 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 defined as the age of the latest decoded update at the destination. Our objective is to design an optimal online transmission scheme to minimize the time-average AoI. The transmission decision is based on the instantaneous AoI, the age of the update being transmitted, as well as the number of successfully delivered symbols of the update. We formulate the problem as a Markov Decision Process (MDP) and identify the monotonic threshold structure of the optimal policy. Numerical results corroborate the structural properties of the optimal solution.",
author = "Songtao Feng and Jing Yang",
year = "2019",
month = "5",
day = "1",
doi = "10.1109/ICC.2019.8761668",
language = "English (US)",
series = "IEEE International Conference on Communications",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2019 IEEE International Conference on Communications, ICC 2019 - Proceedings",
address = "United States",

}

Feng, S & Yang, J 2019, Age-Optimal Transmission of Rateless Codes in an Erasure Channel. in 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings., 8761668, IEEE International Conference on Communications, vol. 2019-May, Institute of Electrical and Electronics Engineers Inc., 2019 IEEE International Conference on Communications, ICC 2019, Shanghai, China, 5/20/19. https://doi.org/10.1109/ICC.2019.8761668

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

2019 IEEE International Conference on Communications, ICC 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. 8761668 (IEEE International Conference on Communications; Vol. 2019-May).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Age-Optimal Transmission of Rateless Codes in an Erasure Channel

AU - Feng, Songtao

AU - Yang, Jing

PY - 2019/5/1

Y1 - 2019/5/1

N2 - 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 k 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 k 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 defined as the age of the latest decoded update at the destination. Our objective is to design an optimal online transmission scheme to minimize the time-average AoI. The transmission decision is based on the instantaneous AoI, the age of the update being transmitted, as well as the number of successfully delivered symbols of the update. We formulate the problem as a Markov Decision Process (MDP) and identify the monotonic threshold structure of the optimal policy. Numerical results corroborate the structural properties of the optimal solution.

AB - 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 k 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 k 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 defined as the age of the latest decoded update at the destination. Our objective is to design an optimal online transmission scheme to minimize the time-average AoI. The transmission decision is based on the instantaneous AoI, the age of the update being transmitted, as well as the number of successfully delivered symbols of the update. We formulate the problem as a Markov Decision Process (MDP) and identify the monotonic threshold structure of the optimal policy. Numerical results corroborate the structural properties of the optimal solution.

UR - http://www.scopus.com/inward/record.url?scp=85070238984&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85070238984&partnerID=8YFLogxK

U2 - 10.1109/ICC.2019.8761668

DO - 10.1109/ICC.2019.8761668

M3 - Conference contribution

AN - SCOPUS:85070238984

T3 - IEEE International Conference on Communications

BT - 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Feng S, Yang J. Age-Optimal Transmission of Rateless Codes in an Erasure Channel. In 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. 8761668. (IEEE International Conference on Communications). https://doi.org/10.1109/ICC.2019.8761668