Haopeng Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Haopeng Chen has a total of 57 co-authors. Here are the top co-authors by number of shared publications:
- Fuxiao Zhou
Shanghai Jiao Tong University
3 shared publications Lin Gui
3 shared publications- Xiupu Lang
School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University - Minhang Campus
3 shared publications - Chang Liu2 shared publications
Delin Liu
Shanghai Jiao Tong University
2 shared publications- Lin Gui
Shanghai Jiao Tong University
2 shared publications
Latest Publications
- 26 September 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 188
Confidence-adaptive local perception for distributed LEO satellite routing under degraded telemetry
- 26 September 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 188
Confidence-adaptive local perception for distributed LEO satellite routing under degraded telemetry
- 9 March 2026
- Published by Elsevier in Computer Networks
- Vol. 280
A cluster-level scheduling approach for heterogeneous satellite constellations
- 9 March 2026
- Published by Elsevier in Computer Networks
- Vol. 280
A cluster-level scheduling approach for heterogeneous satellite constellations
- Open Access
- 15 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 26 (1) , 1-30
Incentivizing Cooperation for Handover Strategies in LEO Constellations via Fairness-guided MARL
Handover (HO) is one of the pivotal technologies for mobility management in highly dynamic mega LEO Earth Orbit satellite constellations (MLSCs). Due to the lack of channel reservation under random access (RA) and the prohibitive overhead incurred by centralized HO scheduling, intense competition among massive connections (e.g., IoRT nodes) results in significant degradation of service continuity. To solve the above challenges, we propose a distributed fairness-guided handover strategy (DHO-F) to dynamically select the best HO target and sub-channel. Specifically, the DHO-F optimization problem is formulated based on max-min egalitarian fairness and further modeled as a multi-objective Markov decision process (MOMDP), where fairness is expressed by the social welfare function (SWF). To address MOMDP, the analytical form of the policy gradient to maximize fairness is derived. Subsequently, Multi-agent Proximal Policy Optimization (MAPPO) with distributed cooperation is exploited to achieve long-term maximization. The fairness-guided MAPPO (FG-MAPPO) features a hybrid network architecture that simultaneously takes into account maximizing individual link rates and fairness among UEs. It reconciles these two conflicting objectives through the collaboration between a throughput-oriented (TO) network and a fairness-oriented (FO) network. Additionally, a distributed training framework is implemented to improve the sample efficiency and data diversity for on-policy FG-MAPPO. FG-MAPPO is fully compatible with 3GPP’s conditional handover (CHO) framework, demonstrating that it can be implemented in real-world. Extensive evaluations demonstrate that DHO-F demonstrates superior performance even compared to centralized algorithms, achieving an average improvement of 3.48% in SWF metric. Moreover, DHO-F establishes new SOTA performance in balancing fairness and rate maximization across medium-to-high load scenarios compared to IDQN, ISAC, and MAPPO.
- 15 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 26 (1) , 1-30
Open AccessIncentivizing Cooperation for Handover Strategies in LEO Constellations via Fairness-guided MARL
Handover (HO) is one of the pivotal technologies for mobility management in highly dynamic mega LEO Earth Orbit satellite constellations (MLSCs). Due to the lack of channel reservation under random access (RA) and the prohibitive overhead incurred by centralized HO scheduling, intense competition among massive connections (e.g., IoRT nodes) results in significant degradation of service continuity. To solve the above challenges, we propose a distributed fairness-guided handover strategy (DHO-F) to dynamically select the best HO target and sub-channel. Specifically, the DHO-F optimization problem is formulated based on max-min egalitarian fairness and further modeled as a multi-objective Markov decision process (MOMDP), where fairness is expressed by the social welfare function (SWF). To address MOMDP, the analytical form of the policy gradient to maximize fairness is derived. Subsequently, Multi-agent Proximal Policy Optimization (MAPPO) with distributed cooperation is exploited to achieve long-term maximization. The fairness-guided MAPPO (FG-MAPPO) features a hybrid network architecture that simultaneously takes into account maximizing individual link rates and fairness among UEs. It reconciles these two conflicting objectives through the collaboration between a throughput-oriented (TO) network and a fairness-oriented (FO) network. Additionally, a distributed training framework is implemented to improve the sample efficiency and data diversity for on-policy FG-MAPPO. FG-MAPPO is fully compatible with 3GPP’s conditional handover (CHO) framework, demonstrating that it can be implemented in real-world. Extensive evaluations demonstrate that DHO-F demonstrates superior performance even compared to centralized algorithms, achieving an average improvement of 3.48% in SWF metric. Moreover, DHO-F establishes new SOTA performance in balancing fairness and rate maximization across medium-to-high load scenarios compared to IDQN, ISAC, and MAPPO.
- 2 January 2026
- Published by Springer Nature
- p. 673-682
MCTM: Multi-chord Distributed System for Efficient Trajectory Data Management in Mobile Edge Computing
- 2 January 2026
- Published by Springer Nature
- p. 673-682
MCTM: Multi-chord Distributed System for Efficient Trajectory Data Management in Mobile Edge Computing
- Open Access
- 21 October 2025
- Published by IOS Press
- p. 1286-1293
D-CHO: Task-Oriented Satellite Conditional Handover Decision in NTN Based on Multi-Agent Game
In non-terrestrial networks, satellite constellations based on the Low-Earth-Orbit (LEO) have become crucial for ensuring seamless global connectivity. The flexible continuity guarantee is demanded for task-oriented user connection requests in satellite networks. In this paper, we propose a task-oriented satellite conditional handover scheme, D-CHO, based on multi-agent game theory. For the problem formalization, this paper focuses on delay overhead, satellite utilization deviation, and load performance to model the multi-objective optimization. According to game theory, a Nash equilibrium exists among the multi-task game strategies that require satellite links. Through exploration and exploitation, the optimal satellite handover sequence scheme can be identified. This paper explores the optimal solution based on the MAPPO algorithm, which enables multiple tasks to make independent decisions based on their partial observations without requiring global information. This approach is beneficial for the adaptive expansion in response to dynamic changes in different satellite networks. The simulation results show that D-CHO improves performance by 22%, 26%, and 11% compared to the SCDP, G-CHO, and MADDPG-CHO algorithms, respectively, and exhibits better scalability while maintaining satisfactory performance.
- 21 October 2025
- Published by IOS Press
- p. 1286-1293
Open AccessD-CHO: Task-Oriented Satellite Conditional Handover Decision in NTN Based on Multi-Agent Game
In non-terrestrial networks, satellite constellations based on the Low-Earth-Orbit (LEO) have become crucial for ensuring seamless global connectivity. The flexible continuity guarantee is demanded for task-oriented user connection requests in satellite networks. In this paper, we propose a task-oriented satellite conditional handover scheme, D-CHO, based on multi-agent game theory. For the problem formalization, this paper focuses on delay overhead, satellite utilization deviation, and load performance to model the multi-objective optimization. According to game theory, a Nash equilibrium exists among the multi-task game strategies that require satellite links. Through exploration and exploitation, the optimal satellite handover sequence scheme can be identified. This paper explores the optimal solution based on the MAPPO algorithm, which enables multiple tasks to make independent decisions based on their partial observations without requiring global information. This approach is beneficial for the adaptive expansion in response to dynamic changes in different satellite networks. The simulation results show that D-CHO improves performance by 22%, 26%, and 11% compared to the SCDP, G-CHO, and MADDPG-CHO algorithms, respectively, and exhibits better scalability while maintaining satisfactory performance.
- 22 September 2023
- Published by Springer Nature
- p. 357-368
EGCN: A Node Classification Model Based on Transformer and Spatial Feature Attention GCN for Dynamic Graph
- 22 September 2023
- Published by Springer Nature
- p. 357-368
EGCN: A Node Classification Model Based on Transformer and Spatial Feature Attention GCN for Dynamic Graph
- Open Access
- 9 June 2022
- Published by Institution of Engineering and Technology (IET) in IET Image Processing
- Vol. 16 (12) , 3143-3154
SREFBN: Enhanced feature block network for single‐image super‐resolution
Deep learning has assisted the field of single‐image super‐resolution (SR) in achieving new heights. However, the task of restoring a high‐resolution (HR) image from a highly degraded low‐resolution (LR) image is sophisticated due to poor image restoration quality. A novel and effective lightweight SR method is presented as super‐resolution via an enhanced feature block network (SREFBN) that successfully reconstructs an HR image using a corresponding LR image with a purposed deep residual block. In addition, a novel shared parameters approach in the top‐down pathway among low‐level feature maps is introduced. The experimental results prove that SREFBN achieves remarkable performance. The presented framework requires lower computational cost and outperforms many state‐of‐the‐art methods. It is also highly adaptable with low‐end devices, requiring lower multiplication and adding operations. A trade‐off comparison between the number of parameters, execution time, and accuracies is given while also showing different variations of our approach to prove the effectiveness and reliability of the shared parameters. Most importantly, the results indicate that our framework has gained state‐of‐the‐art performance on larger scales 3 and 4. Code is available at https://github.com/curzii23/SREFBN .
- 9 June 2022
- Published by Institution of Engineering and Technology (IET) in IET Image Processing
- Vol. 16 (12) , 3143-3154
Open AccessSREFBN: Enhanced feature block network for single‐image super‐resolution
Deep learning has assisted the field of single‐image super‐resolution (SR) in achieving new heights. However, the task of restoring a high‐resolution (HR) image from a highly degraded low‐resolution (LR) image is sophisticated due to poor image restoration quality. A novel and effective lightweight SR method is presented as super‐resolution via an enhanced feature block network (SREFBN) that successfully reconstructs an HR image using a corresponding LR image with a purposed deep residual block. In addition, a novel shared parameters approach in the top‐down pathway among low‐level feature maps is introduced. The experimental results prove that SREFBN achieves remarkable performance. The presented framework requires lower computational cost and outperforms many state‐of‐the‐art methods. It is also highly adaptable with low‐end devices, requiring lower multiplication and adding operations. A trade‐off comparison between the number of parameters, execution time, and accuracies is given while also showing different variations of our approach to prove the effectiveness and reliability of the shared parameters. Most importantly, the results indicate that our framework has gained state‐of‐the‐art performance on larger scales 3 and 4. Code is available at https://github.com/curzii23/SREFBN .
- 1 July 2021
- Published by Elsevier in Computer Networks
- Vol. 193
A-DECS: Enhanced collaborative edge–edge data storage service for edge computing with adaptive prediction
- 1 July 2021
- Published by Elsevier in Computer Networks
- Vol. 193
A-DECS: Enhanced collaborative edge–edge data storage service for edge computing with adaptive prediction