Average Age of Information with Hybrid ARQ under a Resource Constraint

Download

index.pdf

Date

2018-01-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

108
views

70
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 (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 mechanisms when the channel statistics are known; in particular, the standard automatic repeat request (ARQ) and hybrid ARQ (HARQ) protocols are considered. Then, for an unknown environment, an average-cost reinforcement learning (RL) algorithm is proposed that learns the system parameters and the transmission policy in real time. The effectiveness of the proposed methods are verified through numerical simulations.

URI

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

DOI

https://doi.org/10.1109/wcnc.2018.8377368

Conference Name

IEEE Wireless Communications and Networking Conference (WCNC)

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Average Age of Information With Hybrid ARQ Under a Resource Constraint Ceran Arslan, Elif Tuğçe; Gunduz, Deniz; Gyorgy, Andras (2019-03-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 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 mechan...
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...
QUERY AGE OF INFORMATION IN COMMUNICATION NETWORKS Ildız, Muhammed Emrullah; Uysal, Elif; Department of Electrical and Electronics Engineering (2002-8-22) We study a pull-based status update communication model where a source node submits update packets to a channel with random transmission delay, at times requested by a remote destination node. The objective is to minimize the average query-age-of-information (QAoI), defined as the age of information (AoI) measured at query instants that occur at the destination side according to a stochastic arrival process. In reference to a push-based problem formulation defined in the literature where the source decides ...
Differential network coding in wireless networks Telsiz aǧlarda farksal aǧ kodlamasi Özdemir, Özgür; Yılmaz, Ali Özgür (2009-10-29) In this paper a three-terminal communication scenario where two users exchange information by employing differential binary modulation and network coding via a relay is considered. The transmission is divided into three slots in time where the first and second slots are allocated to the transmission of differential encoded data of the users. After demodulation, the relay broadcasts the bit-wise XOR-ed and differential encoded packet to the users in the third slot. The optimum detector and a simplified decis...

Citation Formats

E. T. Ceran Arslan, D. Gunduz, and A. Gyorgy, “Average Age of Information with Hybrid ARQ under a Resource Constraint,” presented at the IEEE Wireless Communications and Networking Conference (WCNC), Barcelona, İspanya, 2018, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/92298.