CN107294853B - Power communication network path optimization method - Google Patents
Power communication network path optimization method Download PDFInfo
- Publication number
- CN107294853B CN107294853B CN201710566815.XA CN201710566815A CN107294853B CN 107294853 B CN107294853 B CN 107294853B CN 201710566815 A CN201710566815 A CN 201710566815A CN 107294853 B CN107294853 B CN 107294853B
- Authority
- CN
- China
- Prior art keywords
- nodes
- core
- node
- communication network
- minimum distance
- 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.)
- Active
Links
- 238000004891 communication Methods 0.000 title claims abstract description 125
- 238000000034 method Methods 0.000 title claims abstract description 53
- 238000005457 optimization Methods 0.000 title claims abstract description 14
- 239000012792 core layer Substances 0.000 claims abstract description 82
- 239000010410 layer Substances 0.000 claims abstract description 67
- 230000005540 biological transmission Effects 0.000 abstract description 6
- 238000010276 construction Methods 0.000 abstract description 3
- 238000011161 development Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000008092 positive effect Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Telephonic Communication Services (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a power communication network path optimization method, which comprises the following steps: 1) connecting all nodes of a core layer of the power communication network into a ring at a minimum distance through an algorithm; 2) finding a node closest to a core layer of the power communication network in an access layer of the power communication network; 3) connecting all the found access layer nodes closest to a core layer of the power communication network into the power communication network and recording the connection distance of the access layer nodes; 4) and adding all the connection distances to obtain the minimum communication path. The invention not only ensures the sum of communication network paths to be minimum, but also effectively saves the construction cost and improves the transmission stability.
Description
Technical Field
The invention relates to a power communication network path optimization method, and belongs to the technical field of power communication network path planning.
Background
With the rapid development of power systems and the continuous improvement of automation level, the traffic borne by power communication networks is rapidly increased, and the effectiveness and reliability are receiving more and more attention. Among other things, the size of the power communication network path directly affects the communication network propagation rate and reliability. Therefore, in the case of a fixed communication network node, the smaller the communication path, the higher the effectiveness and reliability of the power communication network.
The optimization of the power communication line refers to determining a communication line deployment scheme with the best economical efficiency under the condition of meeting the service distribution and reliability constraints according to the existing network structure on the basis of the known site position and service distribution. With the increasing expansion of the power grid scale, the optimization problem of the power communication network becomes more and more complex. Therefore, the deep research on the optimization of the power transmission network not only has a positive effect on the good operation of the power system in China, but also has a positive effect on the stability of the society and the rapid and healthy development of the national economy.
At present, in the research on the topology of the power communication network, a minimum spanning tree method Kruskal algorithm, a minimum path algorithm, a maximum flow algorithm and a Waxman random model are adopted, and the method can consider the influence of the path on the communication network and ensure the minimum path between local communication nodes. However, the sum of the total paths of the whole network cannot be guaranteed to be minimum, and further optimization of the communication network propagation path is limited.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides a power communication network path optimization method which can minimize the sum of paths by optimizing a communication network.
The technical scheme adopted for solving the technical problems is as follows:
a power communication network path optimization method comprises the following steps:
1) connecting all nodes of a core layer of the power communication network into a ring at a minimum distance through an algorithm;
2) finding a node closest to a core layer of the power communication network in an access layer of the power communication network;
3) connecting all the found access layer nodes closest to a core layer of the power communication network into the power communication network and recording the connection distance of the access layer nodes;
4) and adding all the connection distances to obtain the minimum communication path.
Further, the specific process of the step 1) is as follows: (1) determining a master node location core of a power communications network core layer0To core the node0Put into the set C, C ═ core0And calculating other nodes and the master node core of the power communication network core layer0The node with the smallest distance is core1And node core0Connecting, connecting the nodes core1Put into the set C, C ═ core0,core1}; (2) will (core)0,core1) Adding into ordered number pair M, M { (core)0,core1) And respectively calculating the power supplyFinding the minimum distance between other nodes in the core layer of the message network and the nodes in the set C, connecting two nodes corresponding to the minimum distance, and putting the nodes which do not belong to the set C in the set C; (3) sequentially calculating according to the mode, so that the set C comprises all nodes in the core layer, and meanwhile, two nodes to which the minimum distance measured each time belongs form an ordinal number pair and are placed in the array M; (4) and calculating the distance between the node with only one connecting line and other nodes which are not connected with the node, finding out the minimum distance, connecting the two nodes corresponding to the distance to ensure that all the nodes have at least two connecting lines, and forming an ordinal pair by the two nodes to which the minimum distance measured each time belongs, and putting the ordinal pair into the array M.
Further, the specific process of step 2) is as follows: respectively calculating the positions of each node of a core layer of the power communication network and each node of an access layer of the power communication network, finding out the minimum distance, and connecting the nodes of the core layer and the nodes of the access layer at the two ends of the minimum distance with the nodes of the access layer conv0Connect, connect conv0And putting the nodes into the set C, forming an ordinal pair by the two nodes to which the measured minimum distance belongs, and putting the ordinal pair into an array M.
Further, the specific process of step 3) is as follows: (1) calculating the distance between the power communication network access layer node which is not in the set C and each point in the set C, finding out the node outside the set C with the minimum distance, putting the node into the set C, and continuously repeating the process to finally put all the power communication network core layer nodes and the power communication network access layer nodes into the set C; (2) and forming an ordinal pair by two nodes to which the minimum distance measured each time belongs, putting the ordinal pair into an array M, calculating the distances between the nodes with only one connecting line number and other nodes which are not connected with the nodes, finding the minimum distance, connecting the two nodes corresponding to the minimum distance to ensure that all the nodes have at least two connecting lines, forming the ordinal pair by the two nodes to which the minimum distance measured each time belongs, and putting the ordinal pair into the array M.
Further, the specific process of the step 4) is as follows: and adding the distances between two points corresponding to each pair of the array M to obtain the minimum path of the communication network as the optimized power communication network path.
The invention provides another power communication network path optimization method, which comprises the following steps:
s1, dividing the power communication network into a core layer and an access layer according to grades;
s2, calculating the distance between the unplanned node of the core layer and the planned node, finding the minimum distance and recording the distance, putting the unplanned node in the planned node, repeating the above process until all the core layer nodes belong to the planned node, and simultaneously connecting the nodes with only one connection line with the next node to form a ring;
s3, calculating the positions of the unplanned nodes of the access layer and all the planned nodes before, finding the minimum distance, placing the unplanned nodes at the distance into the planned nodes, and repeating the process until all the nodes of the access layer belong to the planned nodes;
and S4, adding all the minimum distances to obtain the minimum path of the communication network.
Further, the specific process of step S2 is as follows: (1) determining a core node location core of a core layer0To core the node0Put into the set C, C ═ core0And calculating other nodes of the core layer and the core node0The node with the smallest distance is core1And node core0Connecting, connecting the nodes core1Put into the set C, C ═ core0,core1}; (2) will (core)0,core1) Adding into ordered number pair M, M { (core)0,core1) Respectively calculating the distances between other nodes in the core layer and the nodes in the set C, finding out the minimum distance, connecting two nodes corresponding to the minimum distance, and putting the nodes which do not belong to the set C in the set C; (3) sequentially calculating according to the mode, so that the set C comprises all nodes in the core layer, and meanwhile, two nodes to which the minimum distance measured each time belongs form an ordinal number pair and are placed in the array M; (4) only one connecting line is calculatedThe distance between the node(s) of (1) and other nodes which are not connected with the node(s) of (3) is found out, the minimum distance is found, the two nodes corresponding to the distance are connected, so that all the nodes have at least two connecting lines, and the two nodes to which the minimum distance measured each time belongs form an ordinal pair which is put into an array M.
Further, the specific process of step S3 is as follows: (1) respectively calculating the positions of each node of the core layer and each node of the access layer, finding out the minimum distance, and connecting the nodes of the core layer and the nodes of the access layer at the two ends of the minimum distance with the nodes of the access layer conv0Connect, connect conv0Putting the nodes into a set C, forming an ordinal pair by the two nodes to which the measured minimum distance belongs, and putting the ordinal pair into an array M; (2) calculating the distance between the access layer node which is not in the set C and each point in the set C, finding out the node outside the set C with the minimum distance, putting the node into the set C, and continuously repeating the process to finally put all the core layer nodes and the access layer nodes into the set C; (3) and forming an ordinal pair by two nodes to which the minimum distance measured each time belongs, putting the ordinal pair into an array M, calculating the distances between the nodes with only one connecting line number and other nodes which are not connected with the nodes, finding the minimum distance, connecting the two nodes corresponding to the minimum distance to ensure that all the nodes have at least two connecting lines, forming the ordinal pair by the two nodes to which the minimum distance measured each time belongs, and putting the ordinal pair into the array M.
Further, the specific process of step S4 is as follows: and adding the distances between two points corresponding to each pair of the array M to obtain the minimum path of the communication network as the optimized power communication network path.
The invention has the following beneficial effects:
according to the invention, all nodes of the core layer of the power communication network are connected into a ring at the minimum distance through an algorithm, then the node closest to the core layer is found in the access layer of the power communication network, then all the found nodes of the access layer closest to the core layer are connected into the power communication network and the connection distances of the nodes are recorded, and finally all the connection distances are added to obtain the minimum communication path, so that the sum of the communication network paths is ensured to be minimum, the construction cost is effectively saved, and the transmission stability is improved.
All nodes of the core layer of the power communication network are connected into a ring at the minimum distance through an algorithm, so that the core layer is connected into the ring, and the stability and the minimum distance of a communication path are ensured; finding out the node closest to the core layer in the access layer of the power communication network, so that at least one node of the access layer is connected with the core layer, and the reliability of communication transmission is ensured; connecting all the found access layer nodes closest to the core layer to the power communication network and recording the connection distance of the access layer nodes, so that all the access layer nodes are connected to the communication network; and accumulating all the connection distances to obtain the sum of the distances, and ensuring that a communication path with the minimum sum of the distances can be obtained.
Drawings
Fig. 1 is a flowchart of a power communication network path optimization method according to embodiment 1 of the present invention;
fig. 2 is a flowchart of a method for obtaining a minimum path of a communication network in embodiment 2 of the present invention.
Detailed Description
In order to clearly explain the technical features of the present invention, the following detailed description of the present invention is provided with reference to the accompanying drawings. The following disclosure provides many different embodiments, or examples, for implementing different features of the invention. To simplify the disclosure of the present invention, the components and arrangements of specific examples are described below. Furthermore, the present invention may repeat reference numerals and/or letters in the various examples. This repetition is for the purpose of simplicity and clarity and does not in itself dictate a relationship between the various embodiments and/or configurations discussed. It should be noted that the components illustrated in the figures are not necessarily drawn to scale. Descriptions of well-known components and processing techniques and procedures are omitted so as to not unnecessarily limit the invention. Example 1
As shown in fig. 1, the method for optimizing a power communication network path according to this embodiment includes the following steps:
1) all nodes of the core layer of the power communication network are connected into a ring at a minimum distance through an algorithm. To supply electric powerThe specific process that all nodes of the core layer of the network are connected into a ring at the minimum distance through an algorithm is as follows: (1) determining a master node location core of a power communications network core layer0To core the node0Put into the set C, C ═ core0And calculating other nodes and the master node core of the power communication network core layer0The node with the smallest distance is core1And node core0Connecting, connecting the nodes core1Put into the set C, C ═ core0,core1}; (2) will (core)0,core1) Adding into ordered number pair M, M { (core)0,core1) Respectively calculating the distances between other nodes in the core layer of the power communication network and the nodes in the set C, finding out the minimum distance, connecting two nodes corresponding to the minimum distance, and putting the nodes which do not belong to the set C in the set C; (3) sequentially calculating according to the mode, so that the set C comprises all nodes in the core layer, and meanwhile, two nodes to which the minimum distance measured each time belongs form an ordinal number pair and are placed in the array M; (4) and calculating the distance between the node with only one connecting line and other nodes which are not connected with the node, finding out the minimum distance, connecting the two nodes corresponding to the distance to ensure that all the nodes have at least two connecting lines, and forming an ordinal pair by the two nodes to which the minimum distance measured each time belongs, and putting the ordinal pair into the array M.
2) And finding the node closest to the core layer of the power communication network in the access layer of the power communication network. The specific process of finding the node closest to the power communication network core layer in the power communication network access layer is as follows: respectively calculating the positions of each node of a core layer of the power communication network and each node of an access layer of the power communication network, finding out the minimum distance, and connecting the nodes of the core layer and the nodes of the access layer at the two ends of the minimum distance with the nodes of the access layer conv0Connect, connect conv0And putting the nodes into the set C, forming an ordinal pair by the two nodes to which the measured minimum distance belongs, and putting the ordinal pair into an array M.
3) All access layer nodes found to be closest to the core layer of the power communications network are connected into the power communications network and their connection distances are recorded. The specific process of connecting all the found access layer nodes closest to the core layer of the power communication network into the power communication network and recording the connection distance of the access layer nodes is as follows: (1) calculating the distance between the power communication network access layer node which is not in the set C and each point in the set C, finding out the node outside the set C with the minimum distance, putting the node into the set C, and continuously repeating the process to finally put all the power communication network core layer nodes and the power communication network access layer nodes into the set C; (2) and forming an ordinal pair by two nodes to which the minimum distance measured each time belongs, putting the ordinal pair into an array M, calculating the distances between the nodes with only one connecting line number and other nodes which are not connected with the nodes, finding the minimum distance, connecting the two nodes corresponding to the minimum distance to ensure that all the nodes have at least two connecting lines, forming the ordinal pair by the two nodes to which the minimum distance measured each time belongs, and putting the ordinal pair into the array M.
4) And adding all the connection distances to obtain the minimum communication path. The specific process of adding all the connection distances to obtain the minimum communication path is as follows: and adding the distances between two points corresponding to each pair of the array M to obtain the minimum path of the communication network as the optimized power communication network path.
All nodes of the core layer of the power communication network are connected into a ring at the minimum distance through an algorithm, so that the core layer is connected into the ring, and the stability and the minimum distance of a communication path are ensured; finding out the node closest to the core layer in the access layer of the power communication network, so that at least one node of the access layer is connected with the core layer, and the reliability of communication transmission is ensured; connecting all the found access layer nodes closest to the core layer to the power communication network and recording the connection distance of the access layer nodes, so that all the access layer nodes are connected to the communication network; and accumulating all the connection distances to obtain the sum of the distances, and ensuring that a communication path with the minimum sum of the distances can be obtained.
Example 2
As shown in fig. 2, the method for optimizing a power communication network path according to this embodiment includes the following steps:
s1, dividing the power communication network into a core layer and an access layer according to grades;
s2, calculating the distance between the unplanned node of the core layer and the planned node, finding the minimum distance and recording the distance, putting the unplanned node in the planned node, repeating the above process until all the core layer nodes belong to the planned node, and simultaneously connecting the nodes with only one connection line with the next node to form a ring;
s3, calculating the positions of the unplanned nodes of the access layer and all the planned nodes before, finding the minimum distance, placing the unplanned nodes at the distance into the planned nodes, and repeating the process until all the nodes of the access layer belong to the planned nodes;
and S4, adding all the minimum distances to obtain the minimum path of the communication network.
Further, the specific process of step S2 is as follows: (1) determining a core node location core of a core layer0To core the node0Put into the set C, C ═ core0And calculating other nodes of the core layer and the core node0The node with the smallest distance is core1And node core0Connecting, connecting the nodes core1Put into the set C, C ═ core0,core1}; (2) will (core)0,core1) Adding into ordered number pair M, M { (core)0,core1) Respectively calculating the distances between other nodes in the core layer and the nodes in the set C, finding out the minimum distance, connecting two nodes corresponding to the minimum distance, and putting the nodes which do not belong to the set C in the set C; (3) sequentially calculating according to the mode, so that the set C comprises all nodes in the core layer, and meanwhile, two nodes to which the minimum distance measured each time belongs form an ordinal number pair and are placed in the array M; (4) calculating the distance between the node with only one connecting line and other nodes not connected with the node, finding the minimum distance, connecting the two nodes corresponding to the distance to make all the nodes have at least two connecting lines, and forming two nodes to which the minimum distance measured each time belongs to beOrdinal pairs, put into array M.
Further, the specific process of step S3 is as follows: (1) respectively calculating the positions of each node of the core layer and each node of the access layer, finding out the minimum distance, and connecting the nodes of the core layer and the nodes of the access layer at the two ends of the minimum distance with the nodes of the access layer conv0Connect, connect conv0Putting the nodes into a set C, forming an ordinal pair by the two nodes to which the measured minimum distance belongs, and putting the ordinal pair into an array M; (2) calculating the distance between the access layer node which is not in the set C and each point in the set C, finding out the node outside the set C with the minimum distance, putting the node into the set C, and continuously repeating the process to finally put all the core layer nodes and the access layer nodes into the set C; (3) and forming an ordinal pair by two nodes to which the minimum distance measured each time belongs, putting the ordinal pair into an array M, calculating the distances between the nodes with only one connecting line number and other nodes which are not connected with the nodes, finding the minimum distance, connecting the two nodes corresponding to the minimum distance to ensure that all the nodes have at least two connecting lines, forming the ordinal pair by the two nodes to which the minimum distance measured each time belongs, and putting the ordinal pair into the array M.
Further, the specific process of step S4 is as follows: and adding the distances between two points corresponding to each pair of the array M to obtain the minimum path of the communication network as the optimized power communication network path.
According to the invention, all nodes of the core layer of the power communication network are connected into a ring at the minimum distance through an algorithm, then the node closest to the core layer is found in the access layer of the power communication network, then all the found nodes of the access layer closest to the core layer are connected into the power communication network and the connection distances of the nodes are recorded, and finally all the connection distances are added to obtain the minimum communication path, so that the sum of the communication network paths is ensured to be minimum, the construction cost is effectively saved, and the transmission stability is improved.
The foregoing is only a preferred embodiment of the present invention, and it will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the principle of the invention, and such modifications and improvements are also considered to be within the scope of the invention.
Claims (5)
1. A power communication network path optimization method is characterized by comprising the following steps:
1) connecting all nodes of a core layer of the power communication network into a ring at a minimum distance through an algorithm;
2) finding a node closest to a core layer of the power communication network in an access layer of the power communication network;
3) connecting all the found access layer nodes closest to a core layer of the power communication network into the power communication network and recording the connection distance of the access layer nodes;
4) adding all the connection distances to obtain a minimum communication path;
the specific process of the step 1) is as follows: (1) determining a master node location core of a power communications network core layer0To core the node0Put into the set C, C ═ core0And calculating other nodes and the master node core of the power communication network core layer0The node with the smallest distance is core1And node core0Connecting, connecting the nodes core1Put into the set C, C ═ core0,core1}; (2) will (core)0,core1) Adding into ordered number pair M, M { (core)0,core1) Respectively calculating the distances between other nodes in the core layer of the power communication network and the nodes in the set C, finding out the minimum distance, connecting two nodes corresponding to the minimum distance, and putting the nodes which do not belong to the set C in the set C; (3) sequentially calculating according to the mode, so that the set C comprises all nodes in the core layer, and meanwhile, two nodes to which the minimum distance measured each time belongs form an ordinal number pair and are placed in the array M; (4) calculating the distance between the node with only one connecting line and other nodes which are not connected with the node, finding out the minimum distance, connecting the two nodes corresponding to the distance to ensure that all the nodes have at least two connecting lines, forming an ordinal pair by the two nodes to which the minimum distance measured each time belongs, and putting the ordinal pair into an array M;
the specific process of the step 3) is as follows: (1) calculating the distance between the power communication network access layer node which is not in the set C and each point in the set C, finding out the node outside the set C with the minimum distance, putting the node into the set C, and continuously repeating the process to finally put all the power communication network core layer nodes and the power communication network access layer nodes into the set C; (2) and forming an ordinal pair by two nodes to which the minimum distance measured each time belongs, putting the ordinal pair into an array M, calculating the distances between the nodes with only one connecting line number and other nodes which are not connected with the nodes, finding the minimum distance, connecting the two nodes corresponding to the minimum distance to ensure that all the nodes have at least two connecting lines, forming the ordinal pair by the two nodes to which the minimum distance measured each time belongs, and putting the ordinal pair into the array M.
2. The method for optimizing the path of the power communication network according to claim 1, wherein the specific process of the step 2) is as follows: respectively calculating the positions of each node of a core layer of the power communication network and each node of an access layer of the power communication network, finding out the minimum distance, and connecting the nodes of the core layer and the nodes of the access layer at the two ends of the minimum distance with the nodes of the access layer conv0Connect, connect conv0And putting the nodes into the set C, forming an ordinal pair by the two nodes to which the measured minimum distance belongs, and putting the ordinal pair into an array M.
3. The method for optimizing the path of the power communication network according to claim 1, wherein the specific process of the step 4) is as follows: and adding the distances between two points corresponding to each pair of the array M to obtain the minimum path of the communication network as the optimized power communication network path.
4. A power communication network path optimization method is characterized by comprising the following steps:
s1, dividing the power communication network into a core layer and an access layer according to grades;
s2, calculating the distance between the unplanned node of the core layer and the planned node, finding the minimum distance and recording the distance, putting the unplanned node in the planned node, repeating the above process until all the core layer nodes belong to the planned node, and simultaneously connecting the nodes with only one connection line with the next node to form a ring;
s3, calculating the positions of the unplanned nodes of the access layer and all the planned nodes before, finding the minimum distance, placing the unplanned nodes at the distance into the planned nodes, and repeating the process until all the nodes of the access layer belong to the planned nodes;
s4, adding all the minimum distances to obtain the minimum path of the communication network;
the specific process of step S2 is as follows: (1) determining a core node location core of a core layer0To core the node0Put into the set C, C ═ core0And calculating other nodes of the core layer and the core node0The node with the smallest distance is core1And node core0Connecting, connecting the nodes core1Put into the set C, C ═ core0,core1}; (2) will (core)0,core1) Adding into ordered number pair M, M { (core)0,core1) Respectively calculating the distances between other nodes in the core layer and the nodes in the set C, finding out the minimum distance, connecting two nodes corresponding to the minimum distance, and putting the nodes which do not belong to the set C in the set C; (3) sequentially calculating according to the mode, so that the set C comprises all nodes in the core layer, and meanwhile, two nodes to which the minimum distance measured each time belongs form an ordinal number pair and are placed in the array M; (4) calculating the distance between the node with only one connecting line and other nodes which are not connected with the node, finding out the minimum distance, connecting the two nodes corresponding to the distance to ensure that all the nodes have at least two connecting lines, forming an ordinal pair by the two nodes to which the minimum distance measured each time belongs, and putting the ordinal pair into an array M;
the specific process of step S3 is as follows: (1) respectively calculating the positions of each node of the core layer and each node of the access layer, finding out the minimum distance, and connecting the nodes of the core layer and the nodes of the access layer at the two ends of the minimum distance with the nodes of the access layer conv0The connection is carried out in a connecting way,will conv0Putting the nodes into a set C, forming an ordinal pair by the two nodes to which the measured minimum distance belongs, and putting the ordinal pair into an array M; (2) calculating the distance between the access layer node which is not in the set C and each point in the set C, finding out the node outside the set C with the minimum distance, putting the node into the set C, and continuously repeating the process to finally put all the core layer nodes and the access layer nodes into the set C; (3) and forming an ordinal pair by two nodes to which the minimum distance measured each time belongs, putting the ordinal pair into an array M, calculating the distances between the nodes with only one connecting line number and other nodes which are not connected with the nodes, finding the minimum distance, connecting the two nodes corresponding to the minimum distance to ensure that all the nodes have at least two connecting lines, forming the ordinal pair by the two nodes to which the minimum distance measured each time belongs, and putting the ordinal pair into the array M.
5. The method according to claim 4, wherein the specific process of step S4 is as follows: and adding the distances between two points corresponding to each pair of the array M to obtain the minimum path of the communication network as the optimized power communication network path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710566815.XA CN107294853B (en) | 2017-07-12 | 2017-07-12 | Power communication network path optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710566815.XA CN107294853B (en) | 2017-07-12 | 2017-07-12 | Power communication network path optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107294853A CN107294853A (en) | 2017-10-24 |
| CN107294853B true CN107294853B (en) | 2020-06-30 |
Family
ID=60100686
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710566815.XA Active CN107294853B (en) | 2017-07-12 | 2017-07-12 | Power communication network path optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107294853B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108551403B (en) * | 2018-04-16 | 2021-02-09 | 胡昱 | Transmission network planning method and system |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101873249B (en) * | 2009-04-27 | 2012-07-04 | 华为技术有限公司 | Method and device for computing service transmission path in optical transport network |
| JP5880139B2 (en) * | 2012-02-29 | 2016-03-08 | 富士通株式会社 | Placement server, information processing system, cache placement method, cache placement program |
| CN103001876B (en) * | 2012-11-26 | 2015-06-17 | 中国联合网络通信集团有限公司 | Bearer network flow optimizing method, router, optimizing server and bearer network system |
| CN103078796B (en) * | 2013-01-28 | 2016-03-30 | 杭州华三通信技术有限公司 | A kind of route computing method and equipment |
| CN103701702A (en) * | 2013-12-12 | 2014-04-02 | 杭州百富电子技术有限公司 | Dynamic routing algorithm in power line carrier communication |
| CN104954160B (en) * | 2014-03-28 | 2019-02-26 | 中国移动通信集团内蒙古有限公司 | A kind of method that realizing bearer network multiple protective and bearer network |
| CN106209669B (en) * | 2016-06-30 | 2019-06-07 | 中国人民解放军国防科学技术大学 | Towards SDN data center network maximum probability path stream scheduling method and device |
| CN106454859B (en) * | 2016-09-19 | 2019-10-08 | 广东省电信规划设计院有限公司 | Access layer network dispositions method and system |
-
2017
- 2017-07-12 CN CN201710566815.XA patent/CN107294853B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN107294853A (en) | 2017-10-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | On the data aggregation point placement in smart meter networks | |
| CN102195683A (en) | Power carrier communication method | |
| CN109474023B (en) | Intelligent power distribution network section real-time updating method and system, storage medium and terminal | |
| CN109150712A (en) | The network-building method and system that power line carrier is communicated with wireless fusion | |
| CN104917820A (en) | Data transmission method based on micro-power wireless interconnecting and interworking technology | |
| CN105208622A (en) | High-efficiency dynamic automatic-maintenance routing list structure and routing list management method | |
| CN110290001B (en) | Single-chain structure optimization method, device and equipment for power communication network | |
| KR101387248B1 (en) | Generating method for balanced chain topology in wireless sensor networks | |
| CN107294853B (en) | Power communication network path optimization method | |
| CN103701647B (en) | A kind of wireless network topology optimization generates method | |
| CN114143248A (en) | Heterogeneous communication method, device, computer and readable medium based on dual-mode communication | |
| CN113259242B (en) | Method and device for networking field area network | |
| CN105634554A (en) | Carrier wave communication networking method, nodes and system | |
| CN106296466A (en) | A kind of feeder system planing method based on reliability | |
| CN104579424A (en) | Power line carrier communication method | |
| CN113949412A (en) | Optimization method of high-speed power line carrier communication network | |
| CN116527562A (en) | Routing method, system, device and medium for grid connection of roof photovoltaic power station | |
| CN109033603B (en) | Intelligent substation secondary system simulation method based on source flow path chain | |
| Kong et al. | Robust wireless sensor networks for transmission line monitoring in taiwan | |
| CN112839343B (en) | RF terminal equipment full-coverage method facing cellular unit | |
| Zheng et al. | Construction of d-hop connected dominating sets in wireless sensor networks | |
| CN112566016A (en) | Deep learning and block chain based maintenance tool LoRa positioning method | |
| CN113094858A (en) | Power grid topology analysis method based on shore-based power supply offshore oil field group | |
| CN109742856B (en) | Method for generating network three-dimensional physical topological structure diagram of transformer area electric energy meter | |
| Kumar et al. | An improved clustering machanism to improve neworklife for underwater WSN |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |