Data freshness is extremely important for real-time applications and generally measured with age of information (AoI). Related studies typically assume that fresh data can be generated at any time. However, in industrial Internet of Things (IIoT) applications, such as alerting, monitoring, or task-oriented operations, data generation is often exogenous and occurs within a finite window. This motivates our analysis, where we investigate AoI-minimizing scheduling for status updates from an IIoT source that generates fresh data only at random intervals. We differentiate between infinite and finite horizons, with the latter being more aligned with IIoT tasks. For each scenario, we examine both agnostic (predefined and unchangeable) and source-aware scheduling, based on the probability of fresh data generation and the duty cycle. We provide a tight bound for source-aware scheduling in the infinite-horizon case and exact expressions for the other scenarios. We assess the increase in AoI from sporadic data generation, finding worst-case factors of 3 for agnostic scheduling and 2 for source-aware scheduling. However, these estimates are pessimistic when the data generation probability is at least an order of magnitude higher than the duty cycle. In such cases, the AoI increase is less than 20% for agnostic scheduling and almost negligible for source-aware scheduling.

Exogenous Update Scheduling in the Industrial Internet of Things for Minimal Age of Information

Badia L.;
2025

Abstract

Data freshness is extremely important for real-time applications and generally measured with age of information (AoI). Related studies typically assume that fresh data can be generated at any time. However, in industrial Internet of Things (IIoT) applications, such as alerting, monitoring, or task-oriented operations, data generation is often exogenous and occurs within a finite window. This motivates our analysis, where we investigate AoI-minimizing scheduling for status updates from an IIoT source that generates fresh data only at random intervals. We differentiate between infinite and finite horizons, with the latter being more aligned with IIoT tasks. For each scenario, we examine both agnostic (predefined and unchangeable) and source-aware scheduling, based on the probability of fresh data generation and the duty cycle. We provide a tight bound for source-aware scheduling in the infinite-horizon case and exact expressions for the other scenarios. We assess the increase in AoI from sporadic data generation, finding worst-case factors of 3 for agnostic scheduling and 2 for source-aware scheduling. However, these estimates are pessimistic when the data generation probability is at least an order of magnitude higher than the duty cycle. In such cases, the AoI increase is less than 20% for agnostic scheduling and almost negligible for source-aware scheduling.
File in questo prodotto:
File Dimensione Formato  
Exogenous_Update_Scheduling_in_the_Industrial_Internet_of_Things_for_Minimal_Age_of_Information.pdf

accesso aperto

Tipologia: Published (Publisher's Version of Record)
Licenza: Creative commons
Dimensione 1.38 MB
Formato Adobe PDF
1.38 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/3542231
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 3
  • OpenAlex ND
social impact