Average age of information with hybrid ARQ under a resource constraint

@article{Ceran2017AverageAO,
  title={Average age of information with hybrid ARQ under a resource constraint},
  author={Elif Tuğçe Ceran and Deniz G{\"u}nd{\"u}z and Andr{\'a}s Gy{\"o}rgy},
  journal={2018 IEEE Wireless Communications and Networking Conference (WCNC)},
  year={2017},
  pages={1-6}
}
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… 
[PDF] Semantic Reader
162 Citations
Highly Influential Citations
12
Background Citations
88
Methods Citations
49
Results Citations
5

Figures from this paper

162 Citations

Average Age of Information With Hybrid ARQ Under a Resource Constraint

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…

A Reinforcement Learning Approach to Age of Information in Multi-User Networks

Scheduling the transmission of time-sensitive data to multiple users over error-prone communication channels is studied with the goal of minimizing the longterm average age of information (AoI) at…

A Reinforcement Learning Approach to Age of Information in Multi-User Networks With HARQ

Different RL methods including average-cost SARSA with linear function approximation (LFA), upper confidence reinforcement learning (UCRL2), and deep Q-network (DQN) are applied and compared through numerical simulations.

Age-Optimal Low-Power Status Update over Time-Correlated Fading Channel

This paper considers transmission scheduling in a status update system, where updates are generated periodically and transmitted over a Gilbert-Elliott fading channel, and develops an optimal algorithm using the structure of the problem.

Reinforcement Learning for Minimizing Age of Information over Wireless Links

In this chapter, we study the age of information (AoI) when status updates of an underlying process of interest, sampled and recorded by a source node, must be transmitted to one or more destination…

Learning to Minimize Age of Information over an Unreliable Channel with Energy Harvesting

For the case of unknown environments, average-cost reinforcement-learning algorithms are proposed that learn the system parameters and the status update policy in real-time and the effectiveness of the proposed methods is demonstrated through numerical results.

Average AoI Minimization in an HARQ-based Status Update System under Random Arrivals

A status update system consisting of one source, one butter-aided transmitter, and one receiver is considered and the Lagrangian approach is used to transform the CMDP problem to an MDP problem which is solved with the relative value iteration (RVI) for the known environment and with deep Q-learning algorithm for the unknown environment.

Age Minimization Transmission Scheduling over Time-Correlated Fading Channel under An Average Energy Constraint

This paper considers transmission scheduling in a status update system, where updates are generated periodically and transmitted over a Gilbert-Elliott fading channel and shows that the optimal policy is a randomized mixture of no more than two stationary deterministic policies each of which is of a threshold-type in the belief on the channel.

Age of Incorrect Information With Hybrid ARQ Under a Resource Constraint for N-ary Symmetric Markov Sources

This paper addresses the definition of an AoII-optimal transmission policy in a discrete-time communication scheme with a resource constraint and a hybrid automatic repeat request (HARQ) protocol and proves that under some conditions, the optimal transmission policy is to never transmit.

Age-Optimal Power Control for Status Update Systems With Packet-Based Transmissions

Numerical results on the proposed power control policy show that more power is preferred to be allocated to packets after a certain number of failure packets in the low-power regime and the proposedPower control reduces the average AoI compared to the constant power policy.
...

31 References

Average Age of Information With Hybrid ARQ Under a Resource Constraint

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…

Age of information: Design and analysis of optimal scheduling algorithms

This paper forms a Markov decision process (MDP) to find dynamic transmission scheduling schemes, with the purpose of minimizing the long-run average age, and proposes both optimal off-line and online scheduling algorithms for the finite-approximate MDPs, depending on knowledge of time-varying arrivals.

Monotonicity of Constrained Optimal Transmission Policies in Correlated Fading Channels With ARQ

The main result is to give sufficient conditions on the channel memory, and transmission cost so that the optimal transmission scheduling policy is a monotonically increasing function of the buffer occupancy.

Age of information under energy replenishment constraints

An effective online heuristic, Balance Updating (BU), that achieves performance close to an omniscient (offline) policy is proposed and simulations indicate that they can significantly improve the age over greedy approaches.

Minimizing the Age of Information in broadcast wireless networks

This is the first work to provide a scheduling policy that optimizes AoI in a wireless network with unreliable channels and shows that a Greedy Policy, which transmits the packet with highest current age, is optimal for the case of symmetric networks.

Age-of-information in the presence of error

  • Kun ChenLongbo Huang
  • Computer Science
    2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
The peak age-of-information in an M/M/1 queueing system with packet delivery error is considered and two types of policies are focused on, one is to adopt Last-Come-First-Served scheduling, and the other is to utilize retransmissions, i.e., keep transmitting the most recent packet.

Status updates through M/G/1/1 queues with HARQ

It is shown that in both schemes the best strategy would be not to preempt, and it is proved that, from an age point of view, IIR is better than FR.

Reliability-based type II hybrid ARQ schemes

This work proposes a HARQ scheme that exploits channel state information and received packet quality to improve system performance and uses the average magnitude of the log-likelihood ratios corresponding to the received information bits to determine the sizes of subsequent retransmissions.

Optimal packet scheduling for energy harvesting sources on time varying wireless channels

This paper considers a source node that operates over a time varying channel with energy harvesting capability, and proves that the optimal policy is a threshold type policy depending on the state of the channel and the length of the energy queue.

Timely updates over an erasure channel

This work examines the transmission of coded updates through a binary erasure channel to a monitor/receiver and shows that tuning the redundancy to the symbol erasure rate enables the FR system to perform as well as the IIR system.