Jiayin Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Jiayin Wang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Yafeng Wang
The Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China
2 shared publications - Jiarun Yu
School of Information and Communications Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
1 shared publication - Kan Yu
Department of Computer Science and Information Technology, School of Engineering and Mathematical Sciences, La Trobe University, Bendigo, VIC, Australia
1 shared publication - Peng Cheng
Department of Computer Science and Information Technology, La Trobe University, Melbourne, VIC, Australia
1 shared publication - Wei Xiang
La Trobe University
1 shared publication
Latest Publications
- 13 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (7) , 1814-1818
DDPG-Based Joint Resource Management for Latency Minimization in NOMA-MEC Networks
In this letter, we consider the latency minimization problem in NOMA-MEC networks. Each user offloads partial tasks to the MEC server for remote execution and processes the remaining tasks locally. An iterative two-user NOMA scheme is proposed for task offloading. Obviously, users’ tasks partition ratios and offloading power impose a great effect on system performance, which can be further optimized based on the deep deterministic policy gradient (DDPG) method. Specifically, we derive an upper bound for users’ offloading power, and all the power variables can be normalized to fall between zero and one. In this way, the ratio and power variables lie in the same range, which can be obtained via a single DDPG actor network. Moreover, the optimization objective and constraints are both incorporated into the design of the reward function, which assists DDPG to learn desired strategies. Simulation results show that the proposed algorithm can effectively reduce the task processing latency.
- 13 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (7) , 1814-1818
DDPG-Based Joint Resource Management for Latency Minimization in NOMA-MEC Networks
In this letter, we consider the latency minimization problem in NOMA-MEC networks. Each user offloads partial tasks to the MEC server for remote execution and processes the remaining tasks locally. An iterative two-user NOMA scheme is proposed for task offloading. Obviously, users’ tasks partition ratios and offloading power impose a great effect on system performance, which can be further optimized based on the deep deterministic policy gradient (DDPG) method. Specifically, we derive an upper bound for users’ offloading power, and all the power variables can be normalized to fall between zero and one. In this way, the ratio and power variables lie in the same range, which can be obtained via a single DDPG actor network. Moreover, the optimization objective and constraints are both incorporated into the design of the reward function, which assists DDPG to learn desired strategies. Simulation results show that the proposed algorithm can effectively reduce the task processing latency.
- Open Access
Joint Beam-Forming, User Clustering and Power Allocation for MIMO-NOMA Systems
In this paper, we consider the optimal resource allocation problem for multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) systems, which consists of beam-forming, user clustering and power allocation, respectively. Users can be divided into different clusters, and the users in the same cluster are served by the same beam vector. Inter-cluster orthogonality can be guaranteed based on multi-user detection (MUD). In this paper, we propose a three-step framework to solve the multi-dimensional resource allocation problem. In step 1, we propose a beam-forming algorithm for a given user cluster. Specifically, fractional transmitting power control (FTPC) is applied for intra-cluster power allocation. The considered beam-forming problem can be transformed into a non-constrained one and the limited-memory Broyden–Fletcher–Goldfarb–Shanno (L-BFGS) method is applied to obtain the optimal solution. In step 2, optimal user clustering is further considered. Channel differences and correlations are both involved in the design of user clustering. By assigning different weights to the two factors, we can produce multiple candidate clustering schemes. Based on the proposed beam-forming algorithm, beam-forming can be done for each candidate clustering scheme to compare their performances. Moreover, based on the optimal user clustering and beam-forming schemes, in step 3, power allocation can be further optimized. Specifically, it can be formalized as a difference of convex (DC) programming problem, which is solved by successive convex approximation (SCA) with strong robustness. Simulations results show that the proposed scheme can effectively improve spectral efficiency (SE) and edge users’ data rates.
Open AccessJoint Beam-Forming, User Clustering and Power Allocation for MIMO-NOMA Systems
In this paper, we consider the optimal resource allocation problem for multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) systems, which consists of beam-forming, user clustering and power allocation, respectively. Users can be divided into different clusters, and the users in the same cluster are served by the same beam vector. Inter-cluster orthogonality can be guaranteed based on multi-user detection (MUD). In this paper, we propose a three-step framework to solve the multi-dimensional resource allocation problem. In step 1, we propose a beam-forming algorithm for a given user cluster. Specifically, fractional transmitting power control (FTPC) is applied for intra-cluster power allocation. The considered beam-forming problem can be transformed into a non-constrained one and the limited-memory Broyden–Fletcher–Goldfarb–Shanno (L-BFGS) method is applied to obtain the optimal solution. In step 2, optimal user clustering is further considered. Channel differences and correlations are both involved in the design of user clustering. By assigning different weights to the two factors, we can produce multiple candidate clustering schemes. Based on the proposed beam-forming algorithm, beam-forming can be done for each candidate clustering scheme to compare their performances. Moreover, based on the optimal user clustering and beam-forming schemes, in step 3, power allocation can be further optimized. Specifically, it can be formalized as a difference of convex (DC) programming problem, which is solved by successive convex approximation (SCA) with strong robustness. Simulations results show that the proposed scheme can effectively improve spectral efficiency (SE) and edge users’ data rates.