Qiyang Zhang
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
Qiyang Zhang has a total of 94 co-authors. Here are the top co-authors by number of shared publications:
- Schahram Dustdar
TU Wien
13 shared publications - Shangguang Wang
Beijing University of Posts and Telecommunications
13 shared publications - Ao Zhou
Beijing University of Posts and Telecommunications
5 shared publications - Lei Feng
State Key Laboratory of Switching and Networking Technology, Beijing University of Posts and Telecommunications, Beijing, China
5 shared publications - Praveen Kumar Donta
Stockholm University
5 shared publications - Fanqin Zhou
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China
4 shared publications
Latest Publications
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 24170-24186
Resource-Efficient and Robust Collaborative Computing in Satellite-Terrestrial Networks
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 24170-24186
Resource-Efficient and Robust Collaborative Computing in Satellite-Terrestrial Networks
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 22835-22848
Communication-Efficient Satellite-Ground Federated Learning Over Intermittent LEO Satellite Networks
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 22835-22848
Communication-Efficient Satellite-Ground Federated Learning Over Intermittent LEO Satellite Networks
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4573-4582
PSL-RGHA: Parallel Split Learning with Reference Gradient Half-Space Alignment for Mitigating Gradient Divergence
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4573-4582
Open AccessPSL-RGHA: Parallel Split Learning with Reference Gradient Half-Space Alignment for Mitigating Gradient Divergence
- 28 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Magazine
- Vol. PP (25763180) , 1-6
Task Offloading for AI-Enabled LEO Satellite Networks: A Resource-Efficient Perspective
Low Earth Orbit (LEO) satellite constellations are rapidly evolving, providing pervasive coverage that enables new opportunities for AI-driven services. Delivering Deep Neural Network (DNN)-based applications on these satellites faces unique challenges due to limited onboard computational resources, energy constraints, and stringent latency requirements. In this article, we review the state-of-the-art techniques for onboard DNN inference and task offloading, highlighting the key bottlenecks and resource management challenges. We further discuss emerging solutions, including reinforcement learning-driven offloading strategies and lightweight AI models, that can enhance resource efficiency while maintaining service quality. Finally, we outline future research directions and potential application scenarios for realizing high-quality AI services in LEO satellite networks.
- 28 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Magazine
- Vol. PP (25763180) , 1-6
Task Offloading for AI-Enabled LEO Satellite Networks: A Resource-Efficient Perspective
Low Earth Orbit (LEO) satellite constellations are rapidly evolving, providing pervasive coverage that enables new opportunities for AI-driven services. Delivering Deep Neural Network (DNN)-based applications on these satellites faces unique challenges due to limited onboard computational resources, energy constraints, and stringent latency requirements. In this article, we review the state-of-the-art techniques for onboard DNN inference and task offloading, highlighting the key bottlenecks and resource management challenges. We further discuss emerging solutions, including reinforcement learning-driven offloading strategies and lightweight AI models, that can enhance resource efficiency while maintaining service quality. Finally, we outline future research directions and potential application scenarios for realizing high-quality AI services in LEO satellite networks.
- Open Access
- 12 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 26 (2) , 1-26
Latency-Optimized Scheduling for Data Aggregation in Distributed Edge Computing
In Wireless Sensor Networks (WSNs), relay sensor nodes can aggregate data from edge sensor node into a summary information before sending to the sink. Due to the vast number of sensor nodes in a distributed edge computing (DEC) network, these relay sensor nodes may receive a high number of aggregation requests. This increases the chance of conflicting transmissions, which further leads to unwanted latency. Designing a conflict-free and minimal latency data aggregation schedule remains an open question. Moreover, existing related works have been conducted in traditional WSNs. By leveraging multiple antennas, the Multiple Input Multiple Output (MIMO) and cooperative MIMO called virtual MIMO (V-MIMO) enable broadband wireless communication, thereby improving the performance of WSNs. However, compared with traditional WSNs, MIMO and V-MIMO introduce distinct interference models requiring careful consideration. The work proposes a solution to an NP-hard problem, addressing three challenges: (i) interference; (ii) latency; and (iii) dynamic changes in network topology. Firstly, to counter interference, we propose a model where multiple nodes can simultaneously send data to the same parent by connecting different antennas. Secondly, to minimize latency, we propose a novel distributed heuristic data aggregation scheduling method, which intertwines the construction of an optimal data aggregation tree and conflict-free scheduling. Finally, to handle dynamic network topology changes, we propose lightweight adaptive strategies that do not increase data aggregation latency. Simulation results and theoretical analysis demonstrate superior performance in reducing data aggregation latency. When compared with state-of-the-art solutions, our proposed method decreases data aggregation latency by at least 2.6× on average.
- 12 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 26 (2) , 1-26
Open AccessLatency-Optimized Scheduling for Data Aggregation in Distributed Edge Computing
In Wireless Sensor Networks (WSNs), relay sensor nodes can aggregate data from edge sensor node into a summary information before sending to the sink. Due to the vast number of sensor nodes in a distributed edge computing (DEC) network, these relay sensor nodes may receive a high number of aggregation requests. This increases the chance of conflicting transmissions, which further leads to unwanted latency. Designing a conflict-free and minimal latency data aggregation schedule remains an open question. Moreover, existing related works have been conducted in traditional WSNs. By leveraging multiple antennas, the Multiple Input Multiple Output (MIMO) and cooperative MIMO called virtual MIMO (V-MIMO) enable broadband wireless communication, thereby improving the performance of WSNs. However, compared with traditional WSNs, MIMO and V-MIMO introduce distinct interference models requiring careful consideration. The work proposes a solution to an NP-hard problem, addressing three challenges: (i) interference; (ii) latency; and (iii) dynamic changes in network topology. Firstly, to counter interference, we propose a model where multiple nodes can simultaneously send data to the same parent by connecting different antennas. Secondly, to minimize latency, we propose a novel distributed heuristic data aggregation scheduling method, which intertwines the construction of an optimal data aggregation tree and conflict-free scheduling. Finally, to handle dynamic network topology changes, we propose lightweight adaptive strategies that do not increase data aggregation latency. Simulation results and theoretical analysis demonstrate superior performance in reducing data aggregation latency. When compared with state-of-the-art solutions, our proposed method decreases data aggregation latency by at least 2.6× on average.
- Open Access
- 31 January 2026
- Published by Elsevier in Computer Networks
- Vol. 278
Non-functional certification of edge-computing satellite systems
- 31 January 2026
- Published by Elsevier in Computer Networks
- Vol. 278
Open AccessNon-functional certification of edge-computing satellite systems
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (6) , 8911-8927
Task-Aware Collaborative Inference and Fine-Grained DNN Partitioning in MEC Networks
Mobile devices (MDs) are increasingly incorporating deep neural network (DNN) inference into their systems due to the rapid growth of intelligent applications. Mobile edge computing-based distributed DNN collaborative inference has gained popularity due to limited on-device computation and energy budgets. However, the resource competition among MDs, along with the coupling of collaborative inference tasks across MDs and servers, creates significant challenges for efficient resource management. This issue is further exacerbated by the complexity of directed acyclic graph (DAG)-structured DNNs. Most prior studies do not jointly address the dual challenges of partitioning complex-structured DNNs and leveraging advanced optimization for collaborative inference, and their resilience to channel condition fluctuations remains underexplored. To address these challenges, we propose a novel task-aware collaborative inference framework. First, we devise a fine-grained partitioning point search algorithm based on a bidirectional graph linked list, which enables one-dimensional and flexible partitioning of DAG-structured DNNs. We then reformulate the problem of minimizing collaborative inference energy consumption and latency as a task-aware Markov decision process (MDP), which partitions each user’s inference task queue into consecutive task windows for resource allocation. Building on this, we propose an Embedded Multi-Agent Hybrid Proximal Policy Optimization (EMH-PPO) algorithm to learn effective policies. Extensive experiments conducted across diverse network scenarios reveal that, compared to local DNN inference on MDs, our proposed method reduces inference latency by up to 64% and energy consumption by up to 46%.
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (6) , 8911-8927
Task-Aware Collaborative Inference and Fine-Grained DNN Partitioning in MEC Networks
Mobile devices (MDs) are increasingly incorporating deep neural network (DNN) inference into their systems due to the rapid growth of intelligent applications. Mobile edge computing-based distributed DNN collaborative inference has gained popularity due to limited on-device computation and energy budgets. However, the resource competition among MDs, along with the coupling of collaborative inference tasks across MDs and servers, creates significant challenges for efficient resource management. This issue is further exacerbated by the complexity of directed acyclic graph (DAG)-structured DNNs. Most prior studies do not jointly address the dual challenges of partitioning complex-structured DNNs and leveraging advanced optimization for collaborative inference, and their resilience to channel condition fluctuations remains underexplored. To address these challenges, we propose a novel task-aware collaborative inference framework. First, we devise a fine-grained partitioning point search algorithm based on a bidirectional graph linked list, which enables one-dimensional and flexible partitioning of DAG-structured DNNs. We then reformulate the problem of minimizing collaborative inference energy consumption and latency as a task-aware Markov decision process (MDP), which partitions each user’s inference task queue into consecutive task windows for resource allocation. Building on this, we propose an Embedded Multi-Agent Hybrid Proximal Policy Optimization (EMH-PPO) algorithm to learn effective policies. Extensive experiments conducted across diverse network scenarios reveal that, compared to local DNN inference on MDs, our proposed method reduces inference latency by up to 64% and energy consumption by up to 46%.
- 29 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. PP (00983063) , 1
Co-Design of Control, Energy, and Buffer with Delay Determinism for Consumer Electronics in Industry 5.0
The deployment of wireless control systems in consumer electronics (CEs) is one of the critical components in Industry 5.0 to enable real-time monitoring and control with efficiency, flexibility, and reliability. This paper presents a novel model for the co-design of control, energy, and buffer management with delay determinism for CEs in Industry 5.0. To tackle the non-convex problem of minimizing long-term average joint cost, we propose an efficient resource allocation mechanism based on Lyapunov optimization theory and alternating optimization, utilizing control state information feedback. Specifically, the long-term problem is equivalently converted into an instantaneous optimization problem, which is then decomposed into two iteratively solvable subproblems, namely the buffer allocation problem and the bandwidth allocation problem. The subproblems are solved by branch and bound method and the interior point method, respectively. Simulation results demonstrate that the proposed mechanism outperforms four baseline mechanisms, achieving a balance between delay determinism, control stability, and efficient resource utilization.
- 29 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. PP (00983063) , 1
Co-Design of Control, Energy, and Buffer with Delay Determinism for Consumer Electronics in Industry 5.0
The deployment of wireless control systems in consumer electronics (CEs) is one of the critical components in Industry 5.0 to enable real-time monitoring and control with efficiency, flexibility, and reliability. This paper presents a novel model for the co-design of control, energy, and buffer management with delay determinism for CEs in Industry 5.0. To tackle the non-convex problem of minimizing long-term average joint cost, we propose an efficient resource allocation mechanism based on Lyapunov optimization theory and alternating optimization, utilizing control state information feedback. Specifically, the long-term problem is equivalently converted into an instantaneous optimization problem, which is then decomposed into two iteratively solvable subproblems, namely the buffer allocation problem and the bandwidth allocation problem. The subproblems are solved by branch and bound method and the interior point method, respectively. Simulation results demonstrate that the proposed mechanism outperforms four baseline mechanisms, achieving a balance between delay determinism, control stability, and efficient resource utilization.
- 23 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (6) , 7766-7781
Optimizing Multi-DNN Inference on Mobile Devices Through Heterogeneous Processor Co-Execution
Deep Neural Networks (DNNs) are increasingly adopted across various industries, driving the demand for deploying their capabilities on mobile devices. However, current mobile inference frameworks often rely on a single processor to execute each model inference, limiting hardware utilization and leading to suboptimal performance and energy efficiency. Expanding DNN accessibility on mobile platforms requires more adaptive and resource-efficient solutions to meet increasing computational demands without compromising device functionality. Nevertheless, performing parallel inference of multiple DNNs on heterogeneous processors remains a significant challenge. Existing studies have explored partitioning DNN operations into subgraphs to enable parallel execution across heterogeneous processors. However, these approaches typically generate excessive subgraphs based solely on hardware compatibility, increasing scheduling complexity and memory management overhead. To address these limitations, we propose the Advanced Multi-DNN Model Scheduling (ADMS) strategy that optimizes multi-DNN inference across heterogeneous processors on mobile devices. ADMS constructs an offline subgraph partitioning strategy that considers both hardware support for operations and scheduling granularity. It also employs a processor-state-aware scheduling algorithm to dynamically balance workloads based on real-time system conditions. This ensures efficient workload distribution and maximizes the utilization of available processors. Experimental results demonstrate that, compared to vanilla inference frameworks, ADMS achieves a 4.04× reduction in multi-DNN inference latency.
- 23 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (6) , 7766-7781
Optimizing Multi-DNN Inference on Mobile Devices Through Heterogeneous Processor Co-Execution
Deep Neural Networks (DNNs) are increasingly adopted across various industries, driving the demand for deploying their capabilities on mobile devices. However, current mobile inference frameworks often rely on a single processor to execute each model inference, limiting hardware utilization and leading to suboptimal performance and energy efficiency. Expanding DNN accessibility on mobile platforms requires more adaptive and resource-efficient solutions to meet increasing computational demands without compromising device functionality. Nevertheless, performing parallel inference of multiple DNNs on heterogeneous processors remains a significant challenge. Existing studies have explored partitioning DNN operations into subgraphs to enable parallel execution across heterogeneous processors. However, these approaches typically generate excessive subgraphs based solely on hardware compatibility, increasing scheduling complexity and memory management overhead. To address these limitations, we propose the Advanced Multi-DNN Model Scheduling (ADMS) strategy that optimizes multi-DNN inference across heterogeneous processors on mobile devices. ADMS constructs an offline subgraph partitioning strategy that considers both hardware support for operations and scheduling granularity. It also employs a processor-state-aware scheduling algorithm to dynamically balance workloads based on real-time system conditions. This ensures efficient workload distribution and maximizes the utilization of available processors. Experimental results demonstrate that, compared to vanilla inference frameworks, ADMS achieves a 4.04× reduction in multi-DNN inference latency.
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (1) , 1064-1076
Privacy-Aware and Energy-Efficient Split Learning for Wireless Consumer Healthcare Edge Devices
As the portable consumer healthcare devices become increasingly prevalent, ubiquitously accessible healthcare support has been crucial for the advancement of healthcare systems. However, these portable consumer devices often lack the capacity to support complex healthcare AI services. With the advancement of mobile edge computing, split learning (SL) emerges as a promising solution by offloading portions of model training to auxiliary servers, thereby reducing computational load on consumer devices. Nevertheless, the frequent transmission of intermediate data in mobile edge networks increases communication energy consumption and privacy risks. To tackle these challenges, we propose the Clipping Quantized Split Learning (CQSL) scheme. Unlike conventional methods, CQSL integrates quantization with mutual information constraints to balance privacy, energy efficiency, and accuracy, with proven convergence. Simulations demonstrate that CQSL excels in privacy preservation, energy reduction, and model accuracy retention, presenting a secure and efficient AI solution for healthcare edge devices.
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (1) , 1064-1076
Privacy-Aware and Energy-Efficient Split Learning for Wireless Consumer Healthcare Edge Devices
As the portable consumer healthcare devices become increasingly prevalent, ubiquitously accessible healthcare support has been crucial for the advancement of healthcare systems. However, these portable consumer devices often lack the capacity to support complex healthcare AI services. With the advancement of mobile edge computing, split learning (SL) emerges as a promising solution by offloading portions of model training to auxiliary servers, thereby reducing computational load on consumer devices. Nevertheless, the frequent transmission of intermediate data in mobile edge networks increases communication energy consumption and privacy risks. To tackle these challenges, we propose the Clipping Quantized Split Learning (CQSL) scheme. Unlike conventional methods, CQSL integrates quantization with mutual information constraints to balance privacy, energy efficiency, and accuracy, with proven convergence. Simulations demonstrate that CQSL excels in privacy preservation, energy reduction, and model accuracy retention, presenting a secure and efficient AI solution for healthcare edge devices.