The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Vues en texte intégral
122
Dans un réseau multi-accès hétérogène et peu fiable, dans lequel les terminaux partagent un canal sans fil commun avec des probabilités d'erreur distinctes, des travaux existants ont montré qu'une politique de planification persistante à tour de rôle (RR-P) peut être arbitrairement pire que l'optimum en termes d'ère de l'information ( AoI) dans le cadre de la demande de répétition automatique standard (ARQ). Dans cet article, les schémas pratiques ARQ hybrides (HARQ) qui sont largement utilisés dans les réseaux sans fil actuels sont examinés. Nous montrons que RR-P est très proche de l'optimum avec asymptotiquement de nombreux terminaux dans ce cas, en dérivant explicitement des écarts AoI serrés et de forme fermée entre l'AoI optimal et réalisable par RR-P. En particulier, il est rigoureusement prouvé que pour RR-P, sous les modèles HARQ concernant les canaux à évanouissement (resp. régime de longueur de bloc finie), l'écart AoI relatif par rapport à l'optimum se situe dans une constante de 6.4% (resp. 6.2% avec erreur taux de décroissance exponentielle de 0.5). De plus, RR-P bénéficie de l'avantage distinctif de la simplicité de mise en œuvre avec des opérations ignorant les canaux et faciles à décentraliser, ce qui le rend avantageux dans la pratique. Une étude plus approfondie considérant la contrainte imposée sur le nombre de retransmissions est présentée. L'écart de performance est indiqué par des simulations numériques.
Zhiyuan JIANG
Shanghai University
Yijie HUANG
Shanghai University
Shunqing ZHANG
Shanghai University
Shugong XU
Shanghai University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Zhiyuan JIANG, Yijie HUANG, Shunqing ZHANG, Shugong XU, "Analysis on Asymptotic Optimality of Round-Robin Scheduling for Minimizing Age of Information with HARQ" in IEICE TRANSACTIONS on Communications,
vol. E104-B, no. 12, pp. 1465-1478, December 2021, doi: 10.1587/transcom.2021ITI0002.
Abstract: In a heterogeneous unreliable multiaccess network, wherein terminals share a common wireless channel with distinct error probabilities, existing works have shown that a persistent round-robin (RR-P) scheduling policy can be arbitrarily worse than the optimum in terms of Age of Information (AoI) under standard Automatic Repeat reQuest (ARQ). 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 6.4% (resp. 6.2% with error exponential decay rate of 0.5). In addition, RR-P enjoys the distinctive advantage of implementation simplicity with channel-unaware and easy-to-decentralize operations, making it favorable in practice. A further investigation considering constraint imposed on the number of retransmissions is presented. The performance gap is indicated through numerical simulations.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2021ITI0002/_p
Copier
@ARTICLE{e104-b_12_1465,
author={Zhiyuan JIANG, Yijie HUANG, Shunqing ZHANG, Shugong XU, },
journal={IEICE TRANSACTIONS on Communications},
title={Analysis on Asymptotic Optimality of Round-Robin Scheduling for Minimizing Age of Information with HARQ},
year={2021},
volume={E104-B},
number={12},
pages={1465-1478},
abstract={In a heterogeneous unreliable multiaccess network, wherein terminals share a common wireless channel with distinct error probabilities, existing works have shown that a persistent round-robin (RR-P) scheduling policy can be arbitrarily worse than the optimum in terms of Age of Information (AoI) under standard Automatic Repeat reQuest (ARQ). 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 6.4% (resp. 6.2% with error exponential decay rate of 0.5). In addition, RR-P enjoys the distinctive advantage of implementation simplicity with channel-unaware and easy-to-decentralize operations, making it favorable in practice. A further investigation considering constraint imposed on the number of retransmissions is presented. The performance gap is indicated through numerical simulations.},
keywords={},
doi={10.1587/transcom.2021ITI0002},
ISSN={1745-1345},
month={December},}
Copier
TY - JOUR
TI - Analysis on Asymptotic Optimality of Round-Robin Scheduling for Minimizing Age of Information with HARQ
T2 - IEICE TRANSACTIONS on Communications
SP - 1465
EP - 1478
AU - Zhiyuan JIANG
AU - Yijie HUANG
AU - Shunqing ZHANG
AU - Shugong XU
PY - 2021
DO - 10.1587/transcom.2021ITI0002
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E104-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2021
AB - In a heterogeneous unreliable multiaccess network, wherein terminals share a common wireless channel with distinct error probabilities, existing works have shown that a persistent round-robin (RR-P) scheduling policy can be arbitrarily worse than the optimum in terms of Age of Information (AoI) under standard Automatic Repeat reQuest (ARQ). 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 6.4% (resp. 6.2% with error exponential decay rate of 0.5). In addition, RR-P enjoys the distinctive advantage of implementation simplicity with channel-unaware and easy-to-decentralize operations, making it favorable in practice. A further investigation considering constraint imposed on the number of retransmissions is presented. The performance gap is indicated through numerical simulations.
ER -