CN108833130A - A Method of Calculating Node Importance Degree in Power CPS System Based on Analytic Hierarchy Process - Google Patents
A Method of Calculating Node Importance Degree in Power CPS System Based on Analytic Hierarchy Process Download PDFInfo
- Publication number
- CN108833130A CN108833130A CN201810347526.5A CN201810347526A CN108833130A CN 108833130 A CN108833130 A CN 108833130A CN 201810347526 A CN201810347526 A CN 201810347526A CN 108833130 A CN108833130 A CN 108833130A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- layer
- centrality
- judgment matrix
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/142—Network analysis or design using statistical or mathematical methods
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Algebra (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Pure & Applied Mathematics (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
本发明涉及基于层次分析法计算电力CPS系统中节点重要度的方法,针对目标进行分析并通过层次分析法建立递阶层次结构,根据信息网络节点重要度的评价指标数据建立判断矩阵;根据每层的判断矩阵计算出每相邻两层之间的权重,最后得出底层元素与目标之间的权重顺序,由此得出节点的重要度排序。本发明可以解决如何利用多个指标来评价节点重要度的问题,还在一定程度上降低了权重选取的主观性,得出更客观全面的结果。
The invention relates to a method for calculating the importance of nodes in a power CPS system based on the analytic hierarchy process, which analyzes the target and establishes a hierarchical structure through the analytic hierarchy process, and establishes a judgment matrix according to the evaluation index data of the importance of information network nodes; The judgment matrix calculates the weight between each adjacent two layers, and finally obtains the weight order between the bottom element and the target, and thus obtains the importance ranking of the nodes. The invention can solve the problem of how to use multiple indexes to evaluate the importance of nodes, and also reduces the subjectivity of weight selection to a certain extent, and obtains more objective and comprehensive results.
Description
技术领域technical field
本发明涉及一种计算计算电力CPS系统中信息网络节点重要度的方法,尤其是一种基于层次分析法计算电力CPS系统中信息网络节点重要度的方法,属于纳米技术领域。The invention relates to a method for calculating the importance of information network nodes in an electric power CPS system, in particular to a method for calculating the importance of information network nodes in an electric power CPS system based on analytic hierarchy process, which belongs to the field of nanotechnology.
背景技术Background technique
信息物理系统(CPS,Cyber-Physical Systems)是一个综合计算、网络和物理环境的多维复杂系统,通过3C(Computer、Communication、Control)技术的有机融合与深度协作,实现大型工程系统的实时感知、动态控制和信息服务。完成计算、通信与物理系统的一体化设计,可使系统更加可靠、高效、实时协同。电力CPS是将电力系统物理网络与信息网络充分融合,通过计算设备、传感设备、通信设备、物理设备等的相互协同,实现计算、通信、传感、控制和电力系统的无缝集成。Cyber-Physical Systems (CPS, Cyber-Physical Systems) is a multi-dimensional complex system that integrates computing, network and physical environment. Through the organic integration and in-depth cooperation of 3C (Computer, Communication, Control) technology, it realizes real-time perception, Dynamic control and information services. Completing the integrated design of computing, communication and physical systems can make the system more reliable, efficient and collaborative in real time. Power CPS fully integrates the physical network and information network of the power system, and realizes the seamless integration of computing, communication, sensing, control and power systems through the mutual coordination of computing equipment, sensing equipment, communication equipment, and physical equipment.
电网CPS中信息系统与电力物理系统的耦合与交互的过程十分复杂,随着复杂网络理论研究不断深入发展,对于信息侧系统中节点的重要度评估开始受到人们的广泛关注。度量节点重要性的方法有许多,常用的方法大多都是针对某一具体问题提出,分别从不同的角度、不同的用途描述了节点在某种特定网络中的重要性,都有着自身的优缺点。比如,基于度中心性的评估方法强调节点与相邻节点的连边数,但在电力CPS信息网络中一个节点在信息流通中所起的作用更为重要,所以具有相同度的节点,在网络中的重要程度未必相同;介数刻画了节点在网络中操纵信息流通的重要程度,与通过节点的最短路径息息相关,但在实际网络中信息多数按照自己的意愿随机流通,并非沿着最短路径流通,因此通过介数对节点的重要性进行评估结果并不准确。接近中心性考虑了节点与其它节点的接近程度,对信息的传递和获取有着十分重要的作用,与其它节点距离越短,接近中心性越高。在集中式网络中,它可以较为准确地发掘中心节点,但对于一些随机网络并不适用。同时,在在实际应用中复杂网络千变万化,难以由某个单一指标来描述节点在网络中的重要性。The process of coupling and interaction between the information system and the power physical system in the power grid CPS is very complicated. With the continuous development of complex network theory research, the importance evaluation of nodes in the information side system has begun to receive widespread attention. There are many methods to measure the importance of nodes. Most of the commonly used methods are proposed for a specific problem. They describe the importance of nodes in a specific network from different angles and different purposes, and each has its own advantages and disadvantages. . For example, the evaluation method based on degree centrality emphasizes the number of connections between nodes and adjacent nodes, but in the power CPS information network, a node plays a more important role in information flow, so nodes with the same degree, in the network The degree of importance in is not necessarily the same; betweenness describes the importance of nodes in manipulating information flow in the network, and is closely related to the shortest path through nodes. However, in the actual network, most information flows randomly according to their own wishes, not along the shortest path. , so it is not accurate to evaluate the importance of nodes through betweenness. Proximity centrality takes into account the proximity of a node to other nodes, which plays a very important role in the transmission and acquisition of information. The shorter the distance from other nodes, the higher the proximity centrality. In a centralized network, it can more accurately discover the central node, but it is not suitable for some random networks. At the same time, complex networks are ever-changing in practical applications, and it is difficult to describe the importance of nodes in the network by a single indicator.
发明内容Contents of the invention
本发明的目的在于:针对现有技术存在的缺陷,提出一种基于层次分析法计算电力CPS系统中节点重要度的方法,解决无法用单一指标衡量某个节点在电力CPS系统的重要性问题。The purpose of the present invention is: aiming at the defects existing in the prior art, a method for calculating the importance of nodes in the electric power CPS system based on the analytic hierarchy process is proposed to solve the problem that a single index cannot be used to measure the importance of a certain node in the electric power CPS system.
为了达到以上目的,本发明提供了一种基于层次分析法计算电力CPS系统中节点重要度的方法,针对目标进行分析并通过层次分析法建立递阶层次结构,根据信息网络节点重要度的评价指标数据建立判断矩阵;根据每层的判断矩阵计算出每相邻两层之间的权重,最后得出底层元素与目标之间的权重顺序,具体步骤如下:In order to achieve the above purpose, the present invention provides a method for calculating the importance of nodes in the power CPS system based on the analytic hierarchy process, which analyzes the target and establishes a hierarchical structure through the analytic hierarchy process. According to the evaluation index of the importance of information network nodes Establish a judgment matrix based on the data; calculate the weight between each adjacent two layers according to the judgment matrix of each layer, and finally obtain the weight order between the bottom element and the target. The specific steps are as follows:
步骤1、针对信息网络中节点重要度这一多目标决策问题进行分析,选出计算重要度的三个常用指标,包括度中心性、介数中心性及接近中心性;并利用层次分析法建立递阶层次结构;Step 1. Analyze the multi-objective decision-making problem of node importance in the information network, select three commonly used indicators for calculating the importance, including degree centrality, betweenness centrality and proximity centrality; and use the analytic hierarchy process to establish Hierarchical hierarchy;
步骤2、根据度中心性(DC)、介数中心性(BC)、接近中心性(CC)这三个计算节点重要度的指标的定义,计算出网络连通图中各个节点的DC、BC、CC值;Step 2. Calculate the DC, BC, CC value;
步骤3、对各指标之间进行两两对比之后,按九级比例标度排定各评价指标的相对优劣顺序,依次构造出评价指标的判断矩阵;Step 3. After pairwise comparison of each index, the relative order of each evaluation index is arranged according to the nine-level proportional scale, and the judgment matrix of the evaluation index is sequentially constructed;
步骤4、对步骤3中的判断矩阵进行一致性检验;Step 4, carry out consistency check to the judgment matrix in step 3;
步骤5、利用特征向量法求取每一层对上一层支配元素的权重值;Step 5, using the eigenvector method to obtain the weight value of each layer to the dominant element of the previous layer;
步骤6、将已得到的权重值进行合成,得到最底层元素对目标的综合权重值,即得到节点的重要度排序Step 6. Synthesize the obtained weight values to obtain the comprehensive weight value of the bottom element to the target, that is, to obtain the importance ranking of nodes
进一步的,多目标决策问题根据递阶层次结构进行划分,包括至少三层目标,第一层目标层为节点重要度,第二层准则层为针对节点重要度的评价指标,分别为度中心性、介数中心性及接近中心性,第三层方案层为所依据连通图中的25个基础节点。Furthermore, the multi-objective decision-making problem is divided according to the hierarchical structure, including at least three levels of objectives, the first level of target level is node importance, the second level of criterion level is the evaluation index for node importance, respectively, degree centrality , betweenness centrality and proximity centrality, the third layer scheme layer is based on 25 basic nodes in the connected graph.
进一步的,所述步骤2中,三个计算节点重要度的指标的定义为:Further, in the step 2, the definitions of the three indicators for calculating the importance of nodes are:
(1)复杂网络中一个节点的度指的是与此节点相连接的边的总数目,则节点的度中心性是指一个节点的邻居节点的个数之和,其反映的是如果一个节点的邻居节点越多,那么这个节点的影响力就越大,即节点的度越大,其重要性就越大;网络中节点i的度中心性定义为:(1) The degree of a node in a complex network refers to the total number of edges connected to this node, and the degree centrality of a node refers to the sum of the number of neighbor nodes of a node, which reflects that if a node The more neighbor nodes there are, the greater the influence of this node, that is, the greater the degree of the node, the greater its importance; the degree centrality of node i in the network is defined as:
其中,i表示所求的节点,j表示其他所有的节点,N表示整个网络中节点的总数,Xij表示节点i与节点j之间的连接关系,如果两个节点相连,则为1,反之,则为0;Among them, i represents the requested node, j represents all other nodes, N represents the total number of nodes in the entire network, X ij represents the connection relationship between node i and node j, if two nodes are connected, it is 1, otherwise , then it is 0;
(2)在复杂网络中所有节点对的最短路径中,如果经过一个节点的最短路径数越多,那么这个节点就越重要,故网络节点的介数中心性定义为:(2) In the shortest path of all node pairs in a complex network, if the number of shortest paths passing through a node is more, then this node is more important, so the betweenness centrality of a network node is defined as:
其中,gst为从节点s到节点t的所有最短路径的数目,gst(i)为节点s到节点t的最短路径中经过节点i的最短路径的数目;是用来对介数进行归一化的公式,N为网络节点的总数;Among them, g st is the number of all shortest paths from node s to node t, and g st (i) is the number of shortest paths passing through node i among the shortest paths from node s to node t; is the formula used to normalize the betweenness, and N is the total number of network nodes;
(3)节点接近中心性表示的是该节点与复杂网络中其他所有节点的最短距离之和的倒数,一个节点与其他节点的平均距离越小,则该节点的接近中心性就越大,其定义为:(3) The proximity centrality of a node represents the reciprocal of the sum of the shortest distances between the node and all other nodes in the complex network. The smaller the average distance between a node and other nodes, the greater the proximity centrality of the node. defined as:
其中,dij表示节点i与节点j的最短距离。Among them, d ij represents the shortest distance between node i and node j.
九级比例标度定义为:两个元素互相比较时,以其中一个元素ui作为1,若相对于上一层,ui与uj比较,好坏相同,则uj记为1;若uj比ui较好,uj记为3;uj比ui好,uj记为5;uj比ui明显好,uj记为7;如果uj比ui好得多,则uj记为9;2、4、6、8则是介于1、3、5、7、9之间的情况。把与上层某元素有关系的所有下层元素逐一比较,且每一个元素与各元素比较的结果排成一排则可得到一个方阵A=(aij)n×n,称为两两比较矩阵;设ui与uj比为aij,则uj与ui比应为aji=1/aij,故两两比较矩阵A也称为正互反矩阵。The nine-level proportional scale is defined as: when two elements are compared with each other, take one element u i as 1, if compared with the previous layer, u i and u j are the same, then u j is recorded as 1; if u j is better than u i , u j is recorded as 3; u j is better than ui, u j is recorded as 5; u j is obviously better than u i , u j is recorded as 7; if u j is much better than u i , Then u j is recorded as 9; 2, 4, 6, and 8 are cases between 1, 3, 5, 7, and 9. Comparing all the lower elements that are related to a certain element in the upper layer one by one, and arranging the comparison results of each element with each element in a row, a square matrix A=(a ij ) n×n can be obtained, which is called a pairwise comparison matrix ; Suppose the ratio of u i to u j is a ij , then the ratio of u j to u i should be a ji =1/a ij , so the pairwise comparison matrix A is also called a positive and reciprocal matrix.
进一步的,所述步骤4中,一致性检验的步骤为:Further, in the step 4, the step of consistency check is:
步骤4.1、计算判断矩阵的一致性指标CI:Step 4.1, calculate the consistency index CI of the judgment matrix:
其中,λmax为判断矩阵的最大特征值,n为判断矩阵的行列个数值。Among them, λ max is the maximum eigenvalue of the judgment matrix, and n is the number of rows and columns of the judgment matrix.
步骤4.2、在一致性指标RI的数值表中查找相应的指标值;Step 4.2, look up the corresponding index value in the value table of the consistency index RI;
步骤4.3、计算一致性比例CR:Step 4.3, calculate the consistency ratio CR:
当CR<0.1时,认为判断矩阵的一致性是可以接受的,否则应对判断矩阵进行修正。When CR<0.1, it is considered that the consistency of the judgment matrix is acceptable, otherwise the judgment matrix should be corrected.
进一步的,所述步骤5中,利用特征向量法求取每一层对上一层的权重值的步骤为,Further, in the step 5, the step of using the eigenvector method to obtain the weight value of each layer to the previous layer is,
步骤5.1、计算所述判断矩阵的最大特征值λmax;Step 5.1, calculating the maximum eigenvalue λ max of the judgment matrix;
步骤5.2、求判断判断矩阵属于特征值λmax的正特征向量,即分量全部大于0的特征向量,并将其归一化,所得向量即为权重向量。Step 5.2. Determine whether the judgment matrix belongs to the positive eigenvector of the eigenvalue λ max , that is, the eigenvector whose components are all greater than 0, and normalize it, and the obtained vector is the weight vector.
本发明采用以上技术方案与现有技术相比,具有以下技术效果:本发明利用节点的多个重要性评价指标:度中心性、介数中心性、接近中心性来综合评估网络节点的重要性,相比于使用单一的评价指标可以更为准确的获得排序结果。Compared with the prior art, the present invention adopts the above technical scheme and has the following technical effects: the present invention utilizes multiple importance evaluation indexes of nodes: degree centrality, betweenness centrality and proximity centrality to comprehensively evaluate the importance of network nodes , compared with using a single evaluation index, the sorting results can be obtained more accurately.
附图说明Description of drawings
下面结合附图对本发明作进一步的说明。The present invention will be further described below in conjunction with the accompanying drawings.
图1为本发明中电力CPS信息网络拓扑图。Fig. 1 is a topological diagram of the electric power CPS information network in the present invention.
图2为本发明中所建立的层次结构图。Fig. 2 is a hierarchical structure diagram established in the present invention.
具体实施方式Detailed ways
下面对本发明的具体实施方式进行详细描述,但应当理解本发明的保护范围并不受具体实施方式的限制。Specific embodiments of the present invention are described in detail below, but it should be understood that the protection scope of the present invention is not limited by the specific embodiments.
本实施例提供了一种基于层次分析法计算电力CPS系统中节点重要度的方法,基于图1计算节点重要度所利用的电力CPS信息网络,是将一个电力CPS系统对应的二次设备层和通信层简化所得,本发明目标是计算这25个通信节点在网络中的重要程度。This embodiment provides a method for calculating the importance of nodes in a power CPS system based on the analytic hierarchy process. Based on the power CPS information network used to calculate the importance of nodes in Figure 1, the secondary equipment layer and the corresponding secondary equipment layer of a power CPS system are The communication layer is simplified, and the object of the present invention is to calculate the importance of these 25 communication nodes in the network.
具体步骤如下:Specific steps are as follows:
步骤1:分析信息网络中节点重要度这个多目标决策问题,选出计算重要度的三个常用指标——度中心性、介数中心性、接近中心性;并利用层次分析法建立递阶层次结构,建立出的层次结构如图2所示;Step 1: Analyze the multi-objective decision-making problem of node importance in the information network, and select three commonly used indicators for calculating the importance—degree centrality, betweenness centrality, and proximity centrality; and use the analytic hierarchy process to establish a hierarchical level structure, the established hierarchical structure is shown in Figure 2;
步骤2:根据度中心性(DC)、介数中心性(BC)、接近中心性(CC)这三个计算节点重要度的指标的定义,计算出网络连通图中各个节点的DC、BC、CC值,通过资料查找可知三个指标的定义如下:Step 2: Calculate the DC, BC, CC value, through data search, we can know that the definitions of the three indicators are as follows:
(1)复杂网络中一个节点的度指的是与此节点相连接的边的总数目,则节点的度中心性是指一个节点的邻居节点的个数之和,它反映的是如果一个节点的邻居节点越多,那么这个节点的影响力就越大,即节点的度越大,其重要性就越大。节点的度中心性是网络中刻画节点重要性最简单、最直观、也是计算复杂度最低的指标。网络中节点i的度中心性可以定义为:(1) The degree of a node in a complex network refers to the total number of edges connected to this node, and the degree centrality of a node refers to the sum of the number of neighbor nodes of a node, which reflects that if a node The more neighbor nodes there are, the greater the influence of this node, that is, the greater the degree of the node, the greater its importance. The degree centrality of nodes is the simplest, most intuitive, and least computationally complex index to describe the importance of nodes in the network. The degree centrality of node i in the network can be defined as:
其中,i表示所求的节点,j表示其他所有的节点,N表示整个网络中节点的总数,Xij表示节点i与节点j之间的连接关系,如果两个节点相连,则为1;反之,则为0。Among them, i represents the requested node, j represents all other nodes, N represents the total number of nodes in the entire network, X ij represents the connection relationship between node i and node j, if two nodes are connected, it is 1; otherwise , then it is 0.
(2)在复杂网络中所有节点对的最短路径中,如果经过一个节点的最短路径数越多,那么这个节点就越重要。根据这个思想,Freeman提出网络节点的介数中心性,其定义为:(2) Among the shortest paths of all node pairs in a complex network, if the number of shortest paths passing through a node is more, then this node is more important. According to this idea, Freeman proposed the betweenness centrality of network nodes, which is defined as:
其中,gst为从节点s到节点t的所有最短路径的数目,gst(i)为节点s到节点t的最短路径中经过节点i的最短路径的数目。是用来对介数进行归一化的公式,N为网络节点的总数。Among them, g st is the number of all shortest paths from node s to node t, and g st (i) is the number of shortest paths passing through node i among the shortest paths from node s to node t. is the formula used to normalize the betweenness, and N is the total number of network nodes.
(3)节点接近中心性表示的是该节点与复杂网络中其他所有节点的最短距离之和的倒数,一个节点与其他节点的平均距离越小,则该节点的接近中心性就越大。其定义为:(3) The proximity centrality of a node means the reciprocal of the sum of the shortest distances between the node and all other nodes in the complex network. The smaller the average distance between a node and other nodes, the greater the proximity centrality of the node. It is defined as:
其中,dij表示节点i与节点j的最短距离。Among them, d ij represents the shortest distance between node i and node j.
通过Matlab软件计算可得25个节点的指标数据如表1所示。The index data of 25 nodes can be calculated by Matlab software, as shown in Table 1.
表1 各节点的指标数据Table 1 Index data of each node
步骤3:对各指标之间进行两两对比之后,按九级比例标度排定各评价指标的相对优劣顺序,依次构造出评价指标的判断矩阵;Step 3: After pairwise comparisons between each index, arrange the relative order of each evaluation index according to the nine-level proportional scale, and construct the judgment matrix of the evaluation index in turn;
首先将25个节点的度中心性、介数中心性、接近中心性的数据两两相减,然后引入九级比例标度对结果进行分析。九级比例标度定义为:两个元素互相比较时,以其中一个元素作为1(如ui),如果相对于上一层,ui与uj比较,好坏相同,则uj记为1;uj比ui较好,uj记为3;uj比ui好,uj记为5;uj比ui明显好,uj记为7;如果uj比ui好得多,则uj记为9;2、4、6、8则是介于1、3、5、7、9之间的情况。把与上层某元素有关系的所有下层元素逐一比较,且每一个元素与各元素比较的结果排成一排则可得到一个方阵A=(aij)n×n,称为两两比较矩阵。设ui与uj比为aij,则uj与ui比应为aji=1/aij,所以两两比较矩阵A也称为正互反矩阵。Firstly, the data of degree centrality, betweenness centrality and proximity centrality of 25 nodes are subtracted in pairs, and then a nine-level proportional scale is introduced to analyze the results. The nine-level proportional scale is defined as: when two elements are compared with each other, take one element as 1 (such as u i ), if compared with the previous layer, u i and u j are the same, then uj is recorded as 1 ; u j is better than u i , u j is recorded as 3; u j is better than ui, u j is recorded as 5; u j is obviously better than u i , u j is recorded as 7; if u j is much better than u i , then u j is recorded as 9; 2, 4, 6, and 8 are cases between 1, 3, 5, 7, and 9. Comparing all the elements of the lower layer that are related to an element of the upper layer one by one, and arranging the comparison results of each element with each element in a row, a square matrix A=(a ij ) n×n can be obtained, which is called a pairwise comparison matrix . Assuming that the ratio of u i to u j is a ij , then the ratio of u j to u i should be a ji =1/a ij , so the pairwise comparison matrix A is also called a positive and reciprocal matrix.
例如在处理度中心性指标的数据时,得到的最小差值为0.04,最大的差值为0.20。则设定0~0.05之间的差值级数为1;0.06~0.1之间的差值级数为5;0.11~0.15之间的差值级数为7;0.16~0.2之间的差值级数为9。2、4、6、8是介于1、3、5、7、9之间的情况。则最终得到底层元素(25个节点)相比于上一层的度中心性元素的比较矩阵为:For example, when processing the data of the degree centrality index, the minimum difference obtained is 0.04, and the maximum difference is 0.20. Then set the difference series between 0 to 0.05 as 1; the difference series between 0.06 and 0.1 as 5; the difference series between 0.11 and 0.15 as 7; the difference between 0.16 and 0.2 The number of series is 9. 2, 4, 6, and 8 are cases between 1, 3, 5, 7, and 9. Then the final comparison matrix of the bottom element (25 nodes) compared with the degree centrality element of the upper layer is:
同理可得得第三层元素(25个节点)相比于上一层的介数中心性元素和接近中心性原素的比较矩阵B、C,A、B、C即为第三层与第二层之间的比较矩阵。In the same way, the third layer elements (25 nodes) can be compared with the betweenness centrality elements of the previous layer and the comparison matrix B and C of the close centrality elements. A, B, and C are the third layer and Comparison matrix between the second layer.
再根据三个指标的定义,给出三个指标的重要性排序:介数中心性>度中心性>接近中心性,则第二层对于第一层的比较矩阵D为:Then according to the definition of the three indicators, the importance ranking of the three indicators is given: betweenness centrality > degree centrality > closeness centrality, then the comparison matrix D of the second layer with respect to the first layer is:
步骤4:对判断矩阵进行一致性检验;Step 4: Carry out a consistency check on the judgment matrix;
首先计算判断矩阵的一致性指标CI:First calculate the consistency index CI of the judgment matrix:
其中,λmax为判断矩阵的最大特征值,n为判断矩阵的行列个数值。因为度中心性比较矩阵A的最大特征值为26。其次在一致性指标RI的数值表中查找得n=25时相应的指标值RI为1.6556,则可知一致性指标CR=0.02<0.1,说明矩阵A是可以接受的。同理可知B、C、D这三个比较矩阵也是可以接受的。Among them, λ max is the maximum eigenvalue of the judgment matrix, and n is the number of rows and columns of the judgment matrix. Because the degree centrality comparison matrix A has a maximum eigenvalue of 26. Secondly, look up in the value table of the consistency index RI and find that when n=25, the corresponding index value RI is 1.6556, then it can be seen that the consistency index CR=0.02<0.1, indicating that the matrix A is acceptable. Similarly, it can be known that the three comparison matrices B, C, and D are also acceptable.
步骤5:利用特征向量法求取每一层对上一层的权重值;通过Matlab计算可得:Step 5: Use the eigenvector method to obtain the weight value of each layer to the previous layer; through Matlab calculation:
矩阵A的最大特征值的特征向量经过归一化后为W1=[0.0248,0.0248,0.0248,0.0962,0.0248,0.0248,0.0248,0.0554,0.0102,0.0102,0.0102,0.0102,0.0102,0.0102,0.0102 0.0962,0.0554,0.0102,0.0102,0.0248,0.2097,0.1470,0.0248,0.0248,0.0248];After normalization, the eigenvector of the largest eigenvalue of matrix A is W 1 =[0.0248, 0.0248, 0.0248, 0.0962, 0.0248, 0.0248, 0.0248, 0.0554, 0.0102, 0.0102, 0.0102, 0.0102, 0.0102, 0.0102, 0.0902 0.0554, 0.0102, 0.0102, 0.0248, 0.2097, 0.1470, 0.0248, 0.0248, 0.0248];
矩阵B的最大特征值的特征向量经过归一化后为W2=[0.0144,0.0134,0.0565,0.1030,0.0158,0.0174,0.0917,0.1146,0.0096,0.0096,0.0096,0.0096,0.0096,0.0096,0.0096,0.1765,0.0316,0.0096,0.0096,0.0377,0.1148,0.0513,0.0225,0.0377,0.0144];The eigenvector of the largest eigenvalue of matrix B after normalization is W 2 =[0.0144, 0.0134, 0.0565, 0.1030, 0.0158, 0.0174, 0.0917, 0.1146, 0.0096, 0.0096, 0.0096, 0.0096, 0.0096, 0.0096, 0.00796, , 0.0316, 0.0096, 0.0096, 0.0377, 0.1148, 0.0513, 0.0225, 0.0377, 0.0144];
矩阵C的最大特征值的特征向量经过归一化后为W3=[0.0180,0.0107,0.0454,0.0978,0.0301,0.0454,0.1181,0.1033,0.0066,0.0123,0.0123,0.0123,0.0086,0.0086,0.0086,0.1470,0.0153,0.0066,0.0362,0.0635,0.0362,0.0230,0.0301,0.0635,0.0404];The eigenvector of the largest eigenvalue of matrix C after normalization is W 3 =[0.0180, 0.0107, 0.0454, 0.0978, 0.0301, 0.0454, 0.1181, 0.1033, 0.0066, 0.0123, 0.0123, 0.0123, 0.0086, 0.0086, 0.00876, , 0.0153, 0.0066, 0.0362, 0.0635, 0.0362, 0.0230, 0.0301, 0.0635, 0.0404];
矩阵D的最大特征值的特征向量经过归一化后为W4=[0.1884,0.7306,0.0810]。The eigenvector of the largest eigenvalue of the matrix D is W 4 =[0.1884, 0.7306, 0.0810] after normalization.
步骤6:将已得到的权重值进行合成,得到最底层元素对目标的综合权重值。因为第三层对第二层的权重值向量分别为W1、W2、W3,第二层对第一层的权重值向量为W4,所以第三层的25个节点对于第一层重要性的权重值向量W5=0.1884*W1+0.7306*W2+0.0810*W3=[0.0166,0.0153,0.0496,0.1012,0.01860.0210,0.0812,0.1025,0.0094,0.0099,0.0099,0.0099,0.0096,0.0096,0.0096,0.1589,0.0347,0.0094,0.0118,0.0373,0.1263,0.0670,0.0235,0.0373,0.0184]。Step 6: Synthesize the obtained weight values to obtain the comprehensive weight value of the bottom element to the target. Because the weight value vectors of the third layer to the second layer are W 1 , W 2 , W 3 respectively, and the weight value vector of the second layer to the first layer is W 4 , so the 25 nodes of the third layer are relative to the first layer Importance weight value vector W 5 =0.1884*W 1 +0.7306*W 2 +0.0810*W 3 =[0.0166, 0.0153, 0.0496, 0.1012, 0.01860.0210, 0.0812, 0.1025, 0.0094, 0.0099, 0.0099, 0.009 , 0.0096, 0.0096, 0.1589, 0.0347, 0.0094, 0.0118, 0.0373, 0.1263, 0.0670, 0.0235, 0.0373, 0.0184].
底层与目标层之间的权重代表的即为节点的重要程度,通过数据即可看出最重要的节点为16节点。The weight between the bottom layer and the target layer represents the importance of the nodes. It can be seen from the data that the most important nodes are 16 nodes.
除上述实施例外,本发明还可以有其他实施方式。凡采用等同替换或等效变换形成的技术方案,均落在本发明要求的保护范围。In addition to the above-mentioned embodiments, the present invention can also have other implementations. All technical solutions formed by equivalent replacement or equivalent transformation fall within the scope of protection required by the present invention.
Claims (6)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810347526.5A CN108833130A (en) | 2018-04-18 | 2018-04-18 | A Method of Calculating Node Importance Degree in Power CPS System Based on Analytic Hierarchy Process |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810347526.5A CN108833130A (en) | 2018-04-18 | 2018-04-18 | A Method of Calculating Node Importance Degree in Power CPS System Based on Analytic Hierarchy Process |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108833130A true CN108833130A (en) | 2018-11-16 |
Family
ID=64154136
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810347526.5A Pending CN108833130A (en) | 2018-04-18 | 2018-04-18 | A Method of Calculating Node Importance Degree in Power CPS System Based on Analytic Hierarchy Process |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108833130A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109831381A (en) * | 2018-12-15 | 2019-05-31 | 清华大学 | A kind of power telecom network robust routing optimization method considering information physical coupling |
| CN112801561A (en) * | 2021-04-13 | 2021-05-14 | 腾讯科技(深圳)有限公司 | User relationship determination method and device, storage medium and electronic equipment |
| CN113315807A (en) * | 2021-04-16 | 2021-08-27 | 山东英信计算机技术有限公司 | Method, system, device and medium for optimizing cluster decision |
| CN114781800A (en) * | 2022-03-22 | 2022-07-22 | 上海工程技术大学 | Urban rail transit emergency drilling evaluation method |
| CN119513570A (en) * | 2024-11-04 | 2025-02-25 | 广东电力交易中心有限责任公司 | A power data analysis method and system based on data center |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102880799A (en) * | 2012-09-24 | 2013-01-16 | 西北工业大学 | Method for comprehensively evaluating importance of complicated network node based on multi-attribute decision-making |
| WO2015019234A1 (en) * | 2013-08-05 | 2015-02-12 | Universidade De Aveiro | Method and apparatus for multi-network communication in vehicular networks |
| CN105550191A (en) * | 2015-07-10 | 2016-05-04 | 成都信息工程大学 | Node importance ranking method for multi-layer network |
-
2018
- 2018-04-18 CN CN201810347526.5A patent/CN108833130A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102880799A (en) * | 2012-09-24 | 2013-01-16 | 西北工业大学 | Method for comprehensively evaluating importance of complicated network node based on multi-attribute decision-making |
| WO2015019234A1 (en) * | 2013-08-05 | 2015-02-12 | Universidade De Aveiro | Method and apparatus for multi-network communication in vehicular networks |
| CN105550191A (en) * | 2015-07-10 | 2016-05-04 | 成都信息工程大学 | Node importance ranking method for multi-layer network |
Non-Patent Citations (3)
| Title |
|---|
| 佚名: ""层次分析法(详解)"", 《HTTPS://WWW.CNBLOGS.COM/ECJTUACM-873284962/P/6723568.HTML》 * |
| 张立凡,金雅芳: ""双层耦合网络中桥节点重要性评价研究"", 《经营与管理》 * |
| 李可: ""电力网络的重要节点识别及暂态性能研究"", 《中国优秀硕士学位论文全文数据库 基础科学辑》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109831381A (en) * | 2018-12-15 | 2019-05-31 | 清华大学 | A kind of power telecom network robust routing optimization method considering information physical coupling |
| CN112801561A (en) * | 2021-04-13 | 2021-05-14 | 腾讯科技(深圳)有限公司 | User relationship determination method and device, storage medium and electronic equipment |
| CN112801561B (en) * | 2021-04-13 | 2021-07-09 | 腾讯科技(深圳)有限公司 | User relationship determination method and device, storage medium and electronic equipment |
| CN113315807A (en) * | 2021-04-16 | 2021-08-27 | 山东英信计算机技术有限公司 | Method, system, device and medium for optimizing cluster decision |
| CN114781800A (en) * | 2022-03-22 | 2022-07-22 | 上海工程技术大学 | Urban rail transit emergency drilling evaluation method |
| CN119513570A (en) * | 2024-11-04 | 2025-02-25 | 广东电力交易中心有限责任公司 | A power data analysis method and system based on data center |
| CN119513570B (en) * | 2024-11-04 | 2025-10-17 | 广东电力交易中心有限责任公司 | Power data analysis method and system based on data center |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107482626B (en) | A method for identifying key nodes in regional power grid | |
| CN110969347B (en) | Power transmission network structure morphology assessment method | |
| CN106850254B (en) | Method for identifying key nodes in power communication network | |
| CN108833130A (en) | A Method of Calculating Node Importance Degree in Power CPS System Based on Analytic Hierarchy Process | |
| CN108053148B (en) | An efficient fault diagnosis method for power information system | |
| CN110020815A (en) | A kind of comprehensive vulnerability inder calculation method of the grid nodes based on analytic network process | |
| CN108306756B (en) | Holographic evaluation system based on power data network and fault positioning method thereof | |
| CN115099335A (en) | Abnormal identification and feature screening method and system for multi-source heterogeneous data | |
| CN106022480B (en) | Robot function module granularity division evaluation method based on D-S evidence theory | |
| Yunming et al. | Measure of invulnerability for command and control network based on mission link | |
| CN111697590A (en) | Entropy weight method-based power system key node identification method and system | |
| CN105721228A (en) | Method for importance evaluation of nodes of power telecommunication network based on fast density clustering | |
| CN113887846B (en) | Out-of-tolerance risk early warning method for capacitive voltage transformer | |
| CN105550191A (en) | Node importance ranking method for multi-layer network | |
| CN109670611A (en) | A kind of power information system method for diagnosing faults and device | |
| CN106549826A (en) | Intelligent substation switch applied in network performance test appraisal procedure | |
| CN110264032A (en) | A kind of acquisition methods of direct current distribution Plan mode result | |
| CN110837966A (en) | SNA-based building equipment optimization method based on mixed multi-attribute group decision | |
| CN114065220B (en) | Dual-level analysis situation assessment method based on distributed system | |
| CN103914482B (en) | Centralized Monitoring event influence property based on CMDB determines method | |
| CN114186420A (en) | Distribution network region topology verification method, device, equipment and medium | |
| CN111523080A (en) | PAS system comprehensive evaluation method of power system and related device | |
| CN109256774A (en) | A kind of power grid subgraph partitioning method and device based on voltage class | |
| CN105977968B (en) | An optimal configuration method for power quality monitors in ring-shaped multi-source distribution networks | |
| CN111104722A (en) | Electric power communication network modeling method considering overlapping communities |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181116 |