Average Age of Information With Hybrid ARQ Under a Resource Constraint

Download

index.pdf

Date

2019-03-01

Author

Ceran Arslan, Elif Tuğçe
Gunduz, Deniz
Gyorgy, Andras

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

123
views

54
downloads

Scheduling the transmission of status updates over an error-prone communication channel is studied in order to minimize the long-term average age of information at the destination under a constraint on the average number of transmissions at the source node. After each transmission, the source receives an instantaneous ACK/NACK feedback, and decides on the next update without prior knowledge on the success of future transmissions. The optimal scheduling policy is first studied under different feedback mechanisms when the channel statistics are known; in particular, the standard automatic repeat request (ARQ) and hybrid ARQ (HARQ) protocols are considered. The structural results are derived for the optimal policy under HARQ, while the optimal policy is determined analytically for ARQ. For the case of unknown environments, an average-cost reinforcement learning algorithm is proposed that learns the system parameters and the transmission policy in real time. The effectiveness of the proposed methods is verified through the numerical results.

URI

https://hdl.handle.net/11511/92663

Journal

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS

DOI

https://doi.org/10.1109/twc.2019.2899303

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Average Age of Information with Hybrid ARQ under a Resource Constraint Ceran Arslan, Elif Tuğçe; Gunduz, Deniz; Gyorgy, Andras (2018-01-01) Scheduling the transmission of status updates over an error-prone communication channel is studied in order to minimize the long-term average age of information (AoI) at the destination under a constraint on the average number of transmissions at the source node. After each transmission, the source receives an instantaneous ACK/NACK feedback, and decides on the next update without prior knowledge on the success of future transmissions. First, the optimal scheduling policy is studied under different feedback...
A Reinforcement Learning Approach to Age of Information in Multi-User Networks Ceran Arslan, Elif Tuğçe; Gunduz, Deniz; Gyorgy, Andras (2018-01-01) Scheduling the transmission of time-sensitive data to multiple users over error-prone communication channels is studied with the goal of minimizing the long-term average age of information (AoI) at the users under a constraint on the average number of transmissions. The source can transmit only to a single user at each time slot, and after each transmission, it receives an instantaneous ACK/NACK feedback from the intended receiver, and decides on when and to which user to transmit the next update. The optim...
Optimizing Information Freshness in Random Access Channels Yavaşcan, Orhan Tahir; Uysal, Elif; Department of Electrical and Electronics Engineering (2022-8-31) In this work, a number of transmission strategies aimed at optimizing information freshness in random access channels are developed and studied. Threshold-ALOHA, an age-aware modification of slotted ALOHA, suggests a fixed age threshold on the terminals before they can become active and attempt transmissions with a constant probability. Threshold ALOHA nearly halves the average Age of Information (AoI) whilst the loss of throughput compared to slotted ALOHA is less than one percent. Mumista, multiple mini s...
TIMELY COMMUNICATION FOR ENERGY-EFFICIENCY, DATA FRESHNESS AND TRACKING Bacınoğlu, Baran Tan; Uysal, Elif; Department of Electrical and Electronics Engineering (2021-9-1) This thesis considers data transmission scenarios where timeliness of information transmission, or adapting to intermittently available resources is important. The ﬁrst part of the thesis focuses on energy harvesting communication systems. For such systems, energy eﬃcient scheduling algorithms that achieve certain throughput maximization and data freshness objectives are developed. The second part of the thesis considers data transmission for the purpose of tracking unstable sources through noisy channels. ...
Measuring age of information on real-life connections Beytur, Hasan Burhan; Baghaee, Sajjad; Uysal, Elif (2019-04-01) Age of Information (AoI) is a relatively new metric to measure freshness of networked application such as real-time monitoring of status updates or control. The AoI metric is discussed in the literature mainly in a theoretical way. In this work, we want to point out the issues related to the measuring AoI-related values, such as synchronization and calculation of the values. We discussed the effect of synchronization error in the measurement and a solution for calculating an estimate of average AoI without ...

Citation Formats

E. T. Ceran Arslan, D. Gunduz, and A. Gyorgy, “Average Age of Information With Hybrid ARQ Under a Resource Constraint,” IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, vol. 18, no. 3, pp. 1900–1913, 2019, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/92663.