Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Fresh Data Delivery: Joint Sampling and Routing for Minimizing the Age of Information
Date
2025-10-23
Author
Atasayar, Adem Utku
Li, Aimin
Arl, Çarl
Uysal, Elif
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
135
views
0
downloads
Cite This
In this paper, we extend the freshness-oriented sampling problem by incorporating controlled delay statistics through heterogeneous routing options, where the Age of Information (AoI) serves as the metric for data freshness. Our objective is to jointly optimize sampling and routing policies to minimize the long-term average AoI, where the sender can choose to forward each status update over one of the available routes, which have distinct delay statistics. This problem is an infinite-horizon Semi-Markov Decision Process (SMDP) with an uncountable state space and a hybrid action space, consisting of discrete routing choices and continuous waiting times. We develop an efficient algorithm to solve this problem and theoretically establish that the optimal policy exhibits a threshold structure, characterized by: (i) a threshold-based monotonic handover mechanism for optimal routing, where the switching order aligns with the decreasing order of mean delays; and (ii) a multi-threshold piecewise linear waiting mechanism for optimal sampling, where the total number of thresholds is upper bounded by 2N - 1, given N selectable routes. We implement the proposed algorithm in a satellite-terrestrial integrated routing scenario, and simulation results reveal an intriguing insight: routes with higher average delay or variance can still contribute to minimizing AoI.
Subject Keywords
age of information
,
markov decision process
,
routing policy
,
sampling policy
,
threshold policy
URI
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=105022180530&origin=inward
https://hdl.handle.net/11511/117959
DOI
https://doi.org/10.1145/3704413.3764413
Conference Name
26th International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, MobiHoc 2025
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. U. Atasayar, A. Li, Ç. Arl, and E. Uysal, “Fresh Data Delivery: Joint Sampling and Routing for Minimizing the Age of Information,” presented at the 26th International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, MobiHoc 2025, Texas, Amerika Birleşik Devletleri, 2025, Accessed: 00, 2025. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=105022180530&origin=inward.