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

Chenghong Luo

dblp:338/3445 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0002-5349-8661ORCID · corroborated

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

Computer networks · 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 · 64% Wireless networking · 18% Network optimization and economics · 18%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › relaying
buffer-aided relaying
0.912025
A General Framework for Probabilistic Relay Selection in Asymmetric Buffer-Aided Cooperative Relaying Systems · IEEE Trans. Commun. 2025
Physical-layer communications › relaying › buffer-aided relaying
buffer-aided relay selection
0.912025
A General Framework for Probabilistic Relay Selection in Asymmetric Buffer-Aided Cooperative Relaying Systems · IEEE Trans. Commun. 2025
Physical-layer communications
cooperative communication
0.912025
A General Framework for Probabilistic Relay Selection in Asymmetric Buffer-Aided Cooperative Relaying Systems · IEEE Trans. Commun. 2025
Network optimization and economics
outage probability optimization
0.912025
A General Framework for Probabilistic Relay Selection in Asymmetric Buffer-Aided Cooperative Relaying Systems · IEEE Trans. Commun. 2025
Wireless networking
relay selection
0.912025
A General Framework for Probabilistic Relay Selection in Asymmetric Buffer-Aided Cooperative Relaying Systems · IEEE Trans. Commun. 2025
Physical-layer communications
channel state information
0.312025
A General Framework for Probabilistic Relay Selection in Asymmetric Buffer-Aided Cooperative Relaying Systems · IEEE Trans. Commun. 2025
Physical-layer communications › channel state information
imperfect CSI
0.312025
A General Framework for Probabilistic Relay Selection in Asymmetric Buffer-Aided Cooperative Relaying Systems · IEEE Trans. Commun. 2025

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

stochastic process modeling · 0.9loss function design · 0.9deep learning · 0.9
YearPublicationVenuePosition
2025 A General Framework for Probabilistic Relay Selection in Asymmetric Buffer-Aided Cooperative Relaying Systems
abstract
This paper presents a general framework for probabilistic relay selection (RS) in asymmetric buffer-aided cooperative relaying systems, which caters to scenarios with both perfect and imperfect channel state information (CSI) during the RS process. The framework extends and generalizes many existing buffer-aided RS schemes. In particular, we introduce an auxiliary stochastic process which assigns varying selection probabilities to different links, considering the dynamic wireless channel and buffer states. Subsequently, we leverage the obtained outage probability and average packet delay (APD) to formulate outage optimization problems while adhering to APD. To address the intricate high-dimensional optimization problems, we employ a deep learning (DL) approach, which involves designing probability mass functions for the auxiliary stochastic process and developing an effective loss function to update the neural network. Simulation results unequivocally demonstrate the superior performance of the proposed DL-based probabilistic RS scheme compared to benchmark schemes, particularly in scenarios involving imperfect CSI.
Peng Xu 0002, Chenghong Luo, Chong Huang 0006, Gaojie Chen 0001, Yuanzhi He, Yong Li 0023, Kai-Kit Wong
IEEE Trans. Commun.2
2022 Deep Reinforcement Learning based Relay Selection for SWIPT Systems with Data Buffer and Energy Storage
abstract
In this paper, we study the simultaneous wireless information and power transfer (SWIPT) cooperative system, where one source forwards information to one destination with the assistance of multiple relays. Each relay is equipped with a finite data butter and a finite energy butter storing the harvested energy by radio-frequency (RF). An optimization problem is formulated for throughput maximization of the SWIPT cooperative system, taking into consideration the strict delay constraint, dynamic channel conditions, time-varying discrete data butter states and time-varying continuous energy butter states. A discrete-time Markov decision process (MDP) is adopted to model the relay selection process referring to data butter states and energy butter states. Two deep Q-network (DQN)based methods named invalid action penalty (IAP) and invalid action mask (IAM) are proposed. The simulation results show that the proposed IAM method can achieve better convergence and throughput performance than the IAP method.
Jianping Quan, Peng Xu 0002, Chenghong Luo, Chong Huang 0006, Gaojie Chen 0001
VTC Fall3