To Skip or to Switch? Minimizing Age of Information under Link Capacity Constraint

Boyu Wang, Songtao Feng, Jing Yang

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

2 Citations (Scopus)

Abstract

Consider a scenario where a source continuously monitors an object and sends time-stamped status updates to a destination through a rate-limited link. In order to measure the 'freshness' of the status information available at the destination, we adopt the metric called Age of Information (AoI). We assume all updates are of the same size, and arrive randomly at the source according to a Bernoulli process. Due to the link capacity constraint, it takes d(d< 2) time slots for the source to complete the transmission of an update. Therefore, when a new update arrives at the source during the transmission of another update, the source needs to decide whether to skip the new arrival or to switch to it, in order to minimize the expected average AoI at the destination. We prove that within a broadly defined class of online policies, the optimal policy should be a renewal policy, and has a sequential switching property. We then show that the optimal decision of the source in any time slot has a multiple-threshold structure, and only depends on the age of the update being transmitted and the AoI in the system. The thresholds are then numerically identified by formulating the problem as a Markov Decision Process (MDP).

Original languageEnglish (US)
Title of host publication2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Print)9781538635124
DOIs
StatePublished - Aug 24 2018
Event19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018 - Kalamata, Greece
Duration: Jun 25 2018Jun 28 2018

Publication series

NameIEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC
Volume2018-June

Other

Other19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018
CountryGreece
CityKalamata
Period6/25/186/28/18

Fingerprint

Sequential switching
Switches

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Information Systems

Cite this

Wang, B., Feng, S., & Yang, J. (2018). To Skip or to Switch? Minimizing Age of Information under Link Capacity Constraint. In 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018 [8445919] (IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC; Vol. 2018-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SPAWC.2018.8445919
Wang, Boyu ; Feng, Songtao ; Yang, Jing. / To Skip or to Switch? Minimizing Age of Information under Link Capacity Constraint. 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018. Institute of Electrical and Electronics Engineers Inc., 2018. (IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC).
@inproceedings{27fb1d954c39461ebad95c35d1c9c2c9,
title = "To Skip or to Switch? Minimizing Age of Information under Link Capacity Constraint",
abstract = "Consider a scenario where a source continuously monitors an object and sends time-stamped status updates to a destination through a rate-limited link. In order to measure the 'freshness' of the status information available at the destination, we adopt the metric called Age of Information (AoI). We assume all updates are of the same size, and arrive randomly at the source according to a Bernoulli process. Due to the link capacity constraint, it takes d(d< 2) time slots for the source to complete the transmission of an update. Therefore, when a new update arrives at the source during the transmission of another update, the source needs to decide whether to skip the new arrival or to switch to it, in order to minimize the expected average AoI at the destination. We prove that within a broadly defined class of online policies, the optimal policy should be a renewal policy, and has a sequential switching property. We then show that the optimal decision of the source in any time slot has a multiple-threshold structure, and only depends on the age of the update being transmitted and the AoI in the system. The thresholds are then numerically identified by formulating the problem as a Markov Decision Process (MDP).",
author = "Boyu Wang and Songtao Feng and Jing Yang",
year = "2018",
month = "8",
day = "24",
doi = "10.1109/SPAWC.2018.8445919",
language = "English (US)",
isbn = "9781538635124",
series = "IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018",
address = "United States",

}

Wang, B, Feng, S & Yang, J 2018, To Skip or to Switch? Minimizing Age of Information under Link Capacity Constraint. in 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018., 8445919, IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC, vol. 2018-June, Institute of Electrical and Electronics Engineers Inc., 19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018, Kalamata, Greece, 6/25/18. https://doi.org/10.1109/SPAWC.2018.8445919

To Skip or to Switch? Minimizing Age of Information under Link Capacity Constraint. / Wang, Boyu; Feng, Songtao; Yang, Jing.

2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018. Institute of Electrical and Electronics Engineers Inc., 2018. 8445919 (IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC; Vol. 2018-June).

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

TY - GEN

T1 - To Skip or to Switch? Minimizing Age of Information under Link Capacity Constraint

AU - Wang, Boyu

AU - Feng, Songtao

AU - Yang, Jing

PY - 2018/8/24

Y1 - 2018/8/24

N2 - Consider a scenario where a source continuously monitors an object and sends time-stamped status updates to a destination through a rate-limited link. In order to measure the 'freshness' of the status information available at the destination, we adopt the metric called Age of Information (AoI). We assume all updates are of the same size, and arrive randomly at the source according to a Bernoulli process. Due to the link capacity constraint, it takes d(d< 2) time slots for the source to complete the transmission of an update. Therefore, when a new update arrives at the source during the transmission of another update, the source needs to decide whether to skip the new arrival or to switch to it, in order to minimize the expected average AoI at the destination. We prove that within a broadly defined class of online policies, the optimal policy should be a renewal policy, and has a sequential switching property. We then show that the optimal decision of the source in any time slot has a multiple-threshold structure, and only depends on the age of the update being transmitted and the AoI in the system. The thresholds are then numerically identified by formulating the problem as a Markov Decision Process (MDP).

AB - Consider a scenario where a source continuously monitors an object and sends time-stamped status updates to a destination through a rate-limited link. In order to measure the 'freshness' of the status information available at the destination, we adopt the metric called Age of Information (AoI). We assume all updates are of the same size, and arrive randomly at the source according to a Bernoulli process. Due to the link capacity constraint, it takes d(d< 2) time slots for the source to complete the transmission of an update. Therefore, when a new update arrives at the source during the transmission of another update, the source needs to decide whether to skip the new arrival or to switch to it, in order to minimize the expected average AoI at the destination. We prove that within a broadly defined class of online policies, the optimal policy should be a renewal policy, and has a sequential switching property. We then show that the optimal decision of the source in any time slot has a multiple-threshold structure, and only depends on the age of the update being transmitted and the AoI in the system. The thresholds are then numerically identified by formulating the problem as a Markov Decision Process (MDP).

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

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

U2 - 10.1109/SPAWC.2018.8445919

DO - 10.1109/SPAWC.2018.8445919

M3 - Conference contribution

AN - SCOPUS:85053481881

SN - 9781538635124

T3 - IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC

BT - 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Wang B, Feng S, Yang J. To Skip or to Switch? Minimizing Age of Information under Link Capacity Constraint. In 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2018. Institute of Electrical and Electronics Engineers Inc. 2018. 8445919. (IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC). https://doi.org/10.1109/SPAWC.2018.8445919