Node routing method, node routing device, computer equipment, communication system and storage medium

Abstract

The invention discloses a node routing method, a node routing device, computer equipment, a communication system and a storage medium. The method comprises the steps that a plurality of routing time periods are divided based on power load data corresponding to a current node, and the power load data are determined based on power data collected by a power collection terminal connected with the current node; respectively establishing a routing table of the current node in each routing time period, wherein the routing table comprises child nodes of the current node; and performing routing control on the current node based on the routing table of each routing time period. A plurality of routing periods are divided based on the change rule of the power load data, the routing table of each routing period is established, and the routing table of the routing period at the current moment is used, so that the routing performance at the current moment can be ensured, the communication quality and reliability are improved, and due to the regular change of the power load, the routing tables do not need to be frequently maintained, and the communication efficiency is improved. And the maintenance overhead of the routing table can be greatly reduced.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and more specifically, to a node routing method, a node routing device, a computer device, a communication system, and a non-volatile computer-readable storage medium. Background Art

[0002] Power line carrier communication is widely used in power meter reading systems, mainly for reading and collecting electric energy data of smart meters. This communication uses power lines as transmission channels, adopts relay and multi-hop routing methods, and establishes a network consisting of central nodes, proxy nodes (routing nodes) and sub-nodes, such as Figure 1 , CCO is the root node, PCO is the proxy node, and STA is the end node or child node.

[0003] Currently, once the routing table of each node is established, the entire network enters the network maintenance phase. Due to the time-varying nature of channel quality, frequent routing maintenance and path reconstruction are generally required, resulting in high network overhead. Summary of the invention

[0004] Embodiments of the present application provide a node routing method, a node routing device, a computer device, a communication system, and a non-volatile computer-readable storage medium.

[0005] The node routing method of the implementation mode of the present application includes dividing a plurality of routing time periods based on the power load data corresponding to the current node, wherein the power load data is determined based on the power data collected by the power collection terminal connected to the current node; establishing a routing table for the current node in each of the routing time periods, wherein the routing table includes the child nodes of the current node; and performing routing control on the current node based on the routing table of each of the routing time periods.

[0006] The node routing device of the embodiment of the present application includes a division module, an establishment module and a control module. The division module is used to divide a plurality of routing time periods based on the power load data corresponding to the current node, and the power load data is determined based on the power data collected by the power collection terminal connected to the current node; the establishment module is used to respectively establish a routing table of the current node in each of the routing time periods, and the routing table includes the child nodes of the current node; the control module is used to perform routing control on the current node based on the routing table of each of the routing time periods.

[0007] The computer device of the embodiment of the present application includes a processor, a memory and a computer program, wherein the computer program is stored in the memory and executed by the processor, and the computer program includes instructions for executing the node routing method described in any of the above embodiments.

[0008] The communication system of the embodiment of the present application includes a plurality of computer devices and a controller. The plurality of computer devices form each node in the network topology; the controller is used to execute the node routing method described in any of the above embodiments.

[0009] The non-volatile computer-readable storage medium of the embodiment of the present application includes a computer program. When the computer program is executed by a processor, the processor executes the node routing method described in any of the above embodiments.

[0010] The node routing method, node routing device, computer equipment, communication system and computer-readable storage medium of the embodiment of the present application collect power data through the power collection terminal to determine the power load data of the current node, and the power load of the same node changes regularly, such as the power load is higher in the evening every day and lower in the early morning. Since the power line is not a dedicated communication channel and is connected to a large number of power loads, the level of power load will affect the communication quality. Therefore, based on the power load data, multiple routing time periods can be divided so that the difference in power load in each routing time period will not be too large.

[0011] Then, for each routing period, a routing table is established for each routing period so that the routing table can match the power load, reducing the time-varying nature of circuit load fluctuations and the impact on the accuracy of the routing table. For example, if routing table 1 in period 1 is used in period 2 where the power load is much different from period 1, the routing performance will be significantly reduced, resulting in a decrease in communication quality and reliability.

[0012] Therefore, based on the routing tables of each routing period, using the routing table of the routing period at the current moment can not only ensure the routing performance at the current moment and improve the communication quality and reliability, but also because the routing table does not need frequent maintenance due to the regular changes in power load, it can also greatly reduce the maintenance cost of the routing table.

[0013] Additional aspects and advantages of the embodiments 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 embodiments of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] The above and / or additional aspects and advantages of the present application will become apparent and easily understood from the description of the embodiments in conjunction with the following drawings, in which:

[0015] Figure 1 It is a topology structure of power line carrier communication network;

[0016] Figure 2 is a flowchart of a node routing method in certain implementation modes of the present application;

[0017] Figure 3 is a flowchart of a node routing method in certain implementation modes of the present application;

[0018] Figure 4 is a flowchart of a node routing method in certain implementation modes of the present application;

[0019] Figure 5 It is a schematic diagram of the principle of the node routing method of certain implementation modes of the present application;

[0020] Figure 6 It is a schematic diagram of the principle of the node routing method of certain implementation modes of the present application;

[0021] Figure 7 It is a schematic diagram of the principle of the node routing method of certain implementation modes of the present application;

[0022] Figure 8 It is a schematic diagram of the principle of the node routing method of certain implementation modes of the present application;

[0023] Fig. 9 is a flowchart of a node routing method in certain implementation modes of the present application;

[0024] Fig.10 is a module schematic diagram of a node routing device in certain embodiments of the present application;

[0025] Fig.11 is a schematic diagram of the structure of a computer device of certain embodiments of the present application;

[0026] Fig.12 is a schematic diagram of the structure of a communication system of certain embodiments of the present application;

[0027] Fig.13 It is a schematic diagram of the connection status of a non-volatile computer-readable storage medium and a processor in certain embodiments of the present application. DETAILED DESCRIPTION

[0028] The 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 represent the same or similar elements or elements having the same or similar functions from beginning to end. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the embodiments of the present application, and cannot be understood as limiting the embodiments of the present application.

[0029] Since power lines are not dedicated communication channels and connect a large number of power loads, the channels have characteristics such as high noise, strong attenuation, and time-varying properties, resulting in short communication distances between nodes and poor communication reliability. Dynamic routing must be established to maintain the connection relationship between nodes.

[0030] At present, power line carrier communication networking generally adopts ADHOC-like dynamic networking protocols. The networking process is generally initiated by the master node, with beacon frames broadcast step by step, and each node uses CSMA / CA competition reporting to establish routing nodes (relay nodes), paths and routing tables.

[0031] Routing node selection and path establishment are based on channel and link signal quality, such as signal-to-noise ratio, bit error rate, packet loss rate and other indicators (in actual application, since it is a non-dedicated channel, signal-to-noise ratio and bit error rate are difficult to measure accurately, and packet loss rate is often used), to determine the path weight and establish the path. Once the routing table of each node is established, the entire network enters the network maintenance phase. Due to the time-varying nature of channel quality, frequent routing maintenance and path reconstruction are generally required, resulting in high network overhead.

[0032] In order to solve the above technical problems, an embodiment of the present application provides a node routing method.

[0033] See also Figure 2 The node routing method of the embodiment of the present application can be implemented by steps 011 to 013, which are described in detail below.

[0034] Step 011: dividing a plurality of routing time periods based on the power load data corresponding to the current node, the power load data being determined based on the power data collected by the power collection terminal connected to the current node;

[0035] The current node is any node in a network topology structure (such as a power line carrier communication network) composed of various nodes. For example, the current node may be a root node, a proxy node or a child node.

[0036] The power data may be power consumption related data detected by the power collection terminal connected to the current node, such as power consumption, power consumption, etc.

[0037] Optionally, the power load data is determined based on power data collected by the power collection terminal within a preset time period, and the preset time period includes one day, one week or one month.

[0038] Specifically, the power collection terminal connected to the current node will collect the power consumption of the connected power-consuming devices in real time, such as collecting the total power consumption of each power-consuming device once every preset time period (such as 1 second, 1 minute, etc.), or collecting the total power consumption of each power-consuming device once every preset time period, thereby obtaining the power data of the power collection terminal.

[0039] Then, the power load data can be obtained according to the power data, such as the power data is directly used as the power load data.

[0040] Optionally, the power data may be processed in sequence through data cleaning (to remove noise data) and data normalization (to facilitate data processing) to generate power load data.

[0041] Among them, data cleaning can be filtering processing, such as filtering out power data with abnormal values. Data normalization can be performed based on total power data. For example, taking power data for one day as an example, each power data can be divided by the total power data for one day. Based on the number of minutes per day, the number of minutes corresponding to the collection time of each circuit data can be divided by the total number of minutes (and 60*24). Power load data can include power data and the collection time corresponding to the power data.

[0042] See also Figure 3 Optionally, step 011 includes:

[0043] Step 0111: performing linear regression processing on each power load data and the collection time of each power load data to generate a power load curve;

[0044] The linear regression process may be implemented based on at least one of least squares method, gradient descent, stochastic gradient descent, particle swarm algorithm and Newton's method.

[0045] Specifically, in order to facilitate the division of routing time periods, each discrete power data may be subjected to linear regression processing to obtain a power load curve.

[0046] See also Figure 4 Optionally, step 0111 includes:

[0047] Step 01111: based on a preset data sample quantity, each power load data is divided into a plurality of sample sets, and a sample period corresponding to each sample set is determined;

[0048] Step 01112: performing linear regression processing on each sample set respectively to generate a regression curve under each sample period;

[0049] Step 01113: Generate a power load curve based on the regression curve in each sample period.

[0050] Specifically, in order to reduce the complexity of regression, the power load data can be divided into multiple parts, each of which is a sample set, and each sample set corresponds to a sample period. Then, linear regression processing is performed on the power load data in each sample set to obtain a regression curve corresponding to each sample period. Finally, based on the regression curves in each sample period, the power load curve is generated, such as splicing the regression curves in each sample period to obtain the power load curve.

[0051] In one example, the process of performing linear regression includes the following steps:

[0052] (1) Select a linear regression model, that is, select the corresponding linear regression algorithm.

[0053] For example, p=b0+b1*t+b2*t2+b3*t3+······+bN*tN

[0054] (2) Obtaining the collection time matrix T and the power data matrix P

[0055]

[0056] (3) Maximum likelihood estimation:

[0057] (4) Based on the results of maximum likelihood estimation, after numerical conversion, the equation corresponding to the power load curve can be determined:

[0058] Step 0112: Divide the routing time periods into multiple time periods based on the power load curve.

[0059] For example, multiple power data with a difference value less than a preset difference value and collected at similar times are grouped together to obtain multiple groups of power data, thereby dividing the routing time periods according to the collection time corresponding to each group of power data. In this way, it can be ensured that the power loads at different times of the divided routing time periods are basically consistent.

[0060] Please continue reading Figure 4 Optionally, step 0112 includes:

[0061] Step 01121: determining characteristic points of the power load curve, wherein the characteristic points include at least one of a maximum point, a minimum point, and a mean point;

[0062] Step 01122: Divide the power load curve into a plurality of segmented curves based on the characteristic value;

[0063] Step 01123: Determine each routing time period based on the time range corresponding to each segmented curve.

[0064] Specifically, characteristic points (such as maximum points, minimum points and mean points) of the power load curve may be determined, and the power load curve may be segmented based on the characteristic points, thereby obtaining routing time periods corresponding to each segmented curve.

[0065] Among them, the maximum point represents the maximum load point in a certain interval, that is, the moment when the communication load is large, the channel attenuation is large, the noise is large, and the channel quality is poor. The method for finding the maximum point is as follows:

[0066] Solve the maximum point by first and second order differential of the power load curve.

[0067] The minimum point represents the point with the lowest load in a certain interval, that is, the moment when the communication load is small, the channel attenuation is small, the noise is small, and the channel quality is good. The method for finding the minimum point is as follows:

[0068] Solve the minimum point by first and second order differential of the power load curve.

[0069] The mean point represents the time when the load distribution is highly probable and the communication channel quality is average. The method for calculating the mean point is as follows:

[0070] Find the point where the power load curve is equal to the mean value, Where T is the total duration.

[0071] In this way, the power load curve can be divided into segmented curves according to at least one of the maximum point, the minimum point and the mean point.

[0072] In an example, Figure 5 As shown, the power load curve generated by the power load data within a day is divided into 7 routing periods from L1 to L7 according to the maximum point, minimum point and mean point.

[0073] Step 012: Establishing a routing table of the current node in each routing period respectively, the routing table including the child nodes of the current node;

[0074] The routing table of each node is a mapping relationship table for each node to determine the node with which it communicates when communicating.

[0075] For example, the routing table of the current node may include the child nodes of the current node, that is, the current node can send data to the child nodes, and the routing table of the current node may also include the parent node of the current node, that is, the current node can send data to the parent node.

[0076] After dividing each routing period, you can create your own routing table in each routing period. For example, based on the channel and link signal quality, such as signal-to-noise ratio, bit error rate, packet loss rate and other indicators, determine the path weight, thereby establishing the path of the current node in each routing period, that is, the sub-node of the current node in each routing period.

[0077] It can be understood that due to the time-varying nature of the power load, the subnodes of the current node in each routing period may change. Figure 1 For example, the current node is PCO2. In routing period 1, the child nodes of PCO2 may be STA5 and STA6. However, in routing period 2, due to the large power load of STA6, the child nodes of PCO2 may only include STA5.

[0078] Please continue reading Figure 4 Optionally, step 012 includes:

[0079] Step 0121: In any routing period, control the current node to send a networking command broadcast frame;

[0080] Step 0122: Determine the child nodes of the current node based on the response frames received from other nodes;

[0081] Step 0123: Based on the address of the child node of the current node and any routing period, a routing table corresponding to any routing period is established.

[0082] Specifically, within the current routing period (any routing period obtained by dividing the routing period), the current node is controlled to send a networking command broadcast frame in the form of a broadcast. The node that can receive the broadcast frame is a node that can communicate directly with the current node, and can serve as a candidate node for the child node of the current node. After receiving the broadcast frame, each candidate node will send a response frame.

[0083] Then, based on the broadcast frame and the response frame of each candidate node, the signal quality of the communication channel and link when each candidate node communicates with the current node, such as signal-to-noise ratio, bit error rate, packet loss rate and other indicators, is determined, and the path weight from the current node to each candidate node is determined (the larger the path weight, the better the communication quality), and then based on the path weight, the child node of the current node is determined among the candidate nodes, such as selecting the candidate node whose path weight is greater than the preset weight as the child node of the current node.

[0084] After determining the child nodes of the current node, the address of the child node can be parsed based on the response frame of the child node, and then the routing table corresponding to the current routing period is established based on the address of the child nodes of the current node, thereby establishing the routing table of the current node in each routing period.

[0085] It can be understood that there can be one or more routing tables. When there is one routing table, a routing period field can be added to the routing table to indicate the routing period corresponding to each path. When there are multiple routing tables, each routing period can correspond to one routing table.

[0086] In an example, see Figure Figures 6 to 8 , each node includes node 1 to node 6, and the divided routing periods include routing period L1, routing period L2 and routing period L3. The power loads corresponding to routing period L1, routing period L2 and routing period L3 decrease in sequence. In routing period L1, the paths of each node are as follows: Figure 6 As shown, in the routing period L2, the paths of each node are as follows Figure 7 As shown, in the routing period L3, the paths of each node are as follows Figure 8 shown.

[0087] Each node includes a corresponding routing table. For node 1, the routing table is as follows:

[0088] For node 1, the routing table is as follows:

[0089] Child Nodes Routing period 2 L1 3 L2 4 L2 3 L3 4 L3 6 L3

[0090] That is to say, node 1 can communicate with node 2 in routing period L1; node 1 can communicate with at least one of node 3 and node 4 in routing period L2; node 1 can communicate with at least one of node 3, node 4 and node 6 in routing period L3.

[0091] For node 2, the routing table is as follows:

[0092] Child Nodes Routing period 5 L1 5 L2 5 L3

[0093] That is to say, node 2 can communicate with node 5 in routing period L1, routing period L2 and routing period L3.

[0094] For node 3, the routing table is as follows:

[0095]

[0096]

[0097] That is to say, node 3 can communicate with node 5 in routing period L1, routing period L2 and routing period L3.

[0098] For node 4, the routing table is as follows:

[0099] Child Nodes Routing period 6 L1 6 L2 6 L3

[0100] That is to say, node 4 can communicate with node 6 in routing period L1, routing period L2 and routing period L3.

[0101] For nodes 5 and 6, since they are end nodes and have no child nodes, there is no routing table containing child nodes. However, it can be understood that since the routing table also contains the parent node, nodes 5 and 6 still have a routing table, and the parent node can be determined based on the routing table containing the current node. For example, if the child nodes in the routing table of node 2 include node 5, then the parent node of node 5 includes node 2.

[0102] Optionally, when two nodes communicate with each other, a redundant path can be set. For example, when node 1 wants to communicate with node 5, node 3 or node 4 can be selected as a proxy node to forward the data sent by node 1 to node 5.

[0103] Optionally, at the target time of any routing period, the current node can be controlled to send a networking command broadcast frame, the target time is the start time or end time of any routing period, and the power load data corresponding to the target time is the extreme value of any routing period.

[0104] When the target time is the maximum point, due to the large power load and fast signal attenuation, there are generally more routing levels at this time (for example, for communication from the root node to the same child node, the greater the power load, the more routing levels there are between the two). Therefore, the routing table established based on the maximum point has a higher reliability.

[0105] When the target time is the minimum point, the power load is small and the signal attenuation is slow, so the routing levels are generally less (for example, for communication from the root node to the same child node, the smaller the power load, the fewer the routing levels between the two). Therefore, the routing table established based on the minimum point has a higher communication efficiency.

[0106] Optionally, at the time corresponding to the mean point of any routing period, the current node is controlled to send a networking command broadcast frame. Since the power load at the mean point is moderate, the signal attenuation is also moderate, and the routing level is between the routing levels corresponding to the maximum point and the minimum point, a balance between reliability and communication efficiency can be achieved.

[0107] Step 013: Based on the routing table of each routing period, perform routing control on the current node.

[0108] Specifically, the current node can be any node. After each node has established its own routing table in different routing periods as the current node, the data sent by the root node to any child node can be sent down step by step based on the routing table of the routing period in which each node is sending data, so as to reach the child node.

[0109] Please refer again Figure 4 Optionally, step 013 includes:

[0110] Step 0131: Obtain the routing table of the target time period of the current time, where the target time period is any routing time period;

[0111] Step 0132: When the destination address of the data frame received by the current node is not the current node, forward the data frame to the corresponding child node based on the routing table of the destination address and the destination time period.

[0112] Specifically, when the current node sends data, it first obtains the routing table of the target time period where the current time is located, or finds the corresponding part of the target time period in the routing table. If the data frame received by the current node is not sent to the current node, when the current node needs to forward it, the current node finds the next-level child node based on the target address of the data frame and the routing table of the target time period, and then forwards the data frame to the corresponding child node. In this way, routing control can be implemented based on the routing table of the current node in each routing time period, ensuring routing performance, which can not only improve communication quality and reliability, but also because of the regular changes in power load, the routing table does not need to be frequently maintained, and the maintenance overhead of the routing table can be greatly reduced.

[0113] See also Fig. 9 In some embodiments, the node routing method further comprises:

[0114] Step 014: When the routing performance of the current node does not meet the preset conditions, the process again proceeds to the step of dividing the routing time periods based on the power load data corresponding to the current node.

[0115] Specifically, the power load and the carrier channel are strongly correlated, and the time-varying law of the power load is the direct cause of the carrier channel. For example, the daily, weekly or monthly power load is related to the user's power consumption habits, power equipment, etc., and shows a strong regularity. However, as the factors related to the power load change (such as changes in users and power equipment), the changing law of the power load will also change accordingly, making the routing time period divided based on the original power load curve no longer accurate, which may lead to a decrease in routing performance. It is necessary to re-acquire the changed power load curve to divide the routing time period.

[0116] Therefore, when the routing performance of the current node does not meet the preset conditions, it is possible to re-divide multiple routing time periods based on the power load data corresponding to the current node (specifically the changed power load data), and then re-establish the corresponding routing table in each re-divided routing time period. Under the premise of ensuring the routing performance of the current node, the overhead of re-establishing the routing table is relatively small because the changing pattern of the power load rarely changes.

[0117] Optionally, the routing performance of the current node does not meet the preset condition, including at least one of the following conditions:

[0118] (1) The number of invalid paths in the routing table of the current node is greater than a first preset number.

[0119] The invalid path is a path that cannot send data to the child node when routing is performed based on the existing paths in the routing table, and the first preset number may be proportional to the total number of paths in the routing table.

[0120] (2) In the routing table of the current node, the number of unreliable paths whose response time is lower than the preset response time is greater than a second preset number.

[0121] Among them, an unreliable path is when routing is performed based on an existing path in the routing table. After sending data to a child node, although the data can be sent to the child node, the response time of the child node is too long. The second preset number may also be proportional to the total number of paths in the routing table.

[0122] (3) In the routing table of the current node, the number of abnormal paths responding to data anomalies is greater than a third preset number.

[0123] Among them, the abnormal path is a path in which, when routing is performed based on the existing path in the routing table, after the request data is sent to the child node, although it can be sent to the child node, the response data of the child node does not match the request data. The third preset number may also be proportional to the total number of paths in the routing table.

[0124] In some embodiments, when a child node is offline or reconnects to the network, the current node will actively send a registration request to the proxy node (such as the parent node), and the proxy node can send confirmation data to update the routing table based on the communication data between the two.

[0125] In summary, this application has the following advantages:

[0126] (1) The existing technology determines the path weight and establishes the path based on the channel and link signal quality, such as signal-to-noise ratio, bit error rate, packet loss rate and other indicators (because the signal-to-noise ratio and bit error rate of the non-dedicated power line channel are difficult to measure, and the packet loss rate has a large overhead and slow response). It can achieve multi-path redundancy, but the adaptability is poor. The path at the previous moment may fail at the next moment. Once it fails, other paths need to be tried multiple times, which wastes channel resources and is inefficient. However, the present application makes full use of the regular changes in power load and establishes a routing table that adapts to different time periods, so that a routing table for different time periods can be established, that is, the best route that adapts to different time periods is established. It can greatly improve the effectiveness and utilization of the path, greatly reduce the failure rate of one-time addressing, and improve communication reliability.

[0127] (2) The existing technology establishes routes based on the channel and link signal quality. The establishment and update maintenance of routes are random and uncertain. Once the addressing fails, the effective path (which may be effective in other time periods) will be rebuilt or judged as invalid, resulting in frequent network reconstruction or update, increasing network congestion and overhead. This patent improves the establishment of routing tables, can better adapt to the channel characteristics at different times, greatly reduces the occurrence of frequent networking or path table reconstruction, and reduces the maintenance overhead of the path table.

[0128] (3) The method proposed in this patent has strong operability, does not change the existing system hardware structure, and basically does not increase the hardware cost. It can be used in many fields such as electricity meter reading and street light control. Compared with the existing technology, it can greatly improve network reliability and communication efficiency.

[0129] See also Fig.10 In order to better implement the node routing method of the embodiment of the present application, the embodiment of the present application also provides a node routing device 10. The node routing device 10 may include a division module 11, an establishment module 12 and a control module 13. The division module 11 is used to divide a plurality of routing time periods based on the power load data corresponding to the current node, and the power load data is determined based on the power data collected by the power collection terminal connected to the current node; the establishment module 12 is used to respectively establish the routing table of the current node in each routing time period, and the routing table includes the child nodes of the current node; the control module 13 is used to perform routing control on the current node based on the routing table of each routing time period.

[0130] The node routing device 10 is described above from the perspective of functional modules in conjunction with the accompanying drawings. The functional modules can be implemented in hardware form, can be implemented in software form, or can be implemented in combination with hardware and software modules. Specifically, each step of the method embodiment in the embodiment of the present application can be implemented by the node routing device 10. For example, it can be completed by the hardware integrated logic circuit and / or software form instructions in the processor, and the steps of the method disclosed in the embodiment of the present application can be directly embodied as a hardware encoding processor, or can be executed by a combination of hardware and software modules in the encoding processor.

[0131] Optionally, the software module may be located in a mature storage medium in the art, such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps in the above method embodiment in combination with its hardware.

[0132] See also Fig.11 The computer device 100 of the embodiment of the present application includes a processor 20, a memory 30 and a computer program, wherein the computer program is stored in the memory 30 and executed by the processor 20, and the computer program includes instructions for executing the node routing method of any of the above embodiments.

[0133] Optionally, the computer device 100 can be any device with image processing capabilities, such as a server or a terminal device (such as a mobile phone, a tablet computer, a display device, a laptop computer, a smart watch, a head-mounted display device, a game console, etc.).

[0134] It should be understood that the various components in the computer device 100 are connected via a bus system, wherein the bus system includes not only a data bus but also a power bus, a control bus and a status signal bus.

[0135] See also Fig.12 The communication system 1000 of the embodiment of the present application includes multiple computer devices 100 and a controller 200. The current node of each node of the network topology formed by the multiple computer devices 100 can be any computer device 100; the controller 200 is used to execute the node routing method of any of the above embodiments.

[0136] The controller 200 may be a processor 20 of any computer device 100 , or the controller 200 may include multiple controllers 200 , each of which is a processor 20 of each computer device 100 .

[0137] See also Fig.13 The embodiment of the present application also provides a computer-readable storage medium 300 on which a computer program 310 is stored. When the computer program 310 is executed by a processor 320, the steps of the node routing method of any of the above-mentioned embodiments are implemented. For the sake of brevity, they are not repeated here.

[0138] In the description of this specification, the descriptions with reference to the terms "certain embodiments", "in an example", "exemplarily", etc., mean that the specific features, structures, materials or characteristics described in conjunction with the embodiments or examples are included in at least one embodiment or example of the present application. In this specification, the schematic representations of the above terms do 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. In addition, those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples, unless they are contradictory.

[0139] Any process or method description in a flowchart or otherwise described herein may be understood to represent a module, segment or portion of code that includes one or more executable instructions for implementing the steps of a specific logical function or process, and the scope of the preferred embodiments of the present application includes alternative implementations in which functions may not be performed in the order shown or discussed, including performing functions in a substantially simultaneous manner or in the reverse order depending on the functions involved, which should be understood by technicians in the technical field to which the embodiments of the present application belong.

[0140] 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 node routing method, characterized in that: include: Dividing a plurality of routing time periods based on power load data corresponding to a current node, wherein the power load data is determined based on power data collected by a power collection terminal connected to the current node; Establishing a routing table of the current node in each routing period respectively, wherein the routing table includes child nodes of the current node; Based on the routing table of each routing period, routing control is performed on the current node.

2. The node routing method according to claim 1, characterized in that: The method of dividing a plurality of routing time periods based on the power load data corresponding to the current node includes: Performing linear regression processing on each of the power load data and the collection time of each of the power load data to generate a power load curve; Based on the power load curve, a plurality of routing time periods are divided.

3. The node routing method according to claim 2, characterized in that: The performing linear regression processing on each of the power load data and the collection time of each of the power load data to generate a power load curve includes: Based on a preset data sample amount, each of the power load data is divided into a plurality of sample sets, and a sample period corresponding to each sample set is determined; Performing linear regression processing on each of the sample sets respectively to generate a regression curve under each of the sample time periods; The power load curve is generated based on the regression curve in each of the sample time periods.

4. The node routing method according to claim 2 or 3, characterized in that: The dividing of the plurality of routing time periods based on the power load curve comprises: Determine a characteristic point of the power load curve, wherein the characteristic point includes at least one of a maximum point, a minimum point, and a mean point; Based on the characteristic value, the power load curve is divided into a plurality of segmented curves; Based on the time range corresponding to each of the segmented curves, each of the routing time periods is determined respectively.

5. The node routing method according to claim 2 or 3, characterized in that: The linear regression process is implemented based on at least one of least squares method, gradient descent, stochastic gradient descent, particle swarm algorithm and Newton's method.

6. The node routing method according to claim 1, characterized in that: The respectively establishing the routing table of the current node in each routing period includes: In any routing period, controlling the current node to send a networking command broadcast frame; Determine the child nodes of the current node based on the received response frames fed back by other nodes; Based on the address of the child node of the current node and the any routing period, the routing table corresponding to the any routing period is established.

7. The node routing method according to claim 6, characterized in that: The controlling the current node to send a networking command broadcast frame within any routing period includes: At the target time of any routing period, the current node is controlled to send a networking command broadcast frame, the target time is the start time or the end time of any routing period, and the power load data corresponding to the target time is the extreme value or the average value of any routing period.

8. The node routing method according to claim 1 or 6, characterized in that: The routing table also includes a parent node of the current node, and the current node is any node in the power line carrier communication network.

9. The node routing method according to claim 1, characterized in that: The performing routing control on the current node based on the routing table in each time period includes: Obtaining a routing table for a target time period at the current time, wherein the target time period is any of the routing time periods; In a case where the target address of the data frame received by the current node is not the current node, the data frame is forwarded to the corresponding child node based on the target address and the routing table of the target time period.

10. The node routing method according to claim 1, characterized in that: Also includes: When the routing performance of the current node does not meet the preset conditions, the step of dividing the routing time periods based on the power load data corresponding to the current node is entered again.

11. The node routing method according to claim 10, characterized in that: The routing performance of the current node does not meet the preset condition, including at least one of the following conditions: The number of invalid paths in the routing table of the current node is greater than a first preset number; In the routing table of the current node, the number of unreliable paths whose response time is lower than the preset response time is greater than a second preset number; In the routing table of the current node, the number of abnormal paths responding to data anomalies is greater than a third preset number.

12. The node routing method according to claim 1, characterized in that: The power load data is determined based on power data collected by the power collection terminal within a preset time period, and the preset time period includes one day, one week or one month.

13. The node routing method according to claim 12, characterized in that: The power data is processed by data cleaning and data normalization to generate the power load data.

14. A node routing device, characterized in that: include: A division module, used to divide a plurality of routing time periods based on power load data corresponding to a current node, wherein the power load data is determined based on power data collected by a power collection terminal connected to the current node; An establishing module, used to establish a routing table of the current node in each routing period respectively, wherein the routing table includes child nodes of the current node; A control module is used to perform routing control on the current node based on the routing table of each routing period.

15. A computer device, characterized in that: include: Processor, memory; and A computer program, wherein the computer program is stored in the memory and executed by the processor, and the computer program includes instructions for executing the node routing method according to any one of claims 1 to 13.

16. A communication system, characterized in that: include: A plurality of computer devices, and respective nodes of a network topology formed by the plurality of computer devices; A controller, wherein the controller is used to execute the node routing method described in any one of claims 1 to 13.

17. A non-volatile computer-readable storage medium comprising a computer program, wherein when the computer program is executed by a processor, the processor executes the node routing method according to any one of claims 1 to 13.

Images