Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,

Slides:



Advertisements
Similar presentations
Hidden Metric Spaces and Navigability of Complex Networks
Advertisements

Data and Computer Communications
Marzieh Parandehgheibi
1 Intrusion Monitoring of Malicious Routing Behavior Poornima Balasubramanyam Karl Levitt Computer Security Laboratory Department of Computer Science UCDavis.
METHODOLOGY FOR IDENTIFYING NEAR-OPTIMAL INTERDICTION STRATEGIES FOR A POWER TRANSMISSION SYSTEM Vicki M. Bier, Eli Robert Gratz, Naraphorn J. Haphuriwat,
1 Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces Dmitri Krioukov CAIDA/UCSD Joint work with F. Papadopoulos, M.
2 - Winter 2005 EE EE 766 Computer Interfacing and Protocols 1 Basic Concepts Link: Physical pathway between devices Line Configuration: Attachment of.
Achille’s Heel. An Achilles's heel is a term for a person's weak spot and is based upon the hero who was dipped in the river that granted immortality;
School of Information University of Michigan Network resilience Lecture 20.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Common approach 1. Define space: assign random ID (160-bit) to each node and key 2. Define a metric topology in this space,  that is, the space of keys.
Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.
On Computing Compression Trees for Data Collection in Wireless Sensor Networks Jian Li, Amol Deshpande and Samir Khuller Department of Computer Science,
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
Mitigating routing misbehavior in ad hoc networks Mary Baker Departments of Computer Science and.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
Small Worlds and the Security of Ubiquitous Computing From : IEEE CNF Author : Harald Vogt Presented by Chen Shih Yu.
Design and Analysis of an MST-Based Topology Control Algorithm Ning Li and Jennifer Hou Department of Computer Science University of Illinois at Urbana-Champaign.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 22nd Lecture Christian Schindelhauer.
Establishing Pairwise Keys in Distributed Sensor Networks Donggang Liu, Peng Ning Jason Buckingham CSCI 7143: Secure Sensor Networks October 12, 2004.
Network Topologies.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Applying the Distribution System in Grid Restoration/NERC CIP-014 Risk Assessment Srijib Mukherjee, Ph.D., P.E. UC Synergetic.
IEEE P2P, Aachen, Germany, September Ad-hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks Hasan Guclu
Programming for Geographical Information Analysis: Advanced Skills Online mini-lecture: Introduction to Networks Dr Andy Evans.
Internet Traffic Engineering by Optimizing OSPF Weights Bernard Fortz (Universit é Libre de Bruxelles) Mikkel Thorup (AT&T Labs-Research) Presented by.
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
Efficient Gathering of Correlated Data in Sensor Networks
March 8, 2006  Yvo Desmedt Robust Operations Research II: Production Networks by Yvo Desmedt University College London, UK.
Complex network geometry and navigation Dmitri Krioukov CAIDA/UCSD F. Papadopoulos, M. Kitsak, kc claffy, A. Vahdat M. Á. Serrano, M. Boguñá UCSD, December.
Separability and Topology Control of Quasi Unit Disk Graphs Philippe Giabbanelli CMPT 880 – Spring 2008.
NTU GICE Intentional Attacks on Complex Network Speaker: Shin-Ming Cheng Advisor: Kwang-Cheng Chen.
Performance Evaluation of ATM Shortcuts in Overlaid IP/ATM Networks Jim Kurose Don Towsley Department of Computer Science Univ. of Massachusetts, Amherst.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Network Survivability Against Region Failure Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on Ran Li, Xiaoliang.
Network Topology
Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.
Complex network of the brain II Hubs and Rich clubs in the brain
Decapitation of networks with and without weights and direction : The economics of iterated attack and defense Advisor : Professor Frank Y. S. Lin Presented.
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
Network Dynamics and Simulation Science Laboratory Cyberinfrastructure for Social Networks and Network Analysis Network Dynamics and Simulation Science.
Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
Mitigation strategies on scale-free networks against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Chris Chang.
Network resilience.
Brief Announcement : Measuring Robustness of Superpeer Topologies Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
Informatics tools in network science
Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
Fast Parallel Algorithms for Edge-Switching to Achieve a Target Visit Rate in Heterogeneous Graphs Maleq Khan September 9, 2014 Joint work with: Hasanuzzaman.
Structure-Free Data Aggregation in Sensor Networks.
Root Cause Localization on Power Networks Zhen Chen, ECEE, Arizona State University Joint work with Kai Zhu and Lei Ying.
1 Minimum Interference Algorithm for Integrated Topology Control and Routing in Wireless Optical Backbone Networks Fangting Sun Mark Shayman University.
Performance Analysis of Inter-Domain Path Computation Methodologies draft-dasgupta-ccamp-path-comp-analysis-00.txt Sukrit Dasgupta, Jaudelice C. de Oliveira.
A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.
Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.
Cascading failures of loads in interconnected networks under intentional attack Yongxiang Xia Department of Information Science and Electronic Engineering.
Complex network of the brain II Attack tolerance vs. Lethality Jaeseung Jeong, Ph.D. Department of Bio and Brain Engineering, KAIST.
Network Topology Single-level Diversity Coding System (DCS) An information source is encoded by a number of encoders. There are a number of decoders, each.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Complex network of the brain II Hubs and Rich clubs in the brain Jaeseung Jeong, Ph.D. Department of Bio and Brain Engineering, KAIST.
Puzzle You have 2 glass marbles Building with 100 floors
Link-Level Internet Structures
How They Interact? Understanding Cyber and Physical Interactions against Fault Propagation in Smart Grid Zhuo Lu, University Of South Florida Mingkui Wei,
Vicki M. Bier, Eli Robert Gratz, Naraphorn J
A Model of Power Transmission Disturbances in Simple Systems
复杂网络可控性 研究进展 汪秉宏 2014 北京 网络科学论坛.
Presentation transcript:

Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar, and Achla Marathe Network Dynamics and Simulation Science Lab Virginia Bioinformatics Institute Virginia Tech

Network Dynamics and Simulation Science Laboratory Vulnerable Electrical Networks 2003 northeast blackout and 2003 Italy blackout (and many others): cascading failure of large power grids from local failure. Damage to other critical infrastructures: transportation, communication, financial networks, etc. It is important to study robustness of power grids, identify potential points of vulnerabilities, and build redundancies to make the infrastructure more robust.

Network Dynamics and Simulation Science Laboratory Methodology: Structural Analysis Instead of simulations, we study vulnerability of an electrical network by structural analysis. Structural properties of a power grid: degree distribution, shortest path distribution, flow capacity, etc. Generic viewpoint to investigate the fundamental causes of vulnerabilities. Structural analysis of real power grids also helps building more realistic synthetic grids for simulations. This method is not limited to power grids. It can be applied to other infrastructure networks.

Network Dynamics and Simulation Science Laboratory Topology of A Real Power Grid

Network Dynamics and Simulation Science Laboratory Topology of Different Networks Real grid Ring Complete graph Binary tree

Network Dynamics and Simulation Science Laboratory Experiment Set-up Data –A real grid of a large US city –A random grid: G(n,m) graph –Synthetic grids: standard IEEE test cases Compute basic structural measures –degree distribution –shortest path distribution –size of minimum dominating set (subset of nodes that have all other nodes as neighbors) Robustness under attacks: random or targeted –Removal of random nodes or random transmission lines –Removal of high degree nodes or high capacity links

Network Dynamics and Simulation Science Laboratory Summary of Grids in Our Experiments GridLinesNodesAvg. Deg.Load Serving NodesGeneratorsDom. Set Real Random bus bus bus bus bus bus bus

Network Dynamics and Simulation Science Laboratory Degree and Shortest Path Distributions Higher avg. degree (145-bus) means larger link redundancy, i.e., more robust to link failure. Shortest path distribution reflects how far apart generators and load serving nodes are. One expects it to become flatter with larger mean as network size increases. Real, 162-bus, and 145-bus grids seem to have shorter shortest paths, thus more robust.

Network Dynamics and Simulation Science Laboratory Max Component Size: Greedy Node Attack Binary tree

Network Dynamics and Simulation Science Laboratory Max Component Size: Greedy Node Attack Binary tree

Network Dynamics and Simulation Science Laboratory Max Component Size: Greedy Node Attack Binary tree

Network Dynamics and Simulation Science Laboratory Max Component Size: Greedy Node Attack

Network Dynamics and Simulation Science Laboratory Max Component Size: Greedy Node Attack Real grid seems most vulnerable: removal of 10% high degree nodes  max component size decreases by 90%. 162-bus network has a component with half of its nodes, even if 20% of nodes are removed.

Network Dynamics and Simulation Science Laboratory Number of Components: Greedy Node Attack

Network Dynamics and Simulation Science Laboratory Number of Components: Greedy Node Attack Again, real grid breaks into (normalized) more pieces than other grids (except random grid, which starts with about 72 components), when high degree nodes are removed. 162-bus network still seems to be most robust.

Network Dynamics and Simulation Science Laboratory Max Component Size: Random Node Attack Real grid is most vulnerable even with random node deletion. Curve of 162-bus grid looks linear: decrease in max component size mainly comes directly from deletion of nodes.

Network Dynamics and Simulation Science Laboratory Number of Components: Random Node Attack Real grid continues to be most vulnerable to random node removal; while 162-bus grid still seems to be robust.

Network Dynamics and Simulation Science Laboratory Flow Vulnerability Flow capacity of a power grid is the maximum (normal) flow that can be sent from generators to load serving nodes, subject to constraints on transmission line capacity, generator capacity, and substation capacity. We have capacity information only for real grid (thus also random grid) and 162-bus grid. Flow vulnerability of a power grid is the percentage decrease in its flow capacity, when nodes or links are removed.

Network Dynamics and Simulation Science Laboratory Flow Vulnerability generator load serving node Flow capacity = 2

Network Dynamics and Simulation Science Laboratory Flow Vulnerability generator load serving node Flow capacity = 2 generator 11 Flow capacity = 1 load serving node

Network Dynamics and Simulation Science Laboratory Flow Vulnerability generator load serving node Flow capacity = 2 generator 11 Flow capacity = 1 load serving node Flow vulnerability with one node deletion = 50%

Network Dynamics and Simulation Science Laboratory Flow Vulnerability: Node Attacks All seem to be robust to random node attack. Random grid is robust to targeted node attack, because it has no particular structure (small flow capacity in base case). Surprisingly, 162-bus grid is most vulnerable to high degree node deletion. Probably although it breaks into small number of pieces with large sizes, generators and load serving nodes are separated and flow cannot be transmitted.

Network Dynamics and Simulation Science Laboratory Flow Vulnerability: Link Attacks Real grid is very robust to link attacks. Its flow capacity is intact even if 40 high capacity links are removed. 162-bus grid is vulnerable to greedy link deletion, too. It is possibly out of the same reason: many generator nodes or load serving nodes are isolated.

Network Dynamics and Simulation Science Laboratory Comparison with Other Infrastructure Networks Wireless network seems to be very robust to targeted node attacks. An almost linear curve means that decrease of its max component size is almost completely due to removal of nodes. Power grid and transportation network seem to have similar vulnerability under greedy node attacks.

Network Dynamics and Simulation Science Laboratory Conclusions and Future Work Grids are robust or vulnerable if different structural measures are used. We need a systematic quantification of vulnerability, which probably integrates different measures. Extend the study to other real electrical networks. Combine structural analysis with simulations.