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 a heterogeneous unreliable multiaccess network, wherein terminals share acommon wireless channel with distinctive error probabilities, existing workshave showed that a persistent round-robin (RR-P) scheduling policy (i.e.,greedy policy) can be arbitrarily worse than the optimum in terms of Age ofInformation (AoI) under standard Automatic Repeat reQuest (ARQ), and one mustresort to Whittle's index approach for optimal AoI. In this paper, practicalHybrid ARQ (HARQ) schemes which are widely-used in today's wireless networksare considered. We show that RR-P is very close to optimum with asymptoticallymany terminals in this case, by explicitly deriving tight, closed-form AoI gapsbetween optimum and achievable AoI by RR-P. In particular, it is rigorouslyproved that for RR-P, under HARQ models concerning fading channels (resp.finite-blocklength regime), the relative AoI gap compared with the optimum iswithin a constant of $(\sqrt{e}-1)^2/4\sqrt{e} \cong 6.4\%$ (resp. $6.2\%$ witherror exponential decay rate of $0.5$). In addition, RR-P enjoys the distinctadvantage of implementation simplicity with channel-unaware andeasy-to-decentralize operations, making it favorable in practice.

Round-Robin is Provably Near-Optimal for Minimizing Age with HARQ over Heterogeneous Unreliable Multiaccess Channels