Detecting Critical Nodes in Interdependent Power Networks for Vulnerability Assessment

Nguyen, Dung Tien; Shen, Yilin; Thai, My T.

doi:10.1109/tsg.2012.2229398

Cited by 251 publications

(98 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We partition the set of players into two sets consisting of high and low edge cost players and show that in any Nash equilibrium, all of the high-cost players that have a low-cost player in their vicinity "free ride" and choose not to construct any interconnections to G 2 . At the end, we provide some insights about our results via a simulation involving random network models that have been previously used to capture interdependencies between power and sensor/communication networks [4], [17], [26], [27]. Our simulations suggest that the social welfare of the constructed networks is higher when all of the players have equal cost of constructing edges, compared to the case where they have heterogeneous edge costs.…”

Section: Introductionmentioning

confidence: 81%

See 1 more Smart Citation

The Game-Theoretic Formation of Interconnections Between Networks

Shahrivar

Sundaram

2017

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

We introduce a network design game where the objective of the players is to design the interconnections between the nodes of two different networks G 1 and G 2 in order to maximize certain local utility functions. In this setting, each player is associated with a node in G 1 and has functional dependencies on certain nodes in G 2 . We use a distance-based utility for the players in which the goal of each player is to purchase a set of edges (incident to its associated node) such that the sum of the distances between its associated node and the nodes it depends on in G 2 is minimized. We consider a heterogeneous set of players (i.e., players have their own costs and benefits for constructing edges). We show that finding a best response of a player in this game is NP-hard. Despite this, we characterize some properties of the best response actions which are helpful in determining a Nash equilibrium for certain instances of this game. In particular, we prove existence of pure Nash equilibria in this game when G 2 contains a star subgraph, and provide an algorithm that outputs such an equilibrium for any set of players. Finally, we show that the price of anarchy in this game can be arbitrarily large.

show abstract

Section: Introductionmentioning

confidence: 81%

“…Here, we use the same experimental setup as [26], where networks G 1 and G 2 have a synthetic scale-free (SF) structure. Such scale-free networks have also been used to model power and communication networks in many of the other works in this area [1], [3], [27].…”

Section: Simulation and Numerical Analysismentioning

confidence: 99%

The Game-Theoretic Formation of Interconnections Between Networks

Shahrivar

Sundaram

2017

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…Figure 4 shows the illustration and degree of distribution of the power grid network. Due to the lack of computer control network data, we use a BA scale-free network instead [15,48], with N BA = 4941 and <K BA > ≈ 4, to construct power-BA interdependent networks.…”

Section: Infrastructure Networkmentioning

confidence: 99%

Research on the Robustness of Interdependent Networks under Localized Attack

et al. 2017

View full text Add to dashboard Cite

Abstract:Critical infrastructures (CI) are the cornerstone of modern society, and they are connected with each other through material, energy, or information. The robustness of interdependent CI systems under attack has been a hot topic in recent years, but previous studies mainly focused on malicious attacks or random failure. To analyze the impact of some natural disasters whose destructive force is mainly related to distance with respect to interdependent CI systems, we present a new localized attack mode considering destructive force decays with distance, and carry out simulations on several interdependent networks constructed by artificial and real world networks. Furthermore, this article analyzes the influence of coupling strength and coupling pattern on the robustness of interdependent system. The results show that dependency links between networks decrease the robustness of interdependence networks, but the robustness under failure probability degradation is not vulnerable like that under malicious attack or random failure. In addition, the coupling preference has little effect on the robustness of interdependent networks under the new localized attack strategy; when the average degree of subnetworks is large, the same conclusion can be obtained for the coupling strength.

show abstract

“…In this work, we follow the cascading failure model described in [1] which has since been widely used in the literature as the basis of several studies (e.g., [2], [19], [20], [21]). In this model, a cascading failure begins with the failure (i.e., removal) of a fraction, 1 p of nodes from network A.…”

Section: B Cascading Failure Modelmentioning

confidence: 99%

Resilience of interdependent communication and power distribution networks against cascading failures

Chai

Kyritsis

Κατσαρός

et al. 2016

2016 IFIP Networking Conference (IFIP Networking) and Workshops

View full text Add to dashboard Cite

Abstract-The operations of many modern cyber-physical systems, such as smart grids, are based on increasingly interdependent networks. The impact of cascading failures on such networks has recently received significant attention due to the corresponding effect of these failures on the society. In this paper, we conduct an empirical study on the robustness of interdependent systems formed by the coupling of power grids and communication networks by putting real distribution power grids to the test. We focus on the assessment of the robustness of a large set of medium-voltage (MV) distribution grids, currently operating live in the Netherlands, against cascading failures initiated by different types of faults / attacks. We consider both unintentional random failures and malicious targeted attacks which gradually degrade the capability of the entire system and we evaluate their respective consequences. Our study shows that current MV grids are highly vulnerable to such cascades of failures. Furthermore, we discover that a small-world communication network structure lends itself to the robustness of the interdependent system. Also interestingly enough, we discover that the formation of hub hierarchies, which is known to enhance independent network robustness, actually has detrimental effects against cascading failures. Based on real MV grid topologies, our study yields realistic insights which can be employed as a set of practical guidelines for distribution system operators (DSOs) to design effective grid protection schemes.

show abstract

Detecting Critical Nodes in Interdependent Power Networks for Vulnerability Assessment

Cited by 251 publications

References 16 publications

The Game-Theoretic Formation of Interconnections Between Networks

The Game-Theoretic Formation of Interconnections Between Networks

Research on the Robustness of Interdependent Networks under Localized Attack

Resilience of interdependent communication and power distribution networks against cascading failures

Contact Info

Product

Resources

About