A method for constructing a routing table and a carrier communication system

Abstract

The present invention provides a routing table construction method and a carrier communication system, including: receiving an access request frame; sending the access request frame to a superior node; receiving an access confirmation frame, where the access confirmation frame includes a first proxy node TEI and a requesting node TEI, and the first proxy node TEI is the TEI of the direct proxy node of the requesting node; if the first proxy node TEI is different from the TEI of the slave node, adding the requesting node TEI as a secondary tree node to the routing table of the slave node to form an updated routing table, the routing table being a two-layer tree structure including a primary tree node and a secondary tree node, the primary tree node corresponding to the TEI of the lower-layer sub-nodes directly proxied by the slave node, and the secondary tree node corresponding to the TEI of the lower-layer sub-nodes indirectly proxied by the slave node; sending an access confirmation frame to the node corresponding to the first proxy node TEI according to the routing table. The present invention simplifies the complexity of the routing table of the proxy node.

Description

Technical Field

[0001] The present invention relates to the field of communications, and in particular to a method for constructing a routing table and a carrier communication system. Background Art

[0002] Medium voltage (10KV) carrier communication is a communication network established based on a master-slave relationship. The master node, as the routing management node in the network, needs to construct a complete routing table in its software. At the same time, it updates and maintains the routing table according to the hierarchy of the slave nodes in the network and the changes in the access paths, and updates the routing table to the proxy node in a timely manner; when the role of the slave node is a proxy node, it needs to pass through the routing tables of all slave nodes that access the network through the proxy, and needs to forward the data of the slave nodes in the routing table in real time according to the routing table during communication.

[0003] When the carrier network changes greatly, the access path of the slave node will continuously change the access path through the proxy according to the network environment. This results in a complex and cumbersome routing table for the proxy node. The complexity of the routing table leads to a slow update of the routing table, and the routing table stored in the node needs to be updated in a timely manner to ensure the correctness of the data forwarding path, so as to ensure that the data can be transmitted to the target node in a timely manner.

[0004] Therefore, how to solve the problem of the complex and cumbersome routing table has become a technical problem that needs to be solved urgently by those skilled in the art and the focus of continuous research. Summary of the Invention

[0005] A first aspect of the present invention provides a method for constructing a routing table, which is applied to a slave node and includes: receiving an access request frame; sending the access request frame to a superior node; receiving an access confirmation frame, where the access confirmation frame includes a first proxy node terminal endpoint identifier and a request node terminal endpoint identifier, and the first proxy node terminal endpoint identifier is the terminal endpoint identifier of the direct proxy node of the request node; if the first proxy node terminal endpoint identifier is different from the terminal endpoint identifier of the slave node, adding the request node terminal endpoint identifier as a secondary tree node to the routing table of the slave node to form an updated routing table. The routing table is a two-layer tree structure, including a primary tree node and a secondary tree node. The primary tree node corresponds to the terminal endpoint identifier of the lower-level sub-node directly proxied by the slave node, and the secondary tree node corresponds to the terminal endpoint identifier of the lower-level sub-node indirectly proxied by the slave node; sending the access confirmation frame to the node corresponding to the first proxy node terminal endpoint identifier according to the routing table.

[0006] The beneficial effects are as follows: In the routing table construction method provided by the embodiments of the present invention, during the data forwarding process, when a slave node receives an access confirmation frame, the access confirmation frame carries the terminal endpoint identifier of the requesting node and the terminal endpoint identifier of the direct proxy node of the requesting node. During the forwarding process of the access request frame by each slave node in the carrier communication system, the respective routing tables are updated according to the information in the access request frame. The routing table of the proxy node is a two-layer tree structure, including a first-level tree node and a second-level tree node. The first-level tree node corresponds to the terminal endpoint identifier of the lower-layer sub-node directly proxied by the slave node, and the second-level tree node corresponds to the terminal endpoint identifier of the lower-layer sub-node indirectly proxied by the slave node. The routing table of the proxy node of the present invention only stores the terminal endpoint identifier of the next-level direct connection node of the device and the terminal endpoint identifiers of all nodes connected to the direct connection node, without storing information of other nodes irrelevant to the proxy node, which simplifies the complexity of constructing the routing table by the proxy node. Since the routing table structure is simple, when the routing table needs to be updated, the update speed is faster and the update is more timely, ensuring the correctness of the data forwarding path. Moreover, since the routing table of the slave node in the embodiments of the present invention is a two-layer tree structure and only contains two layers of data, when forwarding information, the next-hop node can be quickly queried through the routing table provided by the embodiments of the present invention, so as to ensure that the data can be transmitted to the requesting node in time and it is not easy to cause communication congestion.

[0007] Combined with the first aspect, in the first implementation manner of the first aspect, the terminal endpoint identifier of the requesting node is added to the routing table of the slave node as a second-level tree node to form an updated routing table, including: If the terminal endpoint identifier of the first proxy node is a first-level tree node in the routing table, the second-level tree node corresponding to the terminal endpoint identifier of the requesting node is a sub-node of the first-level tree node corresponding to the terminal endpoint identifier of the first proxy node; If the terminal endpoint identifier of the first proxy node is a second-level tree node in the routing table, the second-level tree node corresponding to the terminal endpoint identifier of the requesting node and the second-level tree node corresponding to the terminal endpoint identifier of the first proxy node belong to the same first-level tree node.

[0008] The beneficial effects are as follows: The two-layer tree structure provided by the present invention simplifies the complexity of the proxy node routing table. The second-level tree node corresponding to the terminal endpoint identifier of the requesting node and the second-level tree node corresponding to the terminal endpoint identifier of the first proxy node belong to the same first-level tree node when the terminal endpoint identifier of the first proxy node is a second-level tree node in the routing table, making the routing table structure simpler.

[0009] Combined with the first aspect, in the second implementation manner of the first aspect, if the terminal endpoint identifier of the first proxy node is the same as the terminal endpoint identifier of the slave node, the terminal endpoint identifier of the requesting node is added to the routing table of the slave node as a first-level tree node to form an updated routing table.

[0010] In combination with the first aspect, in the third implementation manner of the first aspect, the access confirmation frame further includes a second proxy node terminal endpoint identifier, where the second proxy node terminal endpoint identifier is the terminal endpoint identifier of the indirect proxy node of the requesting node. Sending the access confirmation frame to the node corresponding to the first proxy node terminal endpoint identifier according to the routing table includes: if the first proxy node terminal endpoint identifier is a first-level tree node in the routing table, replacing the second proxy node terminal endpoint identifier in the access confirmation frame with the first proxy node terminal endpoint identifier to form an updated access confirmation frame; sending the updated access confirmation frame to the node corresponding to the updated second proxy node terminal endpoint identifier.

[0011] The beneficial effect is that for a data frame that is ultimately sent to the requesting node and needs to be forwarded by each proxy node in the middle, when the data frame is forwarded, it needs to carry the terminal endpoint identifier of the next-level proxy node to be recognized by the next forwarding proxy node.

[0012] In combination with the third implementation manner of the first aspect, in the fourth implementation manner of the first aspect, if the first proxy node terminal endpoint identifier is a second-level tree node in the routing table, determining the terminal endpoint identifier corresponding to the first-level tree node connected to the second-level tree node corresponding to the first proxy node terminal endpoint identifier; replacing the second proxy node terminal endpoint identifier in the access confirmation frame with the terminal endpoint identifier to form an updated access confirmation frame; sending the updated access confirmation frame to the node corresponding to the updated second proxy node terminal endpoint identifier.

[0013] In combination with the third implementation manner or the fourth implementation manner of the first aspect, in the fifth implementation manner of the first aspect, the access confirmation frame further includes the network level and the hop count of the requesting node, and the hop count is determined according to the network level of the requesting node. Before the step of sending the updated access request frame to the node corresponding to the updated second proxy node terminal endpoint identifier, the method further includes: decrementing the hop count in the access request frame by 1.

[0014] The beneficial effect is that the hop count of the access confirmation frame changes with the number of forwarding times, clearly recording the number of times the requesting node needs to be forwarded for network access.

[0015] In combination with the first aspect, in the sixth implementation manner of the first aspect, the method further includes: receiving an event frame; the event frame includes a target terminal endpoint identifier; if the first proxy node terminal endpoint identifier is different from the terminal endpoint identifier of the slave node,

[0016] sending the event frame to the node corresponding to the target terminal endpoint identifier according to the routing table.

[0017] The beneficial effects are as follows: The routing table construction method provided by the present invention can not only forward the network access request, but also forward the event frame. When a node has something to report or the master node issues a command, it can also be implemented through this method.

[0018] The second aspect of the present invention provides a carrier communication system, including a master node, a slave node, and a request node; after the request node detects the beacon frame of the slave node, it sends a network access request frame to the slave node. The network access request frame includes a first proxy node terminal endpoint identifier, and the first proxy node terminal endpoint identifier is the terminal endpoint identifier of the slave node; the slave node receives the network access request frame and sends the network access request frame to the upper-level node. The upper-level node is the master node or the proxy node of the slave node; the master node receives the network access request frame, assigns a request node terminal endpoint identifier to the request node, and sends a network access confirmation frame. The network access confirmation frame includes the first proxy node terminal endpoint identifier and the request node terminal endpoint identifier; the slave node receives the network access confirmation frame, adds the request node terminal endpoint identifier as a first-level tree node to the routing table of the slave node to form an updated routing table. The routing table is a two-layer tree structure, including a first-level tree node and a second-level tree node. The first-level tree node corresponds to the terminal endpoint identifier of the lower-layer sub-node directly proxied by the slave node, and the second-level tree node corresponds to the terminal endpoint identifier of the lower-layer sub-node indirectly proxied by the slave node; sends a network access confirmation frame to the request node; the request node receives the network access confirmation frame.

[0019] The beneficial effects are as follows: In the data forwarding process of the routing table construction method provided by the embodiments of the present invention, when the slave node receives the network access confirmation frame, the network access confirmation frame carries the request node terminal endpoint identifier and the terminal endpoint identifier of the direct proxy node of the request node. In the process of forwarding the network access request frame by each slave node in the carrier communication system, the respective routing tables are updated according to the information in the network access request frame. The routing table of the proxy node is a two-layer tree structure, including a first-level tree node and a second-level tree node. The first-level tree node corresponds to the terminal endpoint identifier of the lower-layer sub-node directly proxied by the slave node, and the second-level tree node corresponds to the terminal endpoint identifier of the lower-layer sub-node indirectly proxied by the slave node. The routing table of the proxy node of the present invention only saves the terminal endpoint identifiers of the next-level direct-connected nodes of the device and the terminal endpoint identifiers of all the nodes connected to the direct-connected nodes, and does not save the information of other nodes irrelevant to the proxy node, which simplifies the complexity of constructing the routing table of the proxy node. Since the routing table structure is simple, when the routing table needs to be updated, the update speed is faster and the update is more timely, ensuring the correctness of the data forwarding path. Moreover, since the routing table of the slave node in the embodiments of the present invention is a two-layer tree structure and only contains two layers of data, when forwarding information, the next-hop node can be quickly queried through the routing table provided by the embodiments of the present invention, so as to ensure that the data can be transmitted to the request node in time and it is not easy to cause communication congestion.

[0020] In combination with the second aspect, in the first implementation manner of the second aspect, after the master node receives the network access confirmation frame, if it determines that the node corresponding to the TEI of the first proxy node has accessed the network, it allocates a terminal endpoint identifier to the requesting node in the network access order to generate the terminal endpoint identifier of the requesting node; and forms a network access confirmation frame according to the terminal endpoint identifier of the requesting node, the terminal endpoint identifier of the first proxy node, the terminal endpoint identifier of the second proxy node, the network level of the requesting node, and the number of hops.

[0021] In combination with the second aspect, in the second implementation manner of the second aspect, if the terminal endpoint identifier of the first proxy node is a secondary tree node in the routing table, determine the terminal endpoint identifier corresponding to the primary tree node connected to the secondary tree node corresponding to the terminal endpoint identifier of the first proxy node; replace the terminal endpoint identifier of the second proxy node in the network access confirmation frame with the terminal endpoint identifier to form an updated network access request frame; and send the updated network access request frame to the node corresponding to the updated terminal endpoint identifier of the second proxy node. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] In order to more clearly illustrate the specific implementation manners of the present invention or the technical solutions in the prior art, the following will briefly introduce the drawings required for use in the description of the specific implementation manners or the prior art. Obviously, the drawings in the following description are some implementation manners of the present invention.

[0023] Figure 1 Shows a flowchart of a routing table construction method provided by an embodiment of the present invention;

[0024] Figure 2 Shows a carrier network topology diagram provided by an embodiment of the present invention;

[0025] Figure 3 Shows a schematic diagram of a carrier communication system provided by an embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0026] The following will clearly and completely describe the technical solutions of the present invention with reference to the accompanying drawings. Obviously, the described embodiments are some, but not all, of the embodiments of the present invention. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.

[0027] In the description of the present invention, it should be noted that the terms "first" and "second" are only used for descriptive purposes and cannot be construed as indicating or implying relative importance.

[0028] An embodiment of the present invention provides a routing table construction method, as Figure 1 shown, including the following steps:

[0029] Step S001: Receive an access request frame.

[0030] In an optional embodiment, after a node accesses the carrier communication system, the node is referred to as a slave node in the carrier communication system. The slave node periodically sends beacon frames. When an unaccessed node receives a beacon frame, it sends an access request frame to the slave node that sent the beacon frame.

[0031] In an optional embodiment, the access request frame received by the slave node can be an access request frame directly sent by an unaccessed node, or an access request frame forwarded by another slave node to the current slave node.

[0032] Step S002: Send the access request frame to the upper-level node.

[0033] In an optional embodiment, the upper-level node of the slave node can be another slave node or the master node. After receiving the access request frame, the slave node needs to send the access request frame to the master node. If the slave node is directly connected to the master node, the upper-level node is the master node. If the slave node is indirectly connected to the master node, the upper-level node is another slave node, and the access request frame needs to be forwarded to the master node through another slave node.

[0034] Step S003: Receive an access confirmation frame. The access confirmation frame includes the first proxy node terminal endpoint identifier (Terminal Endpoint Identifier, TEI), the request node TEI, and the first proxy node TEI is the TEI of the direct proxy node of the request node. In the embodiment of the present invention, the request node is the unaccessed node that sends the access request frame.

[0035] In an optional embodiment, after the master node receives the access request frame sent by the unaccessed node, if it determines that the node meets the access conditions, it will issue an access confirmation frame.

[0036] In an optional embodiment, if the slave node is directly connected to the master node, after the master node generates the access confirmation frame, it directly sends the access confirmation frame to the slave node. If the slave node is indirectly connected to the master node, after the master node generates the access confirmation frame, it is forwarded to the slave node by another slave node.

[0037] In an optional embodiment, after the request node receives the beacon frame sent by any slave node in the carrier communication system, it sends an access request frame to the slave node. At this time, the slave node is the direct proxy node of the request node, and the TEI of this node is the first proxy node TEI.

[0038] In an alternative embodiment, when any slave node in the carrier communication system sends a beacon frame, the TEI of the slave node itself is included in the beacon frame. After receiving the beacon frame, the requesting node parses the beacon frame to obtain the TEI and writes the TEI into the network access request frame. After receiving the network access request frame, the master node determines the TEI in the network access request frame as the first proxy node TEI and assigns a requesting node TEI to the requesting node.

[0039] After receiving the network access confirmation frame, the slave node compares the first proxy node TEI in the network access confirmation frame with its own TEI. If the first proxy node TEI is different from its own TEI, step S004 is executed.

[0040] Step S004: If the first proxy node TEI is different from the TEI of the slave node, the requesting node TEI is added to the routing table of the slave node as a secondary tree node to form an updated routing table. The routing table is a two-layer tree structure, including a primary tree node and a secondary tree node. The primary tree node corresponds to the TEI of the lower-layer child nodes directly proxied by the slave node, and the secondary tree node corresponds to the TEI of the lower-layer child nodes indirectly proxied by the slave node. In the embodiment of the present invention, since the first proxy node TEI in the network access confirmation frame is different from the TEI of the current slave node, it indicates that the requesting node is not directly connected to the current slave node. Therefore, the current slave node is an indirect proxy node for the requesting node, and thus the requesting node TEI needs to be added to the routing table of the current slave node as a secondary tree node.

[0041] In an alternative embodiment, the routing information of each proxy node (network level n) only includes a two-layer tree structure. The first layer (primary tree node) is the child nodes (network level n + 1) proxied by the proxy node, and the second layer (secondary tree node) is the information of all child nodes proxied by the child nodes proxied by the proxy node, which is the collection of all child nodes with network levels from n + 2 to n + m. Where n + m is the maximum network level of the child nodes proxied by this proxy node.

[0042] Step S005: Send a network access confirmation frame to the node corresponding to the first proxy node TEI according to the routing table. In the embodiment of the present invention, when the first proxy node TEI in the network access confirmation frame is different from the TEI of the current slave node, the current slave node needs to send the network access confirmation frame to the node corresponding to the first proxy node TEI, so that the node corresponding to the first proxy node TEI can send the network access confirmation frame to the requesting node. At this time, the current slave node needs to determine the next-hop node for receiving the network access confirmation frame according to the routing table and forward the network access confirmation frame.

[0043] The routing table construction method provided by the embodiments of the present invention, during the data forwarding process, when a slave node receives an access confirmation frame, the access confirmation frame carries the TEI of the requesting node and the TEI of the direct proxy node of the requesting node. In the process of forwarding the access request frame by each slave node in the carrier communication system, the respective routing tables are updated according to the information in the access request frame. The routing table of the proxy node is a two-layer tree structure, including a first-level tree node and a second-level tree node. The first-level tree node corresponds to the TEI of the lower-layer sub-nodes directly proxied by the slave node, and the second-level tree node corresponds to the TEI of the lower-layer sub-nodes indirectly proxied by the slave node. The routing table of the proxy node of the present invention only stores the TEI of the next-level direct connection nodes of the device and the TEIs of all the nodes connected to the direct connection nodes, without storing the information of other nodes irrelevant to the proxy node, which simplifies the complexity of constructing the routing table of the proxy node. Since the routing table structure is simple, when the routing table needs to be updated, the update speed is faster and the update is more timely, ensuring the correctness of the data forwarding path. Moreover, since the routing table of the slave node in the embodiments of the present invention is a two-layer tree structure and only contains two layers of data, when forwarding information, the next-hop node can be quickly queried through the routing table provided by the embodiments of the present invention, so as to ensure that the data can be transmitted to the requesting node in time and it is not easy to cause communication congestion.

[0044] In an alternative embodiment, adding the TEI of the requesting node as a second-level tree node to the routing table of the slave node to form an updated routing table includes:

[0045] If the TEI of the first proxy node is a first-level tree node in the routing table, the second-level tree node corresponding to the TEI of the requesting node is a child node of the first-level tree node corresponding to the TEI of the first proxy node.

[0046] If the TEI of the first proxy node TEI is a second-level tree node in the routing table, the second-level tree node corresponding to the TEI of the requesting node and the second-level tree node corresponding to the TEI of the first proxy node belong to the same first-level tree node.

[0047] In an alternative embodiment, as Figure 2 shown, for example, if the requesting node is a node with a TEI of 6, and the TEI of the first proxy node is 5, after the slave node with a TEI of 2 receives the access confirmation frame, it determines that the TEI of the first proxy node "5" is different from its own TEI "2", and the node with a TEI of 5 is the first-level tree node of the node with a TEI of 2. Therefore, the node with a TEI of 6 is updated as a child node of the node with a TEI of 5 in the routing table. If the current routing table of the node with a TEI of 2 is [5], it is updated to [5[6]] after receiving the access confirmation frame.

[0048] In an alternative embodiment, as Figure 2As shown, exemplarily, if the requesting node is a node with a TEI of 8, then the TEI of the first proxy node is 6. It is determined that the TEI “6” of the first proxy node is different from its own TEI “2”, and the node with a TEI of 5 is the secondary tree node of the node with a TEI of 2. Therefore, the nodes with TEIs of 6, 7, and 8 are used as the children nodes of the node with a TEI of 5 to update the routing table. If the routing table of the node with a TEI of 2 is currently [5], after receiving the network access confirmation frame, it is updated to [5[6, 7, 8]].

[0049] In an alternative embodiment, after the slave node receives the network access confirmation frame, if it is determined that the TEI of the first proxy node is the same as its own TEI, the TEI of the requesting node is added as a primary tree node to the routing table of the slave node to form an updated routing table.

[0050] In an alternative embodiment, if the TEI of the first proxy node is the same as the TEI of the slave node, it means that the slave node is the direct proxy node of the requesting node. As Figure 2 shown, exemplarily, if the TEI of the requesting node is 5, then the TEI of the first proxy node is 2. After the node with a TEI of 2 receives the network access confirmation frame, it is determined that the TEI of the first proxy node is the same as its own TEI, and the node with a TEI of 5 is used to update the routing table as a primary tree node in the routing table. Exemplarily, if the node with a TEI of 2 currently has no routing table, after receiving the network access confirmation frame, the routing table is updated to [5]. If the current routing table of the node with a TEI of 2 is [1, 3], after receiving the network access confirmation frame, the routing table is updated to [1, 3, 5].

[0051] In an alternative embodiment, the network access confirmation frame further includes the TEI of the second proxy node. The TEI of the second proxy node is the TEI of the indirect proxy node of the requesting node, and the TEI of the second proxy node is the TEI of the next-hop node in the forwarding process of the network access confirmation frame. For the same network access confirmation frame, the TEI of the second proxy node carried each time it is forwarded is different. Exemplarily, if the master node sends a network access confirmation frame to a node with a TEI of 8, when the master node sends it for the first time, it needs to forward the network access confirmation frame through the node with a TEI of 2. At this time, the TEI of the second proxy node in the network access confirmation frame is 2. After the node with a TEI of 2 receives the network access confirmation frame, it needs to forward it through the node with a TEI of 5. When the node with a TEI of 2 forwards the network access confirmation frame, the TEI of the second proxy node in the network access confirmation frame is 5, and so on until the network access confirmation frame reaches the node with a TEI of 8. On this basis, the step of sending the network access confirmation frame to the node corresponding to the TEI of the first proxy node according to the routing table specifically includes:

[0052] If the TEI of the first proxy node is a primary tree node in the routing table,

[0053] First, replace the TEI of the second proxy node in the network access confirmation frame with the TEI of the first proxy node to form an updated network access confirmation frame.

[0054] Secondly, send the updated network access confirmation frame to the node corresponding to the updated TEI of the second proxy node.

[0055] In the embodiment of the present invention, the node corresponding to the first proxy node TEI is the node to which the network access confirmation frame is to arrive. The network access confirmation frame is sent to the requesting node through the node corresponding to the first proxy node TEI. If the first proxy node TEI is a first-level tree node in the routing table, it indicates that the node corresponding to the first proxy node TEI is directly connected to the current slave node. The current slave node can directly send the network access confirmation frame to the node corresponding to the first proxy node TEI. Therefore, directly using the first proxy node TEI as the second proxy node TEI in the network access confirmation frame can forward the network access confirmation frame.

[0056] In an optional embodiment, if the first proxy node TEI is a second-level tree node in the routing table,

[0057] First, determine the TEI corresponding to the first-level tree node connected to the second-level tree node corresponding to the first proxy node TEI.

[0058] Secondly, replace the TEI of the second proxy node in the network access confirmation frame with the TEI to form an updated network access confirmation frame.

[0059] Finally, send the updated network access confirmation frame to the node corresponding to the updated TEI of the second proxy node.

[0060] In the embodiment of the present invention, if the first proxy node TEI is a second-level tree node in the routing table, it indicates that the node corresponding to the first proxy node TEI is indirectly connected to the current slave node. The current slave node cannot directly send the network access confirmation frame to the node corresponding to the first proxy node TEI. Therefore, first determine the TEI corresponding to the first-level tree node connected to the second-level tree node corresponding to the first proxy node TEI, replace the TEI of the second proxy node in the network access confirmation frame with the TEI to form an updated network access confirmation frame, and then send the updated network access confirmation frame to the node corresponding to the updated TEI of the second proxy node.

[0061] In an optional embodiment, as Figure 2 shown, for example, if the requesting node TEI is 8, the first proxy node TEI is 6, and the routing table of the node with TEI 2 is [5[6,7,8]], replace the TEI in the network access confirmation frame with 5 to form a new network access request frame, forward the network access request frame to the node with TEI 2, and finally forward it to the master node.

[0062] In an alternative embodiment, for a data frame that is finally sent to the requesting node, it needs to be forwarded through each proxy node in the middle. When the data is forwarded, it needs to carry the TEI of the proxy node at the next level in order to be recognized by the next forwarding proxy node. Therefore, after each proxy node receives the data frame that needs to be forwarded by itself, after finding the proxy node at the next level according to the routing table, it needs to replace the proxy node in the data frame with the TEI of the proxy node at the next level and then forward it. If the proxy node TEI is not replaced, the data frame will be sent to itself again.

[0063] In an alternative embodiment, the network entry confirmation frame further includes the network level and the hop count of the requesting node, and the hop count is determined according to the network level of the requesting node. The network level of the requesting node is determined by the master node, and the master node determines the network level of the requesting node according to the network level of the direct proxy node of the requesting node. The network level of the requesting node is obtained by adding 1 to the network level of its direct proxy node. The hop count refers to the number of times of forwarding required when sending to the direct proxy node of the requesting node.

[0064] Before the step of sending the updated network entry request frame to the node corresponding to the updated second proxy node TEI, the method provided by the embodiment of the present invention further includes: subtracting 1 from the hop count in the network entry request frame.

[0065] In an alternative embodiment, the method further includes:

[0066] First, receive an event frame, and the event frame includes the target TEI.

[0067] Secondly, if the first proxy node TEI is different from the TEI of the slave node, send the event frame to the node corresponding to the target TEI according to the routing table.

[0068] In an alternative embodiment, when the master node needs to send data to the slave node after the node enters the network, the proxy node forwards the event frame.

[0069] In an alternative embodiment, during the forwarding process of the event frame, when the proxy node changes, replace the TEI in the event frame with the TEI of the first proxy node to form an updated event frame, and then forward the new event frame.

[0070] In an alternative embodiment, the event frame includes the network level and the hop count of the node to be processed, and the hop count is determined according to the network level of the requesting node. Before the step of sending the updated event frame to the node corresponding to the updated second proxy node TEI, the method further includes: subtracting 1 from the hop count in the event frame.

[0071] The process of forwarding the event frame is the same as the process of forwarding the network entry confirmation frame. For the detailed content, refer to the process of forwarding the network entry confirmation frame in the above embodiment.

[0072] An embodiment of the present invention further provides a carrier communication system, as Figure 3 shown, including:

[0073] A master node, a slave node, and a request node.

[0074] Step S101: After the request node detects the beacon frame of the slave node, it sends an access request frame to the slave node. The access request frame includes a first proxy node TEI, and the first proxy node TEI is the TEI of the slave node.

[0075] Step S102: The slave node receives the access request frame and sends the access request frame to the upper-level node. The upper-level node is the master node or the proxy node of the slave node.

[0076] Step S103: The master node receives the access request frame, allocates a request node terminal endpoint identifier for the request node, and sends an access confirmation frame. The access confirmation frame includes the first proxy node TEI and the request node TEI.

[0077] Step S104: The slave node receives the access confirmation frame, adds the request node TEI as a first-level tree node to the routing table of the slave node to form an updated routing table. The routing table is a two-layer tree structure, including first-level tree nodes and second-level tree nodes. The first-level tree nodes respectively correspond to the TEIs of the lower-level child nodes directly proxied by the slave node, and the second-level tree nodes respectively correspond to the TEIs of the lower-level child nodes indirectly proxied by the slave node; send an access confirmation frame to the request node.

[0078] Step S105: The request node receives the access confirmation frame.

[0079] In the carrier communication system provided by the embodiment of the present invention, during the data forwarding process, when a slave node receives an access confirmation frame, the access confirmation frame carries the terminal endpoint identifier of the requesting node and the terminal endpoint identifier of the direct proxy node of the requesting node. During the forwarding process of the access request frame by each slave node in the carrier communication system, the respective routing tables are updated according to the information in the access request frame. The routing table of the proxy node is a two-layer tree structure, including a first-level tree node and a second-level tree node. The first-level tree node corresponds to the terminal endpoint identifier of the lower-layer sub-node directly proxied by the slave node, and the second-level tree node corresponds to the terminal endpoint identifier of the lower-layer sub-node indirectly proxied by the slave node. The routing table of the proxy node of the present invention only stores the terminal endpoint identifiers of the next-level direct-connected nodes of the device and the terminal endpoint identifiers of all the nodes connected to the direct-connected nodes, without storing the information of other nodes irrelevant to the proxy node, which simplifies the complexity of constructing the routing table of the proxy node. Since the routing table structure is simple, when the routing table needs to be updated, the update speed is faster and the update is more timely, ensuring the correctness of the data forwarding path. Moreover, since the routing table of the slave node in the embodiment of the present invention is a two-layer tree structure and only contains two layers of data, when forwarding information, the next-hop node can be quickly queried through the routing table provided by the embodiment of the present invention, thereby ensuring that the data can be transmitted to the requesting node in time and it is not easy to cause communication congestion.

[0080] In an optional embodiment, after receiving the access confirmation frame, the master node queries the information of the first proxy node among the devices that have accessed the network, confirms that the first proxy node has accessed the network, and assigns a TEI to the requesting node in the access order. An access confirmation frame is formed according to the TEI of the requesting node, the TEI of the first proxy node, the TEI of the second proxy node, the network level of the requesting node, and the number of hops.

[0081] In an optional embodiment, the requesting node receives the access confirmation frame and generates its own TEI according to the TEI of the requesting node in the access confirmation frame.

[0082] In an optional embodiment, the beacon frame is a short data frame containing network information and device information that each node will send regularly after accessing the network. By listening to the beacon frames of other nodes, unaccessed devices initiate access requests based on the listened beacon frames.

[0083] In an optional embodiment, after a node receives the access confirmation frame, it will obtain its relevant information and start sending beacon frames regularly. When other nodes access the network through a similar access process, this node becomes a proxy node.

[0084] In an optional embodiment, by way of example, as Figure 2 shown, the process of constructing the routing tables of the proxy node with a TEI of 5 and the nodes on the related path is as follows:

[0085] Before being connected to the network, after the proxy node with TEI 5 detects the beacon frame of the connected node with TEI 2, it forwards the network access request frame (MAC address: 202211110005, proxy node TEI: 2) to the main node CCO through this node; after receiving the network access request frame, the main node CCO finds the node information of the node with TEI 2 (MAC address: 202211110002, network level: 1) among the connected devices, and assigns the TEI of this node as 5, network level as 2, and the TEI of the proxy node as 2 according to the network access order. According to the above results, a network access confirmation frame (the network access confirmation frame also carries normal data frame information including the original TEI: 0, proxy node TEI: 0, destination TEI: 2, hop count: 0) is formed and sent to the node with TEI 2. After receiving the network access confirmation frame, node 2 parses the network access confirmation frame. Since the TEI of the proxy node is the same as its own TEI, it confirms that the node with TEI 5 is its next-level direct-connected node, and the routing table is updated to [5]; at the same time, it forwards the network access confirmation frame to the carrier line. Device 202211110005 receives the network access confirmation frame, parses and compares the MAC address with its own address, confirms that the device is connected to the network, and confirms that the TEI of this node in the network is 5, network level is 2, and proxy node TEI is 2. After the node is connected to the network, it will periodically send its own beacon frame to the carrier network.

[0086] After the node with device address 202211110006 detects the beacon frame of the node with TEI 5, it sends a network access request frame (MAC address: 202211110006, proxy node TEI: 5). After receiving the network access request frame, the node with TEI 5 forwards it to its proxy node (TEI: 2); then the proxy node with TEI 2 forwards it to the main node CCO; the main node CCO assigns the node as TEI 6, network level 3, proxy node TEI 5, and sends a network access confirmation frame (the network access confirmation frame also carries normal data frame information including the original TEI: 0, proxy node TEI: 2, destination TEI: 5, hop count: 1) to the node with TEI 5. After receiving the network access confirmation frame, the node with TEI 2 parses that it needs to forward it to the node with TEI 5 through itself, so it can judge that the node with TEI 6 is the child node of the next-level direct-connected node (TEI: 5). After updating the routing table [5[6]], it forwards it to the node with TEI 5. 202211110006 receives the network access confirmation frame, updates the device information (TEI: 6, network level: 3, proxy node TEI: 5), and periodically sends beacon frames.

[0087] The network access process of device 202211110007 is the same as that of device 202211110006. The TEI assigned by the master node CC0 for this node is 6, the network level is 3, and the TEI of the proxy node is 5. Therefore, the routing table of the node with TEI 2 is updated to [5[6,7]], and the routing table of the node with TEI 5 is updated to [6,7].

[0088] Device 202211110008 accesses the network through the node with TEI 6. The master node CCO assigns the TEI of this node as 8, the network level is 4, and the proxy node is TEI 6. The network access confirmation frame is first forwarded from 2 to 5. Therefore, the routing table of the node with TEI 2 is updated to [5[6,7,8]]; then it is forwarded from 5 to 6, and the routing table of the node with TEI 5 is updated to [6[8],7]; the routing table of the node with TEI 6 is updated to [8].

[0089] The network access process of device 202211110009 is the same as that of 202211110008. The master node CCO assigns the TEI of this node as 9, the network level is 4, and the proxy node TEI is 7. The network access confirmation frame is forwarded by nodes 2 and 5 respectively. The routing table of the node with TEI 2 is updated to [5[6,7,8,9]]; the routing table of the node with TEI 5 is updated to [6[8],7[9]].

[0090] Device 202211110010 accesses the network through the node with TEI 6. The master node CCO assigns the TEI of this node as 10, the network level is 4, and its proxy node is 6. The routing table of the node with TEI 2 is updated to [5[6,7,8,9,10]], and the routing table of the node with TEI 5 is updated to [6[8,10],7[9]].

[0091] Device 202211110011 accesses the network through the node with TEI 8. The master node CCO assigns the TEI of this node as 11, the network level is 5, and the proxy node TEI is 8. The routing table of the node with TEI 2 is updated to [5[6,7,8,9,10,11]], the routing table of the node with TEI 5 is updated to [6[8,10,11],7[9]], and the routing table of the node with TEI 8 is updated to

[11] .

[0092] Device 202211110012 accesses the network through the node with TEI 8. The master node CCO assigns the TEI of this node as 12, the network level is 5, and the TEI of the proxy node is 8. The routing table of the node with TEI 2 is updated to [5[6,7,8,9,10,11,12]], the routing table of the node with TEI 5 is updated to [6[8,10,11,12],7[9]], and the routing table of the node with TEI 8 is updated to [11,12].

[0093] In an alternative embodiment, the master node CCO retains the network information of each node (including the MAC address of the node, the TEI of the node, the network level, the TEI of the proxy node, and the device type). For ease of description, the routing table of the master node CCO is organized into a multi-dimensional array format as shown in Table 1.

[0094] Table 1: The routing table constructed in the master node CCO.

[0095] MAC address Terminal Endpoint Identifier First Agent Node TEI Hierarchy Device type 202211110000 0 - 0 CCO 202211110001 1 0 1 PCO 202211110002 2 0 1 PCO 202211110003 3 0 1 STA 202211110004 4 1 2 STA 202211110005 5 2 2 PCO 202211110006 6 5 3 PCO 202211110007 7 5 3 PCO 202211110008 8 6 4 PCO 202211110009 9 7 4 STA 202211110010 10 6 4 PCO 202211110011 11 8 5 STA 202211110012 12 8 5 STA

[0096] The routing table of the master node CCO is [1[4], 2[5[7[9], 6[8[11, 12], 10]]], 3] (where the numbers represent the values of the slave node TEIs, each square bracket represents a level, and the slave node TEIs within the same square bracket are separated by commas).

[0097] The same applies to other nodes, and only the routing tables of the nodes at the lower levels are constructed.

[0098] The complete routing table constructed by the slave node with TEI 2 in the first level is [5[7[9], 6[8[11, 12], 10]]];

[0099] The complete routing table constructed by the slave node with TEI 5 in the second level is [7[9], 6[8[11, 12], 10]];

[0100] The complete routing table constructed by the slave node with TEI 6 in the third level is [8[11, 12], 10];

[0101] The complete routing table constructed by the slave node with TEI 8 in the fourth level is [11, 12].

[0102] If it is necessary to send data to the node with TEI 12, according to Table 1, find that the TEI of the proxy node with TEI 12 (level 5, TEI 12, PCO 8) is 8; then according to the routing table, find that the TEI of the proxy node with TEI 8 (level 4, TEI 8, PCO 6) is 6; then according to the routing table, find that the TEI of the proxy node with TEI 6 (level 3, TEI 6, PCO 5) is 5; then according to the routing table, find that the TEI of the proxy node with TEI 5 (level 2, TEI 5, PCO 2) is 2; then according to the routing table, find that the node directly connected to the CCO at the first level with TEI 2 (level 1, TEI 0, PCO 0); thus, it can be determined that the data frame sent by the CCO needs to include the original TEI 0, the proxy node TEI 2, the destination TEI 12, and the hop count 4.

[0103] In an alternative embodiment, the routing table simplified by the routing table construction method of the present invention embodiment:

[0104] The routing table of the CCO with TEI 0 is [1[4], 2[5, 6, 7, 8, 9, 10, 11, 12], 3]; the routing table of the slave node with TEI 2 is [5[6, 7, 8, 9, 10, 11, 12]]; the routing table of the slave node with TEI 5 is [6[8, 10, 11, 12], 7[9]]; the routing table of the slave node with TEI 6 is [8[11, 12], 10]; the routing table of the slave node with TEI 8 is [11, 12].

[0105] When the master node needs to send data to the slave node with TEI 12, according to the information in Table 1, it is determined that the level of this node is 5. Therefore, the jump digit of the data frame sent is 4; at the same time, according to the table [1[4], 2[5, 6, 7, 8, 9, 10, 11, 12], 3], the TEI of the next directly connected node is found to be 2; thus, it can be determined that the data frame sent by the CCO needs to include the original TEI 0, the proxy node TEI 2, the destination TEI 12, and the jump number 4.

[0106] After the relay node with TEI 2 receives and parses the data, according to the routing table [5[6, 7, 8, 9, 10, 11, 12]], the TEI of the next directly connected slave node with TEI 12 can be found as 5. Forward the data packet with other contents unchanged, change the proxy TEI to 5, and reduce the jump number by 1 to 3 and then forward it.

[0107] After the relay node with TEI 5 receives and parses the data, according to the routing table [6[8, 10, 11, 12], 7[9]], the TEI of the slave node with TEI 12 can be found below the slave node with TEI 6. Forward the data packet with other contents unchanged, change the proxy TEI to 6, and reduce the jump number by 1 to 2 and then forward it.

[0108] After the relay node with TEI 6 receives and parses the data, according to the routing table [8[11, 12], 10], the TEI of the slave node with TEI 12 can be found below the slave node with TEI 8. Forward the data packet with other contents unchanged, change the proxy TEI to 8, and reduce the jump number by 1 to 1 and then forward it.

[0109] After the relay node with TEI 8 receives and parses the data, according to the routing table [11, 12], the slave node with TEI 12 is found to be its directly connected node. Forward the data packet with other contents unchanged, change the proxy TEI to 12, and reduce the jump number by 1 to 0 and then forward it.

[0110] The slave node with TEI 12 receives the data. The destination TEI is the same as itself and the jump number is 0, so it processes the data frame.

[0111] Obviously, the above embodiments are merely examples given for clear illustration and are not limitations on the implementation manners. For those of ordinary skill in the art, other different forms of changes or alterations can be made based on the above description. It is not necessary and impossible to enumerate all implementation manners here. And the obvious changes or alterations derived therefrom still fall within the protection scope of the present invention.

Claims

1. A method for constructing a routing table, characterized in that, Applied to a slave node, including: Receiving an access request frame; Sending the access request frame to a superior node; Receiving an access confirmation frame, where the access confirmation frame includes a first proxy node terminal endpoint identifier and a request node terminal endpoint identifier, and the first proxy node terminal endpoint identifier is the terminal endpoint identifier of the direct proxy node of the request node; If the first proxy node terminal endpoint identifier is different from the terminal endpoint identifier of the slave node, Adding the request node terminal endpoint identifier as a secondary tree node to the routing table of the slave node to form an updated routing table. The routing table is a two-layer tree structure, including a primary tree node and a secondary tree node. The primary tree node corresponds to the terminal endpoint identifier of the lower-level sub-node directly proxied by the slave node, and the secondary tree node corresponds to the terminal endpoint identifier of the lower-level sub-node indirectly proxied by the slave node; If the first proxy node terminal endpoint identifier is the same as the terminal endpoint identifier of the slave node, adding the request node terminal endpoint identifier as a primary tree node to the routing table of the slave node to form an updated routing table; Sending the access confirmation frame to the node corresponding to the first proxy node terminal endpoint identifier according to the routing table.

2. The routing table construction method according to claim 1, wherein Adding the request node terminal endpoint identifier as a secondary tree node to the routing table of the slave node to form an updated routing table, including: If the first proxy node terminal endpoint identifier is a primary tree node in the routing table, the secondary tree node corresponding to the request node terminal endpoint identifier is a child node of the primary tree node corresponding to the first proxy node terminal endpoint identifier; If the first proxy node terminal endpoint identifier is a secondary tree node in the routing table, the secondary tree node corresponding to the request node terminal endpoint identifier and the secondary tree node corresponding to the first proxy node terminal endpoint identifier are subordinate to the same primary tree node.

3. The routing table construction method according to claim 1, characterized in that The access confirmation frame further includes a second proxy node terminal endpoint identifier, and the second proxy node terminal endpoint identifier is the terminal endpoint identifier of the indirect proxy node of the request node, Sending the access confirmation frame to the node corresponding to the first proxy node terminal endpoint identifier according to the routing table, including: If the first proxy node terminal endpoint identifier is a primary tree node in the routing table, replacing the second proxy node terminal endpoint identifier in the access confirmation frame with the first proxy node terminal endpoint identifier to form an updated access confirmation frame; Sending the updated access confirmation frame to the node corresponding to the updated second proxy node terminal endpoint identifier.

4. The routing table construction method according to claim 3, characterized in that If the first proxy node terminal endpoint identifier is a secondary tree node in the routing table, Determining the terminal endpoint identifier corresponding to the primary tree node connected to the secondary tree node corresponding to the first proxy node terminal endpoint identifier; Replace the second proxy node terminal endpoint identifier in the network access confirmation frame with the terminal endpoint identifier to form an updated network access confirmation frame; Send the updated network access confirmation frame to the node corresponding to the updated second proxy node terminal endpoint identifier.

5. The routing table construction method according to claim 3 or 4, characterized in that, The network access confirmation frame further includes the network level and hop count of the requesting node, and the hop count is determined according to the network level of the requesting node. Before the step of sending the updated network access request frame to the node corresponding to the updated second proxy node terminal endpoint identifier, the method further includes: Decrease the hop count in the network access request frame by 1.

6. The routing table construction method according to claim 1, wherein The method further includes: Receiving an event frame; The event frame includes a target terminal endpoint identifier; If the first proxy node terminal endpoint identifier is different from the terminal endpoint identifier of the slave node, Send the event frame to the node corresponding to the target terminal endpoint identifier according to the routing table.

7. A carrier communication system, characterized in that, Including a master node, a slave node, and a requesting node; After the requesting node detects the beacon frame of the slave node, it sends a network access request frame to the slave node. The network access request frame includes a first proxy node terminal endpoint identifier, and the first proxy node terminal endpoint identifier is the terminal endpoint identifier of the slave node; The slave node receives the network access request frame and sends the network access request frame to the upper-level node. The upper-level node is the master node or the proxy node of the slave node; When the proxy node of the slave node receives the network access request frame, it forwards it to the master node; The master node receives the network access request frame, assigns a request node terminal endpoint identifier to the requesting node, and sends a network access confirmation frame. The network access confirmation frame includes the first proxy node terminal endpoint identifier and the request node terminal endpoint identifier; The slave node receives the network access confirmation frame. If the first proxy node terminal endpoint identifier is the same as the terminal endpoint identifier of the slave node, it adds the request node terminal endpoint identifier as a first-level tree node to the routing table of the slave node to form an updated routing table. The routing table is a two-layer tree structure, including first-level tree nodes and second-level tree nodes. The first-level tree nodes respectively correspond to the terminal endpoint identifiers of the lower-level child nodes directly proxied by the slave node, and the second-level tree nodes respectively correspond to the terminal endpoint identifiers of the lower-level child nodes indirectly proxied by the slave node; Send the network access confirmation frame to the requesting node; If the first proxy node terminal endpoint identifier is different from the terminal endpoint identifier of the slave node, add the request node terminal endpoint identifier as a second-level tree node to the routing table of the slave node to form an updated routing table; The requesting node receives the network access confirmation frame.

8. The carrier communication system according to claim 7, characterized in that, After the master node receives the network access confirmation frame, If it is determined that the node corresponding to the first proxy node TEI has accessed the network, assign a terminal endpoint identifier to the requesting node in the access order to generate the request node terminal endpoint identifier; An access confirmation frame is formed based on the request node terminal endpoint identifier, the first proxy node terminal endpoint identifier, the second proxy node terminal endpoint identifier, the network level of the request node, and the number of hops.

9. The carrier communication system according to claim 7, wherein if the first proxy node terminal endpoint identifier is a secondary tree node in the routing table, determine the terminal endpoint identifier corresponding to the primary tree node connected to the secondary tree node corresponding to the first proxy node terminal endpoint identifier; replace the second proxy node terminal endpoint identifier in the access confirmation frame with the terminal endpoint identifier to form an updated access request frame; send the updated access request frame to the node corresponding to the updated second proxy node terminal endpoint identifier.

Images