Sum Rate and Access Delay Optimization of Short-Packet Aloha
Shortening the packet length has been a consensus in wireless network design for supporting the ultra-low latency Internet of Things (IoT) applications. Yet, with short-packet transmission, the rate loss would occur, which further depends on the blocklength, making the network optimization notorious...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2022-01-01
|
Series: | IEEE Open Journal of the Communications Society |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9874859/ |
_version_ | 1798000760515985408 |
---|---|
author | Xinghua Sun Wen Zhan Weihua Liu Yitong Li Qi Liu |
author_facet | Xinghua Sun Wen Zhan Weihua Liu Yitong Li Qi Liu |
author_sort | Xinghua Sun |
collection | DOAJ |
description | Shortening the packet length has been a consensus in wireless network design for supporting the ultra-low latency Internet of Things (IoT) applications. Yet, with short-packet transmission, the rate loss would occur, which further depends on the blocklength, making the network optimization notoriously difficult, especially for random access networks. This paper focuses on the representative random access network, i.e., Aloha, with short packet transmission, namely, short-packet Aloha. Specifically, we aim to optimize the sum rate and access delay of short-packet Aloha. By deriving the probability of successful transmissions of packets, both the network sum rate and the probability generating function of access delay are obtained as explicit functions of key system parameters. The maximum sum rate and the minimum mean access delay are further derived by jointly tuning the packet transmission probability and the blocklength of packets. The effect of system parameters on the optimal sum rate and access delay performance is investigated. It is shown that the maximum sum rate is insensitive to the retry limit <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>, while deteriorates as the information bits per packet <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> decreases. In contrast, the optimal delay performance can be improved with a small <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula> or <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>. The reliability performance is also evaluated and shown to be enhanced with a large retry limit <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>. The analysis sheds important light on the access design of practical short-packet Aloha networks. By taking LTE-M as an example, it is found that to improve access delay performance, the information bits per packet <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> should not exceed an upperbound, which polynomially decreases as the network size increases. |
first_indexed | 2024-04-11T11:25:31Z |
format | Article |
id | doaj.art-04d82c78cd29446ea7c50d2a84b09585 |
institution | Directory Open Access Journal |
issn | 2644-125X |
language | English |
last_indexed | 2024-04-11T11:25:31Z |
publishDate | 2022-01-01 |
publisher | IEEE |
record_format | Article |
series | IEEE Open Journal of the Communications Society |
spelling | doaj.art-04d82c78cd29446ea7c50d2a84b095852022-12-22T04:26:17ZengIEEEIEEE Open Journal of the Communications Society2644-125X2022-01-0131501151410.1109/OJCOMS.2022.32038039874859Sum Rate and Access Delay Optimization of Short-Packet AlohaXinghua Sun0https://orcid.org/0000-0003-0621-1469Wen Zhan1https://orcid.org/0000-0002-3129-7893Weihua Liu2Yitong Li3https://orcid.org/0000-0002-8720-0974Qi Liu4https://orcid.org/0000-0001-5378-6404School of Electronics and Communication Engineering, Sun Yat-sen University (Shenzhen Campus), Shenzhen, ChinaSchool of Electronics and Communication Engineering, Sun Yat-sen University (Shenzhen Campus), Shenzhen, ChinaSchool of Electronics and Communication Engineering, Sun Yat-sen University (Shenzhen Campus), Shenzhen, ChinaSchool of Information Engineering, Zhengzhou University, Zhengzhou, ChinaSchool of Future Technology, South China University of Technology, Guangzhou, ChinaShortening the packet length has been a consensus in wireless network design for supporting the ultra-low latency Internet of Things (IoT) applications. Yet, with short-packet transmission, the rate loss would occur, which further depends on the blocklength, making the network optimization notoriously difficult, especially for random access networks. This paper focuses on the representative random access network, i.e., Aloha, with short packet transmission, namely, short-packet Aloha. Specifically, we aim to optimize the sum rate and access delay of short-packet Aloha. By deriving the probability of successful transmissions of packets, both the network sum rate and the probability generating function of access delay are obtained as explicit functions of key system parameters. The maximum sum rate and the minimum mean access delay are further derived by jointly tuning the packet transmission probability and the blocklength of packets. The effect of system parameters on the optimal sum rate and access delay performance is investigated. It is shown that the maximum sum rate is insensitive to the retry limit <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>, while deteriorates as the information bits per packet <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> decreases. In contrast, the optimal delay performance can be improved with a small <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula> or <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>. The reliability performance is also evaluated and shown to be enhanced with a large retry limit <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>. The analysis sheds important light on the access design of practical short-packet Aloha networks. By taking LTE-M as an example, it is found that to improve access delay performance, the information bits per packet <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> should not exceed an upperbound, which polynomially decreases as the network size increases.https://ieeexplore.ieee.org/document/9874859/Alohafinite block length regionlow latencymaximum sum rateshort-packet |
spellingShingle | Xinghua Sun Wen Zhan Weihua Liu Yitong Li Qi Liu Sum Rate and Access Delay Optimization of Short-Packet Aloha IEEE Open Journal of the Communications Society Aloha finite block length region low latency maximum sum rate short-packet |
title | Sum Rate and Access Delay Optimization of Short-Packet Aloha |
title_full | Sum Rate and Access Delay Optimization of Short-Packet Aloha |
title_fullStr | Sum Rate and Access Delay Optimization of Short-Packet Aloha |
title_full_unstemmed | Sum Rate and Access Delay Optimization of Short-Packet Aloha |
title_short | Sum Rate and Access Delay Optimization of Short-Packet Aloha |
title_sort | sum rate and access delay optimization of short packet aloha |
topic | Aloha finite block length region low latency maximum sum rate short-packet |
url | https://ieeexplore.ieee.org/document/9874859/ |
work_keys_str_mv | AT xinghuasun sumrateandaccessdelayoptimizationofshortpacketaloha AT wenzhan sumrateandaccessdelayoptimizationofshortpacketaloha AT weihualiu sumrateandaccessdelayoptimizationofshortpacketaloha AT yitongli sumrateandaccessdelayoptimizationofshortpacketaloha AT qiliu sumrateandaccessdelayoptimizationofshortpacketaloha |