You Shi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
You Shi has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Changyan Yi
Nanjing University of Aeronautics and Astronautics
11 shared publications - Bing Chen
Nanjing University of Aeronautics and Astronautics
4 shared publications - Jun Cai
Network Intelligence and Innovation Lab (NI2L), Department of Electrical and Computer Engineering, Concordia University, Montreal, QC, Canada
4 shared publications - Jialiuyuan Li
College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu, China
3 shared publications - Jiayuan Chen
Nanjing University of Aeronautics and Astronautics
3 shared publications - Yuye Yang
College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China
3 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (21) , 51417-51438
Collaborative Coverage of Heterogeneous Unmanned Swarms Based on Deep Reinforcement Learning in Signal Interference Environments
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (21) , 51417-51438
Collaborative Coverage of Heterogeneous Unmanned Swarms Based on Deep Reinforcement Learning in Signal Interference Environments
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Magazine
- Vol. 9 (6) , 128-135
Collaborative Embodied Learning for Digital Twin Deployment in Industrial IoT: Challenges and Solutions
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Magazine
- Vol. 9 (6) , 128-135
Collaborative Embodied Learning for Digital Twin Deployment in Industrial IoT: Challenges and Solutions
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (6) , 9717-9733
A Learning-Based Stochastic Game for Energy Efficient Optimization of UAV Trajectory and Task Offloading in Space/Aerial Edge Computing
In this paper, we study the energy-efficient unmanned aerial vehicle (UAV) and low earth orbital (LEO) satellite assisted mobile edge computing (MEC) in space–air–ground integrated networks (SAGINs). The key challenge involves how to efficiently execute tasks offloaded from IoT devices, given limited on-board computation capabilities of UAVs and delay constraints of tasks. To address it, UAVs are first allowed to adjust their trajectories to accommodate as many tasks as possible from IoT devices. Subsequently, UAVs compute a portion of these tasks while delegating the rest to LEO satellites for further execution. Accordingly, we formulate a joint optimization problem including UAV trajectory planning, task offloading, and bandwidth allocations, aiming to maximize the long-term energy efficiency of UAVs and LEO satellites (i.e., the total data size in computation offloading divided by energy consumption of UAVs and LEO satellites). Considering the interactions among intelligent UAVs, this problem is reformulated as a set of interconnected multi-agent stochastic games, and the existence of corresponding Nash Equilibrium (NE) is theoretically proved. To obtain the NE, a multi-agent reinforcement learning-based algorithm, namely UTPTR, is developed concerning system dynamics and uncertainties. Simulations evaluate the performance of the UTPTR and demonstrate its superiority compared to existing approaches.
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (6) , 9717-9733
A Learning-Based Stochastic Game for Energy Efficient Optimization of UAV Trajectory and Task Offloading in Space/Aerial Edge Computing
In this paper, we study the energy-efficient unmanned aerial vehicle (UAV) and low earth orbital (LEO) satellite assisted mobile edge computing (MEC) in space–air–ground integrated networks (SAGINs). The key challenge involves how to efficiently execute tasks offloaded from IoT devices, given limited on-board computation capabilities of UAVs and delay constraints of tasks. To address it, UAVs are first allowed to adjust their trajectories to accommodate as many tasks as possible from IoT devices. Subsequently, UAVs compute a portion of these tasks while delegating the rest to LEO satellites for further execution. Accordingly, we formulate a joint optimization problem including UAV trajectory planning, task offloading, and bandwidth allocations, aiming to maximize the long-term energy efficiency of UAVs and LEO satellites (i.e., the total data size in computation offloading divided by energy consumption of UAVs and LEO satellites). Considering the interactions among intelligent UAVs, this problem is reformulated as a set of interconnected multi-agent stochastic games, and the existence of corresponding Nash Equilibrium (NE) is theoretically proved. To obtain the NE, a multi-agent reinforcement learning-based algorithm, namely UTPTR, is developed concerning system dynamics and uncertainties. Simulations evaluate the performance of the UTPTR and demonstrate its superiority compared to existing approaches.
- Top Cited Papers
- 24 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (21) , 34749-34773
Generative-AI-Driven Human Digital Twin in IoT Healthcare: A Comprehensive Survey
The Internet of Things (IoT) can significantly enhance the quality of human life, specifically in healthcare, attracting extensive attentions to IoT healthcare services. Meanwhile, the human digital twin (HDT) is proposed as an innovative paradigm that can comprehensively characterize the replication of the individual human body in the digital world and reflect its physical status in real time. Naturally, HDT is envisioned to empower IoT healthcare beyond the application of healthcare monitoring by acting as a versatile and vivid human digital testbed, simulating the outcomes and guiding the practical treatments. However, successfully establishing HDT requires high-fidelity virtual modeling and strong information interactions but possibly with scarce, biased, and noisy data. Fortunately, a recent popular technology called generative artificial intelligence (GAI) may be a promising solution because it can leverage advanced AI algorithms to automatically create, manipulate, and modify valuable while diverse data. This survey particularly focuses on the implementation of GAI-driven HDT in IoT healthcare. We start by introducing the background of IoT healthcare and the potential of GAI-driven HDT. Then, we delve into the fundamental techniques and present the overall framework of GAI-driven HDT. After that, we explore the realization of GAI-driven HDT in detail, including GAI-enabled data acquisition, communication, data management, digital modeling, and data analysis. Besides, we discuss typical IoT healthcare applications that can be revolutionized by GAI-driven HDT, namely, personalized health monitoring and diagnosis, personalized prescription, and personalized rehabilitation. Finally, we conclude this survey by highlighting some future research directions.
- 24 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (21) , 34749-34773
Top Cited PapersGenerative-AI-Driven Human Digital Twin in IoT Healthcare: A Comprehensive Survey
The Internet of Things (IoT) can significantly enhance the quality of human life, specifically in healthcare, attracting extensive attentions to IoT healthcare services. Meanwhile, the human digital twin (HDT) is proposed as an innovative paradigm that can comprehensively characterize the replication of the individual human body in the digital world and reflect its physical status in real time. Naturally, HDT is envisioned to empower IoT healthcare beyond the application of healthcare monitoring by acting as a versatile and vivid human digital testbed, simulating the outcomes and guiding the practical treatments. However, successfully establishing HDT requires high-fidelity virtual modeling and strong information interactions but possibly with scarce, biased, and noisy data. Fortunately, a recent popular technology called generative artificial intelligence (GAI) may be a promising solution because it can leverage advanced AI algorithms to automatically create, manipulate, and modify valuable while diverse data. This survey particularly focuses on the implementation of GAI-driven HDT in IoT healthcare. We start by introducing the background of IoT healthcare and the potential of GAI-driven HDT. Then, we delve into the fundamental techniques and present the overall framework of GAI-driven HDT. After that, we explore the realization of GAI-driven HDT in detail, including GAI-enabled data acquisition, communication, data management, digital modeling, and data analysis. Besides, we discuss typical IoT healthcare applications that can be revolutionized by GAI-driven HDT, namely, personalized health monitoring and diagnosis, personalized prescription, and personalized rehabilitation. Finally, we conclude this survey by highlighting some future research directions.
- 5 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 9 (1) , 255-270
A Reinforcement Learning-Based Stochastic Game for Energy-Efficient UAV Swarm-Assisted MEC With Dynamic Clustering and Scheduling
In this paper, we study the energy-efficient unmanned aerial vehicle (UAV) swarm assisted mobile edge computing (MEC) with dynamic clustering and scheduling. In the considered system model, UAVs are divided into multiple swarms, with each swarm consisting of a leader UAV and several follower UAVs. These UAVs serve as mobile edge servers, providing computing services to their covered ground end-users. Unlike existing works, we allow UAVs to dynamically cluster into different swarms, in other words, each follower UAV can change its leader based on the time-varying spatial positions, updated application placement, etc. in a dynamic manner. With the objective of maximizing the long-term energy efficiency of the UAV swarm assisted MEC system, a joint optimization problem of UAV swarm dynamic clustering and scheduling is formulated. Considering the inherent cooperation and competition among intelligent UAVs, we further reformulate this problem as a combination of a series of strongly interconnected multi-agent stochastic games, and theoretically prove the existence of the corresponding Nash Equilibrium (NE). Then, we propose a novel reinforcement learning based UAV swarm dynamic coordination (RLDC) algorithm for obtaining such an equilibrium. Furthermore, the convergence and complexity of the RLDC algorithm are analyzed. Simulations are performed to evaluate the performance of RLDC and illustrate its superiority compared to existing approaches.
- 5 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 9 (1) , 255-270
A Reinforcement Learning-Based Stochastic Game for Energy-Efficient UAV Swarm-Assisted MEC With Dynamic Clustering and Scheduling
In this paper, we study the energy-efficient unmanned aerial vehicle (UAV) swarm assisted mobile edge computing (MEC) with dynamic clustering and scheduling. In the considered system model, UAVs are divided into multiple swarms, with each swarm consisting of a leader UAV and several follower UAVs. These UAVs serve as mobile edge servers, providing computing services to their covered ground end-users. Unlike existing works, we allow UAVs to dynamically cluster into different swarms, in other words, each follower UAV can change its leader based on the time-varying spatial positions, updated application placement, etc. in a dynamic manner. With the objective of maximizing the long-term energy efficiency of the UAV swarm assisted MEC system, a joint optimization problem of UAV swarm dynamic clustering and scheduling is formulated. Considering the inherent cooperation and competition among intelligent UAVs, we further reformulate this problem as a combination of a series of strongly interconnected multi-agent stochastic games, and theoretically prove the existence of the corresponding Nash Equilibrium (NE). Then, we propose a novel reinforcement learning based UAV swarm dynamic coordination (RLDC) algorithm for obtaining such an equilibrium. Furthermore, the convergence and complexity of the RLDC algorithm are analyzed. Simulations are performed to evaluate the performance of RLDC and illustrate its superiority compared to existing approaches.
- Top Cited Papers
- 28 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (12) , 12262-12279
Dynamic Human Digital Twin Deployment at the Edge for Task Execution: A Two-Timescale Accuracy-Aware Online Optimization
Human digital twin (HDT) is an emerging paradigm that bridges physical twins (PTs) with powerful virtual twins (VTs) for assisting complex task executions in human-centric services. In this paper, we study a two-timescale online optimization for building HDT under an end-edge-cloud collaborative framework. As a unique feature of HDT, we consider that PTs' corresponding VTs are deployed on edge servers, consisting of not only generic models placed by downloading experiential knowledge from the cloud but also customized models updated by collecting personalized data from end devices. To maximize task execution accuracy with stringent energy and delay constraints, and by taking into account HDT's inherent mobility and status variation uncertainties, we jointly and dynamically optimize VTs' construction and PTs' task offloading, along with communication and computation resource allocations. Observing that decision variables are asynchronous with different triggers, we propose a novel two-timescale accuracy-aware online optimization approach (TACO). Specifically, TACO utilizes an improved Lyapunov method to decompose the problem into multiple instant ones, and then leverages piecewise McCormick envelopes and block coordinate descent based algorithms, addressing two timescales alternately. Theoretical analyses and simulations show that the proposed approach can reach asymptotic optimum within a polynomial-time complexity, and demonstrate its superiority over counterparts.
- 28 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (12) , 12262-12279
Top Cited PapersDynamic Human Digital Twin Deployment at the Edge for Task Execution: A Two-Timescale Accuracy-Aware Online Optimization
Human digital twin (HDT) is an emerging paradigm that bridges physical twins (PTs) with powerful virtual twins (VTs) for assisting complex task executions in human-centric services. In this paper, we study a two-timescale online optimization for building HDT under an end-edge-cloud collaborative framework. As a unique feature of HDT, we consider that PTs' corresponding VTs are deployed on edge servers, consisting of not only generic models placed by downloading experiential knowledge from the cloud but also customized models updated by collecting personalized data from end devices. To maximize task execution accuracy with stringent energy and delay constraints, and by taking into account HDT's inherent mobility and status variation uncertainties, we jointly and dynamically optimize VTs' construction and PTs' task offloading, along with communication and computation resource allocations. Observing that decision variables are asynchronous with different triggers, we propose a novel two-timescale accuracy-aware online optimization approach (TACO). Specifically, TACO utilizes an improved Lyapunov method to decompose the problem into multiple instant ones, and then leverages piecewise McCormick envelopes and block coordinate descent based algorithms, addressing two timescales alternately. Theoretical analyses and simulations show that the proposed approach can reach asymptotic optimum within a polynomial-time complexity, and demonstrate its superiority over counterparts.
- Top Cited Papers
- 8 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (13) , 23370-23383
Toward Online Reliability-Enhanced Microservice Deployment With Layer Sharing in Edge Computing
Container–based microservice provisioning, with its elasticity in terms of the layered structure, enables the sharing of common layers among different edge computing tasks, both within and across edge servers (ESs). However, due to the potential hardware breakdowns, each ES may prone to failures, affecting its lifetime (i.e., the time-length that an ES works continuously without interruptions), and in turn leading to the collapse of their hosted/provided microservices or the other ESs’ microservices requesting common layers from it. To address such an issue, in this article, we study the microservice deployment optimization with layer sharing for maximizing the system-wide reliability while satisfying all tasks’ delay requirements. Considering dynamic task generations and the asynchronization of various decision variables with different triggers, we design an online optimization algorithm by leveraging an improved Lyapunov technique integrating randomized rounding, Lagrangian method and convex optimization, which iteratively solves the problem over different timescales. Theoretical analyses and simulations evaluate the performance of the proposed solution, showing that it can achieve an increase of 12.4% in reliability and a reduction of 28.57% in total delay, compared to the counterparts.
- 8 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (13) , 23370-23383
Top Cited PapersToward Online Reliability-Enhanced Microservice Deployment With Layer Sharing in Edge Computing
Container–based microservice provisioning, with its elasticity in terms of the layered structure, enables the sharing of common layers among different edge computing tasks, both within and across edge servers (ESs). However, due to the potential hardware breakdowns, each ES may prone to failures, affecting its lifetime (i.e., the time-length that an ES works continuously without interruptions), and in turn leading to the collapse of their hosted/provided microservices or the other ESs’ microservices requesting common layers from it. To address such an issue, in this article, we study the microservice deployment optimization with layer sharing for maximizing the system-wide reliability while satisfying all tasks’ delay requirements. Considering dynamic task generations and the asynchronization of various decision variables with different triggers, we design an online optimization algorithm by leveraging an improved Lyapunov technique integrating randomized rounding, Lagrangian method and convex optimization, which iteratively solves the problem over different timescales. Theoretical analyses and simulations evaluate the performance of the proposed solution, showing that it can achieve an increase of 12.4% in reliability and a reduction of 28.57% in total delay, compared to the counterparts.
- Top Cited Papers
- 5 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (2) , 1503-1519
Service Migration or Task Rerouting: A Two-Timescale Online Resource Optimization for MEC
In this paper, a novel two-timescale resource management framework for mobile edge computing (MEC) is constructed. Unlike existing studies, for providing seamless and cost-efficient MEC services, this work aims to strike the balance between service migration and task rerouting for mobile devices (MDs) whenever handovers occur (i.e., switching access from one edge server to another). Considering the network dynamics (e.g., randomness of MDs’ task generations and time-varying channel conditions) and the asynchronization of different management decisions with different triggers, we formulate an online optimization problem for jointly determining i ) large-timescale decisions, including which edge server should be selected to access, and whether service migration or task rerouting should be chosen for each MD in each large time frame, and ii ) small-time scale decisions, including how computing and communication resources should be allocated among MDs with task offloading requests in each small time slot. Then, we propose an online algorithm based on the improved Lyapunov method, together with an iterative algorithm integrating randomized rounding and Lagrange dual techniques, which solves the problem to asymptotic optimum in terms of the long-term average service delay. Theoretical analyses and simulations evaluate the performance of the proposed solution and show its superiority over counterparts.
- 5 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (2) , 1503-1519
Top Cited PapersService Migration or Task Rerouting: A Two-Timescale Online Resource Optimization for MEC
In this paper, a novel two-timescale resource management framework for mobile edge computing (MEC) is constructed. Unlike existing studies, for providing seamless and cost-efficient MEC services, this work aims to strike the balance between service migration and task rerouting for mobile devices (MDs) whenever handovers occur (i.e., switching access from one edge server to another). Considering the network dynamics (e.g., randomness of MDs’ task generations and time-varying channel conditions) and the asynchronization of different management decisions with different triggers, we formulate an online optimization problem for jointly determining i ) large-timescale decisions, including which edge server should be selected to access, and whether service migration or task rerouting should be chosen for each MD in each large time frame, and ii ) small-time scale decisions, including how computing and communication resources should be allocated among MDs with task offloading requests in each small time slot. Then, we propose an online algorithm based on the improved Lyapunov method, together with an iterative algorithm integrating randomized rounding and Lagrange dual techniques, which solves the problem to asymptotic optimum in terms of the long-term average service delay. Theoretical analyses and simulations evaluate the performance of the proposed solution and show its superiority over counterparts.