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

10/21/2020
by   Zhiyuan Jiang, et al.
0

In a heterogeneous unreliable multiaccess network, wherein terminals share a common wireless channel with distinctive error probabilities, existing works have 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 of Information (AoI) under standard Automatic Repeat reQuest (ARQ), and one must resort to Whittle's index approach for optimal AoI. In this paper, practical Hybrid ARQ (HARQ) schemes which are widely-used in today's wireless networks are considered. We show that RR-P is very close to optimum with asymptotically many terminals in this case, by explicitly deriving tight, closed-form AoI gaps between optimum and achievable AoI by RR-P. In particular, it is rigorously proved that for RR-P, under HARQ models concerning fading channels (resp. finite-blocklength regime), the relative AoI gap compared with the optimum is within a constant of (√(e)-1)^2/4√(e)≅ 6.4% (resp. 6.2% with error exponential decay rate of 0.5). In addition, RR-P enjoys the distinct advantage of implementation simplicity with channel-unaware and easy-to-decentralize operations, making it favorable in practice.

READ FULL TEXT
research
12/26/2020

Analyzing Age of Information in Multiaccess Networks by Fluid Limits

In this paper, we adopt the fluid limits to analyze Age of Information (...
research
10/29/2019

Closed-Form Whittle's Index-Enabled Random Access for Timely Status Update

We consider a star-topology wireless network for status update where a c...
research
03/22/2018

Can Decentralized Status Update Achieve Universally Near-Optimal Age-of-Information in Wireless Multiaccess Channels?

In an Internet-of-Things system where status data are collected from sen...
research
07/05/2019

Optimal Blocklength Allocation towards Reduced Age of Information in Wireless Sensor Networks

The freshness or timeliness of data at server is a significant key perfo...
research
10/14/2020

Fairness for Freshness: Optimal Age of Information Based OFDMA Scheduling with Minimal Knowledge

It is becoming increasingly clear that an important task for wireless ne...
research
01/17/2022

A Theory of Second-Order Wireless Network Optimization and Its Application on AoI

This paper introduces a new theoretical framework for optimizing second-...
research
01/19/2022

Extreme Age of Information for Wireless-Powered Communication Systems

The extreme or maximum age of information (AoI) is analytically studied ...

Please sign up or login with your details

Forgot password? Click here to reset