A method for improving stability of a virtual aggregation node of a topological relationship

Abstract

The application discloses a method for improving stability of a virtual convergence node of a topological relation, comprising the following steps: traversing a new topological relation, recording all virtual convergence nodes and their hanging child node information; traversing a virtual node set of the new topological relation, finding a virtual convergence node of a child node of a non-virtual convergence node from an old topological relation; if the child node of the non-virtual convergence node cannot find the virtual convergence node in the old topological relation, the child node is set as a to-be-allocated node; counting the number of times that a child node of a non-virtual convergence node hanging from a virtual convergence node is found in the old topological relation, obtaining a time counting set; finding the maximum number of times in sequence, comparing the number of the virtual convergence node with a virtual convergence node number in the new topological relation; if the state is not processed, the allocation is considered to be finished; and allocating the number of the to-be-allocated virtual convergence node. The application aims at keeping the stability of the virtual convergence node as much as possible under the condition of unstable topological relation, and improving the stability and reliability of a system network.

Description

Technical Field

[0001] This invention relates to a method for improving the stability of virtual convergence nodes in topological relationships, belonging to the fields of smart power and power grid technology. Background Technology

[0002] Topological relationships refer to the interrelationships between spatial data that satisfy the principles of topological geometry. The power supply area of ​​one or more transformers is called a power distribution area. Within the jurisdiction of a distribution area, it consists of multiple nodes such as outgoing line cabinets, branch boxes, meter boxes, and user meters. The topological relationship of a distribution area refers to the hierarchical containment relationship between transformers, branch boxes, meter boxes, and meters.

[0003] Status sensing terminals are installed and deployed in branch boxes and meter boxes. These terminals collect and calculate voltage, current characteristic data, and loop impedance data in real time, and transmit this data to edge devices via HPLC. The edge devices then combine the transformer area records, voltage and current characteristic data, and loop impedance data to calculate and generate a panoramic topology of the transformer area.

[0004] When only status sensing terminals are installed and deployed within the meter boxes, it is necessary to calculate virtual branch box nodes as aggregation nodes for other subordinate nodes. Based on recorded voltage and current characteristic data, the mutual impedances between each pair of meter boxes are calculated. By comparing and matching the magnitudes of these mutual impedance values, the meter box grouping and affiliation are determined, and virtual aggregation nodes are assigned to them. The virtual aggregation nodes are numbered sequentially starting from 1 (distinct from the standard 12-digit meter box address). Changes in voltage and current characteristic data caused by user electrical appliance usage lead to variations in the calculated mutual impedance values, thus affecting the meter box grouping and affiliation.

[0005] Therefore, a method is needed to improve the stability of virtual convergence nodes in topological relationships to solve the above problems. Summary of the Invention

[0006] Purpose of the invention: To address the problems existing in the prior art, the present invention provides a method for improving the stability of virtual convergence nodes in topological relationships.

[0007] A method for improving the stability of virtual convergence nodes in topological relationships includes the following steps:

[0008] Step 1: Traverse the new topology and record information about all virtual aggregation nodes and their child nodes, including processing status and whether they contain virtual aggregation child nodes, to obtain the set of virtual nodes of the new topology, vNodes_New.

[0009] Step 2: Traverse the new topology virtual node set vNodes_New obtained in Step 1. If the child node is a non-virtual convergence node, find the parent virtual convergence node of the child node in the old topology and record the virtual convergence node number.

[0010] Step 3: For child nodes that are not virtual aggregation nodes, if their parent virtual aggregation node cannot be found in the old topology, their processing status is set to pending allocation.

[0011] Step 4: Count the number of child nodes of non-virtual aggregation nodes under the virtual aggregation node in the old topology, and obtain the count set;

[0012] Step 5: In the count statistics set obtained in Step 4, find the maximum count Nmax in order. Compare the virtual convergence node number of this maximum count with the virtual convergence node number in the new topology virtual node set vNodes_New. If they match, set the processing status to processed. If they do not match and the old topology virtual convergence node number has not yet been assigned, replace the virtual convergence node number in the new topology virtual node set vNodes_New with the virtual convergence node number in the old topology and set the processing status to processed. If the old topology virtual convergence node number has already been assigned, set the processing status to pending assignment.

[0013] Step 6: Traverse the new topology virtual node set vNodes_New. If all nodes are not in an unprocessed state, the calculation and allocation of virtual aggregation node numbers will end, and proceed to Step 7. Otherwise, if there are still nodes in an unprocessed state, return to Step 3.

[0014] Step 7: Traverse the new topology virtual node set vNodes_New, and assign numbers to the virtual aggregation nodes whose processing status is pending. At this point, the correction of virtual aggregation node numbers is completed, and the corrected virtual nodes vNodes_Remend are obtained.

[0015] Furthermore, in steps three through six, priority is given to processing the virtual aggregation nodes whose child nodes do not contain virtual aggregation nodes; then, the virtual aggregation nodes whose child nodes contain virtual aggregation nodes are processed.

[0016] Furthermore, the principle for assigning numbers in step seven is to start from 1 and increment. After assigning an unused number, the processing status is set to processed.

[0017] Furthermore, the processing status in step one includes 0, 1, and 2, where 0 indicates unprocessed, 1 indicates pending allocation, and 2 indicates processed.

[0018] Beneficial effects: The method of improving the stability of virtual aggregation nodes in the topology relationship of the present invention aims to maintain the stability of virtual aggregation nodes as much as possible under topological instability, thereby improving the stability and reliability of the system network. Attached Figure Description

[0019] Figure 1 Diagram showing the exchange of group numbers;

[0020] Figure 2 Add a diagram to the new node;

[0021] Figure 3 A diagram illustrating node removal;

[0022] Figure 4 This is a diagram illustrating node switching.

[0023] Figure 5 This is a diagram illustrating multi-level interactive group numbering.

[0024] Figure 6 Add a diagram to the new nodes at multiple levels;

[0025] Figure 7 A diagram illustrating the removal of multi-level nodes;

[0026] Figure 8 This is a schematic diagram of multi-level node switching;

[0027] Figure 9 A flowchart illustrating a method for improving the stability of virtual convergence nodes in topological relationships. Detailed Implementation

[0028] The preferred embodiments of the present invention will now be described in conjunction with the accompanying drawings, which will more clearly and completely illustrate the technical solution of the present invention.

[0029] Please see Figure 9 As shown, the method of the present invention for improving the stability of virtual convergence nodes based on topological relationships includes the following steps:

[0030] The correction of virtual convergence node numbers in the new topology is based on the existing old topology. The basic method is: statistics, comparison, counting, contrast, and correction. The following is a serialized object or array, which can be viewed using a JSON parser.

[0031] (1) Traverse the new topology and record information about all virtual aggregation nodes and their subordinate child nodes (child nodes may also be virtual aggregation nodes), including processing status and whether they contain virtual aggregation child nodes.

[0032] {"vNodes_New":[{"v1":{"nodes":["n1","n2","n3"],"status":0,"hasVNode":0}},{"v2":{"nodes":["n4","n5","n6" ,"n7","v3"],"status":0,"hasVNode":1}},{"v3":{"nodes":["n8","n9","n10","n11"],"status":0,"hasVNode":0}}, {"v4":{"nodes":["n12","n13","n14","n15","n16","v5"],"status":0,"hasVNode":1}},{"v5":{"nodes":["n17","n1 8","n19","n20"],"status":0,"hasVNode":0}},{"v6":{"nodes":["n21","n22","n23"],"status":0,"hasVNode":0}}]}

[0033] (2) Traverse vNodes_New, find the child nodes of non-virtual convergence nodes from the old topology, and record the virtual convergence node number.

[0034] {"vNodes_Old":[{"n1":"v2"},{"n2":"v2"},{"n3":"v2"},{"n4":"v1"},{"n5":"v1"} ,{"n6":"v1"},{"n7":"v2"},{"n8":"v4"},{"n9":"v4"},{"n10":"v4"},{"n11":"v3"} ,{"n12":"v4"},{"n13":"v3"},{"n14":"v3"},{"n15":"v3"},{"n16":"v3"},{"n17":" v5"},{"n18":"v5"},{"n19":""},{"n20":""},{"n21":""},{"n22":""},{"n23":""}]}

[0035] (3) All child nodes of non-virtual aggregation nodes that cannot find virtual aggregation nodes in the old topology are set to 1 (to be assigned).

[0036] {"vNodes_New":[{"v1":{"nodes":["n1","n2","n3"],"status":0,"hasVNode":0}},{"v2":{"nodes":["n4","n5","n6" ,"n7","v3"],"status":0,"hasVNode":1}},{"v3":{"nodes":["n8","n9","n10","n11"],"status":0,"hasVNode":0}}, {"v4":{"nodes":["n12","n13","n14","n15","n16","v5"],"status":0,"hasVNode":1}},{"v5":{"nodes":["n17","n1 8","n19","n20"],"status":0,"hasVNode":0}},{"v6":{"nodes":["n21","n22","n23"],"status":1,"hasVNode":0}}]}

[0037] (4) Prioritize processing aggregation nodes whose child nodes do not have virtual aggregation nodes.

[0038] {"vNodes_New_Prioritize_1 / 2":[{"v1":{"nodes":["n1","n2","n3"],"status":0,"hasVNode":0}},{"v3":{"nodes":["n8","n9","n10","n11"], "status":0,"hasVNode":0}},{"v5":{"nodes":["n17","n18","n19","n20"],"status":0,"hasVNode":0}},{"v6":{"nodes":["n21","n22","n23"],

[0039] "status":0,"hasVNode":0}}]}

[0040] Next, process the virtual aggregation nodes whose child nodes include virtual aggregation nodes.

[0041] {"vNodes_New_Prioritize_2 / 2":[{"v2":{"nodes":["n4","n5","n6","n7","v3"],"status":0,"hasVN ode":1}},{"v4":{"nodes":["n12","n13","n14","n15","n16","v5"],"status":0,"hasVNode":1}}]}

[0042] (5) Count the number of times the child nodes of non-virtual aggregation nodes under the virtual aggregation node appear under the virtual aggregation node in the old topology. Obtain a set of count statistics.

[0043] {"frequencyStatisticsSet":[{"v1":[{"v2":["n1","n2","n3"],"statistics":3}],"prio":2},{"v2":[{"v1":["n4","n5","n6"],"statistics":3},{"v2":["n7"], "statistics":1}],"prio":1},{"v3":[{"v4":["n8","n9","n10"],"statistics":3},{"v3":["n11"],"statistics":1}],"prio":2},{"v4":[{"v4":["n12"],"statist ics":1},{"v3":["n13","n14","n15","n16"],"statistics":4}],"prio":1},{"v5":[{"v5":["n17","n18","n19","n20"],"statistics":4}],"prio":2}]}

[0044] (6) In the count statistics set, find the maximum count Nmax in order. Compare the virtual convergence node number of this maximum count with the virtual convergence node number in the new topology. If they match, mark it as "processed"; if they do not match, and the virtual convergence node number in the old topology has not yet been assigned, replace the virtual convergence node number in the new topology with the virtual convergence node number in the old topology, and mark it as "processed". If the virtual convergence node number in the old topology has already been assigned, mark it as "pending assignment".

[0045] ① Prioritize processing aggregation nodes whose child nodes do not have virtual aggregation nodes:

[0046] First time:

[0047] {"v5":[{"v5":["n17","n18","n19","n20"],"statistics":4}]}, Nmax = 4, both the old and new versions are "v5", set to 2 (already processed).

[0048] {"vNodes_New":[{"v1":{"nodes":["n1","n2","n3"],"status":0,"hasVNode":0}},{"v2":{"nodes":["n4","n5","n6","n7","v3"],

[0049] "status":0,"hasVNode":1}},{"v3":{"nodes":["n8","n9","n10","n11"],"status":0,"hasVNode":0}} ,{"v4":{"nodes":["n12","n13","n14","n15","n16","v5"],"status":0,"hasVNode":1}},{"v5":{"node s":["n17","n18","n19","n20"],"status":0,"hasVNode":0}},{"v6":{"nodes":["n21","n22","n23"],"status":1,"hasVNode":0}}]}

[0050] Second time:

[0051] {"v1":[{"v2":["n1","n2","n3"],"statistics":3}]}, Nmax=3, "v1" and "v2" are swapped and set to 2 (already processed).

[0052] {"vNodes_New":[{"v1":{"nodes":["n1","n2","n3"],"status":2,"hasVNode":0}},{"v2":{"nodes":["n4","n5","n6","n7","v3"],

[0053] "status":2,"hasVNode":1}},{"v3":{"nodes":["n8","n9","n10","n11"],"statu s":0}},{"v4":{"nodes":["n12","n13","n14","n15","n16","v5"],"status":0," hasVNode":1}},{"v5":{"nodes":["n17","n18","n19","n20"],"status":2,"hasV Node":0}},{"v6":{"nodes":["n21","n22","n23"],"status":1,"hasVNode":0}}]}

[0054] ② Next, process the virtual aggregation nodes whose child nodes include virtual aggregation nodes:

[0055] 3rd time:

[0056] {"v4":[{"v4":["n12"],"statistics":1},{"v3":["n13","n14","n15","n16"],"statistics":4}]}, Nmax=4, "v4" and "v3" are swapped and set to 2 (already processed).

[0057] {"vNodes_New":[{"v1":{"nodes":["n1","n2","n3"],"status":2,"hasVNode":0}},{"v2":{"nodes":["n4","n5","n6","n7","v3"],

[0058] "status":2,"hasVNode":1}},{"v3":{"nodes":["n8","n9","n10","n11"],"status":2,"hasVNode":0}} ,{"v4":{"nodes":["n12","n13","n14","n15","n16","v5"],"status":2,"hasVNode":1}},{"v5":{"node s":["n17","n18","n19","n20"],"status":2,"hasVNode":0}},{"v6":{"nodes":["n21","n22","n23"],"status":1,"hasVNode":0}}]}

[0059] (7) Traverse vNodes_New. If there is no "unprocessed" status, it is considered that the calculation and allocation are finished, and proceed to step (8). Otherwise, return to step (4).

[0060] (8) Traverse vNodes_New and assign numbers to the virtual aggregation nodes that are "to be assigned". The assignment principle is to start from 1 and increment. After assigning an unused number, set it to "processed".

[0061] This concludes the correction of the virtual convergence node numbers in the new topology. The corrected result is as follows:

[0062] {"vNodes_Remend":[{"v2":{"nodes":["n1","n2","n3"]}},{"v1":{"nodes":[ "n4","n5","n6","n7","v3"]}},{"v4":{"nodes":["n8","n9","n10","n11"]}} ,{"v3":{"nodes":["n12","n13","n14","n15","n16","v5"]}},{"v5":{"nodes ":["n17","n18","n19","n20"]}},{"v6":{"nodes":["n21","n22","n23"]}}]}

[0063] Note:

[0064] ◆vNodes_New: The new set of virtual nodes in the topology;

[0065] ◆vx: Virtual node;

[0066] ◆nx: Child node (box node);

[0067] ◆nodes: The collection of child nodes;

[0068] ◆status: Status (0 - Unprocessed; 1 - Pending Assignment; 2 - Processed);

[0069] ◆hasVNode: Whether it contains virtual child nodes (0-no; 1-yes);

[0070] ◆frequencyStatisticsSet: A set of frequency statistics;

[0071] ◆prio: Priority (the larger the number, the higher the priority. Here, only 2 and 1 are used).

[0072] ◆vNodes_New_Prioritize_x / y: In the new topology, virtual nodes are prioritized for processing x, and totaled for y;

[0073] ◆Nmax: Maximum number of counts;

[0074] ◆vNodes_Remend: The corrected virtual node.

[0075] in, Figure 1 Diagram showing the exchange of group numbers; Figure 2 Add a diagram to the new node; Figure 3 A diagram illustrating node removal; Figure 4 This is a diagram illustrating node switching. Figure 5 This is a diagram illustrating multi-level interactive group numbering. Figure 6 Add a diagram to the new nodes at multiple levels; Figure 7 A diagram illustrating the removal of multi-level nodes; Figure 8 This is a schematic diagram of multi-level node exchange.

[0076] Single-layer deployment of transformer topology identification technology based on meter box-level power grid characteristic data analysis often leads to unstable topology relationships when user electricity consumption is low or when there is limited characteristic analysis data due to network faults, resulting in significant changes in virtual aggregation nodes (branch box nodes). Virtual aggregation nodes are critical nodes in the transformer topology network; when a fault occurs in the transformer area, they can quickly and accurately determine the fault section and the power outage section. Therefore, ensuring the stability of virtual aggregation nodes is particularly important.

[0077] The method for improving the stability of virtual aggregation nodes in topology relationships according to the present invention aims to maintain the stability of virtual aggregation nodes as much as possible under topological instability, thereby improving the stability and reliability of the system network.

Claims

1. A method for improving the stability of virtual convergence nodes in topological relationships, characterized in that, Includes the following steps: Step 1: Traverse the new topology and record information about all virtual aggregation nodes and their child nodes, including processing status and whether they contain virtual aggregation child nodes, to obtain the set of virtual nodes of the new topology, vNodes_New. Step 2: Traverse the new topology virtual node set vNodes_New obtained in Step 1. If the child node is a non-virtual convergence node, find the parent virtual convergence node of the child node in the old topology and record the virtual convergence node number. Step 3: For child nodes that are not virtual aggregation nodes, if their parent virtual aggregation node cannot be found in the old topology, their processing status is set to pending allocation. Step 4: Count the number of child nodes of non-virtual aggregation nodes under the virtual aggregation node in the old topology, and obtain the count set; Step 5: In the count statistics set obtained in Step 4, find the maximum count Nmax in order. Compare the virtual convergence node number of this maximum count with the virtual convergence node number in the new topology virtual node set vNodes_New. If they match, set the processing status to processed. If they do not match and the old topology virtual convergence node number has not yet been assigned, replace the virtual convergence node number in the new topology virtual node set vNodes_New with the virtual convergence node number in the old topology and set the processing status to processed. If the old topology virtual convergence node number has already been assigned, set the processing status to pending assignment. Step 6: Traverse the new topology virtual node set vNodes_New. If all nodes are not in an unprocessed state, the calculation and allocation of virtual aggregation node numbers will end, and proceed to Step 7. Otherwise, if there are still nodes in an unprocessed state, return to Step 3. Step 7: Traverse the new topology virtual node set vNodes_New, and assign numbers to the virtual aggregation nodes whose processing status is pending. At this point, the correction of virtual aggregation node numbers is completed, and the corrected virtual nodes vNodes_Remend are obtained.

2. The method for improving the stability of virtual convergence nodes in topological relationships as described in claim 1, characterized in that, In steps three through six, priority is given to processing virtual aggregation nodes whose child nodes do not contain virtual aggregation nodes; then, virtual aggregation nodes whose child nodes contain virtual aggregation nodes are processed.

3. The method for improving the stability of virtual convergence nodes in topological relationships as described in claim 1, characterized in that, The principle for assigning numbers in step seven is to start from 1 and increment. After assigning an unused number, the processing status is set to processed.

4. The method for improving the stability of virtual convergence nodes in topological relationships as described in claim 1, characterized in that, The processing status in step one includes 0, 1, and 2, where 0 indicates unprocessed, 1 indicates pending allocation, and 2 indicates processed.

Images