Helin Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Helin Yang has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Huabing Lu
School of Computer Science and Technology Laboratory of Intelligent Control and Optimization for Industrial Equipment of Ministry of Education Dalian University of Technology 116024 Dalian China
2 shared publications - Jun Cai
Network Intelligence and Innovation Lab (NI2L), Department of Electrical and Computer Engineering, Concordia University, Montreal, QC, Canada
2 shared publications - Xianzhong Xie
Chongqing Key Laboratory of Computer Network and Communication Technology, Chongqing University of Posts and Telecommunications, Chongqing, China
2 shared publications - Zhaoyuan Shi
Key Laboratory of Intelligent Perception and Computing of Anhui Province, Anqing Normal University, Anqing, China
2 shared publications - Chongwen Huang
Zhejiang University
1 shared publication - Dongdong Ye
School of Electronic information and Electrical engineering, Huizhou University, Huizhou, China
1 shared publication
Latest Publications
- Open Access
When Metaverses Meet Vehicle Road Cooperation: Multi-Agent DRL-Based Stackelberg Game for Vehicular Twins Migration
Vehicular Metaverses represent emerging paradigms arising from the convergence of vehicle road cooperation, Metaverse, and augmented intelligence of things. Users engaging with Vehicular Metaverses (VMUs) gain entry by consistently updating their Vehicular Twins (VTs), which are deployed on RoadSide Units (RSUs) in proximity. The constrained RSU coverage and the consistently moving vehicles necessitate the continuous migration of VTs between RSUs through vehicle road cooperation, ensuring uninterrupted immersion services for VMUs. Nevertheless, the VT migration process faces challenges in obtaining adequate bandwidth resources from RSUs for timely migration, posing a resource trading problem among RSUs. In this paper, we tackle this challenge by formulating a game-theoretic incentive mechanism with multi-leader multi-follower, incorporating insights from social-awareness and queueing theory to optimize VT migration. To validate the existence and uniqueness of the Stackelberg Equilibrium, we apply the backward induction method. Theoretical solutions for this equilibrium are then obtained through the Alternating Direction Method of Multipliers (ADMM) algorithm. Moreover, owing to incomplete information caused by the requirements for privacy protection, we proposed a multi-agent deep reinforcement learning algorithm named MALPPO. MALPPO facilitates learning the Stackelberg Equilibrium without requiring private information from others, relying solely on past experiences. Comprehensive experimental results demonstrate that our MALPPO-based incentive mechanism outperforms baseline approaches significantly, showcasing rapid convergence and achieving the highest reward.
Open AccessWhen Metaverses Meet Vehicle Road Cooperation: Multi-Agent DRL-Based Stackelberg Game for Vehicular Twins Migration
Vehicular Metaverses represent emerging paradigms arising from the convergence of vehicle road cooperation, Metaverse, and augmented intelligence of things. Users engaging with Vehicular Metaverses (VMUs) gain entry by consistently updating their Vehicular Twins (VTs), which are deployed on RoadSide Units (RSUs) in proximity. The constrained RSU coverage and the consistently moving vehicles necessitate the continuous migration of VTs between RSUs through vehicle road cooperation, ensuring uninterrupted immersion services for VMUs. Nevertheless, the VT migration process faces challenges in obtaining adequate bandwidth resources from RSUs for timely migration, posing a resource trading problem among RSUs. In this paper, we tackle this challenge by formulating a game-theoretic incentive mechanism with multi-leader multi-follower, incorporating insights from social-awareness and queueing theory to optimize VT migration. To validate the existence and uniqueness of the Stackelberg Equilibrium, we apply the backward induction method. Theoretical solutions for this equilibrium are then obtained through the Alternating Direction Method of Multipliers (ADMM) algorithm. Moreover, owing to incomplete information caused by the requirements for privacy protection, we proposed a multi-agent deep reinforcement learning algorithm named MALPPO. MALPPO facilitates learning the Stackelberg Equilibrium without requiring private information from others, relying solely on past experiences. Comprehensive experimental results demonstrate that our MALPPO-based incentive mechanism outperforms baseline approaches significantly, showcasing rapid convergence and achieving the highest reward.
- Open Access
Active RIS-aided EH-NOMA Networks: A Deep Reinforcement Learning Approach
An active reconfigurable intelligent surface (RIS)-aided multi-user downlink communication system is investigated, where non-orthogonal multiple access (NOMA) is employed to improve spectral efficiency, and the active RIS is powered by energy harvesting (EH). The problem of joint control of the RIS's amplification matrix and phase shift matrix is formulated to maximize the communication success ratio with considering the quality of service (QoS) requirements of users, dynamic communication state, and dynamic available energy of RIS. To tackle this non-convex problem, a cascaded deep learning algorithm namely long short-term memory-deep deterministic policy gradient (LSTM-DDPG) is designed. First, an advanced LSTM based algorithm is developed to predict users' dynamic communication state. Then, based on the prediction results, a DDPG based algorithm is proposed to joint control the amplification matrix and phase shift matrix of the RIS. Finally, simulation results verify the accuracy of the prediction of the proposed LSTM algorithm, and demonstrate that the LSTM-DDPG algorithm has a significant advantage over other benchmark algorithms in terms of communication success ratio performance.
Open AccessActive RIS-aided EH-NOMA Networks: A Deep Reinforcement Learning Approach
An active reconfigurable intelligent surface (RIS)-aided multi-user downlink communication system is investigated, where non-orthogonal multiple access (NOMA) is employed to improve spectral efficiency, and the active RIS is powered by energy harvesting (EH). The problem of joint control of the RIS's amplification matrix and phase shift matrix is formulated to maximize the communication success ratio with considering the quality of service (QoS) requirements of users, dynamic communication state, and dynamic available energy of RIS. To tackle this non-convex problem, a cascaded deep learning algorithm namely long short-term memory-deep deterministic policy gradient (LSTM-DDPG) is designed. First, an advanced LSTM based algorithm is developed to predict users' dynamic communication state. Then, based on the prediction results, a DDPG based algorithm is proposed to joint control the amplification matrix and phase shift matrix of the RIS. Finally, simulation results verify the accuracy of the prediction of the proposed LSTM algorithm, and demonstrate that the LSTM-DDPG algorithm has a significant advantage over other benchmark algorithms in terms of communication success ratio performance.
- Open Access
Advanced NOMA Assisted Semi-Grant-Free Transmission Schemes for Randomly Distributed Users
Non-orthogonal multiple access (NOMA) assisted semi-grant-free (SGF) transmission has recently received significant research attention due to its outstanding ability of serving grant-free (GF) users with grant-based (GB) users' spectrum, which greatly improves the spectrum efficiency and effectively relieves the massive access problem of 5G and beyond networks. In this paper, we first study the outage performance of the greedy best user scheduling SGF scheme (BU-SGF) by considering the impacts of Rayleigh fading, path loss, and random user locations. In order to tackle the admission fairness problem of the BU-SGF scheme, we propose a fair SGF scheme by applying cumulative distribution function (CDF)-based scheduling (CS-SGF), in which the GF user with the best channel relative to its own statistics will be admitted. Moreover, by employing the theories of order statistics and stochastic geometry, the outage performances of both BU-SGF and CS-SGF schemes are analyzed. Theoretical results show that both schemes can achieve full diversity orders only when the served users' data rate is capped, which severely limits the rate performance of SGF schemes. To further address this issue, we propose a distributed power control strategy to relax such data rate constraint, and derive analytical expressions of the two schemes' outage performances under this strategy. Finally, simulation results validate the fairness performance of the proposed CS-SGF scheme, the effectiveness of the power control strategy, and the accuracy of the theoretical analyses.
Open AccessAdvanced NOMA Assisted Semi-Grant-Free Transmission Schemes for Randomly Distributed Users
Non-orthogonal multiple access (NOMA) assisted semi-grant-free (SGF) transmission has recently received significant research attention due to its outstanding ability of serving grant-free (GF) users with grant-based (GB) users' spectrum, which greatly improves the spectrum efficiency and effectively relieves the massive access problem of 5G and beyond networks. In this paper, we first study the outage performance of the greedy best user scheduling SGF scheme (BU-SGF) by considering the impacts of Rayleigh fading, path loss, and random user locations. In order to tackle the admission fairness problem of the BU-SGF scheme, we propose a fair SGF scheme by applying cumulative distribution function (CDF)-based scheduling (CS-SGF), in which the GF user with the best channel relative to its own statistics will be admitted. Moreover, by employing the theories of order statistics and stochastic geometry, the outage performances of both BU-SGF and CS-SGF schemes are analyzed. Theoretical results show that both schemes can achieve full diversity orders only when the served users' data rate is capped, which severely limits the rate performance of SGF schemes. To further address this issue, we propose a distributed power control strategy to relax such data rate constraint, and derive analytical expressions of the two schemes' outage performances under this strategy. Finally, simulation results validate the fairness performance of the proposed CS-SGF scheme, the effectiveness of the power control strategy, and the accuracy of the theoretical analyses.