The Smart Grid System (SGS) is a joint network comprising the power and the communication network. In this paper, the underlying intra-and-interdependencies between entities for a given SGS is captured using a dependency model called Modified Implicative Interdependency Model (MIIM) [1]. Given an integer K, the K-contingency list problem gives the list of K-most critical entities, failure of which maximizes the network damage at the current time. The problem being NP complete [2] and owing to the higher running time of the given Integer Linear Programming (ILP) based solution [3], a much faster heuristic solution to generate an event driven self-updating K-contingency list [4] is also given in this paper. Based on the contingency lists obtained from both the solutions, this paper proposes an adaptive entity hardening technique based on a leader-follower game theoretic approach that arrests the cascading failure of entities in the SGS after an initial failure of entities. The validation of the work is done by comparing the contingency lists using both types of solutions, obtained for different K values using the MIIM model on a smart grid of IEEE 14-Bus system with that obtained by simulating the smart grid using a co-simulation system formed by MATPOWER and Java Network Simulator (JNS). The K-contingency list obtained for a smart grid of IEEE 14-Bus system also indicate that the network damage predicted by both the ILP based solution and heuristic solution using MIIM are more realistic compared to that obtained using another dependency model called Implicative Interdependency Model (IIM) [2]. Advantage of using the MIIM based heuristic solution is also shown in this paper when larger SGS of IEEE 118-Bus is considered. Finally, it is shown how the adaptive hardening helps in improving the network performance.
翻译:智能网格系统(SGS) 是一个由电力和通信网络组成的联合网络。 在本文中, 使用一个称为 Modified Indition Indition Indition Indition Indidition Indictication Indivision model (MIIM) [1] 来捕捉给给定的 SGS 的实体之间基本的内和相互依存关系[3]。 K- condition list 问题给出了K- most 关键实体的列表, K- condition Greistrict 。 问题在于 NP 完成 [2], 问题在于给定的 Integer Lina 编程(ILP) 解决方案[3] 运行时间较长, 一个更快得多的内和内联互连互连互连互连互连互连互连互连互连 。 本文还根据两个解决方案的应急互连连连调列表提供[4], K- condistration a redistration a registration districal a livestal modistration the I-I-I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I- I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-