• Home
  • Search
  • Optimizing the Age of Information with Segmentation and Predictive Scheduling
  • Cite Icon1
  • https://doi.org/10.1109/wcnc55385.2023.10118997Copy DOI Icon

Optimizing the Age of Information with Segmentation and Predictive Scheduling

  • Mar 1, 2023
  • Jin Zhang +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Age of Information (AoI) is a well-investigated timeliness metric for data collected from sensors. Various packet scheduling policies have been proposed in order to optimize AoI. It is natural to raise the question of how much these scheduling policies could be improved using prediction and how many predictive packets are necessary to achieve the optimum. Given a packet sequence, there must be at least one packet combination to achieve the optimal AoI, which can be obtained by exhausting all possible decisions of preserving/rejecting packets. However, it is impractical to obtain prior knowledge of each update’s arrival and service time. In addition, this exhaustive scheduling policy consumes unaffordable resources of time, energy, and computing power.In this paper, we show that a sufficiently long packet sequence may be segmented into local epochs with invariant global optimal policy, and local optimization of each epoch incrementally aggregates the global optimal AoI of the entire sequence. This new perspective also explains the counter-intuitive phenomenon [1]–[3] of idle waiting time outperforming transmitting updates immediately. After comparing with the AoIs obtained from other scheduling policies, we find that the optimization performance of predictive scheduling prevails over others.

Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.