Carrier communication routing networking method for distribution network

Abstract

The present application discloses a carrier communication routing networking method for a distribution network, in which the master node can dynamically update the first routing table of the master node after sending confirmation access information to each slave node. If each slave node receives confirmation access information, the first routing table of the slave node can be dynamically updated, and the second routing table of the slave node can be dynamically updated based on the first neighbor list and the first routing table of the slave node, and the second neighbor list and the first routing table broadcast by the first neighbor node, thereby improving the flexibility of routing networking. And because the first routing table of each slave node stores the routes from the slave node to the master node, the parent node, and the descendant node respectively, the second routing table stores the routes from the slave node to the nodes other than the reachable nodes of the first routing table. Therefore, based on the first routing table and the second routing table, communication can be achieved between the two slave nodes without passing through the master node, thereby improving the efficiency of communication between the slave nodes.

Description

Technical Field

[0001] The present application relates to the field of computers, and in particular to a carrier communication routing networking method for a distribution network. Background Art

[0002] The distribution network may include a main node and multiple sub-nodes located on a low-voltage line. After the main node and the multiple sub-nodes are networked, the nodes can communicate with each other.

[0003] In the related art, after a master node and multiple sub-nodes are networked, any two slave nodes need to communicate through the master node, resulting in low communication efficiency. Summary of the invention

[0004] The present application aims to solve one of the technical problems in the related art at least to a certain extent. To this end, one purpose of the present application is to propose a carrier communication routing networking method for a distribution network, in which in the process of networking a master node and multiple slave nodes, the master node can dynamically update the first routing table of the master node after sending confirmation access information to each slave node. If each slave node receives confirmation access information, the first routing table of the slave node can be dynamically updated. And the second routing table of the slave node can be dynamically updated based on the first neighbor list of the slave node, the first routing table of the slave node, the second neighbor list broadcast by the first neighbor node, and the first routing table, thereby improving the flexibility of routing networking.

[0005] After the master node and multiple slave nodes are networked, the first routing table of each slave node stores the routes from the slave node to the master node, the parent node, and the descendant nodes, and the second routing table of the slave node stores the routes from the slave node to nodes other than the reachable nodes in the first routing table. Therefore, based on the first routing table and the second routing table, two slave nodes can communicate without passing through the master node, thereby realizing horizontal communication between slave nodes and improving the efficiency of communication between slave nodes.

[0006] On the one hand, a carrier communication routing networking method for a distribution network is provided, which is applied to the distribution network, wherein the distribution network includes a master node and multiple slave nodes, and the method includes:

[0007] After the master node sends the network access confirmation information to each slave node, the master node updates the first routing table of the master node;

[0008] For each slave node, if the network access confirmation information is obtained, the first routing table of the slave node is updated, the first neighbor list and the first routing table of the slave node are broadcast after the network access, and the second routing table of the slave node is updated based on the first neighbor list, the first routing table of the slave node, the second neighbor list of the first neighbor node, and the first routing table;

[0009] Among them, the neighbor list stores the neighbor nodes of the node. After the master node and multiple slave nodes are networked, the first routing table of the master node stores the routes from the master node to the descendant nodes; the first routing table of the slave node stores the routes from the slave node to the master node, the parent node and the descendant nodes respectively, and the second routing table of the slave node stores the routes from the slave node to nodes other than the reachable nodes in the first routing table.

[0010] Optionally, updating the second routing table of the slave node based on the first neighbor list, the first routing table of the slave node, the second neighbor list of the first neighbor node, and the first routing table includes:

[0011] storing in a second routing table a route from the node to a second neighboring node, the second neighboring node being a node in the first neighbor list other than a node reachable from the node in the first routing table;

[0012] For each reference node, if the reference node does not exist in the reachable nodes in the first routing table and the second routing table of the slave node, then the next hop route from the node to the reference node is stored as the first neighbor node in the second routing table of the slave node;

[0013] The reference node is a node in the second neighbor list or a reachable node in the first routing table of the first neighbor node.

[0014] Optionally, the method further includes:

[0015] For each reference node, if the target reachable node in the second routing table of the slave node is the same as the reference node, the reference node is not a neighbor node of the slave node, and the communication quality of the slave node reaching the reference node through the first neighbor node is better than the communication quality of the slave node reaching the target reachable node through the target next hop route, then the target next hop route in the second routing table of the slave node is updated to the first neighbor node;

[0016] The target next-hop route is a next-hop route from the node to the target reachable node in the second routing table of the slave node.

[0017] Optionally, the method further includes:

[0018] The first node determines a target routing table from the first routing table and the second routing table of the first node, and the second node exists in the reachable nodes of the target routing table;

[0019] If the first node detects that the next hop route to the second node in the target routing table is the same as that of the second node, the first node sends communication data to the second node;

[0020] If the next-hop route is different from the second node, a data transmission instruction and communication data are sent to the next-hop route so that the next-hop route responds to the data transmission instruction and executes the step of determining from the first routing table and the second routing table of the first node that there is a target routing table where a reachable node is the second node, and the first node includes the next-hop route.

[0021] Optionally, the neighbor list of each node is also used to store the role of the neighbor node of the node and the level of the neighbor node; the method further includes:

[0022] After the offline slave node is in an offline state, the third neighbor node is determined from the neighbor list of the offline slave node, the roles of the offline slave node and the third neighbor node are both relay nodes, and the level of the third neighbor node is lower than that of the offline slave node;

[0023] After the offline slave node sends a network access request to the master node through the relay node and accesses the network, the route from the offline slave node to the third neighbor node is stored in the first routing table of the offline slave node, and the route from the offline slave node to the master node is updated, and the relay node at least includes the third neighbor node;

[0024] The relay node stores, in a first routing table of the relay node, routes from the relay node to the offline slave node and to the descendant nodes of the offline slave node.

[0025] Optionally, the neighbor list of each node also stores the communication quality of the neighbor nodes of the node, and the communication quality of the third neighbor node is higher than the communication quality of other neighbor nodes in the neighbor list of the offline slave node.

[0026] Optionally, the method further includes:

[0027] If the offline slave node determines that a neighbor node of the offline slave node has changed after entering the network, the neighbor list and the second routing table of the offline slave node are updated.

[0028] In another aspect, a distribution network is provided, the distribution network comprising: a master node and a plurality of slave nodes;

[0029] The master node is used to update the first routing table of the master node after sending confirmation information of network access to each slave node;

[0030] Each slave node is used to update the first routing table of the slave node if the network access confirmation information is obtained, broadcast the first neighbor list and the first routing table of the slave node after network access, and update the second routing table of the slave node based on the first neighbor list, the first routing table of the slave node, the second neighbor list of the first neighbor node, and the first routing table;

[0031] Among them, the neighbor list stores the neighbor nodes of the node. After the master node and multiple slave nodes are networked, the first routing table of the master node stores the routes from the master node to the descendant nodes; the first routing table of the slave node stores the routes from the slave node to the master node, the parent node and the descendant nodes respectively, and the second routing table of the slave node stores the routes from the slave node to nodes other than the reachable nodes in the first routing table.

[0032] Optionally, each slave node is used to:

[0033] storing in a second routing table a route from the node to a second neighboring node, the second neighboring node being a node in the first neighbor list other than a node reachable from the node in the first routing table;

[0034] For each reference node, if the reference node does not exist in the reachable nodes in the first routing table and the second routing table of the slave node, then the next hop route from the node to the reference node is stored as the first neighbor node in the second routing table of the slave node;

[0035] The reference node is a node in the second neighbor list or a reachable node in the first routing table of the first neighbor node.

[0036] Optionally, each slave node is used to:

[0037] For each reference node, if the target reachable node in the second routing table of the slave node is the same as the reference node, the reference node is not a neighbor node of the slave node, and the communication quality of the slave node reaching the reference node through the first neighbor node is better than the communication quality of the slave node reaching the target reachable node through the target next hop route, then the target next hop route in the second routing table of the slave node is updated to the first neighbor node;

[0038] The target next-hop route is a next-hop route from the node to the target reachable node in the second routing table of the slave node.

[0039] Optionally, the first node is used to:

[0040] Determine a target routing table from the first routing table and the second routing table of the first node, wherein the second node exists in the reachable nodes of the target routing table;

[0041] If it is detected that the next hop route to the second node in the target routing table is the same as the second node, sending communication data to the second node;

[0042] If it is detected that the next-hop route is different from the second node, a data transmission instruction and communication data are sent to the next-hop route so that the next-hop route responds to the data transmission instruction and executes the step of determining from the first routing table and the second routing table of the first node that there is a target routing table where a reachable node is the second node, and the first node includes the next-hop route.

[0043] Optionally, the neighbor list of each node is also used to store the roles and levels of the neighbor nodes of the node; offline slave nodes are used to:

[0044] After being in an offline state, determining a third neighbor node from a neighbor list of the offline slave node, the roles of the offline slave node and the third neighbor node are both relay nodes, and the level of the third neighbor node is lower than that of the offline slave node;

[0045] After sending a network access request to the master node through the relay node and accessing the network, storing the route from the offline slave node to the third neighbor node in the first routing table of the offline slave node, and updating the route from the offline slave node to the master node, the relay node at least includes the third neighbor node;

[0046] The relay node is used to store in the first routing table of the relay node the routes from the relay node to the offline slave node and the descendant nodes of the offline slave node.

[0047] Optionally, the neighbor list of each node also stores the communication quality of the neighbor nodes of the node, and the communication quality of the third neighbor node is higher than the communication quality of other neighbor nodes in the neighbor list of the offline slave node.

[0048] Additional aspects and advantages of the present application will be given in part in the description below, and in part will become apparent from the description below, or will be learned through the practice of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] Figure 1 It is a structural schematic diagram of a distribution network provided in an embodiment of the present application;

[0050] Figure 2 It is a flow chart of a carrier communication routing networking method for distribution network provided in an embodiment of the present application;

[0051] Figure 3 It is a flow chart of a carrier communication routing networking method for distribution network provided in an embodiment of the present application;

[0052] Figure 4 It is a topology diagram of a carrier communication network provided in an embodiment of the present application. DETAILED DESCRIPTION

[0053] Embodiments of the present application are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to be used to explain the present application, and should not be construed as limiting the present application.

[0054] Figure 1 is a schematic diagram of a distribution network structure provided in an embodiment of the present application, and the distribution network may be a low-voltage distribution network. Figure 1 As shown, the distribution network may include a master node 1 and multiple slave nodes. Figure 1 A total of 13 slave nodes are shown, from slave node 2 to slave node 14. The master node 1 and the slave nodes, and the slave nodes and the slave nodes are connected via low-voltage cables. Optionally, the master node 1 may be a node capable of communication, and the plurality of slave nodes may all be electric meters.

[0055] Figure 2 This is a flow chart of a carrier communication routing networking method for a distribution network provided in an embodiment of the present application. The method can be applied to Figure 1 The distribution network shown in Figure 2 As shown, the method includes:

[0056] Step 201: After sending network access confirmation information to each slave node, the master node updates the first routing table of the master node.

[0057] In an embodiment of the present application, after the master node sends confirmation of network access information to each slave node, the master node can dynamically update the first routing table of the master node. After the master node and multiple slave nodes are networked, the first routing table of the master node stores the routes from the master node to the master node's descendant nodes.

[0058] Step 202: For each slave node, if confirmation of network access is received, the first routing table of the slave node is updated, and the first neighbor list and the first routing table of the slave node are broadcast after network access, and the second routing table of the slave node is updated based on the first neighbor list, the first routing table of the slave node, the second neighbor list of the first neighbor node, and the first routing table.

[0059] For each slave node, if confirmation of network access is received, the first routing table of the slave node can be updated, and the first neighbor list and the first routing table of the slave node can be broadcast after network access, and the second routing table of the slave node can be updated based on the first neighbor list, the first routing table of the slave node, the second neighbor list of the first neighbor node, and the first routing table.

[0060] Among them, the first neighbor node can be a neighbor node of the slave node, and the neighbor list is used to store the neighbor nodes of the node. After the master node and multiple slave nodes are networked, the first routing table of the slave node stores the routes from the slave node to the master node, the parent node and the descendant nodes respectively, and the second routing table of the slave node stores the routes from the slave node to nodes other than the reachable nodes in the first routing table.

[0061] In summary, the embodiment of the present application provides a carrier communication routing networking method for a distribution network, in which in the process of networking a master node and multiple slave nodes, after the master node sends confirmation network access information to each slave node, the first routing table of the master node can be dynamically updated. If each slave node receives the confirmation network access information, the first routing table of the slave node can be dynamically updated. The second routing table of the slave node can be dynamically updated based on the first neighbor list of the slave node, the first routing table of the slave node, the second neighbor list broadcast by the first neighbor node, and the first routing table, thereby improving the flexibility of routing networking.

[0062] After the master node and multiple slave nodes are networked, the first routing table of each slave node stores the routes from the slave node to the master node, the parent node, and the descendant nodes, and the second routing table of the slave node stores the routes from the slave node to nodes other than the reachable nodes in the first routing table. Therefore, based on the first routing table and the second routing table, two slave nodes can communicate without passing through the master node, thereby realizing horizontal communication between slave nodes and improving the efficiency of communication between slave nodes.

[0063] Figure 3 is a flowchart of another carrier communication routing networking method for distribution network provided in an embodiment of the present application, which can be applied to Figure 1 The distribution network shown in Figure 3 As shown, the method may include:

[0064] Step 301: After sending network access confirmation information to each slave node, the master node updates the first routing table of the master node.

[0065] After sending network access confirmation information to each slave node, the master node can update the first routing table of the master node. After the master node and multiple slave nodes are networked, the first routing table of the master node stores the routes from the master node to its descendant nodes.

[0066] In the embodiment of the present application, during the networking process of the master node and multiple slave nodes, for each slave node, after receiving the network access request sent by the slave node, if the slave node is authenticated, the master node can send confirmation network access information to the slave node. Afterwards, the master node can store the route from the master node to the slave node in the first routing table of the master node, thereby updating the first routing table of the master node.

[0067] Optionally, if the network access request of the slave node is sent directly from the slave node to the master node, the master node may store the next hop route from the master node to the slave node as the slave node in the first routing table of the master node after sending the network access confirmation information to the slave node. The slave node may be located within the communication range of the master node, and the network access request is sent by the slave node after receiving the beacon frame broadcast by the master node.

[0068] Example, reference Figure 1 and Figure 4 , slave node 2 is within the communication range of master node 1. After receiving the beacon frame broadcast by master node 1, slave node 2 can send a network access request to master node 1. If master node 1 authenticates slave node 2, it can send network access confirmation information to slave node 2. Then, master node 1 can store the route from master node 1 to slave node 2 in the first routing table of master node 1, thereby updating the first routing table of master node 1.

[0069] If the network access request of the slave node is forwarded to the master node through the first relay node, the master node may store the next hop route from the master node to the slave node as a reference relay node in the first-level slave node in the first routing table of the master node after sending the network access confirmation information to the slave node through the first relay node. The first relay node may include a reference relay node in the first-level slave node, and the reference relay node is a node that directly communicates with the master node.

[0070] refer to Figure 4 , taking slave node 9 as an example, the first relay node includes slave node 2 and slave node 6, and slave node 2 is the reference relay node in the first-level slave nodes, and the network access request of slave node 9 is forwarded to master node 1 through the first relay node. After master node 1 sends the network access confirmation information to slave node 9 through the first relay node, the next hop route from master node 1 to slave node 9 can be stored as slave node 2 in the first routing table of master node 1.

[0071] Step 302: For each slave node, a beacon frame is broadcast after joining the network, and after obtaining the network entry confirmation information, the first routing table of the slave node is updated.

[0072] For each slave node, a beacon frame is broadcast after entering the network, and after obtaining the network entry confirmation information, the first routing table of the slave node is updated.

[0073] In the process of dynamic networking between the master node and multiple slave nodes, after obtaining the confirmation information of network access, the slave node can dynamically update the first routing table, so that after all nodes are connected to the network, the first routing table of the slave node can store the routes from the slave node to the master node, the parent node and the descendant node respectively. It should be noted that if the slave node is a leaf node after entering the network, the route of the descendant node in the first routing table of the slave node can be empty.

[0074] It can be understood that obtaining the network access confirmation information from the slave node may refer to the slave node receiving the network access confirmation information or forwarding the network access confirmation information. If the slave node receives the network access confirmation information, the slave node is the node requesting network access, that is, the network access request sent to the master node is initiated by the slave node. If the slave node forwards the network access confirmation information, the slave node is not the node requesting network access, and the slave node is used to forward the network access confirmation information to the node requesting network access.

[0075] If the slave node receives the network access confirmation information, the slave node can store the routes from the slave node to the master node and the parent node in the first routing table. If the slave node forwards the network access confirmation information, the slave node can store the route from the slave node to the node that initiated the network access request in the first routing table.

[0076] Optionally, if the node initiating the network access request is a child node of the slave node, the slave node stores in the first routing table the next hop route from the node to the node initiating the network access request as the node initiating the network access request. If the node initiating the network access request is not a child node of the slave node, the slave node stores in the first routing table the next hop route from the node to the node initiating the network access request as the next node forwarding the network access confirmation information, thereby implementing the storage of routes from the node to descendant nodes in the first routing table.

[0077] Since the master node and the slave nodes after joining the network will broadcast beacon frames, for each slave node, after receiving the beacon frame broadcast by the Nth level node in the carrier communication network, it can send a network access request to the master node, and after receiving the network access confirmation information sent by the master node, the first routing table of the slave node can be updated, where N is an integer greater than or equal to 0, and the master node is the 0th level node in the carrier communication network.

[0078] After the master node broadcasts the beacon frame, the slave node within the communication range of the master node can directly send a network access request to the master node after receiving the beacon frame broadcast by the master node. After the master node authenticates the slave node, it can directly send a network access confirmation message to the slave node. After the slave node enters the network, it is the first-level node in the carrier communication network, that is, N is 1.

[0079] Correspondingly, after receiving the network access confirmation information sent by the master node, the slave node can store the routes from the slave node to the master node and the parent node respectively in the first routing table of the slave node, and the parent node of the slave node is the master node.

[0080] Optionally, the slave node stores in the first routing table of the slave node the next hop routes from the slave node to the master node and the parent node, both of which are the master node, thereby updating the first routing table of the slave node.

[0081] Assume that the identifier of the master node 1 is 1, the identifier of the slave node 2 is 2, and the slave node 2 is located within the communication range of the master node 1. Table 1 shows the first routing table of the slave node 2, which may include the identifier of the reachable node and the identifier of the next hop route. The reachable node is a node that the slave node can reach, for example, the reachable node includes the master node, the parent node of the slave node, and the descendant node. The next hop route is the node that the slave node needs to pass through to reach the reachable node.

[0082] refer to Figure 1 , Figure 4 As shown in Table 1, after receiving the network access confirmation information sent by the master node 1, the slave node 2 can store in the first routing table of the slave node 1 that the routes from the slave node 2 to the master node 1 and the parent node are both 1, that is, the next hop routes from the slave node 2 to the master node 1 and the parent node are both master node 1.

[0083] Table 1

[0084] Identification of reachable nodes The identifier of the next hop route 1 1 5 5 6 6 9 6 10 6 11 6

[0085] After receiving the beacon frame broadcast by the N-1th level node, the slave node can send a network access request to the master node through the first relay node, and after receiving the network access confirmation information sent by the master node through the first relay node, store the routes from the slave node to the master node and the parent node respectively in the first routing table of the slave node.

[0086] Among them, after joining the network, the slave node is the Nth level node in the carrier communication network, and the parent node of the slave node is the target node in the N-1th level node, and the target node is the node in the N-1th level node with the best communication quality with the slave node. For example, if N is equal to 2, the first relay node may include the target node in the N-1th level node. If N is greater than 2, the first relay node includes the target node in the N-1th level node, and the node that forwards the network access confirmation information to the target node.

[0087] There may be multiple N-1th level nodes. After receiving the beacon frame broadcast by the N-1th level node, the slave node may select the target node with the best communication quality from the N-1th level nodes as the parent node.

[0088] After forwarding the network access confirmation information, the first relay node may store the route from the first relay node to the slave node in a first routing table of the first relay node.

[0089] Example, reference Figure 4 After receiving the beacon frame broadcasted by the second-level node (the second-level node may include slave node 6 and slave node 7), slave node 10 may select slave node 6 as the parent node from the slave node 6 and slave node 7, and send a network access request to master node 1 through the first relay node (i.e., slave node 6 and slave node 2). After receiving the network access confirmation information sent by master node 1 through the first relay node, the routes from slave node 10 to master node 1 and the parent node (i.e., slave node 6) are stored in the first routing table of slave node 10.

[0090] After slave node 2 forwards the network access confirmation information to slave node 6, it can store the next hop route from node 2 to slave node 10 as slave node 6 in the first routing table of slave node 2. After slave node 6 sends the network access confirmation information to slave node 10, it can store the next hop route from node 6 to slave node 10 as slave node 10 in the first routing table of slave node 6.

[0091] Step 303: For each slave node, broadcast the first neighbor list and the first routing table of the slave node after joining the network, and update the second routing table of the slave node based on the first neighbor list, the first routing table of the slave node, the second neighbor list of the first neighbor node and the first routing table.

[0092] After joining the network, the slave node can broadcast its first neighbor list and first routing table, and update the slave node's second routing table based on the first neighbor list, the slave node's first routing table, the received first neighbor node's second neighbor list and the first routing table.

[0093] The first neighbor list is used to store neighbor nodes of the slave node, and the second neighbor list is used to store neighbor nodes of the first neighbor node. The second routing table of the slave node is used to store routes from the node to other nodes in the carrier communication network, and the other nodes are nodes in the carrier communication network other than the reachable nodes in the first routing table of the slave node.

[0094] In an embodiment of the present application, each slave node may broadcast the first neighbor list and the first routing table of the slave node in real time or periodically after joining the network.

[0095] Optionally, the beacon frame broadcast by each slave node may carry the identifier of the slave node. After receiving the beacon frame, each slave node may determine the slave node broadcasting the beacon frame as a neighbor node, thereby generating a first neighbor list of the slave node.

[0096] In an embodiment of the present application, after generating a first neighbor list, the slave node may store a route from the node to a second neighbor node in a second routing table, wherein the second neighbor node is a node in the first neighbor list other than a reachable node in the first routing table of the slave node.

[0097] After receiving the second neighbor list and the first routing table of the first neighbor node, the slave node can sequentially obtain the nodes in the second neighbor list and the reachable nodes in the first routing table of the first neighbor node. For each reference node obtained, the slave node can respectively detect whether the reference node exists in the reachable nodes in the first routing table and the second routing table of the slave node.

[0098] If there is no reference node in the reachable nodes in the first routing table and the second routing table of the slave node, the next hop route from the node to the reference node can be stored as the first neighbor node in the second routing table of the slave node, thereby updating the second routing table. The reference node can be a node in the second neighbor list or a reachable node in the first routing table of the first neighbor node.

[0099] If the target reachable node in the second routing table of the slave node is the same as the reference node, the reference node is not a neighbor node of the slave node, and the communication quality from the slave node to the reference node through the first neighbor node is better than the communication quality from the slave node to the target reachable node through the target next-hop route, then the next-hop route from the slave node to the target reachable node in the second routing table of the slave node can be updated to the first neighbor node.

[0100] The target reachable node being the same as the reference node means that the target reachable node and the reference node are the same node, and the target next-hop route may be a next-hop route from the node to the target reachable node in the second routing table of the slave node.

[0101] In the case where the slave node can reach the reference node via both the first neighbor node and the target next-hop route, the slave node can select a node with good communication quality as the next-hop route to reach the reference node, thereby improving the efficiency of communication between nodes.

[0102] If there is a reference node among the reachable nodes in the first routing table of the slave node, and there is no reference node in the second routing table of the slave node, there is no need to store the reference node. If there is no reference node among the reachable nodes in the first routing table of the slave node, and there is a reference node in the second routing table of the slave node, and the reference node is a neighbor node of the slave node, there is no need to store the reference node.

[0103] It is understandable that, in the process of networking the master node and the slave node, the slave node can dynamically update the first neighbor list according to the received beacon frame. And because the first routing table of each slave node is also dynamically updated, the slave node can dynamically update the second routing table of the slave node based on the first neighbor list, the first routing table of the slave node, the received second neighbor list of the first neighbor node, and the first routing table.

[0104] refer to Figure 4 , if slave node 2, slave node 3, slave node 4, slave node 5, slave node 6 and slave node 7 have all been connected to the network. Taking the generation of the second routing table of slave node 7 as an example, slave node 3, slave node 4 and slave node 6 are all the first neighbor nodes of slave node 7.

[0105] Among them, the second neighbor list of slave node 3 may include master node 1, slave node 2 and slave node 4, and the first routing table of slave node 3 may include {{1,1}}, the first 1 represents a reachable node, and the second 1 represents the next hop route from node 3 to the reachable node (i.e., master node 1). The second neighbor list of slave node 4 may include master node 1, slave node 3 and slave node 7, and the first routing table of slave node 4 may include {{1,1},{7,7}}. The second neighbor list of slave node 6 may include slave node 2 and slave node 5, and the first routing table of slave node 6 may include {{1,2},{2,2}}. The first neighbor list of slave node 7 may include slave node 3, slave node 4 and slave node 6, and the first routing table of slave node 7 may include {{1,4},{4,4}}.

[0106] After slave node 7 joins the network, since slave node 4 is a reachable node in the first routing table of slave node 7, slave node 7 can determine slave node 3 and slave node 6 in the first neighbor list as second neighbor nodes, and store the routes from slave node 7 to slave node 3 and slave node 6 respectively in the second routing table.

[0107] Afterwards, if slave node 7 receives the second neighbor list and the first routing table of slave node 3, the second neighbor list of slave node 3 may include master node 1, slave node 2 and slave node 4, and the first routing table may include {{1,1}}. Then, after the reference node obtained is slave node 2, since slave node 2 does not exist in the reachable nodes in the first routing table and the second routing table of slave node 7, the next hop route to slave node 2 can be stored in the second routing table as slave node 3.

[0108] If slave node 7 receives the second neighbor list and the first routing table of slave node 6, the second neighbor list of slave node 6 may include slave node 2 and slave node 5, and the first routing table of slave node 6 may include {{1,2},{2,2}}, then after the reference node obtained is slave node 2, since the target reachable node (i.e., slave node 2) of the second routing table of slave node 7 is the same as the reference node (i.e., slave node 2), reference node 2 is not a neighbor node of slave node 7, and the communication quality from slave node 7 to reference node 2 through the first neighbor node (i.e., slave node 6) is better than the communication quality from node 7 to the target reachable node (i.e., slave node 2) through the target next hop route (i.e., slave node 3). Therefore, slave node 7 can update the next hop route from node 7 to the target reachable node (i.e., slave node 2) in the second routing table of slave node 7 to the first neighbor node (i.e., slave node 6). Table 2 shows the second routing table of slave node 7, and it can be seen from Table 2 that the next hop route from node 7 to slave node 2 is slave node 6.

[0109] Table 2

[0110] Identification of reachable nodes The identifier of the next hop route 2 6 3 3 5 6 6 6 8 8 9 6 10 6 11 6

[0111] Step 304: The first node determines from the first routing table and the second routing table of the first node that there is a target routing table where the reachable node is the second node.

[0112] After the master node and multiple slave nodes are connected to the network, during the communication between the first node and the second node, the first node can determine the target routing table from the first routing table and the second routing table of the first node, wherein the second node exists in the reachable nodes of the target routing table.

[0113] The first node may be a node that initially initiates a communication request and sends communication data to the second node, or the first node may be a next-hop router that responds to a data transmission instruction and forwards communication data.

[0114] Step 305: The first node detects whether the next hop route to the second node in the target routing table is the same as the second node.

[0115] After the first node determines the target routing table from the first routing table and the second routing table of the first node, it can detect whether the next hop route to the second node in the target routing table is the same as the second node. If the next hop route to the second node in the target routing table is the same as the second node, step 306 can be executed. If the next hop route to the second node in the target routing table is different from the second node, step 307 can be executed.

[0116] Step 306: The first node sends communication data to the second node.

[0117] If the first node detects that the next hop route to the second node in the target routing table is the same as that of the second node, the first node may send communication data to the second node, thereby achieving communication with the second node.

[0118] Step 307: The first node sends a data transmission instruction and communication data to the next hop router.

[0119] If the first node detects that the next hop route is different from the second node, it can send a data transmission instruction and communication data to the next hop route, so that the next hop route responds to the data transmission instruction and executes the above step 304. That is, the next hop route executes the above step 304 as the first node.

[0120] Therefore, during the communication process, the two slave nodes do not need to forward the communication data through the master node, thereby improving the communication efficiency.

[0121] Example, reference Figure 4 , if the first node is slave node 7, and the second node is slave node 2, if slave node 7 determines that the reachable nodes of the second routing table of slave node 7 include slave node 2, and the next hop route is slave node 3, then slave node 7 can send a data transmission instruction and communication data to slave node 3. In response to the data transmission instruction, if slave node 3 determines that the reachable nodes of the second routing table of slave node 3 include slave node 2, and the next hop route is slave node 2, then communication data can be sent to the slave node 2. In this way, communication between slave node 7 and slave node 2 is achieved.

[0122] When all slave nodes are connected to the network, the leaf nodes in the carrier communication network can periodically generate heartbeat messages, which are aggregated to the master node through relay nodes step by step, so that the master node can promptly sense whether the nodes in the network are online.

[0123] In the embodiment of the present application, for each slave node, if no beacon frame is received within a preset time, or the communication success rate with the parent node is 0, the slave node is in an offline state. After being in an offline state, the offline slave node needs to re-network, and the process of re-networking the offline slave node can include the following steps A1 to A3.

[0124] A1. After being in an offline state, the offline slave node can determine a third neighbor node from the neighbor list of the offline slave node.

[0125] The neighbor list of each node is also used to store the roles and levels of the neighbor nodes of the node. The role of the offline slave node is a relay node, and the level of the offline slave node is greater than 1. The role of the third neighbor node is a relay node, and the level of the third neighbor node is lower than the level of the offline slave node, that is, the level of the third neighbor node is lower than or equal to the level of the parent node of the offline slave node. For example, if the level of the offline slave node is 3, the level of the third neighbor node can be 2. Reference Figure 4 , the offline slave node may be slave node 6, and the third neighbor node may be slave node 4.

[0126] Optionally, the neighbor list of each node also stores the communication quality of the node's neighbor nodes, and the communication quality of the third neighbor node is higher than the communication quality of other neighbor nodes in the neighbor list, thereby improving the efficiency of the offline slave node communicating with other nodes after joining the network.

[0127] A2. After the offline slave node sends a network access request to the master node through the second relay node and accesses the network, the route from the offline slave node to the third neighbor node is stored in the first routing table of the offline slave node, and the route from the offline slave node to the master node is updated.

[0128] After the offline slave node sends a network access request to the master node through the second relay node and accesses the network, the route from the offline slave node to the third neighbor node is stored in the first routing table of the offline slave node, and the route from the offline slave node to the master node is updated. The second relay node may at least include the third neighbor node.

[0129] Optionally, the offline slave node may update the route from the offline slave node to the master node to a third neighbor node.

[0130] A3. The second relay node stores, in the first routing table of the second relay node, the routes from the second relay node to the offline slave node and the descendant nodes of the offline slave node.

[0131] After forwarding the network access confirmation information sent by the master node, the second relay node may store the routes from the second relay node to the offline slave node and the descendant nodes of the offline slave node in the first routing table of the second relay node.

[0132] The network access request sent by the offline slave node to the master node through the second relay node can carry the descendant nodes of the offline slave node. Therefore, only the offline slave node needs to be re-networked, and the descendant nodes of the offline slave node do not need to be re-networked, thus realizing rapid routing reconstruction.

[0133] A4. After the offline slave node is connected to the network, if it is determined that the neighbor node of the offline slave node has changed, the neighbor list of the offline slave node is updated.

[0134] If the offline slave node determines that a neighbor node of the offline slave node has changed after entering the network, the neighbor list and the second routing table of the offline slave node are updated.

[0135] Optionally, the process of updating the second routing table from the offline slave node may refer to the above step 303, which will not be described in detail in the embodiment of the present application.

[0136] It can be understood that after the master node and multiple slave nodes are networked, each slave node can also broadcast beacon frames, periodically update the first neighbor list based on the received beacon frames, and can periodically update the second routing table based on the first neighbor list, the first routing table of the slave node, the received second neighbor list of the neighbor node and the first routing table.

[0137] In summary, the embodiment of the present application provides a carrier communication routing networking method for a distribution network, in which in the process of networking a master node and multiple slave nodes, the master node can dynamically update the first routing table of the master node after sending confirmation access information to each slave node. If each slave node receives the confirmation access information, the first routing table of the slave node can be dynamically updated, and the second routing table of the slave node can be dynamically updated based on the first neighbor list of the slave node, the first routing table of the slave node, the second neighbor list broadcast by the first neighbor node, and the first routing table, thereby improving the flexibility of routing networking.

[0138] After the master node and multiple slave nodes are networked, the first routing table of each slave node stores the routes from the slave node to the master node, the parent node, and the descendant nodes, and the second routing table of the slave node stores the routes from the slave node to nodes other than the reachable nodes in the first routing table. Therefore, based on the first routing table and the second routing table, two slave nodes can communicate without passing through the master node, thereby realizing horizontal communication between slave nodes and improving the efficiency of communication between slave nodes.

[0139] The present application embodiment provides a power distribution network, such as Figure 1 As shown, the distribution network includes: the distribution network includes a master node and multiple slave nodes.

[0140] The master node is used to update the first routing table of the master node after sending network access confirmation information to each slave node.

[0141] Each slave node is used to update the first routing table of the slave node if the network access confirmation information is obtained, broadcast the first neighbor list and the first routing table of the slave node after accessing the network, and update the second routing table of the slave node based on the first neighbor list, the first routing table of the slave node, the second neighbor list of the first neighbor node and the first routing table.

[0142] Among them, the neighbor list stores the neighbor nodes of the node. After the master node and multiple slave nodes are networked, the first routing table of the master node stores the routes from the master node to the descendant nodes; the first routing table of the slave node stores the routes from the slave node to the master node, the parent node and the descendant nodes respectively, and the second routing table of the slave node stores the routes from the slave node to nodes other than the reachable nodes in the first routing table.

[0143] Optionally, each slave node is used to:

[0144] The route from the node to the second neighbor node is stored in the second routing table. The second neighbor node is a node in the first neighbor list other than the node reachable in the first routing table from the node.

[0145] For each reference node, if the reference node does not exist in the reachable nodes in the first routing table and the second routing table of the slave node, the next hop route from the node to the reference node is stored as the first neighbor node in the second routing table of the slave node.

[0146] The reference node is a node in the second neighbor list or a reachable node in the first routing table of the first neighbor node.

[0147] Optionally, each slave node is used to:

[0148] For each reference node, if the target reachable node in the second routing table of the slave node is the same as the reference node, the reference node is not a neighbor node of the slave node, and the communication quality from the slave node to the reference node through the first neighbor node is better than the communication quality from the slave node to the target reachable node through the target next-hop route, then the target next-hop route in the second routing table of the slave node is updated to the first neighbor node.

[0149] The target next-hop route is a next-hop route from the node to the target reachable node in the second routing table of the slave node.

[0150] Optionally, the first node is used to:

[0151] A target routing table is determined from the first routing table and the second routing table of the first node, and the second node exists in the reachable nodes of the target routing table.

[0152] If it is detected that the next hop route to the second node in the target routing table is the same as the second node, the communication data is sent to the second node.

[0153] If it is detected that the next-hop route is different from the second node, a data transmission instruction and communication data are sent to the next-hop route so that the next-hop route responds to the data transmission instruction and executes the step of determining from the first routing table and the second routing table of the first node that there is a target routing table where a reachable node is the second node, and the first node includes the next-hop route.

[0154] Optionally, the neighbor list of each node is also used to store the roles and levels of the neighbor nodes of the node; offline slave nodes are used to:

[0155] After being in an offline state, a third neighbor node is determined from the neighbor list of the offline slave node, the role of the offline slave node is a relay node, the role of the third neighbor node is a relay node, and the level of the third neighbor node is lower than the level of the offline slave node.

[0156] After sending a network access request to the master node through the relay node and accessing the network, the route from the offline slave node to the second neighbor node is stored in the first routing table of the offline slave node, and the route from the offline slave node to the master node is updated. The relay node includes at least the second neighbor node.

[0157] The relay node is used to store in the first routing table of the relay node the routes from the relay node to the offline slave node and the descendant nodes of the offline slave node.

[0158] Optionally, the neighbor list of each node also stores the communication quality of the neighbor nodes of the node, and the communication quality of the third neighbor node is higher than the communication quality of other neighbor nodes in the neighbor list.

[0159] In summary, the embodiment of the present application provides a power distribution network, in which in the process of networking of a master node and multiple slave nodes, the master node can dynamically update the first routing table of the master node after sending confirmation network access information to each slave node. If each slave node receives the confirmation network access information, the first routing table of the slave node can be dynamically updated, and the second routing table of the slave node can be dynamically updated based on the first neighbor list of the slave node, the first routing table of the slave node, the second neighbor list broadcast by the first neighbor node, and the first routing table, thereby improving the flexibility of routing networking.

[0160] After the master node and multiple slave nodes are networked, the first routing table of each slave node stores the routes from the slave node to the master node, the parent node, and the descendant nodes, and the second routing table of the slave node stores the routes from the slave node to nodes other than the reachable nodes in the first routing table. Therefore, based on the first routing table and the second routing table, two slave nodes can communicate without passing through the master node, thereby realizing horizontal communication between slave nodes and improving the efficiency of communication between slave nodes.

[0161] It should be noted that the logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as a sequenced list of executable instructions for implementing logical functions, and can be specifically implemented in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute instructions), or in combination with these instruction execution systems, devices or apparatuses. For the purposes of this specification, "computer-readable medium" can be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in combination with these instruction execution systems, devices or apparatuses. More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection portion with one or more wirings (electronic device), a portable computer disk box (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be paper or other suitable medium on which the program is printed, since the program may be obtained electronically, for example, by optically scanning the paper or other medium and then editing, interpreting or processing in other suitable ways if necessary, and then stored in a computer memory.

[0162] It should be understood that the various parts of the present application can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, multiple steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0163] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.

[0164] In addition, the terms "first", "second", etc. used in the embodiments of the present application are only used for descriptive purposes and should not be understood as indicating or implying relative importance, or implicitly indicating the number of technical features indicated in the present embodiment. Therefore, the features defined by the terms "first", "second", etc. in the embodiments of the present application can explicitly or implicitly indicate that at least one of the features is included in the embodiment. In the description of the present application, the word "multiple" means at least two or two or more, such as two, three, four, etc., unless otherwise clearly and specifically defined in the embodiments.

[0165] In this application, unless otherwise clearly specified or limited in the embodiments, the terms "installed", "connected", "connected" and "fixed" etc. appearing in the embodiments should be understood in a broad sense. For example, the connection can be a fixed connection, a detachable connection, or an integrated connection. It can be understood that it can also be a mechanical connection, an electrical connection, etc.; of course, it can also be a direct connection, or an indirect connection through an intermediate medium, or it can be the internal connection of two elements, or the interaction relationship between two elements. For ordinary technicians in this field, the specific meanings of the above terms in this application can be understood according to the specific implementation situation.

[0166] Although the embodiments of the present application have been shown and described above, it can be understood that the above embodiments are exemplary and cannot be understood as limitations on the present application. Ordinary technicians in this field can change, modify, replace and modify the above embodiments within the scope of the present application.

Claims

1. A carrier communication routing networking method for a distribution network, characterized in that: Applied to the power distribution network, the power distribution network includes a master node and a plurality of slave nodes, the method includes: After the master node sends network access confirmation information to each of the slave nodes, the master node updates the first routing table of the master node; For each of the slave nodes, if the network access confirmation information is obtained, the first routing table of the slave node is updated, the first neighbor list and the first routing table of the slave node are broadcast after network access, and the second routing table of the slave node is updated based on the first neighbor list, the first routing table of the slave node, the second neighbor list of the first neighbor node, and the first routing table; Among them, the neighbor list stores the neighbor nodes of the node, and after the master node and multiple slave nodes are networked, the first routing table of the master node stores the route of the master node to the descendant nodes; the first routing table of the slave node stores the routes of the slave node to the master node, the parent node and the descendant nodes respectively, and the second routing table of the slave node stores the routes of the slave node to nodes other than the reachable nodes in the first routing table.

2. The method according to claim 1, characterized in that Updating the second routing table of the slave node based on the first neighbor list, the first routing table of the slave node, the second neighbor list of the first neighbor node, and the first routing table includes: storing in the second routing table the route from the slave node to the second neighbor node, where the second neighbor node is a node in the first neighbor list other than the node reachable in the first routing table of the slave node; For each reference node, if the reference node does not exist in any of the reachable nodes in the first routing table and the second routing table of the slave node, then storing in the second routing table of the slave node the next hop route from the slave node to the reference node as the first neighbor node; The reference node is a node in the second neighbor list or a reachable node in the first routing table of the first neighbor node.

3. The method according to claim 2, characterized in that The method further comprises: For each of the reference nodes, if the target reachable node in the second routing table of the slave node is the same as the reference node, the reference node is not a neighbor node of the slave node, and the communication quality of the slave node reaching the reference node through the first neighbor node is better than the communication quality of the slave node reaching the target reachable node through the target next-hop route, then the target next-hop route in the second routing table of the slave node is updated to the first neighbor node; The target next-hop route is the next-hop route from the slave node to the target reachable node in the second routing table of the slave node.

4. The method according to any one of claims 1 to 3, characterized in that: The method further comprises: The first node determines a target routing table from the first routing table and the second routing table of the first node, where the second node exists in the reachable nodes of the target routing table; If the first node detects that the next hop route to the second node in the target routing table is the same as that of the second node, the first node sends communication data to the second node; If the next-hop route is different from the second node, a data transmission instruction and the communication data are sent to the next-hop route so that the next-hop route responds to the data transmission instruction and executes the step of determining from the first routing table and the second routing table of the first node that there is a target routing table where a reachable node is the second node, and the first node includes the next-hop route.

5. The method according to any one of claims 1 to 3, characterized in that: The neighbor list of each node is also used to store the roles of the neighbor nodes of the node and the levels of the neighbor nodes; The method further comprises: After the offline slave node is in an offline state, determining a third neighbor node from a neighbor list of the offline slave node, the roles of the offline slave node and the third neighbor node are both relay nodes, and the level of the third neighbor node is lower than that of the offline slave node; After the offline slave node sends a network access request to the master node through the relay node and accesses the network, the route from the offline slave node to the third neighbor node is stored in the first routing table of the offline slave node, and the route from the offline slave node to the master node is updated, and the relay node at least includes the third neighbor node; The relay node stores, in a first routing table of the relay node, routes from the relay node to the offline slave node and to descendant nodes of the offline slave node.

6. The method according to claim 5, characterized in that The neighbor list of each node also stores the communication quality of the neighbor nodes of the node, and the communication quality of the third neighbor node is higher than the communication quality of other neighbor nodes in the neighbor list of the offline slave node.

7. The method according to claim 5, characterized in that The method further comprises: If the offline slave node determines that a neighbor node of the offline slave node changes after joining the network, the neighbor list and the second routing table of the offline slave node are updated.

8. A distribution network, characterized in that: The distribution network comprises: a master node and a plurality of slave nodes; The master node is used to update the first routing table of the master node after sending confirmation network access information to each of the slave nodes; Each of the slave nodes is configured to update the first routing table of the slave node if the network access confirmation information is obtained, broadcast the first neighbor list and the first routing table of the slave node after network access, and update the second routing table of the slave node based on the first neighbor list, the first routing table of the slave node, the second neighbor list of the first neighbor node, and the first routing table; Among them, the neighbor list stores the neighbor nodes of the node, and after the master node and multiple slave nodes are networked, the first routing table of the master node stores the route of the master node to the descendant nodes; the first routing table of the slave node stores the routes of the slave node to the master node, the parent node and the descendant nodes respectively, and the second routing table of the slave node stores the routes of the slave node to nodes other than the reachable nodes in the first routing table.

9. The power distribution network according to claim 8, characterized in that: Each of the slave nodes is used for: storing in the second routing table the route from the slave node to the second neighbor node, where the second neighbor node is a node in the first neighbor list other than the node reachable in the first routing table of the slave node; For each reference node, if the reference node does not exist in any of the reachable nodes in the first routing table and the second routing table of the slave node, then storing in the second routing table of the slave node the next hop route from the slave node to the reference node as the first neighbor node; The reference node is a node in the second neighbor list or a reachable node in the first routing table of the first neighbor node.

10. The power distribution network according to claim 9, characterized in that: Each of the slave nodes is used for: For each of the reference nodes, if the target reachable node in the second routing table of the slave node is the same as the reference node, the reference node is not a neighbor node of the slave node, and the communication quality of the slave node reaching the reference node through the first neighbor node is better than the communication quality of the slave node reaching the target reachable node through the target next-hop route, then the target next-hop route in the second routing table of the slave node is updated to the first neighbor node; The target next-hop route is the next-hop route from the slave node to the target reachable node in the second routing table of the slave node.

11. The power distribution network according to any one of claims 8 to 10, characterized in that: The first node is used to: Determine a target routing table from the first routing table and the second routing table of the first node, wherein the second node exists in the reachable nodes of the target routing table; If it is detected that the next hop route to the second node in the target routing table is the same as the second node, sending communication data to the second node; If it is detected that the next-hop route is different from the second node, a data transmission instruction and the communication data are sent to the next-hop route, so that the next-hop route responds to the data transmission instruction and executes the step of determining from the first routing table and the second routing table of the first node that there is a target routing table where the reachable node is the second node, and the first node includes the next-hop route.

12. The power distribution network according to any one of claims 8 to 10, characterized in that: The neighbor list of each node is also used to store the roles of the neighbor nodes of the node and the levels of the neighbor nodes; the offline slave node is used to: After being in an offline state, determining a third neighbor node from a neighbor list of the offline slave node, the roles of the offline slave node and the third neighbor node are both relay nodes, and the level of the third neighbor node is lower than that of the offline slave node; After sending a network access request to the master node through the relay node and accessing the network, storing a route from the offline slave node to the third neighbor node in a first routing table of the offline slave node, and updating a route from the offline slave node to the master node, the relay node at least including the third neighbor node; The relay node is used to store in a first routing table of the relay node the routes from the relay node to the offline slave node and the descendant nodes of the offline slave node.

13. The power distribution network according to claim 12, characterized in that: The neighbor list of each node also stores the communication quality of the neighbor nodes of the node, and the communication quality of the third neighbor node is higher than the communication quality of other neighbor nodes in the neighbor list of the offline slave node.

Images