Tingdong Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Tingdong Wang has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Yinglong Ma
North China Electric Power University
4 shared publications - Chenqi Guo
School of Control and Computer Engineering, North China Electric Power University, Beijing, China
2 shared publications - Siyan Liu
China Electric Power Research Institute
2 shared publications - Huili Liu
School of Control and Computer Engineering, North China Electric Power University, Beijing, China
1 shared publication - Wenguang Ma
North China Electric Power University
1 shared publication - Wenzheng Ma
North China Electric Power University
1 shared publication
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (6) , 6071-6083
Hybrid Attention-Augmented Self-Interpretable Channel-Grouped Graph Convolutional Network for Robust Distribution Network Fault Diagnosis
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (6) , 6071-6083
Hybrid Attention-Augmented Self-Interpretable Channel-Grouped Graph Convolutional Network for Robust Distribution Network Fault Diagnosis
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4252-4264
Fast and Scalable Newton-Raphson Power Flow Analysis via Hierarchical Parallelism and Graph Node-Based Hash Storage
The continuous expansion of smart grids has led to increasingly frequent power flow variations, thereby posing new demands for fast and scalable parallel implementation of Newton-Raphson power flow (N-R PF) calculations. However, existing parallel N-R PF methods often suffer from redundant floating-point operations and centralized data processing of matrix reconstruction for N-R PF calculation, which significantly increases the computational burden and impairs the parallel performance of N-R PF. To address these limitations, this paper proposes a fast and scalable hierarchical parallel strategy and graph node-based hash storage (HPGNH) method to accelerate N-R PF analysis. HPGNH integrates intra-node and inter-node parallel strategies for effectively eliminating redundant floating-point operations in Jacobian matrix updates and equation residual updates. Moreover, we present a graph node-based hash storage structure to efficiently construct and update the nonzero entries of sparse matrices in a fully parallel manner. Particularly for Q-limit N-R PF calculations, HPGNH only updates a subset of entries within the constructed storage structure instead of performing full-scale reconstruction, thereby significantly improving computational efficiency. Extensive experiments on twelve benchmark power systems demonstrate that HPGNH outperforms nine state-of-the-art methods, with computational performance improvements of 63.1% for N-R PF and 81.8% for Q-limit N-R PF.
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4252-4264
Fast and Scalable Newton-Raphson Power Flow Analysis via Hierarchical Parallelism and Graph Node-Based Hash Storage
The continuous expansion of smart grids has led to increasingly frequent power flow variations, thereby posing new demands for fast and scalable parallel implementation of Newton-Raphson power flow (N-R PF) calculations. However, existing parallel N-R PF methods often suffer from redundant floating-point operations and centralized data processing of matrix reconstruction for N-R PF calculation, which significantly increases the computational burden and impairs the parallel performance of N-R PF. To address these limitations, this paper proposes a fast and scalable hierarchical parallel strategy and graph node-based hash storage (HPGNH) method to accelerate N-R PF analysis. HPGNH integrates intra-node and inter-node parallel strategies for effectively eliminating redundant floating-point operations in Jacobian matrix updates and equation residual updates. Moreover, we present a graph node-based hash storage structure to efficiently construct and update the nonzero entries of sparse matrices in a fully parallel manner. Particularly for Q-limit N-R PF calculations, HPGNH only updates a subset of entries within the constructed storage structure instead of performing full-scale reconstruction, thereby significantly improving computational efficiency. Extensive experiments on twelve benchmark power systems demonstrate that HPGNH outperforms nine state-of-the-art methods, with computational performance improvements of 63.1% for N-R PF and 81.8% for Q-limit N-R PF.
- 15 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (3) , 2853-2865
MOHFL: Multi-Level One-Shot Hierarchical Federated Learning With Enhanced Model Aggregation Over Non-IID Data
Hierarchical federated learning (HFL) is a privacy-preserving distributed machine learning framework with a client-edge-cloud hierarchy, where multiple edge servers perform partial model aggregation to reduce costly communication with the cloud server. Nevertheless, most existing HFL methods require extensive iterative communication and public datasets, which not only increase communication overhead but also raise privacy and security concerns. Moreover, non-independent and identically distributed (non-IID) data among devices can significantly impact the accuracy of the global model in HFL. To address these challenges, we propose a multi-level one-shot HFL framework (MOHFL), which aims to improve the performance of the global model in a single communication round. Specifically, we employ conditional variational autoencoders (CVAEs) as local models and use the aggregated decoders to generate an IID training set for the global model, thereby mitigating the negative impact of non-IID data. We improve the performance of CVAEs under different levels of data heterogeneity through a dominant class-based data selection method. Subsequently, an edge aggregation scheme based on multi-teacher knowledge distillation and contrastive learning is proposed to aggregate the knowledge from local decoders to edge decoders. Extensive experiments on four real-world datasets demonstrate that MOHFL is very competitive against four state-of-the-art baselines under various settings.
- 15 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (3) , 2853-2865
MOHFL: Multi-Level One-Shot Hierarchical Federated Learning With Enhanced Model Aggregation Over Non-IID Data
Hierarchical federated learning (HFL) is a privacy-preserving distributed machine learning framework with a client-edge-cloud hierarchy, where multiple edge servers perform partial model aggregation to reduce costly communication with the cloud server. Nevertheless, most existing HFL methods require extensive iterative communication and public datasets, which not only increase communication overhead but also raise privacy and security concerns. Moreover, non-independent and identically distributed (non-IID) data among devices can significantly impact the accuracy of the global model in HFL. To address these challenges, we propose a multi-level one-shot HFL framework (MOHFL), which aims to improve the performance of the global model in a single communication round. Specifically, we employ conditional variational autoencoders (CVAEs) as local models and use the aggregated decoders to generate an IID training set for the global model, thereby mitigating the negative impact of non-IID data. We improve the performance of CVAEs under different levels of data heterogeneity through a dominant class-based data selection method. Subsequently, an edge aggregation scheme based on multi-teacher knowledge distillation and contrastive learning is proposed to aggregate the knowledge from local decoders to edge decoders. Extensive experiments on four real-world datasets demonstrate that MOHFL is very competitive against four state-of-the-art baselines under various settings.
- 5 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (3) , 2124-2133
A Fully Parallel and Scalable FDSE Approach Based on Balanced Measurements Partitioning and Graph Node-Centric Hash Storage
Parallel computing approaches have illustrated promising potential in accelerating state estimation (SE). How to efficiently handle data processing and updating has become a crucial problem in improving the performance of SE. This article proposes a fully parallel and scalable approach (BMPGNC) based on balanced measurements partitioning and graph node-centric hash (GNCH) storage, to accelerate fast decoupled state estimation (FDSE) for largescale power systems, which is based on graph model multithread parallelism without any centralized preprocessing. A GNCH model is presented for compressed data storage and fast data access, where a balanced measurement partitioning is utilized for load balancing over multiple threads. Four GNCH-based algorithms are proposed for parallel data processing and updating. Extensive experiments were conducted over six benchmark test systems. The results show BMPGNC achieves superior performance on accelerating FDSE without compromising high accuracy, thereby achieving fast, energy-efficient, and high-accuracy FDSE for large-scale power systems.
- 5 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (3) , 2124-2133
A Fully Parallel and Scalable FDSE Approach Based on Balanced Measurements Partitioning and Graph Node-Centric Hash Storage
Parallel computing approaches have illustrated promising potential in accelerating state estimation (SE). How to efficiently handle data processing and updating has become a crucial problem in improving the performance of SE. This article proposes a fully parallel and scalable approach (BMPGNC) based on balanced measurements partitioning and graph node-centric hash (GNCH) storage, to accelerate fast decoupled state estimation (FDSE) for largescale power systems, which is based on graph model multithread parallelism without any centralized preprocessing. A GNCH model is presented for compressed data storage and fast data access, where a balanced measurement partitioning is utilized for load balancing over multiple threads. Four GNCH-based algorithms are proposed for parallel data processing and updating. Extensive experiments were conducted over six benchmark test systems. The results show BMPGNC achieves superior performance on accelerating FDSE without compromising high accuracy, thereby achieving fast, energy-efficient, and high-accuracy FDSE for large-scale power systems.