Jing Mei
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
Jing Mei has a total of 62 co-authors. Here are the top co-authors by number of shared publications:
- Keqin Li
Hunan University
23 shared publications - Zhao Tong
College of Information Science and Engineering, Hunan Normal University, Changsha, Hunan, China
21 shared publications - Kenli Li
Hunan University
13 shared publications - Jiake Wang
Hunan Normal University
4 shared publications Lihui Xia
3 shared publications- Jinhui Cai
College of Information Science and Engineering, Hunan Normal University, Changsha, Hunan, China
2 shared publications
Latest Publications
- 11 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (16) , 1
Energy-Efficient Dynamic Offloading Strategy with Stable Dual-Priority Queues via Lyapunov Optimization
With the exponential growth of Internet of Things (IoT) devices, deploying computationally-demanding applications at the edge has become a prevailing trend. Current mainstream research primarily focuses on the balance between system stability and energy optimization, while largely ignoring the differential latency requirements of tasks. This study proposes a multi-objective optimization framework that not only ensures system stability but also minimizes energy consumption while meeting differentiated latency requirements. This study implements a dual-priority queuing architecture where each terminal device maintains distinct high-priority and low-priority queues to isolate high-latency and low-latency tasks. By establishing corresponding virtual queues for each queue, the original queue threshold constraints are transformed into virtual queue stability constraints, enabling the construction of a quantifiable mathematical model. Leveraging Lyapunov optimization theory, the original optimal control problem is reformulated as a stochastic optimization problem requiring only current system information. A novel adaptive offloading strategy is designed to minimize long-term energy consumption while preserving queue length constraints. To empirically demonstrate the superiority of our method, comprehensive simulation experiments are conducted across diverse scenarios. Compared with the baseline algorithm, the proposed algorithm achieves significant energy efficiency improvements, with a reduction in power consumption ranging from 20% to 30%. Concurrently, it demonstrates approximately 25% enhancement in system load processing capacity, indicating superior resource utilization efficiency.
- 11 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (16) , 1
Energy-Efficient Dynamic Offloading Strategy with Stable Dual-Priority Queues via Lyapunov Optimization
With the exponential growth of Internet of Things (IoT) devices, deploying computationally-demanding applications at the edge has become a prevailing trend. Current mainstream research primarily focuses on the balance between system stability and energy optimization, while largely ignoring the differential latency requirements of tasks. This study proposes a multi-objective optimization framework that not only ensures system stability but also minimizes energy consumption while meeting differentiated latency requirements. This study implements a dual-priority queuing architecture where each terminal device maintains distinct high-priority and low-priority queues to isolate high-latency and low-latency tasks. By establishing corresponding virtual queues for each queue, the original queue threshold constraints are transformed into virtual queue stability constraints, enabling the construction of a quantifiable mathematical model. Leveraging Lyapunov optimization theory, the original optimal control problem is reformulated as a stochastic optimization problem requiring only current system information. A novel adaptive offloading strategy is designed to minimize long-term energy consumption while preserving queue length constraints. To empirically demonstrate the superiority of our method, comprehensive simulation experiments are conducted across diverse scenarios. Compared with the baseline algorithm, the proposed algorithm achieves significant energy efficiency improvements, with a reduction in power consumption ranging from 20% to 30%. Concurrently, it demonstrates approximately 25% enhancement in system load processing capacity, indicating superior resource utilization efficiency.
- 26 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1-17
Transformer Enhanced Task Offloading with Privacy-Preserving in Heterogeneous and Dynamic Edge Networks
The exponential growth of edge devices and growing demand for low-latency, high-throughput applications have established edge computing as essential infrastructure. Edge computing enables near-data computation to alleviate device burdens, yet task offloading optimization remains challenging due to the heterogeneous, dynamic networks and privacy risks in centralized approaches. To address these intertwined challenges, we propose the federated Q-Learning via Transformer for task offloading (FQTTO) algorithm, which integrates federated learning (FL) with a Transformer-based Q-Network. FL ensures privacy-preserving distributed model updates, while the Transformer employs customized sequential state encodings of task priorities and resource availabilities to autoregressively predict Q-values, incorporating $n$-step returns for long-term optimization. Extensive simulations show that compared to the baseline methods, FQTTO achieves average reductions exceeding 20.4% in delay and 22.3% in energy consumption, while improving load balance by at least 13.4% and enhancing the task completion rate by up to 12.1%.
- 26 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1-17
Transformer Enhanced Task Offloading with Privacy-Preserving in Heterogeneous and Dynamic Edge Networks
The exponential growth of edge devices and growing demand for low-latency, high-throughput applications have established edge computing as essential infrastructure. Edge computing enables near-data computation to alleviate device burdens, yet task offloading optimization remains challenging due to the heterogeneous, dynamic networks and privacy risks in centralized approaches. To address these intertwined challenges, we propose the federated Q-Learning via Transformer for task offloading (FQTTO) algorithm, which integrates federated learning (FL) with a Transformer-based Q-Network. FL ensures privacy-preserving distributed model updates, while the Transformer employs customized sequential state encodings of task priorities and resource availabilities to autoregressively predict Q-values, incorporating $n$-step returns for long-term optimization. Extensive simulations show that compared to the baseline methods, FQTTO achieves average reductions exceeding 20.4% in delay and 22.3% in energy consumption, while improving load balance by at least 13.4% and enhancing the task completion rate by up to 12.1%.
- 16 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (12) , 25980-25995
LADPG: A Lyapunov Optimization-Based Resource Allocation Strategy for Heterogeneous Vehicular Networks
Vehicular edge computing (VEC) is an emerging paradigm that offloads computationally intensive tasks to nearby VEC servers instead of cloud servers, effectively reducing data transmission latency and enhancing system real-time performance and reliability. However, heterogeneous communication technologies and task diversity introduce significant challenges in resource allocation, rendering traditional optimization methods inadequate for dynamic network environments and long-term queue stability requirements. This article proposed a Lyapunov adaptive deterministic policy gradient (LADPG) algorithm to address the dynamic multiobjective optimization problem of online task offloading and resource allocation in a single VEC server scenario. LADPG integrates Lyapunov optimization with the deep deterministic policy gradient (DDPG) framework to transform long-term queue stability constraints into short-term reward functions. It dynamically adjusts communication and VEC server computation resource allocations to jointly optimize energy consumption and utility costs under latency constraints. In addition, a dynamic channel selection mechanism is designed to mitigate congestion and enhance transmission efficiency. Extensive simulations demonstrate that LADPG significantly improves system performance, particularly in high-load and dynamic scenarios.
- 16 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (12) , 25980-25995
LADPG: A Lyapunov Optimization-Based Resource Allocation Strategy for Heterogeneous Vehicular Networks
Vehicular edge computing (VEC) is an emerging paradigm that offloads computationally intensive tasks to nearby VEC servers instead of cloud servers, effectively reducing data transmission latency and enhancing system real-time performance and reliability. However, heterogeneous communication technologies and task diversity introduce significant challenges in resource allocation, rendering traditional optimization methods inadequate for dynamic network environments and long-term queue stability requirements. This article proposed a Lyapunov adaptive deterministic policy gradient (LADPG) algorithm to address the dynamic multiobjective optimization problem of online task offloading and resource allocation in a single VEC server scenario. LADPG integrates Lyapunov optimization with the deep deterministic policy gradient (DDPG) framework to transform long-term queue stability constraints into short-term reward functions. It dynamically adjusts communication and VEC server computation resource allocations to jointly optimize energy consumption and utility costs under latency constraints. In addition, a dynamic channel selection mechanism is designed to mitigate congestion and enhance transmission efficiency. Extensive simulations demonstrate that LADPG significantly improves system performance, particularly in high-load and dynamic scenarios.
- 4 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (10) , 22425-22439
Game-Theoretic Bandwidth Allocation and Task Offloading in Cloud–Edge Collaboration
The rapid growth of Internet of Things (IoT) devices has imposed higher demands on computational capabilities, which traditional cloud computing struggles to meet in real-time scenarios due to latency issues. Mobile edge computing (MEC) addresses these challenges by processing data at the network edge, thereby reducing latency and enhancing computational efficiency. However, MEC alone is insufficient for handling complex tasks, requiring more robust solutions. This article proposes a hybrid cloud–edge computing framework that enhances system performance by integrating cloud and edge computing. A game-theoretic model is used to optimize wireless bandwidth allocation, and a Stackelberg game mechanism is introduced to incentivize task offloading. This approach orchestrates resource allocation and task offloading dynamics through game theory, ensuring cost minimization and delay requirements are met while fostering cloud–edge collaboration. Theoretical analysis demonstrates the existence of Nash equilibria in both layers of the game, ensuring the system’s stability and effectiveness in complex environments. Based on this, the GA-based resource allocation and offloading (GRAO) algorithm and the iterative game-theoretic offloading (IGTO) algorithm are proposed. Experimental results validate the proposed algorithms, showing that the IGTO algorithm reduces the average cost for mobile devices (MDs) by 49.8% compared to the best baseline, while enhancing overall performance for both MEC servers and the cloud.
- 4 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (10) , 22425-22439
Game-Theoretic Bandwidth Allocation and Task Offloading in Cloud–Edge Collaboration
The rapid growth of Internet of Things (IoT) devices has imposed higher demands on computational capabilities, which traditional cloud computing struggles to meet in real-time scenarios due to latency issues. Mobile edge computing (MEC) addresses these challenges by processing data at the network edge, thereby reducing latency and enhancing computational efficiency. However, MEC alone is insufficient for handling complex tasks, requiring more robust solutions. This article proposes a hybrid cloud–edge computing framework that enhances system performance by integrating cloud and edge computing. A game-theoretic model is used to optimize wireless bandwidth allocation, and a Stackelberg game mechanism is introduced to incentivize task offloading. This approach orchestrates resource allocation and task offloading dynamics through game theory, ensuring cost minimization and delay requirements are met while fostering cloud–edge collaboration. Theoretical analysis demonstrates the existence of Nash equilibria in both layers of the game, ensuring the system’s stability and effectiveness in complex environments. Based on this, the GA-based resource allocation and offloading (GRAO) algorithm and the iterative game-theoretic offloading (IGTO) algorithm are proposed. Experimental results validate the proposed algorithms, showing that the IGTO algorithm reduces the average cost for mobile devices (MDs) by 49.8% compared to the best baseline, while enhancing overall performance for both MEC servers and the cloud.
- 24 January 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 180
Online 3D trajectory and resource optimization for dynamic UAV-assisted MEC systems
- 24 January 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 180
Online 3D trajectory and resource optimization for dynamic UAV-assisted MEC systems
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 6721-6734
Energy-Aware Multi-UAV Collaboration for Data Collection and Trajectory Planning With MADDPG
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 6721-6734
Energy-Aware Multi-UAV Collaboration for Data Collection and Trajectory Planning With MADDPG
- 16 September 2025
- Published by Elsevier in Journal of Systems Architecture
- Vol. 168
Trajectory design for data collection under insufficient UAV energy: A staged actor–critic reinforcement learning approach
- 16 September 2025
- Published by Elsevier in Journal of Systems Architecture
- Vol. 168
Trajectory design for data collection under insufficient UAV energy: A staged actor–critic reinforcement learning approach
- 3 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (3) , 2502-2515
Stackelberg Game-Based Pricing and Offloading for the DVFS-Enabled MEC Systems
Due to the limited computing resources of both mobile devices (MDs) and the mobile edge computing (MEC) server, devising reasonable strategies for MD task offloading, MEC server resource pricing, and resource allocation is crucial. In this paper, a scenario is considered, comprising multiple MDs and a single MEC server. Each MD has a divisible task in each time slot, allowing for partial offloading and the option to discard parts of the task. The MEC server contains multiple computing units with the same computing power, and its computing resources can be dynamically adjusted through dynamic voltage and frequency scaling (DVFS) according to the size of tasks offloaded by MDs. At any given time slice, a Stackelberg game is formulated based on the strategies of the MDs and the strategy of the MEC server. An iterative evolution algorithm is employed to explore the optimal strategies for MDs and the MEC server. Simulation results demonstrate that both parties can reach an equilibrium state through the game, and these experiments confirm that the algorithm effectively enhances system efficiency.
- 3 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (3) , 2502-2515
Stackelberg Game-Based Pricing and Offloading for the DVFS-Enabled MEC Systems
Due to the limited computing resources of both mobile devices (MDs) and the mobile edge computing (MEC) server, devising reasonable strategies for MD task offloading, MEC server resource pricing, and resource allocation is crucial. In this paper, a scenario is considered, comprising multiple MDs and a single MEC server. Each MD has a divisible task in each time slot, allowing for partial offloading and the option to discard parts of the task. The MEC server contains multiple computing units with the same computing power, and its computing resources can be dynamically adjusted through dynamic voltage and frequency scaling (DVFS) according to the size of tasks offloaded by MDs. At any given time slice, a Stackelberg game is formulated based on the strategies of the MDs and the strategy of the MEC server. An iterative evolution algorithm is employed to explore the optimal strategies for MDs and the MEC server. Simulation results demonstrate that both parties can reach an equilibrium state through the game, and these experiments confirm that the algorithm effectively enhances system efficiency.