DOI QR코드

DOI QR Code

Bridge-edges Mining in Complex Power Optical Cable Network based on Minimum Connected Chain Attenuation Topological Potential

  • Jiang, Wanchang (School of Computer Science, Northeast Electric Power University) ;
  • Liu, Yanhui (School of Computer Science, Northeast Electric Power University) ;
  • Wang, Shengda (JiLin Information & Telecommunication Company, Jilin Electric Power Corporation Ltd) ;
  • Guo, Jian (Jilin City Power Supply Bureau, Jilin Electric Power Corporation Ltd)
  • 투고 : 2020.08.22
  • 심사 : 2021.02.27
  • 발행 : 2021.03.31

초록

The edges with "bridge characteristic" play the role of connecting the communication between regions in power optical cable network. To solve the problem of mining edges with "bridge characteristic" in provincial power optical cable network, the complex power optical cable network model is constructed. Firstly, to measure the generated potential energy of all nodes in n-level neighborhood local structure for one edge, the n-level neighborhood local structure topological potential is designed. And the minimum connected chain attenuation is designed to measure the attenuation degree caused by substituted edges. On the basis of that, the minimum connected chain attenuation topological potential based measurement is designed. By using the designed measurement, a bridge-edges mining algorithm is proposed to mine edges with "bridge characteristic". The experiments are conducted on the physical topology of the power optical cable network in Jilin Province. Compared with that of other three typical methods, the network efficiency and connectivity of the proposed method are decreased by 3.58% and 28.79% on average respectively. And the proposed method can not only mine optical cable connection with typical "bridge characteristic" but also can mine optical cables without obvious characteristics of city or voltage, but it have "bridge characteristic" in the topology structure.

키워드

1. Introduction

There are many complex systems in the real world, such as power network [1], traffic network [2], social science network [3], software system [4], etc. With the intention of study these systems, they are abstracted into complex networks, and the characteristics of robustness [5], vulnerability [6] and reliability [7] are studied. Especially, complexity research of the interconnected power network based on complex network has become one of the important research fields [8]. Cai et al. [9] shows that great achievements have been made in the theoretical research of vulnerability and self-organization criticality of the power grid.

In order to ensure the stable operation of power grid, the power communication network is produced [10]. And the network has been constructed by satellite, microwave, carrier, optical cable and other communication methods. As a supporting network, the power communication network is an important infrastructure of power grid [11]. With the gradual expansion of power communication network scale, the number of network nodes, network capacity and topology have undergone fundamental changes. At the same time, the requirements of power grid safety production present higher requirements for the reliability of power communication network [12].

At present, there are two aspects in the reliability research of power communication network based on complex network. On the one hand, the survivability of the network can be improved by mining and protecting key nodes. Liu et al. [13] improves the reliability by identifying and protecting key nodes of power communication network. And a protection strategy for high degree nodes and an edge adding strategy for low degree nodes are proposed to improve the structural vulnerability of power communication network in [14]. In reference [15], an evaluation strategy of node importance in power communication backbone network is proposed by using the node weight in power system as the correction coefficient. On the other hand, the reliability of power communication network is measured by link factor. He et al. [16] evaluated the link importance by considering the redundancy of network alternatives and the connectivity and non-connectivity of the network after link failure. On the basis of link used rate, the research method of the vulnerability of power communication network is put forward in [17]. Xia et al. [18] analyzes the affection of the topological structure on network reliability through calculation the importance of nodes and that of links.

In the study of bridge-edges and bridge-nodes, there are several scholars on bridge-edges or bridge-nodes in fields of dolphins’ social network, email network and command and control network, etc. Considering the contribution of nodes to the importance of lines, a bridge-nodes mining method is proposed in [19]. Liu et al. [20] proposed a bridging node centrality method to identify bridging nodes. And the community structure is used to mine most influential nodes in [21]. These methods can only mine bridge-nodes, not bridge-edges. The edge betweenness [22] is a typical method to evaluate edges importance. However, global information is needed to calculate the shortest path of any pair of nodes. In large-scale networks, global information is not difficult to obtain. Pan et al. [23] proposed a bridge-edges mining measurement based on bridge coefficient. This method considers the size of degree and measures the influence of neighbor nodes on bridge-edges. However, it ignores the attenuation of “bridge characteristic” of edge caused by substitute edges, which replace the bridge-edge to connect the communication between regions. As the main communication mode of the power communication network, the role of edges with “bridge characteristic” in power optical cable network has not been discussed.

Therefore, in this paper, to measure the “bridge characteristic” of edges in power optical cable network, a complex power optical cable network model is constructed firstly. On the basis of topological potential, considering the attenuation caused by substitute edges to “bridge characteristic” of one edge, the minimum connected chain attenuation topological potential is proposed. Then, on the basis of that, a bridge-edges mining algorithm is designed to mine edges with “bridge characteristic” in provincial power optical cable network.

The rest of the paper is arranged as following. The second section introduces modeling of power optical cable network by using complex network theory. In the third section, the minimum connected chain attenuation topological potential is proposed to design bridge-edges measurement. The fourth section describes steps of bridge-edges mining measurement based on minimum connected chain attenuation topological potential. In the fifth section, we carry out two groups of experiments to verify the rationality and the validity of proposed method. The sixth section is the conclusion, including the future work.

2. Complex Power Optical Cable Network Model

As the dispatching, power plants and transformer substations in a power grid are connected by optical cables for communication, the physical network of power optical cable network has been constructed. According to complex network theory, the complex power optical cable network model 𝐺=(𝑉, 𝐸) is constructed to describe the physical network of provincial level, and following assumptions are made from the perspective of simplified analysis:

(1) Ignore the differences among each communication stations in provincial dispatching, standby dispatching, ground dispatching and power plants in the power optical cable network of provincial level, and abstract each communication station as one node with no difference;

(2) Ignore the length, number of cores and the voltage level of each optical cable link between two communication stations, and abstract the link as one edge with no weight and no direction;

(3) The double optical cable links between two communication stations are combined and regarded as one edge.

As a result, the complex power optical cable network model G can be constructed as follows:

𝐺=(𝑉, 𝐸)       (1)

where the node set 𝑉={𝑣𝑖|𝑖=1, 2⋯⋯, 𝑁}, and 𝑁 is the number of nodes in 𝐺. The edge set 𝐸={𝑒𝑖𝑗|𝑖=1, 2, ⋯⋯, 𝑁, 𝑗=1, 2, ⋯⋯, 𝑁 𝑎𝑛𝑑 𝑖≠𝑗}, and M is the number of edges in 𝐺, where 𝑒𝑖𝑗=(𝑣𝑖, 𝑣𝑗) is the edge from node 𝑣𝑖 to node 𝑣𝑗, and 𝑒𝑖𝑗=𝑒𝑗𝑖.

The complex power optical cable network model of Jilin Province is shown in Fig. 1(a). Since power optical cable network has geographical topological connection, the communication stations in the same region form a regional power optical cable network. Due to the influence of geographical topology connection, the optical cable connection between regions is sparse, which leads to the emergence of edges with “bridge characteristic” in the power optical cable network.

E1KOBZ_2021_v15n3_1030_f0001.png 이미지

Fig. 1. The complex power optical cable network model of Jilin Province

This kind of edge usually plays an important role in communication between two regions. Simultaneously, take one local network in Fig. 1(a) as an example, it can be seen that there is one obvious bridge-edge for the local network with two regions, which is shown as Fig. 1(b).

As shown in Fig. 1(b), there is an edge 𝑒45, 59 with “bridge characteristic” that connecting two corresponding regions 𝑅45(𝑒45, 59) and 𝑅59(𝑒45, 59) in the local network, and communication between the two regions may be disconnected when the edge 𝑒45, 59 fails. Even if there are other paths to connect the two regions instead of the edge, the communication distance between the two regions will be greatly extended, which will lead to the decline of network efficiency. The edge of this kind is called “bridge-edge”.

In the power optical cable network, not all optical cable connections between 500kV communication stations and between municipal or county-level city are bridge-edges. And the optical cable without obvious characteristics such as city and voltage, but it has “bridge characteristic” in the topology structure, the optical cable is also the bridge-edge. Therefore, how to mine all bridge-edges of power optical cable network has an important impact on the reliability of the whole network.

3. The Measurement of Bridge-edges Based on the Minimum Connected Chain Attenuation Topological Potential

To measure the “bridge characteristic” of edges in one complex power optical cable network model, a novel bridge-edges measurement named minimum connected chain attenuation topological potential is designed by using the following four steps.

3.1 n-level neighborhood local structure

In order to describe the region that edge 𝑒𝑖𝑗 can affect complex power optical cable network G, the n-level neighborhood local structure of edge 𝑒𝑖𝑗 is defined.

Definition 1. (n-level neighborhood local structure): For each edge 𝑒𝑖𝑗 in 𝐺, the n-level neighborhood local structure 𝐺𝑖𝑗 is consist of edge 𝑒𝑖𝑗 , its two edge endpoints 𝑣𝑖 and 𝑣𝑗 𝑎𝑛𝑑 𝑡𝑤𝑜 corresponding n-level neighborhood regions 𝑅𝑖(𝑒𝑖𝑗) and 𝑅𝑗(𝑒𝑖𝑗).

Based on the shortest path length, the nodes in 𝐺𝑖𝑗 close to the endpoint 𝑣𝑖 belong to 𝑅𝑖(𝑒𝑖𝑗), and the nodes in 𝐺𝑖𝑗 close to the endpoint 𝑣𝑗 belong to 𝑅𝑗(𝑒𝑖𝑗).

Taking Fig. 1(b) as an example, it shows the 3-level (n=3) neighborhood local structure of 𝑒45, 59. The 3-level neighborhood region of endpoint 𝑣59 is 𝑅59(𝑒45, 59), and the 3-level neighborhood region of endpoint 𝑣45 is 𝑅45(𝑒45, 59). Compared with endpoint 𝑣45, node 𝑣75 is closer to endpoint 𝑣59, so node 𝑣75 belongs to 𝑅59(𝑒45, 59).

Note: only when the neighborhood local structure of one edge reaches n-level, the edge may have “bridge characteristic”, and the edge will be put into the candidate bridge-edge set 𝑐𝑜𝑛𝑘(0<𝑘<𝑀) of network 𝐺.

3.2 n-level neighborhood local structure topological potential

Classical topological potential can describe the interaction between nodes and the difference of topological positions. According to the theory of topological potential, one node in n-level neighborhood local structure 𝐺𝑖𝑗 is regard as a potential source, which can affect other nodes and paths of connections among nodes in 𝐺𝑖𝑗. Thus each node in 𝐺𝑖𝑗 generates potential energy for 𝑒𝑖𝑗, and these nodes interact with each other to form a virtual potential field in the network topology space. On the basis of that, n-level neighborhood local structure topological potential is designed, which is used to initially measure the “bridge characteristic” of edges in the candidate set 𝑐𝑜𝑛𝑘.

Definition 2. (n-level neighborhood local structure topological potential): To measure the generated potential energy of all nodes in 𝐺𝑖𝑗 for 𝑒𝑖𝑗, the n-level neighborhood local structure topological potential is designed. It can be computed as follows:

𝜑(𝑒𝑖𝑗)=𝜑(𝑣𝑖)+𝜑(𝑣𝑗)       (2)

where φ(𝑣𝑖) is the topological potential of endpoint 𝑣𝑖. φ(𝑣𝑖) can be computed by the following formula :

\(\varphi\left(v_{i}\right)=\sum_{s=1}^{N_{i s}}\left(m_{s} \times e^{-\left(\frac{d_{i s}}{\sigma}\right)^{2}}\right)\)       (3)

where 𝑑𝑖𝑠 is the shortest path from node 𝑣𝑖 to node 𝑣𝑠. The influence factor σ is used to adjust the influence range of each node in the network. The 𝑁𝑖𝑠 is the number of nodes in 𝑅𝑖(𝑒𝑖𝑗). The 𝑚𝑠 represents the quality of node 𝑣𝑠, which can be used to describe the inherent attributes of node 𝑣𝑠.

φ(𝑣𝑗) is the topological potential of endpoint 𝑣𝑗. φ(𝑣𝑗) can be computed by the following formula :

\(\varphi\left(v_{j}\right)=\sum_{h=1}^{N_{j h}}\left(m_{h} \times e^{-\left(\frac{d_{j h}}{\sigma}\right)^{2}}\right)\)       (4)

where 𝑑𝑗ℎ is the shortest path from node 𝑣𝑗 to node 𝑣. The influence factor σ is used to adjust the influence range of each node in the 𝐺. The 𝑁𝑗ℎ is the number of nodes in 𝑅𝑗(𝑒𝑖𝑗). The 𝑚 represents the quality of node 𝑣, which can be used to describe the inherent attributes of node 𝑣.

3.3 Minimum connected chain attenuation

However, not all edges in the candidate set 𝑐𝑜𝑛𝑘 are bridge-edges actually. For 𝐺𝑖𝑗, if there is one substitute edge 𝑒𝑖′𝑗′(𝑖≠𝑖′, 𝑗≠𝑗′) that can replace 𝑒𝑖𝑗 to connect 𝑅𝑖(𝑒𝑖𝑗)and 𝑅𝑗(𝑒𝑖𝑗), the edge 𝑒𝑖′𝑗′ will weaken the “bridge characteristic” of edge 𝑒𝑖𝑗. All possible substitute edges for 𝑒𝑖𝑗 are put into the substitute edge set {𝑒𝑖′𝑗′} of 𝑒𝑖𝑗, and an attenuation coefficient of "bridge characteristic" of edge 𝑒𝑖𝑗 is designed.

Definition 3. (Minimum connected chain attenuation):To measure the attenuation caused by substitute edges in {𝑒𝑖′𝑗′} the “bridge characteristic” of edge 𝑒𝑖𝑗, the minimum connected chain attenuation is defined as a measurement of the attenuation degree of “bridge characteristic” of edge 𝑒𝑖𝑗. The minimum connected chain attenuation of 𝑒𝑖𝑗 is calculated as

\(\begin{aligned} &Q\left(e_{i j}\right)=\sum_{r=1}^{q} \frac{1}{p}\left(\sum_{s=1}^{N_{i s}}\left(m_{s} \times e^{-\left(\frac{d_{is}}{\sigma}\right)^{2}}\right)+\sum_{h=1}^{N_{j h}}\left(m_{h} \times e^{-\left(\frac{d_{j h}}{\sigma}\right)^{2}}\right)\right)=\sum_{r=1}^{q} \frac{1}{p}\left(\varphi\left(v_{i}\right)+\varphi\left(v_{j}\right)\right)=\sum_{r=1}^{q} \frac{1}{p}\left(\varphi\left(e_{i j}\right)\right) \end{aligned}\)       (5)

where 𝑞 is the number of substitute edges in {𝑒𝑖′𝑗′}.And edges 𝑒𝑖𝑗 and 𝑒𝑖′𝑗′ can form multiple connected chains between 𝑅𝑖(𝑒𝑖𝑗) and 𝑅𝑗(𝑒𝑖𝑗), and the shortest one is taken as the minimum connected chain. And 𝑝 is the number of edges that make up the minimum connected chain.

3.4. Minimum connected chain attenuation topological potential based bridge edges measurement

The “bridge characteristic” of the edge 𝑒𝑖𝑗 is attenuated due to the existence of substitute edges in {𝑒𝑖′𝑗′}. In this regard, a measurement is proposed to measure the value of “bridge characteristic” of the edge 𝑒𝑖𝑗, which is called the minimum connected chain attenuation topological potential.

Definition 4. (Minimum connected chain attenuation topological potential): When substitute edge 𝑒𝑖′𝑗′ exists in 𝐺𝑖𝑗 for 𝑒𝑖𝑗, based on the preliminary measurement of degree value of “bridge characteristic” in the definition 2 and the attenuation coefficient in the definition 3, the minimum connected chain attenuation topological potential is designed to adjust the degree of “bridge characteristic” of the edge 𝑒𝑖𝑗, which is taken as the final measurement of “bridge characteristic” of the edge 𝑒𝑖𝑗.

\(\begin{aligned} &\operatorname{MCCA}\left(e_{i j}\right)=\sum_{s=1}^{N_{i s}}\left(m_{s} \times e^{-\left(\frac{d_{i s}}{\sigma}\right)^{2}}\right)+\sum_{h=1}^{N_{j h}}\left(m_{h} \times e^{-\left(\frac{d_{j h}}{\sigma}\right)^{2}}\right)-\sum_{r=1}^{q} \frac{1}{p}\left(\sum _ { s = 1 } ^ { N _ { i s } } \left(m_{s} \times\right.\left.e^{-\left(\frac{d_{i s}}{\sigma}\right)^{2}}\right)+\sum_{h=1}^{N_{j h}}\left(m_{h} \times e^{-\left(\frac{d_{h}}{\sigma}\right)^{2}}\right)\right)=\varphi\left(e_{i j}\right)-Q\left(e_{i j}\right) \end{aligned}\)       (6)

After using the minimum connected chain attenuation, it can be seen that the larger 𝜑(𝑒𝑖𝑗) is and the smaller 𝑄(𝑒𝑖𝑗) is, which leads to the larger 𝑀𝐶𝐶𝐴(𝑒𝑖𝑗), and makes the characteristic of edge 𝑒𝑖𝑗 more pronounced. Namely, the “bridge characteristic” of the edge 𝑒𝑖𝑗 between 𝑣𝑖 and 𝑣𝑗 is more obvious.

4. Bridge-edges Mining Algorithm

To mine edges with “bridge characteristic” in power optical cable network, a bridge-edges mining algorithm is proposed by using the minimum connected chain attenuation topological potential based “bridge characteristic” measurement. The algorithm is as follows:

Algorithm MCCA

The algorithm is a six-stage process. Steps 1 to 5 are the first stage, a complex power optical cable network model of provincial level power optical cable network is constructed.

In the second stage from step 6 to step 10, the influence range of each node is determined as n-level by rounding 3σ′/√2, and the optimal value of the influence factor σ′ corresponding to the minimum potential entropy H(σ)𝑚𝑖𝑛.The formula for H(σ) is as follows:

\(H(\sigma)=-\sum_{i=1}^{n} \frac{\varphi\left(v_{i}\right)}{Z} \ln \left(\frac{\varphi\left(v_{i}\right)}{Z}\right)\)       (7)

where the standardization factor 𝑍 is \(\sum_{i=1}^{n} \varphi\left(v_{i}\right)\).

In the third stage from steps 11 to 13, the n-level neighborhood local structure of each edge is constructed and the edges that may have “bridge characteristic” are put into the bridge-edge candidate set 𝑐𝑜𝑛𝑘.

In the fourth stage of steps 14 to 17, considering the influence of the n-level neighborhood local structure and the substitute edge 𝑒𝑖′𝑗′ on the “bridge characteristic” of the edge 𝑒𝑖𝑗, the minimum connected chain topological potential 𝑀𝐶𝐶𝐴(𝑒𝑖𝑗) of 𝑒𝑖𝑗 is calculated to measure the “bridge characteristic” of 𝑒𝑖j.

In the last part, from step 18 to step 19, all edges in the candidate set 𝑐𝑜𝑛𝑘 are ranked in descending sequence with 𝑀𝐶𝐶𝐴(𝑒𝑖𝑗). As a result, bridge-edges in the power optical cable network can be obtained.

5. Experiments

To verify the validity and rationality of the proposed bridge-edges mining algorithm based on minimum connected chain attenuation topological potential, two groups of experiments were conducted on two real world data sets, that is the physical topology of power optical cable network of the southern Jilin Province and the physical topology of power optical cable network of Jilin Province.

5.1 Evaluation criteria

In this paper, intentional attack is simulated on the mined bridge-edges in the complex power optical cable network model, the rationality and validity of the proposed method are verified by the following two evaluation criteria.

5.1.1 Connectivity

Connectivity refers to ratio of the number of nodes in the largest communication subset of network after the fault to the number of nodes in the network before the fault, which is an index to evaluate connectivity between communication nodes after fault [24], and any two nodes belonging to the largest communication subset can communicate with each other. The formula for connectivity is as follows:

\(S=\frac{N^{\prime}}{N}\)       (8)

where N′ is the number of nodes in the largest communication subset of the network after the fault; N is the number of nodes in the network before the fault.

The larger connectivity indicates that most nodes in network are still connected, and the stronger the communication ability of the network.

5.1.2 Decline rates of network efficiency

Network efficiency refers to the reciprocal sum of the path length between two nodes, which reflects the difficulty of information transmission in the network [15].

The definition of network efficiency 𝜂 is as follow:

\(\eta=\frac{1}{N(N-1)} \sum_{v_{i} \neq v_{j} \in V} \eta_{i j}\)       (9)

where the 𝜂𝑖𝑗 is efficiency between 𝑣𝑖 and 𝑣𝑗, \(\eta_{i j}=\frac{1}{d_{i j}}\), 𝑑𝑖𝑗 is the shortest path between 𝑣𝑖 and 𝑣𝑗.

𝜇 is the decline rate of network efficiency, defined as:

\(\mu=1-\frac{\eta}{\eta_{0}}\)       (10)

𝜂0 is the initial efficiency of the network.

The larger 𝜇 is, the greater damage caused by the attacked edge to network, indicating that the attacked edge is more important.

5.2 Determination of the optimal value 𝛔′ in constructing the model

When the potential energy reaches the minimum, the uncertainty of the whole topological potential field is the minimum. At the same time, the topological potential distribution is the most reasonable [25]. Therefore, the value of σ′ corresponding to the minimum potential entropy H(σ)𝑚𝑖𝑛 is taken as the optimal value in the model. According to mathematical properties of Gauss function, the influence range of each node is a local region that is less than or equal to 3σ′/√2 hops for given the optimal value of σ′. When the distance is greater than 3σ′/√2 hops, the unit potential function decays rapidly to 0.

In order to mine bridge-edges, it is necessary to determine the optimal value σ′ that corresponding to the minimum potential entropy 𝐻(𝜎)𝑚𝑖𝑛. Then, the n-level neighborhood local structure 𝐺𝑖𝑗 is constructed with the radius of 3σ′/√2 hops. Fig. 2 shows the relationship between potential entropy 𝐻(𝜎) and influence factor σ of the southern network model, when the σ′ is 1.8, the potential entropy 𝐻(𝜎) gets the minimum value.

E1KOBZ_2021_v15n3_1030_f0002.png 이미지

Fig. 2. Relationship between H(σ)and σ of the southern network

Fig. 3 shows the relationship between potential entropy 𝐻(𝜎) and influence factor σ of the provincial network model. When the σ′ is still 1.8, the potential entropy 𝐻(𝜎) gets the minimum value.

E1KOBZ_2021_v15n3_1030_f0003.png 이미지

Fig. 3. Relationship between H(σ) and σ of the provincial network in Jilin Province

When σ′ is equal to 1.8, the 3σ′/√2 is equal to 3.82. Based on the above analysis, the influence range of each node is a local region with the radius of 3.82 hops. When the distance is greater than 3.82 hops, the unit potential function quickly decays to 0. Therefore, the influence range of each node is 3-level local region. Therefore, the 𝐺𝑖𝑗 in the complex power optical cable network model is determined as 3-level.

5.3 Bridge-edges mining under four methods

5.3.1 Bridge-edges of the southern provincial network

To illustrate the process of the proposed bridge-edges mining algorithm based on minimum connected chain attenuation topological potential, an example of the complex power optical cable network model of the southern network of Jilin Province is constructed, which is shown in Fig. 4. And the number of nodes is 78 and the number of edges is 114.

E1KOBZ_2021_v15n3_1030_f0004.png 이미지

Fig. 4. The complex power optical cable network model of the southern Jilin Province

Take the edge 𝑒30,40 in the model as an example, the blue part is the 3-level neighborhood region 𝑅30(𝑒30,40) of endpoint 𝑣30 of 𝑒30,40, and the red part is the 3-level neighborhood region 𝑅40(𝑒30,40) of endpoint 𝑣40 of 𝑒30,40. According to the definition 1, the 3-level neighborhood local structure 𝐺30,40 is constructed by edge 𝑒30,40 and 𝑅30(𝑒30,40) and 𝑅40(𝑒30,40).

The topological potentials of endpoints 𝑣30 and 𝑣40 are 9.5 and 5.55, respectively. Therefore, the n-level neighborhood local structure topological potential of edge 𝑒30, 40 is 15.05 by the definition 2.

In 𝐺30,40 , there is one edge 𝑒6,7 that can replace 𝑒30,40 to connect 𝑅30(𝑒30,40) and 𝑅40(𝑒30,40), so 𝑒30,40 and 𝑒6,7 form a minimum connected chain between 𝑅30(𝑒30,40) and 𝑅40(𝑒30,40), which is composed of six edges. That is, 𝑒30,40,𝑒40,2,𝑒2,6,𝑒6,7,𝑒7,25,𝑒25,30.

According to the definition 3, the minimum connected chain attenuation 𝑄(𝑒30,40) is 2.51. Finally, the final "bridge characteristic" value 𝑀𝐶𝐶𝐴(𝑒30,40) is 12.54 by the definition 4. The calculation of each step of top 10% bridge-edges are shown in Table 1.

Table 1. The calculation of each step of top 10% bridge-edges

E1KOBZ_2021_v15n3_1030_t0001.png 이미지

For the southern provincial network model, the minimum connected chain attenuation topological potential (MCCA), degree summation (DS), bridge coefficient (BC) and edge betweenness (EB) are used to compare the mined results of bridge-edges. The top 5% and top 10% bridge-edges results under four methods are shown in Table 2.

Table 2. The top 5% and 10% bridge-edges results under four methods

E1KOBZ_2021_v15n3_1030_t0002.png 이미지

From the mined the top 5% bridge-edges in Table 2, it can be found that when the top 5%( the grey part) bridge-edges mined by MCCA are broken, the southern provincial network is divided into three connected subgraphs. However, when the top 5% bridge-edges mined by other three methods are broken, the network is divided into two connected sub-networks at most. From the mined the top 10% bridge-edges, it can be found that edges 𝑒30, 40, 𝑒45, , 50, 𝑒2, 44, 𝑒2, 6, 𝑒6, 7, 𝑒56, 72, 𝑒40, 41, 𝑒56, 62, 𝑒44, 45, 𝑒57, 72 are mined two or more times under four different methods. Meanwhile, the edge 𝑒30, 40 is optical cable connection between Tonghua 500kV communication station and Dongfeng 500kV communication station. The edge 𝑒2, 44 is the optical cable connection with “bridge characteristic” between the city of Meihe communication station and the city of Liaoyuan communication station, and the edge is mined by all methods at the same time.

5.3.2 Bridge-edges of the whole provincial network

The complex power optical cable network model was constructed based on the physical topology of power optical cable network of Jilin Province, which is shown in Fig. 1(a). The number of nodes is 261 and the number of edges is 353. And the top 5% and the top 10% bridge-edges results of DS, BC, EB and MCCA are shown in Table 3.

Table 3. The top 5% and 10% bridge-edges results of DS, BC, EB and MCCA

E1KOBZ_2021_v15n3_1030_t0003.png 이미지

From the mined bridge-edges of the four methods in Table 3, the similarity rates of mined bridge-edges of MCCA with that of EB, DS and BC are 51.43% (18), 34% (11) and 37% (13), respectively. In addition, the bridge-edges 𝑒182, 222, 𝑒77, 139, 𝑒53, 79, 𝑒6, 7 𝑒182, 188, 𝑒40, 50, 𝑒186, 188, 𝑒2, 6, 𝑒147, 150, 𝑒58, 77, 𝑒61, 67, 𝑒126, 127 are only mined by MCCA, which are optical cable connections with “bridge characteristic” between county-level communication stations. As shown in the bold edges in the table 77% (10) of optical cable connections between 500kV communication stations are mined by EB and MCCA, and 46% (6) are mined by DS and BC. In the top 5% of bridge-edges, 70% (9) of optical cable connections between 500kV communication stations are mined by EB and MCCA, and 23% (3) are mined by DS and BC.

5.3.3 Network connectivity analysis

For the southern provincial network and the provincial network, intentional attack is simulated on the bridge-edges mined by DS, BC, EB and MCCA, and the connectivity of the network may be destroyed.

A. Connectivity on the southern provincial network

Fig. 5 shows the trend of connectivity with the removal of bridge-edges in the southern complex power optical cable network model.

E1KOBZ_2021_v15n3_1030_f0005.png 이미지

Fig. 5. The trend of network connectivity with the removal of bridge-edges

In Fig. 5, the curve of network connectivity of the four methods shows a downward trend as a whole. When the first one bridge-edge is removed from EB and the first two bridge-edges are removed from MCCA, the network is divided into two independent sub-networks, and the connectivity of both MCCA and EB are decreased by 37.18%. When the first four edges are removed, as show in Fig. 6, the network of the MCCA method is divided into three independent sub-networks, and the connectivity of MCCA is decreased by 19.23%, while the connectivity of EB does not decrease. When the first eight edges of EB method are removed, the connectivity is the same as that of MCCA. After removing all 15 bridge-edges, the connectivity of DS, BS, EB and MCCA are decreased by 7.7%, 0%, 56.41% and 56.41%, respectively.

E1KOBZ_2021_v15n3_1030_f0006.png 이미지

Fig. 6. The southern network before and after the first four edges removed

B. Connectivity on the whole provincial network

Fig. 7 shows the trend of network connectivity with the removal of bridge-edges in the whole provincial complex power optical cable network model.

E1KOBZ_2021_v15n3_1030_f0007.png 이미지

Fig. 7. The trend of network connectivity with the removal of bridge-edges

In Fig. 7, the connectivity decreases slowly in the interval 0-7 of horizontal axis. With the increase of the number of removed edges, the network is divided into two independent sub networks after the first eight bridge-edges is removed, and the connectivity of MCCA is decreased by 14.18%. This is because the 8th bridge-edge (𝑒222, 227) is the optical cable connection between two cities connecting the Changling communication station and the Tongyu communication station. Then, with the removal of the 22nd edge (edge 𝑒53, 79), the network is divided into four independent sub-networks, and the connectivity is decreased by 33.33%. The 𝐺𝑖𝑗 without the edge is shown in Fig. 8. The connectivity changes process with the 22nd edge removed is shown in Fig. 9. The connectivity of MCCA, DS, BC and EB are decreased by 51.72%, 24.14%, 24.14% and 20.69% respectively after removing all 35 bridging-edges. Compared with the other three methods, the connectivity of MCCA is increased by 27.58%, 27.58% and 31.03% respectively.

Fig. 8. The 𝐺𝑖𝑗 of the 22th edge (edge 𝑒53, 79)

E1KOBZ_2021_v15n3_1030_f0009.png 이미지

Fig. 9. The connectivity changes process of the network with the 22nd edge removed

5.3.4 Network efficiency analysis

After bridge-edges were mined, to verify the rationality and validity of the proposed method, the effect of bridge-edges on decline rate of network efficiency of each complex power optical cable network is analyzed.

A. The decline rate of network efficiency on the southern provincial network

Fig. 10 shows the trend of decline rate of network efficiency with the removal of bridge-edges in the southern complex power optical cable network model.

E1KOBZ_2021_v15n3_1030_f0010.png 이미지

Fig. 10. The decline rates of network efficiency with the removal of bridge-edges

In Fig. 10, it shows the relationship between the decline rate of network efficiency and the number of bridge-edges removed from the network. With the removal of bridge-edges, the curve of decline rate of network efficiency show a downward trend as a whole. When the same number of edges are removed, the decline rate of network efficiency of MCCA is similar to that of EB, but higher than that of DS and BC. When all 15 edges are removed, the decline rate of network efficiency of MCCA, EB, DS, BC are increases by 54.32%, 53.77%, 14.71% and 22.96%, respectively. The average decline rate of network efficiency of MCCA, EB, DS and BC are 1.55%, 1.54%, 0.42% and 0.66%, respectively. Compared with the average decline rates of network efficiency of other three methods, the average decline rate of network efficiency of MCCA is the highest.

B. The decline rate of network efficiency on the whole provincial network

Fig. 11 shows the trend of decline rate of network efficiency with the removal of bridge-edges in the whole provincial complex power optical cable network model.

E1KOBZ_2021_v15n3_1030_f0011.png 이미지

Fig. 11. The decline rate of network efficiency with the removal of bridge-edges

From the overall trend of network efficiency decline rate of the four methods in Fig. 11, it can be found that the upward trend of network efficiency decline rate of MCCA is significantly higher than that of the other three methods. When all 35 edges are removed, the decline rates of network efficiency of MCCA, EB, DS, BC are increases by 66%, 47%, 46% and 46%, respectively. The average decline rates of network efficiency of MCCA, EB, DS and BC are 1.89%, 1.34%, 1.31% and 1.31%, respectively. Compared with the average network efficiency decline rates of the other three methods, the average decline rates of network efficiency MCCA are increased by 0.55%, 0.58% and 0.58% respectively.

The above two evaluation criteria are further verified the influence of bridge-edges on network reliability from two aspects of network performance and structural stability. The verification results show that the MCCA method can effectively mine the bridge-edges in the power optical cable network. According to the experimental results, with the removal of the top 10% of the bridge-edges in the complex power optical cable network model of Jilin Province, compared with that of other three typical methods, the decline rate of network efficiency of MCCA method is increased by 19%, 20% and 20%, respectively, and the connectivity is decreased by 31.03%, 27.58% and 27.58%.

6. Conclusion

The bridge-edges play the role of connecting the communication between regions, which has a crucial impact on the reliability of power optical cable network. Therefore, to mine bridge edges in power optical cable network, the complex power optical cable network model of the provincial power optical cable network is constructed. And to measure the generated potential energy of all nodes in n-level neighborhood local structure for the edge, the n-level neighborhood local structure topological potential is designed. Then, the minimum connected chain attenuation is designed to measure the attenuation degree caused by substituted edges. Finally, a bridge-edges mining algorithm based on the minimum connected chain attenuation topological potential is proposed. The experimental results show that, compared with the existing methods (degree summation, bridge coefficient and edge betweenness), the proposed method can effectively mine the bridge-edges of power optical cable network, not only can mine the optical cable connection between 500kV communication stations, but also can mine the optical cable connection with “bridge characteristic” between municipal or county-level city communication stations, and the optical cables without obvious characteristics of city or voltage, but it have “bridge characteristics” in topology structure.

The research on the reliability of complex networks is still a hot topic at present, and the research based on the bridge-edge still needs further study. In the future, we will study how to use bridge-edge to mine the backbone structure of the power optical cable network, and how to add edges to the network to reduce the impact of bridge-edge on the reliability of the power optical cable network.

Acknowledgement

This work was supported in part by the project of the National Natural Science Foundation of China under Grant 61572420, in part by Research Project of the Education Department of Jilin Province under Grant JJKH20190706KJ and in part by Science and technology innovation development program of Jilin under Grant 20190104140.

참고문헌

  1. J. Zhao, H. Zhou, B. Chen, and P. Li, "Research on the Structural Characteristics of Transmission Grid Based on Complex Network Theory," Journal of Applied Mathematics, vol. 2014, no. 8, pp. 1-12, Apr. 2014.
  2. Z. Tian, L. Jia, H. Dong, F. Su, and Z. D. Zhang, "Analysis of Urban Road Traffic Network Based on Complex Network," Procedia Engineering, vol. 137, pp. 537-546, 2016. https://doi.org/10.1016/j.proeng.2016.01.290
  3. F. Mao, L. Ma, Q. He, and G. Xiao, "Match Making in Complex Social Networks," Applied Mathematics and Computation, vol. 371, pp. 1-13, 2020.
  4. W. Pan, B. Li, J. Liu, Y. T. Ma, and B. Hu, "Analysing the Structure of Java Software Systems by Weighted K-core," Future Generation Computer Systems, vol. 83, pp. 431-444, 2018. https://doi.org/10.1016/j.future.2017.09.039
  5. M. Bellingeri and D. Cassi, "Robustness of Weighted Networks," Physica A: A Statistical mechanics and its Applications, vol. 489, pp. 47-55, 2018. https://doi.org/10.1016/j.physa.2017.07.020
  6. X. Zhu, W. Song, and L. Gao, "Topological Characteristics and Vulnerability Analysis of Rural Traffic Network," Journal of Sensors, vol. 2019, pp. 1-9, Apr. 2019.
  7. Y. Lyu and P. Yin, "Internet of Things Transmission and Network Reliability in Complex Environment," Computer Communications, vol. 150, pp. 757-763, 2020. https://doi.org/10.1016/j.comcom.2019.11.054
  8. S. W. Mei and X. P. Ni, "Several New Progresses on the Complexity Research of the Interconnected Power Network," Journal of Changsha University of Science and Technology(Natural Science), vol. 5, no. 2, pp. 4-12, 2008.
  9. Z. X. Cai, X. H. Wang, and X. N. Ren, "A Review of Complex Network Theory and Its Application in Power Systems," Power System Technology, vol. 32, no. 11, pp. 114-121, Nov. 2012.
  10. Y. J. Cao, Y. D. Zhang, and Z. J. Bao, "Analysis of Cascading Failures under Interactions between Power Grid and Communication Network," Electric Power Automation Equipment, vol. 33, no, 1, pp. 7-11, Jan. 2013. https://doi.org/10.3969/j.issn.1006-6047.2013.01.002
  11. B. Li, J. Zhang, S. S. Chen, C. Y. Zhu, D. S. Jing, and B. Q, "Expansion Strategy of Power Communication Network Survivability Based on Complex Network," Power System Technology, vol. 42, no. 6, pp. 1974-1980, June 2018.
  12. J. H. Yang, X. D. Peng, and Y. J. Chao, "Topology Analysis and Optimization of Power Communication Network Based on Complex Network," Computer & Digital Engineering, vol. 46, no. 11, pp. 2319-2328, Nov. 2018.
  13. L. Liu, Y. H. Tan, J. Y. Jin, J. Zhang, and F. G. Tong, "Key Node Identification of Power Communication Network," Proceedings of the CSU-EPSA, vol. 32, no. 2, pp. 28-34, 2019.
  14. D. C. Liu, X. P. Ji, B. Wang, and F. Tang, "Topological Vulnerability Analysis and Countermeasures of Electrical Communication Network Based on Complex Network Theory," Power System Technology, vol. 39, no. 12, pp. 3615-3621, Dec. 2015.
  15. Y. Zeng, Y. Wang, X. J. Dong, and B. Fan, "Node Importance Evaluation Strategy on Electric Power Communication Backbone Network," Journal of North China Electric Power University, vol. 40, no. 5, pp. 65-69, Sep. 2013. https://doi.org/10.3969/j.ISSN.1007-2691.2013.05.12
  16. Y. J. He, H. X. Gao, and S. P. Zhou, "Research on Link Importance Identification for Backbone Optical Communication Network," Study on Optical Communications, vol. 6, no. 8, pp. 52-56, Apr. 2018.
  17. J. Yin, G. J. Li, and H. G. Huang, "Analysis of power telecommunication network vulnerability based on link used rate," Power System Protection and Control, vol. 46, no. 2, pp. 31-36, Jan. 2018.
  18. Z. Y. Xia, D. X. Chen, L. Wei, J. Q. Shi, N. Sun, and M. Lu. "Topology Analysis and Research on the Power Fiber Transmission Network in Nanjing," Power System & Automation, vol. 30, no. 3, pp. 60-63, Nov. 2016.
  19. J. Liu, Q. Y. Xiong, W. R. Shi, X. Shi, and K. Wang, "Evaluating the Importance of Nodes in Complex Networks," Physica A: Statistical Mechanics and its Applications, vol. 452, pp. 209-219, 2016. https://doi.org/10.1016/j.physa.2016.02.049
  20. W. Liu, M. Pellegrini, and A. Wu, "Identification of Bridging Centrality in Complex Networks," IEEE Access, vol. 7, pp. 93123-93130,June 2019. https://doi.org/10.1109/access.2019.2928058
  21. X. Zhang, J. Zhu, Q. Wang, and H. Zhao, "Identifying Influential Nodes in Complex Networks with Community Structure," Knowledge-Based Systems, vol. 42, pp. 74-84, 2013. https://doi.org/10.1016/j.knosys.2013.01.017
  22. Y. Qiu and H. E. Xing, "Evaluation Method for Critical Edge of Operation Networks Based on Complex Theory," Ordnance Industry Automation, vo1. 30, no. 8, pp. 22-26, Aug. 2011.
  23. C. S. Pan, X. S. Chen, Y. M. Wang, and B. Chen, "A Method of Key Links Identification in Command and Control Networks Based on Bridging Coefficient," in Proc. of IEEE 15th International Conference on Networking, Sensing and Control (ICNSC), pp. 1-5, Mar. 2018.
  24. X. E. Gao, X. S. Chen, Y. M. Wang, and B. Chen, "Bridge-edge Identification Method of Command and Control Network Based on Bridging Coefficient," Computer Engineering, vol. 45, no.7, pp. 309-314, July 2019.
  25. J. Hu, Y. N. Han, and J. Hu, "Topological Potential: Modelling Node Importance with Activity and Local Effect in Complex Networks," in Proc. of the 2nd International Conference on Computer Modelling & Simulation, pp. 411-415, Jan. 22-24, 2010.