Hengzhi Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Hengzhi Wang has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- Jiangchuan Liu
Simon Fraser University, Burnaby, Canada
10 shared publications - Laizhong Cui
Shenzhen University, Shenzhen, China
10 shared publications - En Wang
Jilin University
7 shared publications - Yongjian Yang
College of Computer Science and Technology, Jilin University, Changchun, China
6 shared publications - Lei Zhang
Shenzhen University
5 shared publications - Jie Wu
Cloud Computing Research Institute, China Telecom
4 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (11) , 21788-21802
From Cloud to Crowd: Democratizing LLM Service With Decentralized Edge Collaboration for RAG
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (11) , 21788-21802
From Cloud to Crowd: Democratizing LLM Service With Decentralized Edge Collaboration for RAG
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (11) , 21278-21292
Incentive Mechanism for Dynamic Workers With Non-Stationary Qualities in Spatial Crowdsourcing
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (11) , 21278-21292
Incentive Mechanism for Dynamic Workers With Non-Stationary Qualities in Spatial Crowdsourcing
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (11) , 21252-21265
Adaptive Inter-Satellite Power Transfer for Sustainable Space Computing
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (11) , 21252-21265
Adaptive Inter-Satellite Power Transfer for Sustainable Space Computing
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (5) , 11445-11461
Unlearning or Not: A Strategic Data Forgetting Scheme for Federated Unlearning With Bounded Rationality
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (5) , 11445-11461
Unlearning or Not: A Strategic Data Forgetting Scheme for Federated Unlearning With Bounded Rationality
- 27 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1-15
Long-Term Optimal Incentives for Differential-Privacy Federated Learning: A Multi-Stage Game Approach
Differential-privacy federated learning (DP-FL) has emerged as a promising paradigm capable of mitigating the inherent threat of traditional FL architectures that are vulnerable to inferential attacks due to the frequent exchange and updating of model parameters. However, existing DP-FL frameworks often assume that the client's perturbations remain constant throughout the FL process, while ignoring the varying influence of the client's perturbations in distinct communication rounds on the model performance. Besides, existing DP-FL frameworks posit the FL server as a fully rational actor, thereby neglecting the bounded rationality that the FL server may exhibit in the face of risk and uncertainty. In this paper, we propose a novel long-term (i.e., throughout the FL process) privacy-preserving FL framework to address the optimal incentive design, in the presence of the bounded rationality inherent in the FL server and the dynamic influence of perturbations on model performance. Specifically, we first investigate the impact of local perturbations of the client on the model's convergence performance in different communication rounds, elucidating the trade-off between learning performance and privacy loss. Then, to reconcile learning performance with privacy loss, we design a long-term privacy-preserving incentive scheme, where the interactions between clients and the FL server throughout the FL process are modeled as a multi-stage privacy-preserving game. Furthermore, by applying prospect theory (PT) to formulate the risk-aware behavior of the bounded rationality FL server, we employ contract theory to derive the equilibrium of the game, thereby ensuring optimality and fairness. Finally, extensive simulations illustrate that our scheme can motivate clients to provide high-quality models and improve the accuracy of the global model, compared with benchmarks.
- 27 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1-15
Long-Term Optimal Incentives for Differential-Privacy Federated Learning: A Multi-Stage Game Approach
Differential-privacy federated learning (DP-FL) has emerged as a promising paradigm capable of mitigating the inherent threat of traditional FL architectures that are vulnerable to inferential attacks due to the frequent exchange and updating of model parameters. However, existing DP-FL frameworks often assume that the client's perturbations remain constant throughout the FL process, while ignoring the varying influence of the client's perturbations in distinct communication rounds on the model performance. Besides, existing DP-FL frameworks posit the FL server as a fully rational actor, thereby neglecting the bounded rationality that the FL server may exhibit in the face of risk and uncertainty. In this paper, we propose a novel long-term (i.e., throughout the FL process) privacy-preserving FL framework to address the optimal incentive design, in the presence of the bounded rationality inherent in the FL server and the dynamic influence of perturbations on model performance. Specifically, we first investigate the impact of local perturbations of the client on the model's convergence performance in different communication rounds, elucidating the trade-off between learning performance and privacy loss. Then, to reconcile learning performance with privacy loss, we design a long-term privacy-preserving incentive scheme, where the interactions between clients and the FL server throughout the FL process are modeled as a multi-stage privacy-preserving game. Furthermore, by applying prospect theory (PT) to formulate the risk-aware behavior of the bounded rationality FL server, we employ contract theory to derive the equilibrium of the game, thereby ensuring optimality and fairness. Finally, extensive simulations illustrate that our scheme can motivate clients to provide high-quality models and improve the accuracy of the global model, compared with benchmarks.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3042-3053
DIARY: Differentially Private Recovery with Adaptive Privacy Budgets in Federated Unlearning
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3042-3053
Open AccessDIARY: Differentially Private Recovery with Adaptive Privacy Budgets in Federated Unlearning
- Open Access
- 4 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Fast Loss Recovery for Real-Time Video Streaming
Packet loss poses a significant challenge for real-time video streaming applications, which demand uninterrupted video playback in high quality and low latency. Existing loss-resilient streaming techniques either introduce considerable redundant transmissions or rely on receiver-side heavy computations, and thus are not ideal for fast video restoration in weak network conditions. In this work, we investigate the loss recovery in real-time video streaming and divide the problem into two tasks-reconstructing the damaged frame and preventing error propagation in the following frames. For the first task, we identify motion vector prediction as the critical step for restoration in the video decoding pipeline and design a lightweight motion prediction model. For the second task, we propose a perception-aware partial resynchronization mechanism, which selectively refreshes intra-coded macroblocks to reduce error accumulation. Our fast recovery method can be seamlessly integrated into conventional video codecs and thus is compatible to the existing streaming systems. Experimental results demonstrate that the proposed method improves restoration quality and computational efficiency across a wide range of packet loss conditions.
- 4 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessFast Loss Recovery for Real-Time Video Streaming
Packet loss poses a significant challenge for real-time video streaming applications, which demand uninterrupted video playback in high quality and low latency. Existing loss-resilient streaming techniques either introduce considerable redundant transmissions or rely on receiver-side heavy computations, and thus are not ideal for fast video restoration in weak network conditions. In this work, we investigate the loss recovery in real-time video streaming and divide the problem into two tasks-reconstructing the damaged frame and preventing error propagation in the following frames. For the first task, we identify motion vector prediction as the critical step for restoration in the video decoding pipeline and design a lightweight motion prediction model. For the second task, we propose a perception-aware partial resynchronization mechanism, which selectively refreshes intra-coded macroblocks to reduce error accumulation. Our fast recovery method can be seamlessly integrated into conventional video codecs and thus is compatible to the existing streaming systems. Experimental results demonstrate that the proposed method improves restoration quality and computational efficiency across a wide range of packet loss conditions.
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 2158-2172
Toward Double-Layer Data Privacy in Communication-Efficient Hierarchical Federated Learning: A Client Sampling Approach
Federated Learning (FL) is a promising learning paradigm that allows for training a shared model by coordinating multiple distributed devices, namely, clients, without exposing their raw data. To mitigate excessive communication overhead and enhance practicality, a variant known as Hierarchical FL (HFL) has been introduced, which integrates edge servers between the cloud server and clients. In HFL, the number of potential clients is typically large, making full client participation impractical due to various resource constraints. As a result, it is essential to develop a sampling strategy that effectively selects suitable clients for federated optimization. While several methods have been proposed to protect the privacy of communicated models, we argue that the outcomes of client sampling are closely tied to the local data of clients, thereby raising privacy concerns, like the risk of differential attacks. Motivated by this, we propose a Two-step Privacy-Preserving client Sampling framework (TPPS) designed to protect against both attacks on communicated models and potential vulnerabilities in client sampling outcomes. Initially, we consider the diverse privacy requirements of clients by presenting a double-layer noise mechanism. We then conduct a thorough analysis of the impact of this noise mechanism, proposing a novel client sampling strategy that seeks to balance the trade-off between privacy and training performance. The insight lies in maintaining a real-time sampling probability for each client, which can be acutely tuned based on personalized privacy needs and previous training feedback. We provably show that TPPS achieves local differential privacy, a bounded sampling regret, and a privacy-related convergence rate. Furthermore, we conduct extensive simulations based on open datasets, showing the robustness and applicability of TPPS in enhancing privacy while optimizing HFL performance.
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 2158-2172
Toward Double-Layer Data Privacy in Communication-Efficient Hierarchical Federated Learning: A Client Sampling Approach
Federated Learning (FL) is a promising learning paradigm that allows for training a shared model by coordinating multiple distributed devices, namely, clients, without exposing their raw data. To mitigate excessive communication overhead and enhance practicality, a variant known as Hierarchical FL (HFL) has been introduced, which integrates edge servers between the cloud server and clients. In HFL, the number of potential clients is typically large, making full client participation impractical due to various resource constraints. As a result, it is essential to develop a sampling strategy that effectively selects suitable clients for federated optimization. While several methods have been proposed to protect the privacy of communicated models, we argue that the outcomes of client sampling are closely tied to the local data of clients, thereby raising privacy concerns, like the risk of differential attacks. Motivated by this, we propose a Two-step Privacy-Preserving client Sampling framework (TPPS) designed to protect against both attacks on communicated models and potential vulnerabilities in client sampling outcomes. Initially, we consider the diverse privacy requirements of clients by presenting a double-layer noise mechanism. We then conduct a thorough analysis of the impact of this noise mechanism, proposing a novel client sampling strategy that seeks to balance the trade-off between privacy and training performance. The insight lies in maintaining a real-time sampling probability for each client, which can be acutely tuned based on personalized privacy needs and previous training feedback. We provably show that TPPS achieves local differential privacy, a bounded sampling regret, and a privacy-related convergence rate. Furthermore, we conduct extensive simulations based on open datasets, showing the robustness and applicability of TPPS in enhancing privacy while optimizing HFL performance.
- 4 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (4) , 2238-2253
On-Demand and Scalable Topology Control Service for LEO Satellite Network Evolving
Inter-Satellite Links (ISLs) are pivotal for delivering global connectivity services and optimizing resource utilization in 6 G and beyond. However, delivering effective topology control services through ISL provisioning faces critical challenges in sustainability and reliability. Reducing ISLs can conserve energy and extend satellite battery life for Low-Earth-Orbit (LEO) satellites where replacing batteries is impractical. Conversely, increasing ISLs can enhance service reliability but may lead to uneven traffic distribution, overloading nodes, and accelerating battery degradation, ultimately degrading the quality of 6 G services. To tackle this dilemma, we propose TASRI—a service-oriented framework for Traffic-Aware, Sustainable, and Reliable ISL provisioning. TASRI provides a dynamic topology control service by partitioning network topologies into logical zones, enabling flexible ISL activation and deactivation to adapt to varying service demands, ensuring efficient resource utilization and dynamic service orchestration. Using a sustainability-oriented weight model, we formulate the topology control service optimization problem and introduce a scalable on-demand topology evolving algorithm with a bounded approximation ratio. Extensive real-world deployment-based simulation results show that, compared to the state-of-the-art, our TASRI can substantially reduce battery life consumption, while achieving comparable reliability and excellent scalability with considerably fewer ISLs or ISL handovers.
- 4 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (4) , 2238-2253
On-Demand and Scalable Topology Control Service for LEO Satellite Network Evolving
Inter-Satellite Links (ISLs) are pivotal for delivering global connectivity services and optimizing resource utilization in 6 G and beyond. However, delivering effective topology control services through ISL provisioning faces critical challenges in sustainability and reliability. Reducing ISLs can conserve energy and extend satellite battery life for Low-Earth-Orbit (LEO) satellites where replacing batteries is impractical. Conversely, increasing ISLs can enhance service reliability but may lead to uneven traffic distribution, overloading nodes, and accelerating battery degradation, ultimately degrading the quality of 6 G services. To tackle this dilemma, we propose TASRI—a service-oriented framework for Traffic-Aware, Sustainable, and Reliable ISL provisioning. TASRI provides a dynamic topology control service by partitioning network topologies into logical zones, enabling flexible ISL activation and deactivation to adapt to varying service demands, ensuring efficient resource utilization and dynamic service orchestration. Using a sustainability-oriented weight model, we formulate the topology control service optimization problem and introduce a scalable on-demand topology evolving algorithm with a bounded approximation ratio. Extensive real-world deployment-based simulation results show that, compared to the state-of-the-art, our TASRI can substantially reduce battery life consumption, while achieving comparable reliability and excellent scalability with considerably fewer ISLs or ISL handovers.