Li Yan
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
Li Yan has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Haiying Shen
Department of Computer Science, University of Virginia, Charlottesville, VA, USA
7 shared publications - Juanjuan Zhao
Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences
4 shared publications - Chao Shen
Xi'an Jiaotong University, Xi'an, China
3 shared publications - Cheng-Zhong Xu
State Key Laboratory of IoTSC, University of Macau, Macau, Macao
3 shared publications - Liuwang Kang
Department of Computer Science, University of Virginia, Charlottesville, VA, USA
3 shared publications - Zhe Zhang
School of Computer Science, Xian Jiaotong University, Xian, China
3 shared publications
Latest Publications
- 12 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (8) , 1885-1902
P 3 Forecast: Personalized and Adaptive Cloud Workload Prediction via GAN-Based Federated Data Augmentation
To comply with privacy regulations and self-protection from cloud outages, increasingly more users are leveraging multiple cloud providers for service deployment. However, due to the isolation of highly Non-Identically and Independently Distributed (Non-IID) workload datasets and deficiencies of existing methods as reflected in our experimental studies, no cloud providers can single-handedly capture the workload patterns of such users for accurate workload prediction. Accordingly, we propose P3Forecast, a Personalized Privacy-Preserving Cloud workload prediction framework based on Federated Generative Adversarial Networks (GANs), which allows cloud providers with Non-IID workload data to collaboratively train workload prediction models as preferred while protecting privacy. We first design a data synthesis quality assessment method based on Dynamic Time Warping (called pattern-aware DTW), which is insusceptible to time series length and reliable for the comparison of temporal patterns. By using pattern-aware DTW as the model aggregation weights, we adopt the Federated Learning (FL) of a GAN model for the augmentation of IID workload training datasets per cloud provider. Then, we further design a post-training method of local workload prediction models, which consists of a query mechanism based on comprehensive evaluation of data synthesis informativeness and an adaptive learning rate adjustment strategy for stable convergence. Extensive experiments driven by real-world workloads demonstrate that compared with the state-of-the-art, P3Forecast improves workload prediction accuracy by 23.7%-64.5% on average over all cloud providers, while ensuring the fastest convergence in Federated GAN training.
- 12 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (8) , 1885-1902
P 3 Forecast: Personalized and Adaptive Cloud Workload Prediction via GAN-Based Federated Data Augmentation
To comply with privacy regulations and self-protection from cloud outages, increasingly more users are leveraging multiple cloud providers for service deployment. However, due to the isolation of highly Non-Identically and Independently Distributed (Non-IID) workload datasets and deficiencies of existing methods as reflected in our experimental studies, no cloud providers can single-handedly capture the workload patterns of such users for accurate workload prediction. Accordingly, we propose P3Forecast, a Personalized Privacy-Preserving Cloud workload prediction framework based on Federated Generative Adversarial Networks (GANs), which allows cloud providers with Non-IID workload data to collaboratively train workload prediction models as preferred while protecting privacy. We first design a data synthesis quality assessment method based on Dynamic Time Warping (called pattern-aware DTW), which is insusceptible to time series length and reliable for the comparison of temporal patterns. By using pattern-aware DTW as the model aggregation weights, we adopt the Federated Learning (FL) of a GAN model for the augmentation of IID workload training datasets per cloud provider. Then, we further design a post-training method of local workload prediction models, which consists of a query mechanism based on comprehensive evaluation of data synthesis informativeness and an adaptive learning rate adjustment strategy for stable convergence. Extensive experiments driven by real-world workloads demonstrate that compared with the state-of-the-art, P3Forecast improves workload prediction accuracy by 23.7%-64.5% on average over all cloud providers, while ensuring the fastest convergence in Federated GAN training.
- 17 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 2256-2270
Joint Privacy-Preserving Cloud Workload Prediction Based on Federated Learning
Organizations around the world are increasingly using multiple clouds for critical workloads, which makes the accurate prediction of cloud workload a collaborative task across multiple cloud providers. Our experimental studies on four large-scale cloud workload datasets demonstrate that the workloads are highly heterogeneous, and different cloud providers have highly heterogeneous model preferences, which makes the above task challenging. Accordingly, we propose a joint privacy-preserving cloud workload prediction framework based on Federated Learning (FL), which enables the collaborative training of a workload prediction model across cloud providers with heterogeneous workloads and model preferences without exposing private workload data. To handle workload heterogeneity without privacy leakage, we first design a Generative Adversarial Network (GAN) based virtual workload dataset generation method that incorporates workloads’ temporal and resource-usage-plan-related features via temporal-aware feature calibration. Then, to handle model heterogeneity, we design a FL approach based on a hybrid local model composed of a homogeneous public model and a heterogeneous personal model. Finally, we design a Knowledge Distillation (KD) based approach to post-train the personal model with both private workload knowledge and shared workload knowledge learned from the trained global public model. Extensive experiments on various real-world workloads and actual implementations demonstrate that compared with the state-of-the-art, our framework improves workload prediction accuracy by 57.7% in average over all cloud providers.
- 17 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 2256-2270
Joint Privacy-Preserving Cloud Workload Prediction Based on Federated Learning
Organizations around the world are increasingly using multiple clouds for critical workloads, which makes the accurate prediction of cloud workload a collaborative task across multiple cloud providers. Our experimental studies on four large-scale cloud workload datasets demonstrate that the workloads are highly heterogeneous, and different cloud providers have highly heterogeneous model preferences, which makes the above task challenging. Accordingly, we propose a joint privacy-preserving cloud workload prediction framework based on Federated Learning (FL), which enables the collaborative training of a workload prediction model across cloud providers with heterogeneous workloads and model preferences without exposing private workload data. To handle workload heterogeneity without privacy leakage, we first design a Generative Adversarial Network (GAN) based virtual workload dataset generation method that incorporates workloads’ temporal and resource-usage-plan-related features via temporal-aware feature calibration. Then, to handle model heterogeneity, we design a FL approach based on a hybrid local model composed of a homogeneous public model and a heterogeneous personal model. Finally, we design a Knowledge Distillation (KD) based approach to post-train the personal model with both private workload knowledge and shared workload knowledge learned from the trained global public model. Extensive experiments on various real-world workloads and actual implementations demonstrate that compared with the state-of-the-art, our framework improves workload prediction accuracy by 57.7% in average over all cloud providers.
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 248-257
Heterogeneity-aware Task Scheduling based on Personalized Federated Reinforcement Learning
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 248-257
Open AccessHeterogeneity-aware Task Scheduling based on Personalized Federated Reinforcement Learning
- 27 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (6) , 3212-3227
Truthful Padding-Based Auction Mechanisms for Cross-Cloud Link Bandwidth Allocation and Pricing
More and more application providers (APs) start to deploy their geo-distributed services in multiple cloud environments, such as JointCloud, federated clouds and InterCloud. Thus, massive cross-cloud traffic is generated from the services of APs, who need to pay Internet service providers (ISPs) for using their bandwidth. As such, an effective cross-cloud link bandwidth allocation and pricing mechanism is needed between APs and ISPs. Existing fixed-price scheme lacks market efficiency. Thus, we propose a truthful padding-based auction mechanism (TPAM) for cross-cloud bandwidth, which introduces the padding method and well-designed pricing strategy to ensure desirable properties. This mechanism is flexible enough to allow each AP to win the whole request, or win the specified proportional request, or lose and get nothing. Specifically, we first devise a linear-program-based method to calculate the padding vector for each candidate AP. Next, we design a padding-based method to determine the winning APs and match them with ISPs who offer the cheapest bandwidth. Finally, we design a critical-value-based pricing strategy and a marginal-cost-based pricing strategy for APs and ISPs to achieve truthfulness and budget balance. Theoretical analyses prove that TPAM achieves truthfulness, budget balance, individual rationality, asymptotic efficiency and computational tractability. Trace-driven simulation results also validate the effectiveness and efficiency of TPAM.
- 27 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (6) , 3212-3227
Truthful Padding-Based Auction Mechanisms for Cross-Cloud Link Bandwidth Allocation and Pricing
More and more application providers (APs) start to deploy their geo-distributed services in multiple cloud environments, such as JointCloud, federated clouds and InterCloud. Thus, massive cross-cloud traffic is generated from the services of APs, who need to pay Internet service providers (ISPs) for using their bandwidth. As such, an effective cross-cloud link bandwidth allocation and pricing mechanism is needed between APs and ISPs. Existing fixed-price scheme lacks market efficiency. Thus, we propose a truthful padding-based auction mechanism (TPAM) for cross-cloud bandwidth, which introduces the padding method and well-designed pricing strategy to ensure desirable properties. This mechanism is flexible enough to allow each AP to win the whole request, or win the specified proportional request, or lose and get nothing. Specifically, we first devise a linear-program-based method to calculate the padding vector for each candidate AP. Next, we design a padding-based method to determine the winning APs and match them with ISPs who offer the cheapest bandwidth. Finally, we design a critical-value-based pricing strategy and a marginal-cost-based pricing strategy for APs and ISPs to achieve truthfulness and budget balance. Theoretical analyses prove that TPAM achieves truthfulness, budget balance, individual rationality, asymptotic efficiency and computational tractability. Trace-driven simulation results also validate the effectiveness and efficiency of TPAM.
- 23 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (6) , 5569-5583
AdapLDP-FL: An Adaptive Local Differential Privacy for Federated Learning
Federated Learning (FL) is a technique that allows multiple participants to co-train machine learning models, while also enhancing privacy by avoiding the exposure of local data. However, it is important to note that despite its effectiveness, there is still a potential risk of leaking users' private information through weight analysis during FL updates. Local Differential Privacy (LDP) is a technique used to prevent individual information leakage by adding noise to the user's model parameters. However, FL based on LDP lacks dynamic optimization and adaptation considering privacy and data utility, especially regarding noise constraints. This paper investigates FL under the scenario of noise optimization with LDP. Specifically, given a certain privacy budget, we design the adaptive LDP method via a noise scaler, which adaptively optimizes the noise size of every client. Secondly, we dynamically tailor the model direction after adding noise by the designed a direction matrix, to overcome the model drift problem caused by adding noises to the client model. Finally, our method achieves higher accuracy than some existing works with the same privacy level and the convergence speed is significantly improved.
- 23 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (6) , 5569-5583
AdapLDP-FL: An Adaptive Local Differential Privacy for Federated Learning
Federated Learning (FL) is a technique that allows multiple participants to co-train machine learning models, while also enhancing privacy by avoiding the exposure of local data. However, it is important to note that despite its effectiveness, there is still a potential risk of leaking users' private information through weight analysis during FL updates. Local Differential Privacy (LDP) is a technique used to prevent individual information leakage by adding noise to the user's model parameters. However, FL based on LDP lacks dynamic optimization and adaptation considering privacy and data utility, especially regarding noise constraints. This paper investigates FL under the scenario of noise optimization with LDP. Specifically, given a certain privacy budget, we design the adaptive LDP method via a noise scaler, which adaptively optimizes the noise size of every client. Secondly, we dynamically tailor the model direction after adding noise by the designed a direction matrix, to overcome the model drift problem caused by adding noises to the client model. Finally, our method achieves higher accuracy than some existing works with the same privacy level and the convergence speed is significantly improved.
- 3 December 2024
- Published by Springer Nature
- p. 461-477
GCompletor: A Graph-Based Deep Learning Method for Traffic State Imputation on Urban Road Networks
- 3 December 2024
- Published by Springer Nature
- p. 461-477
GCompletor: A Graph-Based Deep Learning Method for Traffic State Imputation on Urban Road Networks
- 8 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (11) , 10429-10442
A Dispatching Strategy of Autonomous Robotic Charger Boats for Charging Electric Vessels
Autonomous robotic boats equipped with chargers or swappable batteries can serve as Mobile Energy Disseminators (MED) and proactively maintain the State-of-Charge of electric vessels. However, previous methods are either incapable of keeping the vessels continuously driving without recharge downtime, or not directly applicable for the scheduling of chargers on city-scale transportation networks. We propose RoboCharger: a Robo tic Charger boat scheduling system that adaptively determines the number of serving MEDs, and the optimal routes of the MEDs according to vessel traffic. We studied a metropolitan-scale vessel mobility dataset provided by MarineTraffic and analyzed the spatial-temporal characteristics of vessel movements in Amsterdam's canals. Based on the analysis insights, we developed a MinHash and spatial-temporal similarity comparison based method for vessel traffic estimation, a Chinese Postman Problem based method for determining the cruising routes of the MEDs, and formulated and solved a multi-objective optimization problem to determine the number of serving MEDs, the driving route of each MED and maintain the SoC of the vessels above zero. Our trace-driven experiments demonstrate that compared with previous methods, RoboCharger increases the average SoC of vessels over all time slots throughout a day by almost 42%, and the number of charges of vessels by almost 53%.
- 8 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (11) , 10429-10442
A Dispatching Strategy of Autonomous Robotic Charger Boats for Charging Electric Vessels
Autonomous robotic boats equipped with chargers or swappable batteries can serve as Mobile Energy Disseminators (MED) and proactively maintain the State-of-Charge of electric vessels. However, previous methods are either incapable of keeping the vessels continuously driving without recharge downtime, or not directly applicable for the scheduling of chargers on city-scale transportation networks. We propose RoboCharger: a Robo tic Charger boat scheduling system that adaptively determines the number of serving MEDs, and the optimal routes of the MEDs according to vessel traffic. We studied a metropolitan-scale vessel mobility dataset provided by MarineTraffic and analyzed the spatial-temporal characteristics of vessel movements in Amsterdam's canals. Based on the analysis insights, we developed a MinHash and spatial-temporal similarity comparison based method for vessel traffic estimation, a Chinese Postman Problem based method for determining the cruising routes of the MEDs, and formulated and solved a multi-objective optimization problem to determine the number of serving MEDs, the driving route of each MED and maintain the SoC of the vessels above zero. Our trace-driven experiments demonstrate that compared with previous methods, RoboCharger increases the average SoC of vessels over all time slots throughout a day by almost 42%, and the number of charges of vessels by almost 53%.
- 10 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (6) , 9338-9354
Adaptive Batch Homomorphic Encryption for Joint Federated Learning in Cross-Device Scenarios
Cross-device federated learning (FL) enables the privacy-preserving and collaborative training of machine learning models across heterogeneous clients. To prevent gradient information leakage, homomorphic encryption (HE) has been widely utilized due to its strong protection without losing accuracy. However, our experiments demonstrate that for clients with heterogeneous data and system capabilities, previous plain HE methods (i.e., encryption applied per gradient) and batch HE methods (i.e., encryption applied per batch of gradients) either significantly prolong training time or suffer from accuracy loss due to gradient quantization. We propose an adaptive batch HE framework for cross-device FL, which determines cost-efficient and sufficiently secure encryption strategies for clients with heterogeneous data and system capabilities. By leveraging the sparsity of convolutional neural networks for privacy-preserving similarity measurement of clients’ data, we first split the clients with similar data into their respective clusters. Then, we develop a fuzzy logic-based method to determine a cost-efficient and sufficiently secure HE key size for each client corresponding to its system capability, and arrange the clients with identical key size to the same groups. Finally, we design an efficient batch encryption approach for accuracy-lossless model aggregation. Extensive experiments on multiple heterogeneity scenarios demonstrate that our framework achieves comparable accuracy to plain HE, while reducing training time by$3\times $ –$31\times $ , and communication cost by$45\times $ –$66\times $ .- 10 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (6) , 9338-9354
Adaptive Batch Homomorphic Encryption for Joint Federated Learning in Cross-Device Scenarios
Cross-device federated learning (FL) enables the privacy-preserving and collaborative training of machine learning models across heterogeneous clients. To prevent gradient information leakage, homomorphic encryption (HE) has been widely utilized due to its strong protection without losing accuracy. However, our experiments demonstrate that for clients with heterogeneous data and system capabilities, previous plain HE methods (i.e., encryption applied per gradient) and batch HE methods (i.e., encryption applied per batch of gradients) either significantly prolong training time or suffer from accuracy loss due to gradient quantization. We propose an adaptive batch HE framework for cross-device FL, which determines cost-efficient and sufficiently secure encryption strategies for clients with heterogeneous data and system capabilities. By leveraging the sparsity of convolutional neural networks for privacy-preserving similarity measurement of clients’ data, we first split the clients with similar data into their respective clusters. Then, we develop a fuzzy logic-based method to determine a cost-efficient and sufficiently secure HE key size for each client corresponding to its system capability, and arrange the clients with identical key size to the same groups. Finally, we design an efficient batch encryption approach for accuracy-lossless model aggregation. Extensive experiments on multiple heterogeneity scenarios demonstrate that our framework achieves comparable accuracy to plain HE, while reducing training time by$3\times $ –$31\times $ , and communication cost by$45\times $ –$66\times $ .- 22 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1-17
MobiCharger: Optimal Scheduling for Cooperative EV-to-EV Dynamic Wireless Charging
With the advancement of dynamic wireless charging for Electric Vehicles (EVs), Mobile Energy Disseminator (MED), which can charge an EV in motion, becomes available. However, existing wireless charging scheduling methods for wireless sensors, which are the most related works to MED deployment, are not directly applicable for city-scale EV-to-EV dynamic wireless charging. We present MobiCharger: a Mobile wireless Charger guidance system that determines the number of serving MEDs, and their optimal routes. We studied a metropolitan-scale vehicle mobility dataset, and found: most vehicles have routines, and the number of driving EVs changes over time, which means MED deployment should adaptively change as well. We combine EVs' current trajectories and routines to estimate EV density and the cruising graph for MED coverage. Then, we develop an offline MED deployment method that utilizes multi-objective optimization to determine the number of serving MEDs and the driving route of each MED, and an online method that utilizes Reinforcement Learning to adjust the MED deployment when the real-time vehicle traffic changes. Our trace-driven experiments show that compared with previous methods, MobiCharger increases the medium State-of-Charge of all EVs by 50% during all time slots, and the number of charges of EVs by almost 100%.
- 22 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1-17
MobiCharger: Optimal Scheduling for Cooperative EV-to-EV Dynamic Wireless Charging
With the advancement of dynamic wireless charging for Electric Vehicles (EVs), Mobile Energy Disseminator (MED), which can charge an EV in motion, becomes available. However, existing wireless charging scheduling methods for wireless sensors, which are the most related works to MED deployment, are not directly applicable for city-scale EV-to-EV dynamic wireless charging. We present MobiCharger: a Mobile wireless Charger guidance system that determines the number of serving MEDs, and their optimal routes. We studied a metropolitan-scale vehicle mobility dataset, and found: most vehicles have routines, and the number of driving EVs changes over time, which means MED deployment should adaptively change as well. We combine EVs' current trajectories and routines to estimate EV density and the cruising graph for MED coverage. Then, we develop an offline MED deployment method that utilizes multi-objective optimization to determine the number of serving MEDs and the driving route of each MED, and an online method that utilizes Reinforcement Learning to adjust the MED deployment when the real-time vehicle traffic changes. Our trace-driven experiments show that compared with previous methods, MobiCharger increases the medium State-of-Charge of all EVs by 50% during all time slots, and the number of charges of EVs by almost 100%.
- 8 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (23) , 23302-23319
CD-Guide: A Dispatching and Charging Approach for Electric Taxicabs
Previous methods for passenger demand inference are unable to capture the effect of all possible random factors (e.g., accident, weather), hence resulting in insufficient accuracy. Moreover, due to the lack of charging optimization, existing taxicab dispatching methods cannot be applied to electric taxicabs directly. We propose CD-Guide, which provides Charging and Dispatching Guide for electric taxicabs based on customized selection and training of historical passenger demand data, multi-objective optimization and Reinforcement Learning. By analyzing a large-scale electric taxicab dataset, we found that (1) the histogram of passengers’ origin buildings is effective in illustrating the suitability of historical data for learning, (2) passenger demands in different regions vary a lot due to various random factors, and (3) charging time must be considered in dispatching electric taxicabs. We first develop a passenger demand inference model based on customized selection and training of suitable historical passenger demand data. Then, we develop two taxicab guidance methods that utilize multi-objective optimization and Reinforcement Learning, respectively, to maximize the taxicab’s likelihood of finding passengers, maximally prevent the taxicab from missing passengers due to charging, and meanwhile maintain the continuous service of the taxicab. Extensive experiments on real-world datasets demonstrate that compared with the state-of-the-art, CD-Guide increases the total number of served passengers by 100%, and the minimum State-of-Charge of all taxicabs by 75% during all time slots.
- 8 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (23) , 23302-23319
CD-Guide: A Dispatching and Charging Approach for Electric Taxicabs
Previous methods for passenger demand inference are unable to capture the effect of all possible random factors (e.g., accident, weather), hence resulting in insufficient accuracy. Moreover, due to the lack of charging optimization, existing taxicab dispatching methods cannot be applied to electric taxicabs directly. We propose CD-Guide, which provides Charging and Dispatching Guide for electric taxicabs based on customized selection and training of historical passenger demand data, multi-objective optimization and Reinforcement Learning. By analyzing a large-scale electric taxicab dataset, we found that (1) the histogram of passengers’ origin buildings is effective in illustrating the suitability of historical data for learning, (2) passenger demands in different regions vary a lot due to various random factors, and (3) charging time must be considered in dispatching electric taxicabs. We first develop a passenger demand inference model based on customized selection and training of suitable historical passenger demand data. Then, we develop two taxicab guidance methods that utilize multi-objective optimization and Reinforcement Learning, respectively, to maximize the taxicab’s likelihood of finding passengers, maximally prevent the taxicab from missing passengers due to charging, and meanwhile maintain the continuous service of the taxicab. Extensive experiments on real-world datasets demonstrate that compared with the state-of-the-art, CD-Guide increases the total number of served passengers by 100%, and the minimum State-of-Charge of all taxicabs by 75% during all time slots.