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

more »

... mal 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 NetSimTM 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.