Skip to main content
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute Donate

Computer Science > Information Theory

arXiv:2212.03602v2 (cs)
[Submitted on 7 Dec 2022 (v1) , revised 30 Jun 2023 (this version, v2) , latest version 20 Oct 2025 (v4) ]

Title: Reliable O-RAN-inspired Latency-constrained Wireless Transport Networks in 6G

Title: 可靠的6G-inspired时延约束无线传输网络

Authors:Bin Han, Muxia Sun, Yao Zhu, Vincenzo Sciancalepore, Mohammad Asif Habibi, Yulin Hu, Anke Schmeink, Yan-Fu Li, Hans D. Schotten
Abstract: The extreme requirements for high reliability and low latency in the upcoming Sixth Generation (6G) wireless networks are challenging the design of multi-hop relay networks. Inspired by the advent of the virtualization concept in the wireless networks design and openness paradigm as fostered by the O-RAN Alliance, we target a revolutionary resource scheduling scheme to improve the overall transmission efficiency. In this paper, we investigate the problem of multi-hop decode-and-forward (DF) relaying in the finite blocklength (FBL) regime, and propose a Dynamic Multi-Hop HARQ (DMH-HARQ) scheme, which maximizes the end-to-end (E2E) communication reliability in such systems. We also propose an integer dynamic programming (DP) algorithm to efficiently solve the optimal DMH-HARQ schedule. Constrained within a certain time frame to accomplish multi-hop relaying, our proposed
Comments: Submitted to IEEE Transactions on Wireless Communications
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2212.03602 [cs.IT]
  (or arXiv:2212.03602v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2212.03602

Submission history

From: Bin Han [view email]
[v1] Wed, 7 Dec 2022 12:36:37 UTC (178 KB)
[v2] Fri, 30 Jun 2023 13:10:14 UTC (1,060 KB)
[v3] Mon, 1 Jul 2024 22:25:25 UTC (5,449 KB)
[v4] Mon, 20 Oct 2025 22:18:59 UTC (5,493 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2022-12
Change to browse by:
cs
math
math.IT

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)