Refined Network Topology for Improved Reliability and Enhanced Dijkstra Algorithm for Optimal Path Selection during Link Failures in Cluster Microgrids

Gogulamudi Pradeep Reddy, Yellapragada Venkata Pavan Kumar, Maddikera Kalyan Chakravarthi () and Aymen Flah
Additional contact information
Gogulamudi Pradeep Reddy: School of Electronics Engineering, VIT-AP University, Amaravati 522237, India
Yellapragada Venkata Pavan Kumar: School of Electronics Engineering, VIT-AP University, Amaravati 522237, India
Maddikera Kalyan Chakravarthi: School of Electronics Engineering, VIT-AP University, Amaravati 522237, India
Aymen Flah: Energy Processes Environment and Electrical Systems Unit, National Engineering School of Gabes, University of Gabes, Gabes 6072, Tunisia

Sustainability, 2022, vol. 14, issue 16, 1-21

Abstract: Cluster microgrids are a group of interoperable smart microgrids, connected in a local network to exchange their energy resources and collectively meet their load. A microgrid can import/export energy to the neighboring microgrid in the network based on energy deficit/availability. However, in executing such an operation, a well-established communication network is essential. This network must provide a reliable communication path between microgrids. In addition, the network must provide an optimal path between any two microgrids in the network to optimize immediate energy generation, import requirements, and export possibilities. To meet these requirements, different conventional research approaches have been used to provide reliable communication, such as backup/alternative/Hot Standby Router Protocol (HSRP)-based redundant path concepts, in addition to traditional/renowned Dijkstra algorithms, in order to find the shortest path between microgrids. The HSRP-based mechanism provides an additional path between microgrids, but may not completely solve the reliability issue, especially during multiple link failures and simultaneous failures of the actual path and redundant path. Similarly, Dijkstra algorithms discussed in the literature do not work for finding the shortest path during link failures. Thus, to enhance reliability, this paper proposes a refined network topology that provides more communication paths between microgrids, while retaining the same number of total links needed, as in conventional HSRP-based networks. In addition, this paper proposes an enhanced Dijkstra algorithm to find the optimum path during link failures. Simulations are executed using NetSim TM by implementing test cases such as single-link and multiple-link failures. The results prove that the proposed topology and method are superior to conventional approaches.

Keywords: cluster microgrids; communication network; Dijkstra algorithm; graph theory approach; interoperability; link failures; optimal path selection; reliability (search for similar items in EconPapers)
JEL-codes: O13 Q Q0 Q2 Q3 Q5 Q56 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2071-1050/14/16/10367/pdf (application/pdf)
https://www.mdpi.com/2071-1050/14/16/10367/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jsusta:v:14:y:2022:i:16:p:10367-:d:893249

Access Statistics for this article

Sustainability is currently edited by Ms. Alexandra Wu

More articles in Sustainability from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().