Performance Analysis of Graph Algorithms for Microgrid Protection

Jasleen Saluja; Swagata Biswas; Souvik Roy; O.V. Gnana Swathika

Performance Analysis of Graph Algorithms for Microgrid Protection

Authors

Jasleen Saluja School of Electrical Engineering, VIT University, Chennai Tamilnadu 600127, India.
Swagata Biswas School of Electrical Engineering, VIT University, Chennai Tamilnadu 600127, India.
Souvik Roy School of Electrical Engineering, VIT University, Chennai Tamilnadu 600127, India.
O.V. Gnana Swathika School of Electrical Engineering, VIT University, Chennai Tamilnadu 600127, India.

Keywords:

Microgrid, Kruskals Algorithm, Prims Algorithm, Djikstras Algorithms, Floyd-Warshalls Algorithm, Microgrid Protection,

Abstract

Microgrids are energy systems that consist of distributed energy sources and loads, which can operate in parallel with or independently from the main grid. The integration of renewable Energy System (RES) into microgrid causes the power flow to be bidirectional in nature. Reconfiguration of the microgrid could occur due to RES, load or utility grid connection or disconnection. Thus, conventional protection strategies are not applicable to microgrids and it is challenging for engineers to tackle any faulty issues. This paper proposes graph algorithms, such as the Kruskals and the Prim which aid in identifying the shortest path from a faulted point to the point of common coupling(PCC). Algorithms, such as Floyd Warshall and Djiktra’s algorithms ensure that only minimum portion of the network is disconnected during fault clearance.

Downloads

Download data is not yet available.

Downloads

Published

2018-02-15

How to Cite

Saluja, J., Biswas, S., Roy, S., & Swathika, O. G. (2018). Performance Analysis of Graph Algorithms for Microgrid Protection. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 10(1-8), 115–118. Retrieved from https://jtec.utem.edu.my/jtec/article/view/3746