Yuqian Song

Yuqian Song

Auto-generated profile, based on publicly available information

Yuqian Song

Intelligent Perception and Computing Research Center, School of Artificial Intelligence, Beijing University of Posts and Telecommunications (BUPT), Beijing, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 January 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YXYang Xiao
Yang Xiao
YSYuqian Song
Yuqian Song
JLJun Liu
Jun Liu
As a promising technology in the 5G era, the artificial intelligence (AI) enabled Internet of controllable things (IoCT) is expected to be an integral part of heterogeneous networks (HetNets) in the future. However, the realization of ultra-reliable low-latency communications (URLLC) in IoCT communications underlaid HetNet has stringent quality of service (QoS) requirements, resulting in unprecedented challenges for existing wireless resource allocation methods. In this paper, we first describe a cellular HetNet model with uplink IoCT communications, then formulate a dynamic mixed-integer nonlinear programming (MINLP) resource allocation problem for maximizing the long-term average energy efficiency under URLLC requirements including reliability, latency, and transmission rate. To solve the problem, we propose a decentralized MADRL-based resource allocation algorithm with a decentralized partially observable Markov decision process (dec-POMDP) and a mixed-centralized-decentralized (MCD) framework to address the partial observability and the scalability issues, respectively. In addition, we design a reward function featuring the objective decomposition, baseline-guided scaling, and QoS violation penalty so that the agents are coordinated. Extensive experiments demonstrate the convergence, scalability, and robustness of the proposed algorithm. Besides, the proposed algorithm substantially outperforms conventional resource allocation methods and different agent communication mechanisms in terms of maximizing energy efficiency.

1 December 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YXYang Xiao
Yang Xiao
YSYuqian Song
Yuqian Song
JLJun Liu
Jun Liu
Mobile edge computing (MEC) is an enabling technology for next-generation network architectures to deliver more diversified communication services and meet more demanding quality-of-service (QoS) requirements. However, owing to the growing scale and heterogeneity of the networks, energy-efficient resource allocation in heterogeneous MEC (Het-MEC) networks faces great challenges. As an emerging research area, multi-agent deep reinforcement learning (MADRL) is expected to realize autonomous resource allocation in Het-MEC networks by learning from trial and error. Nevertheless, existing MADRL-based solutions are usually not applicable to practical scenarios by the limitations of centralized control schemes or massive signaling overhead. To address the issue, we first formulate the energy-efficient resource allocation problem in Het-MEC networks as a time-variant mixed-integer nonlinear programming (MINLP) problem. Then, we propose a fully decentralized collaborative MADRL-based algorithm featuring the multi-actor shared-critic (MASC) architecture and the regional training distributed execution (RTDE) framework, which effectively stabilizes model training and reduces information exchange, respectively. Finally, we conduct extensive simulations to evaluate the performance of the proposed algorithm. Numerical results demonstrate that the proposed algorithm comprehensively outperforms several mainstream baseline methods in terms of convergence performance, scalability, and robustness.

20 February 2025 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
YSYuqian Song
Yuqian Song
JZjingli zhou
jingli zhou
XLXinyuan Li
Xinyuan Li
JLJun Liu
Jun Liu
Packet routing in modern communication networks faces increasing challenges due to evolving network dynamics and stringent quality-of-service (QoS) requirements. Traditional rule-based and model-based routing methods, constrained by pre-defined rules and static network assumptions, often fail to address these complexities. This paper presents an experience-driven, model-free routing algorithm grounded in deep reinforcement learning (DRL), offering adaptive and efficient forwarding decisions. For practical deployment, we incorporate GraphTransformer networks into the DRL decision framework to enhance generalization under diverse and unseen network conditions. Specifically, we explore two element-level mapping paradigms, node-based and edge-based, to identify the optimal configuration. In addition, we design a hybrid action space that effectively incorporates domain-specific knowledge, thereby contributing to a more robust DRL agent in dynamic routing environments. Simulation results indicate that our proposed algorithms demonstrate significant robustness and generalization capabilities, revealing key principles for designing an optimal GNN-enhanced DRL-based routing algorithm.

23 October 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YSYuqian Song
Yuqian Song
YXYang Xiao
Yang Xiao
JLJun Liu
Jun Liu
The Third Generation Partnership Project has standardized new-radio vehicle-to-everything (NR-V2X) to facilitate advanced use cases for safety-critical message conveyance. However, there is a paucity of resource allocation research for high-performance NR-V2X communications. In this article, we investigate an adaptive optimization issue of energy efficiency (EE) and Quality of Service (QoS) in NR-V2X networks inspired by the Tchebycheff function. To address this issue, we first formulate the resource allocation task as a time-variant mixed-integer nonlinear programming (MINLP) problem. Then, we propose a fully decentralized multiagent deep reinforcement learning (MADRL)-based algorithm characterized by a multitask-actor shared-critic (MTA-SC) architecture and a localized training and distributed execution (LTDE) framework to promote efficient learning and minimize information exchange. Finally, we implement the proposed algorithm in a three-lane highway NR-V2X scenario. Numerical results demonstrate that the proposed algorithm comprehensively outperforms benchmarks in terms of convergence performance, scalability, and robustness.

5 December 2025 in Neurocomputing
Verified
Journal Article
Closed access
YSYuqian Song
Yuqian Song
MNMao Ni
Mao Ni
JLJun Liu
Jun Liu

8 September 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YSYuqian Song
Yuqian Song
JZjingli zhou
jingli zhou
SYShudan Yu
Shudan Yu
JLJun Liu
Jun Liu
The Internet today hosts a multitude of communication sessions from diverse vertical industries, each with distinct and increasingly stringent quality-of-service (QoS) requirements across multiple performance metrics. However, QoS-aware routing remains a significant challenge in traffic engineering, as existing solutions struggle to adapt to dynamic network conditions and meet these rigorous QoS demands. To address this issue, this paper proposes a multi-agent graph reinforcement learning-based routing algorithm that provides differentiated treatment for multiple services. First, we explore both node-based and link-based graph reinforcement learning paradigms for performance comparison. Second, two key mechanisms, i.e., a packet sacrifice mechanism and a Tchebycheff-based reward function, are designed to realize adaptive sacrifice behavior patterns, aiming to optimize the lower bound of service satisfaction rates and enhance fairness across services. Furthermore, to ensure practical applicability, we devise a distributed computing architecture featuring neighborhood-restricted data acquisition and asynchronous historical information retrieval. Extensive simulation results demonstrate that our proposed algorithms significantly outperform benchmark methods regarding the minimum service satisfaction rate, even under unseen networks. Besides, the distributed computing architecture is proven to incur no performance penalty, which can be generalized to other resource-constrained applications.