Yueqiang Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yueqiang Xu has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Chengcheng Zhou
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China
1 shared publication Chunyu Liu
Joint Laboratory for Space Information Network Frequency and Orbit Technology and Applications, China Satellite Network System Research Institute Co., Ltd, Beijing, China
1 shared publication- Feiran Gao
Beijing-Dublin International College, Beijing University of Technology, Beijing, China
1 shared publication - Fuhong Lin
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China
1 shared publication Guowei Li
North China Institute of Computing Technology Beijing, Beijing, 100080, China
1 shared publication- Haitao Xu
University of Science and Technology Beijing
1 shared publication
Latest Publications
- Open Access
- 1 July 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-17
Blockchain-based heterogeneous resource configuration scheme in computing power network
To provide users with on-demand computing and network resources while ensuring service quality, the concept of a computational power network has emerged. However, efficiently allocating these resources to achieve an optimal balance between system energy consumption and latency, as well as ensuring the security of the resource allocation process, remain significant challenges. To solve these challenges, this paper proposes a secure edge offloading optimization framework. Within this framework, we incorporate blockchain technology to record critical network information in blocks within the blockchain, thereby ensuring the security of resource allocation. Subsequently, we formulate a joint optimization problem aimed at optimizing network bandwidth, computational resources, and blockchain maintenance resources simultaneously to achieve the best possible balance between system latency and energy consumption. Given the complexity of the original problem, we decompose it into two subproblems and solve each using the Lagrange multiplier iterative algorithm. To validate the effectiveness of our proposed solution, we compare it with several baseline approaches, including those based on Particle Swarm Optimization (PSO) and reinforcement learning methods such as Proximal Policy Optimization (PPO). Simulation results demonstrate that our proposed scheme performs notably better in achieving an optimal balance between system energy consumption and latency.
- 1 July 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-17
Open AccessBlockchain-based heterogeneous resource configuration scheme in computing power network
To provide users with on-demand computing and network resources while ensuring service quality, the concept of a computational power network has emerged. However, efficiently allocating these resources to achieve an optimal balance between system energy consumption and latency, as well as ensuring the security of the resource allocation process, remain significant challenges. To solve these challenges, this paper proposes a secure edge offloading optimization framework. Within this framework, we incorporate blockchain technology to record critical network information in blocks within the blockchain, thereby ensuring the security of resource allocation. Subsequently, we formulate a joint optimization problem aimed at optimizing network bandwidth, computational resources, and blockchain maintenance resources simultaneously to achieve the best possible balance between system latency and energy consumption. Given the complexity of the original problem, we decompose it into two subproblems and solve each using the Lagrange multiplier iterative algorithm. To validate the effectiveness of our proposed solution, we compare it with several baseline approaches, including those based on Particle Swarm Optimization (PSO) and reinforcement learning methods such as Proximal Policy Optimization (PPO). Simulation results demonstrate that our proposed scheme performs notably better in achieving an optimal balance between system energy consumption and latency.
- 18 April 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (6) , 1-30
How to balance the verification burden: a multi-hierarchical aggregate signature for drone swarms
- 18 April 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (6) , 1-30
How to balance the verification burden: a multi-hierarchical aggregate signature for drone swarms
- 18 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (11) , 17668-17683
Dynamic Energy Management for UAV-Enabled VR Systems: A Tile-Based Collaboration Approach
Unmanned aerial vehicles (UAVs) have been envisioned as a promising technology to support wireless virtual reality (VR) applications. However, the huge energy consumption during the rendering process is challenging for UAV-enabled VR systems. The existing energy management strategies neglecting the dynamic and tiling features of VR tasks may not achieve optimal performance. To cope with these issues, we present a dynamic energy optimization framework for UAV-enabled VR systems. In the proposed framework, a tile-based collaborative rendering scheme for multi-UAVs is developed by exploiting the correlation among different tiles of VR users. Further, we formulate an optimization problem by jointly considering the collaboration decision, resource allocation, and UAV trajectory, aiming to reduce the long-term energy consumption under the motion-to-photon (MTP) latency requirement. Due to the tight coupling variables and the dynamic factors, the formulated problem is non-convex and difficult to tackle by adopting the traditional method. To this end, we first decompose the original problem into two sub-problems, i.e., the UAV trajectory and collaboration decision (UTCD) problem, and the resource allocation (RA) problem. Then, we design a dynamic UTCD algorithm based on deep reinforcement learning (DRL) and present an optimal RA algorithm based on the Lagrangian multiplier iterative (LMI) method. To enhance the solving efficiency, a block coordinate descent (BCD)-based solving method is introduced by embedding the RA algorithm in the learning environment of DRL. Finally, simulation results prove that the proposed scheme can obtain good performance for UAV-enabled VR systems.
- 18 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (11) , 17668-17683
Dynamic Energy Management for UAV-Enabled VR Systems: A Tile-Based Collaboration Approach
Unmanned aerial vehicles (UAVs) have been envisioned as a promising technology to support wireless virtual reality (VR) applications. However, the huge energy consumption during the rendering process is challenging for UAV-enabled VR systems. The existing energy management strategies neglecting the dynamic and tiling features of VR tasks may not achieve optimal performance. To cope with these issues, we present a dynamic energy optimization framework for UAV-enabled VR systems. In the proposed framework, a tile-based collaborative rendering scheme for multi-UAVs is developed by exploiting the correlation among different tiles of VR users. Further, we formulate an optimization problem by jointly considering the collaboration decision, resource allocation, and UAV trajectory, aiming to reduce the long-term energy consumption under the motion-to-photon (MTP) latency requirement. Due to the tight coupling variables and the dynamic factors, the formulated problem is non-convex and difficult to tackle by adopting the traditional method. To this end, we first decompose the original problem into two sub-problems, i.e., the UAV trajectory and collaboration decision (UTCD) problem, and the resource allocation (RA) problem. Then, we design a dynamic UTCD algorithm based on deep reinforcement learning (DRL) and present an optimal RA algorithm based on the Lagrangian multiplier iterative (LMI) method. To enhance the solving efficiency, a block coordinate descent (BCD)-based solving method is introduced by embedding the RA algorithm in the learning environment of DRL. Finally, simulation results prove that the proposed scheme can obtain good performance for UAV-enabled VR systems.
- Open Access
- 1 January 2024
- Published by Tech Science Press in Computers, Materials & Continua
- Vol. 80 (2) , 1809-1829
Dynamic Offloading and Scheduling Strategy for Telematics Tasks Based on Latency Minimization
In current research on task offloading and resource scheduling in vehicular networks, vehicles are commonly assumed to maintain constant speed or relatively stationary states, and the impact of speed variations on task offloading is often overlooked. It is frequently assumed that vehicles can be accurately modeled during actual motion processes. However, in vehicular dynamic environments, both the tasks generated by the vehicles and the vehicles’ surroundings are constantly changing, making it difficult to achieve real-time modeling for actual dynamic vehicular network scenarios. Taking into account the actual dynamic vehicular scenarios, this paper considers the real-time non-uniform movement of vehicles and proposes a vehicular task dynamic offloading and scheduling algorithm for single-task multi-vehicle vehicular network scenarios, attempting to solve the dynamic decision-making problem in task offloading process. The optimization objective is to minimize the average task completion time, which is formulated as a multi-constrained non-linear programming problem. Due to the mobility of vehicles, a constraint model is applied in the decision-making process to dynamically determine whether the communication range is sufficient for task offloading and transmission. Finally, the proposed vehicular task dynamic offloading and scheduling algorithm based on muti-agent deep deterministic policy gradient (MADDPG) is applied to solve the optimal solution of the optimization problem. Simulation results show that the algorithm proposed in this paper is able to achieve lower latency task computation offloading. Meanwhile, the average task completion time of the proposed algorithm in this paper can be improved by 7.6% compared to the performance of the MADDPG scheme and 51.1% compared to the performance of deep deterministic policy gradient (DDPG).
- 1 January 2024
- Published by Tech Science Press in Computers, Materials & Continua
- Vol. 80 (2) , 1809-1829
Open AccessDynamic Offloading and Scheduling Strategy for Telematics Tasks Based on Latency Minimization
In current research on task offloading and resource scheduling in vehicular networks, vehicles are commonly assumed to maintain constant speed or relatively stationary states, and the impact of speed variations on task offloading is often overlooked. It is frequently assumed that vehicles can be accurately modeled during actual motion processes. However, in vehicular dynamic environments, both the tasks generated by the vehicles and the vehicles’ surroundings are constantly changing, making it difficult to achieve real-time modeling for actual dynamic vehicular network scenarios. Taking into account the actual dynamic vehicular scenarios, this paper considers the real-time non-uniform movement of vehicles and proposes a vehicular task dynamic offloading and scheduling algorithm for single-task multi-vehicle vehicular network scenarios, attempting to solve the dynamic decision-making problem in task offloading process. The optimization objective is to minimize the average task completion time, which is formulated as a multi-constrained non-linear programming problem. Due to the mobility of vehicles, a constraint model is applied in the decision-making process to dynamically determine whether the communication range is sufficient for task offloading and transmission. Finally, the proposed vehicular task dynamic offloading and scheduling algorithm based on muti-agent deep deterministic policy gradient (MADDPG) is applied to solve the optimal solution of the optimization problem. Simulation results show that the algorithm proposed in this paper is able to achieve lower latency task computation offloading. Meanwhile, the average task completion time of the proposed algorithm in this paper can be improved by 7.6% compared to the performance of the MADDPG scheme and 51.1% compared to the performance of deep deterministic policy gradient (DDPG).