Graph partitioning of power network for emergency voltage control

This paper presents an electrical network graph partitioning technique that divides a power network into zones. The idea of partitioning is to prevent the propagation of disturbances between zones and avoid cascading events in response to disturbances. Identifying coherent groups of buses in power electrical networks is crucial to implement efficient control strategies based on partitioning techniques. Furthermore, the coherent buses can be used for model reduction of complex power systems. Graph theory has an excellent capability to simplify large connoted networks such as the case with large power networks. In this paper, graph partitioning algorithm is applied to electrical networks including IEEE 39-bus and IEEE 118-bus. Graphs with and without weights are considered to investigate and compare the results of using graph partition algorithm. Weights in a graph power system can be real, reactive or apparent power transferred between buses. Finally, disturbances are intentionally inserted on the loads to verify the performance of partitioned power network to violation. The results show the performance and ability of graph partitioning when used in conjunction with a large power network.