• DocumentCode
    452
  • Title

    A Maximum-Flow-Based Complex Network Approach for Power System Vulnerability Analysis

  • Author

    Dwivedi, Ajendra ; Yu, Xinghuo

  • Author_Institution
    RMIT Univ., Melbourne, VIC, Australia
  • Volume
    9
  • Issue
    1
  • fYear
    2013
  • fDate
    Feb. 2013
  • Firstpage
    81
  • Lastpage
    88
  • Abstract
    This paper proposes a maximum-flow-based complex network approach for the analysis of the vulnerability of power systems. A new centrality index is proposed, taking into consideration the maximum flow from the source (generator) nodes to the sink (load) nodes, for assessing the network. The Max-Flow Min-Cut Theorem, also known as Ford-Fulkerson Theorem, is used for evaluating the capacity of links. The proposed methodology is then used to identify vulnerable lines of the IEEE 118 bus system and its effectiveness is demonstrated through simulation studies.
  • Keywords
    complex networks; load flow; power system security; Ford-Fulkerson theorem; IEEE 118 bus system; centrality index; max-flow min-cut theorem; maximum-flow-based complex network; power system vulnerability analysis; sink load nodes; source generator nodes; Admittance; Indexes; Joining processes; Load flow; Power transmission lines; Transmission line matrix methods; Cascading failure; complex networks (CN); computational algorithms; identification; maximum flow; modeling; power systems; vulnerability;
  • fLanguage
    English
  • Journal_Title
    Industrial Informatics, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1551-3203
  • Type

    jour

  • DOI
    10.1109/TII.2011.2173944
  • Filename
    6062676