EUVIMEDEUVIMED entdecken
Crossref

Age Optimal Sampling for Unreliable Channels Under Unknown Channel Statistics

Hongyi He, Haoyue Tang, Jiayu Pan, Jintao Wang, Jian Song, Leandros Tassiulas

IEEE Transactions on Mobile Computing · 2026-06 · 25 (6) · 7640-7656

DOI: 10.1109/tmc.2025.3646252 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Mobile Computing, 2026-06. Verfasst von Hongyi He und 5 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 43 Literaturangaben. Gefördert von: Guangdong Innovative and Entrepreneurial Research Team, Independent Research Project of the Department of Electronic, Tsinghua University, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, we study a system in which a sensor forwards status updates to a receiver through an error-prone channel, while the receiver sends the transmission results back to the sensor via a reliable channel. Both channels are subject to random delays. To evaluate the timeliness of the status information at the receiver, we use the Age of Information (AoI) metric. The objective is to design a sampling policy that minimizes the expected time-average AoI, even when the channel statistics (e.g., delay distributions) are unknown. We first review the threshold structure of the optimal offline policy under known channel statistics and then reformulate the design of the online algorithm as a stochastic approximation problem. We propose a Robbins-Monro algorithm to solve this problem and demonstrate that the optimal threshold can be approximated almost surely. Moreover, we prove that the cumulative AoI regret of the online algorithm increases with rate $\mathcal {O}(\ln K)$ O ( ln K ) , where $K$ K is the number of successful transmissions. In addition, our algorithm is shown to be minimax order optimal, in the sense that for any online learning algorithm, the cumulative AoI regret up to the $K$ K -th successful transmissions grows with the rate at least $\Omega (\ln K)$ Ω ( ln K ) in the worst case delay distribution. Finally, we improve the stability of the proposed online learning algorithm through a momentum-based stochastic gradient descent algorithm. Simulation results validate the performance of our proposed algorithm.

Förderung

  • Guangdong Innovative and Entrepreneurial Research Team
  • Independent Research Project of the Department of Electronic, Tsinghua University
  • National Natural Science Foundation of China
  • Ningbo Yongjiang Talent Programme
  • Natural Science Foundation of Ningbo

Zitieren

APA

He, H., Tang, H., Pan, J., Wang, J., Song, J., & Tassiulas, L. (2026). Age Optimal Sampling for Unreliable Channels Under Unknown Channel Statistics. IEEE Transactions on Mobile Computing, 25(6), 7640-7656. https://doi.org/10.1109/tmc.2025.3646252

Vancouver

He H, Tang H, Pan J, Wang J, Song J, Tassiulas L. Age Optimal Sampling for Unreliable Channels Under Unknown Channel Statistics. IEEE Transactions on Mobile Computing. 2026;25(6):7640-7656. doi:10.1109/tmc.2025.3646252

BibTeX
@article{He2026,
  author = {He, Hongyi and Tang, Haoyue and Pan, Jiayu and Wang, Jintao and Song, Jian and Tassiulas, Leandros},
  title = {Age Optimal Sampling for Unreliable Channels Under Unknown Channel Statistics},
  journal = {IEEE Transactions on Mobile Computing},
  year = {2026},
  volume = {25},
  number = {6},
  pages = {7640--7656},
  doi = {10.1109/tmc.2025.3646252}
}
Kostenlos starten →