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

Age-of-Information (AoI) is a recently proposed metric for quantifying thefreshness of information from the UE's perspective in a communication network.Recently, Kadota et al. [1] have proposed an index-type approximately optimalscheduling policy for minimizing the average-AoI metric for a downlinktransmission problem. For delay-sensitive applications, including real-timecontrol of a cyber-physical system, or scheduling URLLC traffic in 5G, it isessential to have a more stringent uniform control on AoI across all users. Inthis paper, we derive an exactly optimal scheduling policy for this problem ina downlink cellular system with erasure channels. Our proof of optimalityinvolves an explicit solution to the associated average-cost Bellman Equation,which might be of independent theoretical interest. We also establish that theresulting Age-process is positive recurrent under the optimal policy, and hasan exponentially light tail, with the optimal large-deviation exponent.Finally, motivated by typical applications in small-cell residential networks,we consider the problem of minimizing the peak-AoI with throughput constraintsto specific UEs, and derive a heuristic policy for this problem. Extensivenumerical simulations have been carried out to compare the efficacy of theproposed policies with other well-known scheduling policies, such as Randomizedscheduling and Proportional Fair.

On Minimizing the Maximum Age-of-Information For Wireless Erasure Channels