English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we consider transmission scheduling in a status update system,where updates are generated periodically and transmitted over a Gilbert-Elliottfading channel. The goal is to minimize the long-run average age of information(AoI) at the destination under an average energy constraint. We consider twopractical cases to obtain channel state information (CSI): (i) \emph{withoutchannel sensing} and (ii) \emph{with delayed channel sensing}. For case (i),the channel state is revealed when an ACK/NACK is received at the transmitterfollowing a transmission, but when no transmission occurs, the channel state isnot revealed. Thus, we have to design schemes that balance tradeoffs acrossenergy, AoI, channel exploration, and channel exploitation. The problem isformulated as a constrained partially observable Markov decision processproblem (POMDP). To reduce algorithm complexity, we show that the optimalpolicy is a randomized mixture of no more than two stationary deterministicpolicies each of which is of a threshold-type in the belief on the channel. Forcase (ii), (delayed) CSI is available at the transmitter via channel sensing.In this case, the tradeoff is only between the AoI and energy consumption andthe problem is formulated as a constrained MDP. The optimal policy is shown tohave a similar structure as in case (i) but with an AoI associated threshold.Finally, the performance of the proposed structure-aware algorithms isevaluated numerically and compared with a Greedy policy.

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