Warship Power System Survivability Evaluation Based on Complex Network Theory Huiying He1,a, Hongjiang Li1, Shaochang Chen1 and Hao Xiong1,2,b

Similar documents
A study on reliability of high-speed passenger transport network based on complex network analysis 1

Controllability of Complex Power Networks

A New Evaluation Method of Node Importance in Directed Weighted Complex Networks

An ELM-based traffic flow prediction method adapted to different data types Wang Xingchao1, a, Hu Jianming2, b, Zhang Yi3 and Wang Zhenyu4

Study on Computer Network Technology of Digital Library

Road Network Traffic Congestion Evaluation Simulation Model based on Complex Network Chao Luo

An Adaptive Threshold LBP Algorithm for Face Recognition

AUV Cruise Path Planning Based on Energy Priority and Current Model

An Evolutionary Algorithm for the Multi-objective Shortest Path Problem

Design of Coal Mine Power Supply Monitoring System

Distribution Network Reconfiguration Based on Relevance Vector Machine

Research on Quality Reliability of Rolling Bearings by Multi - Weight Method (Part Ⅱ: Experiment)

Mobile Cloud Multimedia Services Using Enhance Blind Online Scheduling Algorithm

Indoor Location Algorithm Based on Kalman Filter

Fault Analysis of Distribution Network with Flexible Ring Network Control Device

An Improved DFSA Anti-collision Algorithm Based on the RFID-based Internet of Vehicles

manufacturing process.

SMALL WORLD NETWORK. -Naveen Teja Vempati -Ravi Teja Mitta

Improvement of SURF Feature Image Registration Algorithm Based on Cluster Analysis

Semi supervised clustering for Text Clustering

WITH the development of the semiconductor technology,

Research on Design and Application of Computer Database Quality Evaluation Model

An improved PageRank algorithm for Social Network User s Influence research Peng Wang, Xue Bo*, Huamin Yang, Shuangzi Sun, Songjiang Li

The Comparative Study of Machine Learning Algorithms in Text Data Classification*

Data Structure Optimization of AS_PATH in BGP

An Improved Method of Vehicle Driving Cycle Construction: A Case Study of Beijing

Quality Assessment of Power Dispatching Data Based on Improved Cloud Model

Chapter 2 A Second-Order Algorithm for Curve Parallel Projection on Parametric Surfaces

A Real-time Detection for Traffic Surveillance Video Shaking

Research on the Application of Digital Images Based on the Computer Graphics. Jing Li 1, Bin Hu 2

Citation for the original published paper (version of record):

Protecting Sink Location Against Global Traffic Monitoring Attacker

Network Theory: Social, Mythological and Fictional Networks. Math 485, Spring 2018 (Midterm Report) Christina West, Taylor Martins, Yihe Hao

McGill University - Faculty of Engineering Department of Electrical and Computer Engineering

An Algorithm of Parking Planning for Smart Parking System

THE MULTI-TARGET FIRE DISTRIBUTION STRATEGY RESEARCH OF THE ANTI-AIR FIRE BASED ON THE GENETIC ALGORITHM. Received January 2011; revised May 2011

Iterative Removing Salt and Pepper Noise based on Neighbourhood Information

An Algorithmic Approach to Graph Theory Neetu Rawat

A Data Classification Algorithm of Internet of Things Based on Neural Network

Research on Ad Hoc-based Routing Algorithm for Wireless Body Sensor Network

A Test Sequence Generation Method Based on Dependencies and Slices Jin-peng MO *, Jun-yi LI and Jian-wen HUANG

Application of Improved Lzc Algorithm in the Discrimination of Photo and Text ChengJing Ye 1, a, Donghai Zeng 2,b

Detecting and Analyzing Communities in Social Network Graphs for Targeted Marketing

Data Cleaning for Power Quality Monitoring

Performance Degradation Assessment and Fault Diagnosis of Bearing Based on EMD and PCA-SOM

Anti-Distortion Image Contrast Enhancement Algorithm Based on Fuzzy Statistical Analysis of the Histogram Equalization

Study on Improving the Quality of Reconstructed NURBS Surfaces

Prediction of traffic flow based on the EMD and wavelet neural network Teng Feng 1,a,Xiaohong Wang 1,b,Yunlai He 1,c

An Efficient Character Segmentation Algorithm for Printed Chinese Documents

Analysis Range-Free Node Location Algorithm in WSN

The Discussion of 500kV Centralized Monitoring System for Large Operation and Large Maintenance Mode

An Empirical Study of Lazy Multilabel Classification Algorithms

A Finite State Mobile Agent Computation Model

Finite Element Modeling and Failure Analysis of Roll Bending. Forming of GLARE Laminates

Using graph theoretic measures to predict the performance of associative memory models

Research on Measured Course Accuracy Based on Relative Measure between Azimuth and Relative Bearing

The Application of CAN Bus in Intelligent Substation Automation System Yuehua HUANG 1, a, Ruiyong LIU 2, b, Peipei YANG 3, C, Dongxu XIANG 4,D

Video Inter-frame Forgery Identification Based on Optical Flow Consistency

Component connectivity of crossed cubes

EDGE EXTRACTION ALGORITHM BASED ON LINEAR PERCEPTION ENHANCEMENT

Analysis of Space-Ground Integrated Information Network Architecture and Protocol

Study on data encryption technology in network information security. Jianliang Meng, Tao Wu a

FRAGILE WATERMARKING USING SUBBAND CODING

Dynamic Key Ring Update Mechanism for Mobile Wireless Sensor Networks

LOW-DENSITY PARITY-CHECK (LDPC) codes [1] can

T-S Neural Network Model Identification of Ultra-Supercritical Units for Superheater Based on Improved FCM

The Research and Design of the Application Domain Building Based on GridGIS

The Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints

A Novel Approach to Planar Mechanism Synthesis Using HEEDS

World Academy of Science, Engineering and Technology International Journal of Mechanical and Mechatronics Engineering Vol:9, No:1, 2015

An indirect tire identification method based on a two-layered fuzzy scheme

Seismic regionalization based on an artificial neural network

A Quick Judgment Method for the Infeasible Solution of Distribution Network Reconfiguration

Improving Range Query Performance on Historic Web Page Data

Robust Watermark Algorithm using Genetic Algorithm

The missing links in the BGP-based AS connectivity maps

A Low-Overhead Hybrid Routing Algorithm for ZigBee Networks. Zhi Ren, Lihua Tian, Jianling Cao, Jibi Li, Zilong Zhang

Remote monitoring system based on C/S and B/S mixed mode Kaibing Song1, a, Yinsong Wang2,band Dandan Shang3,c

On Performance Evaluation of Reliable Topology Control Algorithms in Mobile Ad Hoc Networks (Invited Paper)

Analysis and Design of the Client in the Supervision System Based on Android

FSRM Feedback Algorithm based on Learning Theory

Deadlock Avoidance Based on Graph Theory

Analysis of Broadcast Authentication Mechanism in Selected Network Topologies

Information Fusion Based Fault Location Technology for Distribution Network

Attack Vulnerability of Network with Duplication-Divergence Mechanism

A Genetic Algorithm-Based Approach for Energy- Efficient Clustering of Wireless Sensor Networks

Model the P2P Attack in Computer Networks

A Robust Watermarking Algorithm For JPEG Images

Link Scheduling in Multi-Transmit-Receive Wireless Networks

Research on Applications of Data Mining in Electronic Commerce. Xiuping YANG 1, a

A New Implementation of Dijkstra s Algorithm on Urban Rail Transit Network

A Verification Method for Software Safety Requirement by Combining Model Checking and FTA Congcong Chen1,a, Fuping Zeng1,b, Minyan Lu1,c

Learning the Three Factors of a Non-overlapping Multi-camera Network Topology

Fuzzy Set Theory and Fault Tree Analysis based Method Suitable for Fault Diagnosis of Power Transformer

Data Communication and Parallel Computing on Twisted Hypercubes

Application of Nonlinear Later TV Edition in Gigabit Ethernet. Hong Ma

Comprehensive analysis and evaluation of big data for main transformer equipment based on PCA and Apriority

Efficient Path Finding Method Based Evaluation Function in Large Scene Online Games and Its Application

AN ALGORITHM WHICH GENERATES THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAP

Research on Heterogeneous Communication Network for Power Distribution Automation

Transcription:

International Industrial Informatics and Computer Engineering Conference (IIICEC 05) Warship Power System Survivability Evaluation Based on Complex Network Theory Huiying He,a, Hongjiang Li, Shaochang Chen and Hao Xiong,,b Naval University of Engineering, Wuhan, 430033, China Huazhong University of Science and Technology, Wuhan, 430074, China a yinger536@qq.com, bhowell76@sina.com Keywords: Survivability evaluation, Warship, Power system, Complex network theory Abstract. This paper analyzes the characteristics of warship power network based on complex network theory, obtains the commonly statistical properties of the ship power system, applies them to the research for survivability of warship power system, concludes that a ship power grid has the characteristics of scale-free networks and it has strong robustness to random attacks but poor to deliberate attacks, and suggests that the it reduce the nodes with higher degree in a warship power network during ship power network design to improve and optimize the performance of the network. Introduction A warship power network is divided into the basic network and the distribution network. The characteristics of the basic network are that the basic network generally employs the ring network, the electric energy always flows from a generator to a main switchboard between, and the state changes of the switches between the generators and the main switchboards make the connection relationship uncertain so that it is uncertain for the flow direction of the current and power between the main distribution boards. The characteristics of the distribution network are that the distribution network generally adopts the main and feeder lines hybrid distribution network, the current always flows from an upper layer distribution board to a lower one, the distribution network has the "tree" type hierarchy, and an important distribution board is supplied by the dual power supply and the dual power switches are not closed simultaneously []. Hence a typical warship power network structure model is established as follows, shown in Fig.. Fig. Network model of a warship power system 05. The authors - Published by Atlantis Press

Topology Parameter Analysis of Shipboard Power Network Model Features Degree. The degree of a node is defined as the number of the other nodes connected to the node. The average value of the degrees of all nodes in the network is called the average degree of the network, and denoted by k. The distribution function p( k ) represents a probability that the degree of a randomly chosen node is exactly k. The cumulative degree distribution function ' k pk ( ) represents the probability distribution of the nodes whose degrees are not less than k []. ' k k P Based on the power network model in Fig., the power network includes 60 nodes and 6 edges. The average value of the degrees of all nodes k.07, and the power law function is y k.5. In the log-log coordinate system the cumulative degree distribution curve is plotted in Fig.. In Fig., it is plotted by o mark for the cumulative degree distribution curve of the ship power network model and * mark for the power law function curve. 0 0 0.7 0.6 0.5 节点累积度分布 0 - 节点度分布 0.4 0.3 0. 0. 0-0 0 0 节点度 0 0 4 6 8 0 节点度 (a) Cumulative degree distribution curve of node (b) bar chart of node degree distribution Fig. Cumulative degree distribution curve of node and bar chart of node degree distribution Fig. (a) shows that the degree distribution of the model possesses the characteristics of a scale-free network while Fig. (a) indicates that the ship power network model has the following characteristics: it has some nodes with higher "degree" value; most of the nodes have far lower "degree" value, which proves a shipboard power network is a non-uniform network with the characteristics of a scale-free network. Average Path Length. Distance d ij between two nodes i and j in the network is defined as the number of edges on the shortest path connecting these two nodes. The average path length L of the network is defined as the average value of the distance between any two nodes [3], i.e. L d ij. Herein N is the number of nodes in the network []. This paper uses Dijkstra i j N( N ) algorithm to calculate the average path length of the model and the average path length of the ship power network model is obtained L = 3.57, which shows the model network having a smaller average path length. Betweenness. Betweenness is divided into the node and edge betweenness. A node betweenness is a proportion of the shortest path through the node versus all shortest path in the network. The definition of an edge betweenness is similar. Betweenness reflects the role and influence of a node or an edge in the network. In a power system, the line betweenness is the number of the shortest paths between all the generators and loads in the network passing the line. The cumulative betweenness distribution of the ship network model shown in Fig. is calculated and plotted in a log-log coordinate system as shown in Fig. 3. Therein, it is plotted by o mark for the cumulative betweenness distribution fitting curve of the model and * mark for the power law function curve: y k.. It is obvious from Fig. 3 that the cumulative betweenness distribution of the model has a trend of an approximate power law function, which proves that the betweenness distribution of 3

the model possesses the characteristics of a scale-free network: () it has some nodes with higher betweenness value; () most of the nodes have far lower betweenness value. 0 0 节点累积介数分布 0-0 - 0 0 0 节点介数 Fig. 3 Node s cumulative betweenness distribution of warship power network Survivability Evaluation of Warship Power System Based on Complex Network Theory Evaluation Method. Survivability of a warship power system refers to the ability of the power system to supply the ship after it has gone through the attack or accident. So the survivability index of a warship power system refers to the power supply range and energy which a power system can provide after attack [4] & [5]. This paper adopts the percentage of the load nodes that can be connected to the power supplies after attack. m Ei E i PS 00% 00% () N N Where N is the total number of nodes in the grid, m is the number of supply area, and E is the number of nodes that can be connected to the power sources. Survivability evaluation follows the below steps: () Determine the attack mode. () Calculate the survivability index of a warship power system, depending on the attack mode. (3) Analyze the impact of the ship power system statistical characteristics on the survivability index. Attack Mode. Attack mode is classified into two categories: (a) random attack and (b) deliberate attack, according to whether the attack considers the statistical characteristics of the nodes [6]. Random attack determines the attacked node number based on the random number generated by a random function. However, deliberate attack sorts the nodes based on the statistical characteristics of the selected grid nodes and attacks them in turn. It is assumed that the edges connected to a node are broken when the node is under attack. Comparison of Survivability Index in Different Attack Situations. Whether it is a random attack or a deliberate attack, the destruction on the basic network is to cause mainly the basic network to be disconnected while attack damage to the distribution network is to cause mainly a power failure of some distribution area node. The node - switch matrix method is used to calculate the impact of attack on the basic network Survivability Evaluation under Random Attack. Ten random attacks hit a 60-node 6-branch ship power system, and it is calculated for the supply performance of the network after the attacks. Assuming that the bow and stern power stations of the basic network are in the parallel operation at the start and one more node is destroyed and its adjacent branches break down after each attack, the attacked node sequence and the power supply performance of the nodes after attack are calculated and listed in Table. It is evident from the table that a ring-form basic network is more attack-resistant. Branch, 9 and 3 in Table, the basic network branches, are disconnected respectively after attack, and 4, but the power performance of the network is 00% after strike. The power supply performance of the network declines dramatically after the attacks have struck the 4

nodes with higher degree and betweenness. The 5 th and 8 th attacks have randomly hit the nodes with higher degree and betweenness, which causes a sharp decline of power supply performance. There is no effect on the power supply performance when the nodes with degree of, i.e. the load nodes, are struck. Moreover, for a small 60-node 6-branch network, the attacked nodes are 6.7% of all and the power-loss percentage of the total nodes is 8.3% after 0 random attacks. Hence the power system has a stronger anti-attack capability against the random attack. Table Power supply performance after random attack Attack sequence Node number Degree of node Betweenness of node Node Property Power supply performance (%) 3 Power supply 00 9 Power supply 00 3 30 Load 00 4 3 3 Power supply 00 5 0 6 6 Distribution 90 6 43 Load 90 7 59 Load 90 8 35 5 4 Distribution 8.7 9 30 Load 8.7 0 Load 8.7 Survivability Evaluation under Deliberate Attack. A deliberate attack strikes the nodes in sequence: first attack the node with the largest degree and betweenness, and second strike the node with second one and so on. The power supply performance of the nodes after five attacks are calculated and listed in Table. The attacks on the nodes with higher degree and betweenness lead to a sharp drop of the power supply performance, which proves the power network is vulnerable to a deliberate attack. For the small network, the attacked nodes are 8.3% of all but the power-loss percentage of the total nodes is 85% after 5 deliberate attacks. Hence the power system is far less attack-resistant against the deliberate attack. Table Power supply performance after deliberate attack Attack sequence Node number Degree of node Betweenness of node Node Property Power supply performance (%) 5 0 3 Power supply 73.3 8 0 9 Power supply 55 3 6 8 7 Power supply 43.3 4 7 7 3 Power supply 5 5 35 6 6 Distribution 5 5

00 90 连通性 ( % ) 80 70 60 50 40 30 0 0 0 0 0.0 0.0 0.03 0.04 0.05 0.06 0.07 0.08 0.09 0. 打击的对象比例 - Power supply performance after random attack - Power supply performance after deliberate attack Fig.4 Comparison of power supply performance after random attack and deliberate attack Conclusions The nodes are often associated with a number of branches so attacks on the nodes are more dangerous. Furthermore, the nodes with higher degree and betweenness, most in the basic network, are the important nodes in the network and the attacks on them will cause a greater damage on the warship power system. A ship power network is more robust to random attacks but less to deliberate attacks. References [] H. Lin: The Research for Survivability of Warship Power System (Harbin Engineering University Press, China 009), In Chinese. [] X. Li, X. Li and G. Chen: Complex Network Theory and Application (Tsinghua University Press, China 009), In Chinese. [3] H. Zhang and F. Lu: Proceedings of the CSEE Vol. 34 (04), p. 63-69, In Chinese. [4] H. Li, Z. Lu and L. Zhu: Journal of Wuhan University of Technology Vol. 3 (007), p. 533-536, In Chinese. [5] T. Jin, B. Luo and X. Chen: Journal of Naval University of Engineering Vol. 8 (006), p. 37-4, In Chinese. [6] Z. Lu, Z. Meng and S. Zhou: Proceedings of the 8th International Conference on Probabilistic Methods Applied to Power Systems (004), p. 635-640.004. 6