Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Muxia Sun

dblp:276/6245 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 3 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 56% Cellular and mobile networks · 44%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
6g
1.012026
DMH-HARQ: Reliable and Open Latency-Constrained Wireless Transport Network · IEEE Trans. Netw. 2026
Physical-layer communications › channel coding
hybrid ARQ
1.012026
DMH-HARQ: Reliable and Open Latency-Constrained Wireless Transport Network · IEEE Trans. Netw. 2026
Physical-layer communications › information theory
finite blocklength regime
0.312026
DMH-HARQ: Reliable and Open Latency-Constrained Wireless Transport Network · IEEE Trans. Netw. 2026

Methods — techniques the papers use, named apart from their topics

integer optimization · 1.0dynamic programming · 1.0
YearPublicationVenuePosition
2026 DMH-HARQ: Reliable and Open Latency-Constrained Wireless Transport Network
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 wireless transport networks. Inspired by the advent of the virtualization concept in the wireless networks design andopennessparadigm as fostered by the Open-Radio Access Network (O-RAN) Alliance, we target a revolutionary resource allocation scheme to improve the overall transmission efficiency. In this paper, we investigate the problem of automatic repeat request (ARQ) in multi-hop decode-and-forward (DF) relaying in the finite blocklength (FBL) regime, and propose a dynamic scheme of multi-hop hybrid ARQ (HARQ), which maximizes the end-to-end (E2E) communication reliability in the wireless transport network.We also propose an integer dynamic programming (DP) algorithm to efficiently solve the optimal Dynamic Multi-Hop HARQ (DMH-HARQ) strategy. Constrained within a certain time frame to accomplish E2E transmission, our proposed approach is proven to outperform the conventional listening-based cooperative ARQ, as well as any static HARQ strategy, regarding the E2E reliability. It is applicable without dependence on special delay constraint, and is particularly competitive for long-distance transport network with many hops.
Bin Han 0004, Muxia Sun, Yao Zhu 0001, Vincenzo Sciancalepore, Mohammad Asif Habibi, Yulin Hu, Anke Schmeink, Yan-Fu Li, Hans D. Schotten
IEEE Trans. Netw.2
2022 Fitting multiple temporal usage patterns in day-ahead hourly building load forecasting under patch learning framework
Zhaohui Dan, Bo Wang 0032, Zhou Wu 0001, Huijin Fan, Lei Liu 0013, Muxia Sun
Neural Comput. Appl.7
2022 CLARQ: A Dynamic ARQ Solution for Ultra-High Closed-Loop Reliability
Bin Han 0004, Yao Zhu 0001, Muxia Sun, Vincenzo Sciancalepore, Yulin Hu, Hans D. Schotten
IEEE Trans. Wirel. Commun.3
2021 Fairness for Freshness: Optimal Age of Information Based OFDMA Scheduling With Minimal Knowledge
abstract
It is becoming increasingly clear that an important task for wireless networks is to minimize the age of information (AoI), i.e., the timeliness of information delivery. While mainstream approaches generally rely on the real-time observation of user AoI and channel state, there has been little attention to solve the problem in a complete (or partial) absence of such knowledge. In this article, we present a novel study to address the optimal blind radio resource scheduling problem in orthogonal frequency division multiplexing access (OFDMA) systems towards minimizing long-term average AoI, which is proven to be the composition of time-domain-fair clustered round-robin and frequency-domain-fair intra-cluster sub-carrier assignment. Heuristic solutions that are near-optimal as shown by simulation results are also proposed to effectively improve the performance upon presence of various degrees of extra knowledge, e.g., channel state and AoI.
Bin Han 0004, Yao Zhu 0001, Zhiyuan Jiang, Muxia Sun, Hans D. Schotten
IEEE Trans. Wirel. Commun.4