Transmission path selection method of Mesh network, storage medium and node equipment

Abstract

The embodiment of the invention discloses a transmission path selection method of a Mesh network, a storage medium and node equipment, and relates to the field of wireless communication. A node in the invention receives a management frame which is sent by an online node in a Mesh network and contains link depth, link delay, the number of child nodes, link load and a sender MAC (Media Access Control) address, and a candidate father node list is generated according to the management frame. And measuring the link receiving signal strength of the candidate father node, and calculating the final link delay and the final link load in combination with the analysis information. And performing weighted summation on each index after normalization processing to obtain comprehensive scores of candidate father nodes, selecting the candidate father node with the highest score as a target father node and performing association, and broadcasting a self management frame after successful association. The link quality is evaluated by integrating multiple indexes, the load balancing is considered, the network change can be dynamically adapted, and the network performance and stability are improved.

Description

Technical Field

[0001] The present application relates to the field of wireless communications, and in particular to a transmission path selection method, storage medium, and node device for a Mesh network. Background Art

[0002] In a Mesh network, the process of new nodes accessing the network and the transmission path selection strategy directly affect the performance of the network. At present, when an offline node accesses a deployed and normally operating Mesh network, a relatively basic and common path selection method is usually adopted. Specifically, before accessing the network, the offline node will actively scan the potential parent nodes in the surrounding environment, and generate a list of candidate parent nodes by analyzing and processing the scan results. Subsequently, the offline node will measure the received signal strength (RSSI) of each parent node in the list. Based on the measured received signal strength value, the offline node will select the parent node with the largest received signal strength as the target parent node, and use this to determine the data transmission path.

[0003] However, this selection method lacks consideration for the overall network topology and load balancing. In a mesh network, the load on each node changes dynamically as the network operates. If a large number of nodes tend to select the parent node with the strongest received signal strength, this can lead to an overload on the network surrounding that parent node and the surrounding area, while other nodes with weaker signal strength but lower loads are underutilized. This load imbalance not only reduces overall network efficiency but can also cause network congestion, further deteriorating communication quality, and even preventing some nodes from communicating properly, impacting network stability and reliability.

[0004] Furthermore, as mesh networks continue to expand in scale and complexity, communication relationships between nodes become increasingly complex. Methods that rely solely on received signal strength to select paths struggle to adapt to this dynamically changing network environment and are unable to promptly and accurately select the optimal transmission path. This limits the performance of mesh networks in larger-scale and more complex application scenarios.

[0005] Therefore, the existing method of selecting the target parent node and transmission path based on the maximum received signal strength has obvious shortcomings in ensuring the communication quality of the Mesh network, achieving load balancing, and adapting to complex dynamic network environments. It is urgent to propose a more effective and comprehensive node access and transmission path selection method to improve the overall performance of the Mesh network. Summary of the Invention

[0006] The present invention provides a transmission path selection method, storage medium, and node device for a Mesh network, which can address the problem of poor Mesh network performance in existing transmission path selection methods. The technical solution is as follows:

[0007] In a first aspect, an embodiment of the present application provides a method for selecting a transmission path in a Mesh network, the method comprising:

[0008] Receive management frames sent by online nodes in an existing Mesh network. The management frames carry the link depth, link delay, number of child nodes, link load, and sender MAC address of the sending node. Link depth indicates the distance between the sending node and the root node, link delay indicates the transmission delay between the sending node and the root node, number of child nodes indicates the number of child nodes associated with the sending node, and link load indicates the maximum load of each sublink between the sending node and the root node.

[0009] Parsing the received management frame and generating a candidate parent node list according to the sender MAC address carried in the management frame; the candidate parent node list includes multiple candidate parent nodes;

[0010] Measure the received signal strength between the current node and the candidate parent node, and use the measurement result as the link received signal strength;

[0011] Measure the signal delay between the current node and the parent node, and sum the measured signal delay and the resolved link delay of the parent node to obtain the final link delay;

[0012] Measure the link load between the current node and the parent node, and take the maximum value of the calculated link load and the resolved link load of the parent node to obtain the final link load;

[0013] Normalize the resolved link depth, link received signal strength, final link delay, final link load, and the number of resolved child nodes;

[0014] Perform weighted summation on the normalized index values ​​to obtain the comprehensive score of each candidate parent node;

[0015] The parent node with the largest comprehensive score is selected as the target parent node;

[0016] Associate with the target parent node. After successful association, send a management frame carrying link depth, link delay, number of child nodes, link load and its own MAC address through the broadcast channel.

[0017] In a second aspect, an embodiment of the present application provides a node device, the device comprising:

[0018] The transceiver unit is used to receive management frames sent by online nodes in an existing Mesh network. The management frames carry the link depth, link delay, number of child nodes, link load, and MAC address of the sending node. The link depth indicates the distance between the sending node and the root node, the link delay indicates the transmission delay between the sending node and the root node, the number of child nodes indicates the number of child nodes associated with the sending node, and the link load indicates the maximum load of each sublink between the sending node and the root node.

[0019] A parsing unit, configured to parse a received management frame and generate a candidate parent node list according to a sender MAC address carried in the management frame; the candidate parent node list includes a plurality of candidate parent nodes;

[0020] A measurement unit is used to measure the received signal strength between the current node and the candidate parent node, and use the measurement result as the link received signal strength;

[0021] The measuring unit is further configured to measure the signal delay between the current node and the parent node, and to sum the measured signal delay and the resolved link delay of the parent node to obtain a final link delay;

[0022] The measuring unit is further configured to measure the link load between the current node and the parent node, and take the maximum value of the calculated link load and the resolved link load of the parent node to obtain a final link load;

[0023] A normalization unit, configured to normalize the resolved link depth, link received signal strength, final link delay, final link load, and the number of resolved child nodes;

[0024] A selection unit is used to perform weighted summation of the normalized index values ​​to obtain a comprehensive score of each candidate parent node, and to select the parent node with the largest comprehensive score as the target parent node;

[0025] The transceiver unit is further configured to associate with the target parent node, and after successful association, send a management frame carrying link depth, link delay, number of child nodes, link load and its own MAC address through a broadcast channel.

[0026] In a third aspect, an embodiment of the present application provides a computer storage medium, wherein the computer storage medium stores a plurality of instructions, wherein the instructions are suitable for being loaded by a processor and executing the above-mentioned method steps.

[0027] In a fourth aspect, an embodiment of the present application provides a node device, which may include: a processor and a memory; wherein the memory stores a computer program, and the computer program is suitable for being loaded by the processor and executing the above-mentioned method steps.

[0028] The beneficial effects of the technical solutions provided by some embodiments of the present application include at least:

[0029] This approach not only considers the link's received signal strength, but also integrates multiple key indicators such as link depth, link latency, the number of child nodes, and link load. Link depth reflects the distance from the node to the root node, link latency reflects the timeliness of data transmission, the number of child nodes is related to the network topology and node load capacity, and link load is directly related to the node's data processing capacity. By comprehensively considering these indicators, the link quality between the node and the parent node can be more comprehensively and accurately assessed, avoiding the limitations of relying solely on the received signal strength indicator.

[0030] When calculating the final link load, the maximum value of the link load between the current node and the parent node and the resolved link load of the parent node is taken, fully considering the overall load of the parent node. This way, when selecting the target parent node, the node with lower load will be selected, avoiding the selection of the parent node that is already in a high load state.

[0031] Each time a node connects, it re-receives management frames sent by online nodes, parses the relevant information, and recalculates the comprehensive scores of each candidate parent node. This means that even if network conditions change, such as the movement of other nodes or the appearance or disappearance of obstacles, causing changes in the signal strength and link quality of a parent node, the new method can promptly detect and re-evaluate the strengths and weaknesses of each candidate parent node, selecting the most suitable parent node at the current moment. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0033] Figure 1 This is a schematic diagram of the network architecture of the Mesh network provided in an embodiment of the present application;

[0034] Figure 2 This is a flow chart of a transmission path selection method for a Mesh network provided in an embodiment of the present application;

[0035] Figure 3 This is a schematic diagram of the structure of a node device provided by this application;

[0036] Figure 4 is a schematic diagram of the computer storage medium provided by this application;

[0037] Figure 5 This is a structural diagram of a node device provided by this application. DETAILED DESCRIPTION

[0038] In order to make the objectives, technical solutions and advantages of the present application clearer, the embodiments of the present application will be described in further detail below with reference to the accompanying drawings.

[0039] Figure 1 The figure shows the network architecture of the Mesh network that can be applied to the present application.

[0040] like Figure 1 As shown, the network architecture may include: multiple node devices, each of which communicates with each other through the wireless WiFi protocol. The Mesh network is a tree structure, with node device 0 as the root node, node device 0's two child nodes being node device 1 and node device 2, node device 1's child nodes being node device 11 and node device 12, and node device 2's child node being node device 21. When a node device needs to join Figure 1 When an existing Mesh network is connected, a candidate parent node is selected for association according to the path selection method of this application.

[0041] It should be understood that Figure 1 The number of node devices and network topology shown are for reference only. Configure them based on your needs.

[0042] The following will be combined with the Figure 2 , the transmission path selection method of the Mesh network provided by the embodiment of the present application is described in detail. Among them, the node device in the embodiment of the present application can be Figure 1 The node device shown.

[0043] See Figure 2 , provides a flow chart of a transmission path selection method for a Mesh network according to an embodiment of the present application. Figure 2 As shown, the method of the embodiment of the present application may include the following steps:

[0044] S201. The current node receives a management frame sent by an online node in an existing Mesh network. The management frame carries the link depth, link delay, number of child nodes, link load, and MAC address of the sending node.

[0045] The current node can be an offline node, or it can be a node at a specified location. For example, if the current node is the online node with the highest link depth in the mesh network, then steps S202 to S209 can be periodically executed to dynamically update the mesh network topology. To access an existing mesh network, the current node must actively listen for management frames sent by online nodes. Management frames play a management role in the mesh network, carrying a range of critical information about the sending node. BEACON frames and probe response frames are two common types of management frames. BEACON frames are typically broadcast periodically by nodes in the network to announce the existence of the network, synchronize node clocks, and provide basic network configuration information. Probe response frames are responses returned by the probed node after a node initiates a probe request. By receiving these management frames, the current node can obtain information about the sending node, such as link depth, link latency, number of child nodes, link load, and the sender's MAC address. The link depth reflects the hierarchical relationship between the sender node and the root node. The closer to the root node, the smaller the link depth, which usually means that the number of hops for data transmission to the root node is fewer; the link delay indicates the data transmission delay between the sender node and the root node. The smaller the delay, the better the real-time performance of the data transmission; the number of child nodes reflects the number of child nodes currently associated with the sender node. Too many child nodes may cause the node to be overloaded; the link load indicates the maximum load of each sublink between the sender node and the root node. Excessive load may affect the efficiency of data transmission; the sender MAC address is used to uniquely identify the identity of the sending node.

[0046] S202: Parse the received management frame, and generate a candidate parent node list according to the sender MAC address carried in the management frame.

[0047] After receiving a management frame, the current node needs to parse the data in the frame and extract useful information. The parsing process involves identifying the management frame format and extracting the data to ensure that the sender's MAC address and other relevant parameters can be accurately obtained. Based on the parsed sender's MAC address, the current node selects these online nodes as candidate parent nodes and generates a candidate parent node list. The candidate parent node list is the basis for the subsequent selection of the target parent node and contains information about all online nodes that may become the parent node of the current node. When generating the list, each candidate parent node needs to be marked so that it can be easily operated and analyzed later.

[0048] For example, after receiving management frames from multiple online nodes, the current node begins parsing these frames. For example, for the node with the MAC address 00:1A:2B:3C:4D:5E mentioned earlier, the current node records its information and marks it as candidate parent node 1. Simultaneously, it receives a management frame from another node with the MAC address 00:1A:2B:3C:4D:5F. After parsing the relevant information, the current node marks it as candidate parent node 2. After multiple receptions and parsing, the current node generates a list of candidate parent nodes, such as candidate parent node 1 (MAC address 00:1A:2B:3C:4D:5E) and candidate parent node 2 (MAC address 00:1A:2B:3C:4D:5F).

[0049] S203: Measure the received signal strength between the current node and the candidate parent node, and use the measurement result as the link received signal strength.

[0050] The current node needs to measure the received signal strength (RSSI) between itself and the candidate parent node. RSSI is a key indicator of wireless link quality, reflecting the signal attenuation during transmission. The current node uses its wireless module to send a probe signal to the candidate parent node and receive a return signal. During signal reception, the wireless module measures the signal strength to obtain the RSSI value. A higher RSSI value generally indicates better signal quality and higher data transmission reliability. However, it should be noted that RSSI is affected by various factors, such as distance, obstacles, and electromagnetic interference. Therefore, RSSI alone cannot be used to fully assess link quality.

[0051] In some possible embodiments of the present application, a node in the candidate parent node list whose received signal strength is less than a first strength threshold is proposed.

[0052] The preset first strength threshold is determined based on a combination of factors, including network design requirements, actual environmental conditions, and communication quality standards. For example, in a small indoor mesh network, given the shorter signal propagation distance and relatively low interference, the strength threshold might be set to -70dBm. In a large outdoor mesh network, given the longer signal propagation distance and potential for more interference sources, the strength threshold might be set to -85dBm. This threshold is used to select candidate parent nodes whose signal quality meets basic communication requirements.

[0053] The current node continuously monitors the received signal strength of each candidate parent node. Upon obtaining the RSSI value of a candidate parent node, it compares it to a preset first strength threshold. This is because signal strength directly impacts the reliability and stability of data transmission. If the signal strength is too weak, data transmission is more susceptible to noise, interference, and other factors, leading to increased bit error rates and data loss, thus affecting the performance of the entire network.

[0054] If the received signal strength of a candidate parent node is found to be less than the strength threshold, the current node will determine that the candidate parent node cannot provide a stable and reliable communication connection under the current network environment. To optimize the subsequent parent node selection process, the current node will remove the candidate parent node from the candidate parent node list. For example, suppose the current node has collected information on five candidate parent nodes. After signal strength monitoring, it is found that the RSSI value of one of the candidate parent nodes is -90dBm. The preset first strength threshold is -85dBm. In this case, the current node will remove the candidate parent node with an RSSI value of -90dBm from the list.

[0055] The elimination operation of this application is based on a comprehensive consideration of network performance and communication quality. By excluding candidate parent nodes with weak signal strength, unnecessary calculation and analysis of these inappropriate nodes can be avoided in the subsequent parent node selection process, thereby saving computing resources.

[0056] During the parent node selection process, the current node typically needs to perform a series of complex evaluations and calculations on candidate parent nodes, such as link load, signal delay, and packet error rate, and then comprehensively sort and select them based on these metrics. If the candidate parent node list contains a large number of nodes with weak signal strength, performing these calculations on these nodes will waste a lot of computing resources and time.

[0057] By eliminating candidate parent nodes whose received signal strength falls below the strength threshold, the length of the candidate parent node list is shortened accordingly. This reduces the amount of data to be processed in subsequent calculations, lowering computational complexity and effectively reducing the amount of computation required. For example, if calculations were originally required for five candidate parent nodes, eliminating one reduces the number of candidate parent nodes to four, a 20% reduction in computational effort.

[0058] By comparing the received signal strength of candidate parent nodes at the current node against a strength threshold and removing candidate parent nodes with signal strengths below the threshold from the list, the computational effort required for subsequent parent node selection can be significantly reduced. This not only improves the processing efficiency of the current node and reduces energy consumption, but also speeds up parent node selection, enabling the current node to establish a stable communication connection more quickly, thereby improving the performance and responsiveness of the entire Mesh network. This screening mechanism also helps improve network connection reliability by eliminating candidate parent nodes with poor signal quality, reducing the possibility of communication failures due to signal issues.

[0059] S204: Measure the signal delay between the current node and the candidate parent node, and sum the measured signal delay and the resolved link delay of the parent node to obtain a final link delay.

[0060] Among them, the current node not only needs to measure the signal delay between itself and the candidate parent node, but also needs to combine the link delay of the parent node parsed from the management frame to calculate the final link delay. Signal delay refers to the time required for the signal to transmit from the current node to the candidate parent node. The current node can measure the signal delay by sending a specific test data packet and recording the timestamps of sending and receiving. The link delay parsed from the management frame is the transmission delay between the candidate parent node and the root node. Adding the two together, we can get the final link delay from the current node to the root node through the candidate parent node. The final link delay reflects the total time it takes for data to be transmitted from the current node to the root node. The smaller the delay, the better the real-time performance of the data transmission.

[0061] For example, the current node sends a test packet to candidate parent node 1 (MAC address 00:1A:2B:3C:4D:5E), recording the send time as 10:00:00. After receiving the packet, candidate parent node 1 immediately returns a response packet, and the current node records the receive time as 10:00:02. The calculated signal delay is 2ms. The link delay for candidate parent node 1, parsed from the previously received management frame, is 20ms. Adding these two together, the final link delay is 22ms. For candidate parent node 2 (MAC address 00:1A:2B:3C:4D:5F), the current node measures a signal delay of 3ms, and the parsed link delay is 18ms, resulting in a final link delay of 21ms.

[0062] In some embodiments of the present application, the process of measuring the signal delay between the current node and the candidate parent node includes:

[0063] The current node generates a series of specific test data packets, which typically contain specific information for identification and recording, such as the packet's sequence number and transmission timestamp. The current node then sends these test data packets to the parent node at regular intervals via its own wireless communication module. The selection of the time interval requires comprehensive consideration of various factors. If the interval is too short, network congestion may occur, affecting the accuracy of the test results; if the interval is too long, the measurement time will be extended, reducing measurement efficiency. For example, in a relatively stable mesh network environment, you can choose to send a test data packet every 100 milliseconds, sending a certain number of packets (e.g., 10) to ensure that sufficient data is obtained to calculate the signal delay.

[0064] After receiving the test data packet sent by the current node, the candidate parent node immediately records the reception timestamp and feeds this information back to the current node. After receiving the feedback information from the parent node, the current node can calculate the transmission duration of each data packet based on the transmission timestamp and reception timestamp of each data packet. The transmission timestamp is the time recorded when the current node sends the data packet, and the reception timestamp is the time recorded when the parent node receives the data packet. The difference between the two is the transmission duration of the data packet. Due to the instability of the network environment, the transmission duration of each data packet may vary. For example, during the transmission process, it may be affected by factors such as signal interference and network congestion, resulting in longer transmission times for some data packets. Therefore, it is necessary to calculate the transmission duration of multiple data packets to enable more accurate calculations later.

[0065] To eliminate the randomness of individual data packet transmission times and improve the accuracy of signal delay measurements, the current node needs to average the transmission times of each data packet. This average is calculated by adding the transmission times of all data packets and then dividing by the total number of data packets. The average value obtained in this way can more accurately reflect the signal delay between the current node and the parent node. For example, if the calculated average transmission time is 21.3 milliseconds, then the signal delay between the current node and the candidate parent node can be considered to be approximately 21.3 milliseconds.

[0066] S205: Measure the link load between the current node and the parent node, and take the maximum value of the calculated link load and the resolved link load of the parent node to obtain a final link load.

[0067] The current node measures the link load between itself and the candidate parent node, compares the calculated link load with the parsed link load of the parent node, and takes the maximum of the two as the final link load. Link load reflects the busyness of a link and is typically expressed as the amount of data transmitted over a given period of time. The current node can measure link load by monitoring the data flow between itself and the candidate parent node. The link load parsed from management frames is the maximum load of each sublink between the candidate parent node and the root node. Taking the maximum of the two as the final link load ensures that the busiest portion of the entire link is considered, avoiding the selection of overly loaded links that could affect data transmission efficiency.

[0068] For example, the current node monitors the data traffic between it and candidate parent node 1 (MAC address 00:1A:2B:3C:4D:5E). After a period of statistics, the calculated link load is 60%. Meanwhile, the link load for candidate parent node 1, parsed from previously received management frames, is 70%. Comparing the two, the maximum value (70%) is taken as the final link load. For candidate parent node 2 (MAC address 00:1A:2B:3C:4D:5F), the current node measures a link load of 50%, and the parsed link load is 65%, resulting in a final link load of 65%.

[0069] S206: Normalize the link received signal strength, the final link delay, the final link load, and the number of resolved child nodes.

[0070] Because metrics such as link received signal strength, final link delay, final link load, and the number of resolved child nodes have different units and dimensions, direct comparison and calculation may result in inaccurate results. Therefore, these metrics need to be normalized to bring them into the same dimensional range. There are many normalization methods, including linear normalization and Z-score normalization. Through normalization, the values ​​of each metric can be mapped to a specific interval (such as [0, 1]), making them comparable across metrics and providing a foundation for subsequent comprehensive score calculations.

[0071] In some possible embodiments of the present application, the normalization method includes:

[0072] The resolved link depth, link received signal strength, final link delay, final link load, and the number of resolved child nodes are normalized according to the following formula:

[0073] x normal ={1-(xx min ) / (x max -x min+α)}, x represents the index value before normalization, x min Indicates the preset minimum indicator value, x min represents the preset maximum index value, α represents the preset constant value, and x norma l represents the normalized index value.

[0074] In a mesh network, when evaluating and selecting a parent node, the current node comprehensively considers multiple metrics, including link depth, link received signal strength, final link latency, final link load, and the number of resolved child nodes. However, the physical meaning and value ranges of these metrics vary. For example, link depth is typically a non-negative integer representing the number of hops from the current node to the root node, and its value range may start from 1 and gradually increase; link received signal strength is generally measured in dBm and is a negative number, ranging from -100 dBm to 0 dBm; link latency is typically measured in milliseconds, ranging from a few milliseconds to several hundred milliseconds; link load is a percentage value, ranging from 0% to 100%; and the number of child nodes is a positive integer, whose value range depends on the scale of the network and the node's connectivity.

[0075] Because these metrics have different value ranges and units, it's unreasonable to directly evaluate and compare them. For example, you can't simply add the link depth and link received signal strength values ​​to compare the performance of different parent nodes. Therefore, these metrics need to be normalized to the same value range, typically [0, 1], to ensure a fair and reasonable comprehensive evaluation.

[0076] The core idea of ​​the normalization process in this application is to map the original index value x to the interval [0,1]. First, calculate x and x min The difference (xx min ), which indicates the degree of deviation of the current indicator value from the minimum value. Then, calculate x max with x min The difference (x max -x min ), which represents the range of values ​​of the indicator. To prevent the denominator from being zero, a constant value α is introduced. By dividing the degree of deviation by the range of values ​​(after adding α), a relative ratio is obtained. Finally, this relative ratio is subtracted from 1 to obtain the normalized value x normal .

[0077] x min and x max It is preset according to the actual needs and indicator characteristics of the network. For example, for the link received signal strength, if the network design requires normal communication between -90dBm and -30dBm, then xmin =-90dBm, x max =-30dBm. α is a small positive number, which is used to avoid max and x min When they are equal, the denominator is zero, resulting in calculation errors. At the same time, α can also fine-tune the normalized result to make it more in line with actual needs.

[0078] When x=x min When x normal =1, indicating that the indicator is in the optimal state; when x=x max When x normal =0, indicating that the indicator is in the worst state; when x is in x min and x max When x normal The value is between 0 and 1, reflecting the relative quality of the indicator.

[0079] The following is an example of normalization processing of various indicator values.

[0080] Link depth: Assume the preset minimum link depth x min =1, maximum link depth x max =5, α=0.1. If the link depth x of a candidate parent node is x=3, then the normalized link depth x normal =1-(3-1) / (5-1+0.1)=1-4.12≈0.51.

[0081] Link receiving signal strength: preset x min =-90dBm, x max =-30dBm, α = 0.1. If the link received signal strength x of a candidate parent node is x = -60dBm, then the normalized link received signal strength x normal =1-(-60-(-90)) / (-30-(-90)+0.1)=1-60.130≈0.50.

[0082] Final link delay: Assume x min =10ms,x max = 200ms, α = 0.1. When the final link delay x of a candidate parent node is 50ms, the normalized final link delay x normal =1-(50-10) / (200-10+0.1)=1-190.140≈0.79.

[0083] Final link load: preset x min =0%, x max =100%, α=0.1. If the final link load x of a candidate parent node is 30%, then the normalized final link load xnormal =1-(30-0) / (100-0+0.1)=1-100.130≈0.70.

[0084] Number of child nodes: Assume x min =0,x max =10, α = 0.1. When the number of child nodes of a candidate parent node is x = 5, the normalized number of child nodes x normal =1-(5-0) / (10-0+0.1)=1-10.15≈0.50.

[0085] By using the above normalization formula to normalize metrics such as link depth, link received signal strength, final link latency, final link load, and the number of child nodes, the current node can convert metrics with different value ranges and units to the [0, 1] interval. This allows these metrics to be compared and comprehensively evaluated on a consistent scale, providing a fair and reasonable basis for subsequent parent node selection. Normalization eliminates dimensional differences between metrics, improving the accuracy and reliability of evaluation, and assisting the current node in selecting a parent node with better performance, thereby enhancing the performance and stability of the entire mesh network. Furthermore, the normalized metrics facilitate comprehensive calculations such as weighted summation, further optimizing the parent node selection algorithm.

[0086] S207 , performing weighted summation on the normalized index values ​​to obtain a comprehensive score for each candidate parent node.

[0087] To comprehensively consider the impact of multiple indicators on candidate parent nodes, such as link received signal strength, final link delay, final link load, and the number of child nodes, a weighted summation of the normalized indicator values ​​is performed to obtain a comprehensive score for each candidate parent node. The weights used in this weighted summation can be set based on actual needs, with different weights reflecting the importance of each indicator in the comprehensive score. For example, if real-time data transmission is more important, a higher weight could be set for link delay; if network load balancing is more important, a higher weight could be set for link load. This weighted summation yields a score that comprehensively reflects the quality of the candidate parent node.

[0088] For example, assume the weight of link received signal strength is 0.3, the weight of final link delay is 0.2, the weight of final link load is 0.3, and the weight of the number of child nodes is 0.2. For candidate parent node 1, the normalized link received signal strength is 0.417, the final link delay is 0.22, the final link load is 0.7, and the number of child nodes is 0.25. Its comprehensive score is 0.417*0.3+0.22*0.2+0.7*0.3+0.25*0.2=0.4451. Similarly, calculate the comprehensive score for candidate parent node 2.

[0089] In some possible embodiments of the present application, the weights of various indicator values ​​are dynamically adjusted according to the business scenario:

[0090] When the measured link received signal strength value is less than the second strength threshold and greater than the first strength threshold, reducing the weight of the link received signal strength according to a preset weight adjustment rule;

[0091] When the calculated final link load is greater than the load threshold, the weight of the final link load is increased according to a preset weight adjustment rule.

[0092] In the actual operation of Mesh networks, different business scenarios have significantly different requirements for network performance indicators. For example, for video calls, which require extremely high real-time performance, link latency and signal strength are key indicators. Unstable signals or excessive latency can cause video freezes and audio desynchronization, severely impacting the user experience. For file downloads, which require high data volumes, link load and bandwidth utilization are even more crucial. High loads can lead to slower downloads or even download failures. Therefore, the current node needs to dynamically adjust the weights of various indicators based on the current business scenario to ensure that parent node selection best meets business needs.

[0093] The current node monitors the link received signal strength value. When the measured link received signal strength value is less than the second strength threshold and greater than the first strength threshold, it means that the current signal strength is in a relatively unstable range. For example, assuming the first strength threshold is -85dBm and the second strength threshold is -75dBm, when the measured link received signal strength value is -80dBm, the trigger condition is met. In this case, although the signal can still maintain basic communication, the signal quality is relatively poor and is easily affected by external interference, resulting in reduced reliability of data transmission.

[0094] According to the preset weight adjustment rules, the current node will reduce the weight of the link received signal strength. This is because within this signal strength range, simply relying on improving signal strength to improve overall network performance has limited effect, and other indicators (such as link delay, link load, etc.) may have a more significant impact on the business. For example, in the video call business, even if the signal strength is around -80dBm, if the link delay is too high, it will still cause video freezes. Therefore, reducing the weight of the link received signal strength can make the current node pay more attention to other indicators that have a greater impact on the business during the parent node selection process.

[0095] Assume that the original weight of the link received signal strength is 0.3. According to the preset rule, when the signal strength is between -85dBm and -75dBm, the weight is reduced by 0.1, and the adjusted weight becomes 0.2.

[0096] The current node calculates the final link load. When the calculated final link load exceeds the load threshold, it indicates that the current link has already assumed a significant amount of data transmission, approaching or exceeding its carrying capacity. For example, if the load threshold is 70%, and the calculated final link load is 80%, the weight adjustment condition is triggered. In this case, continuing to select this link as the parent node may cause link congestion, reduced data transmission speeds, and even data loss.

[0097] Based on preset weight adjustment rules, the current node increases the weight of the final link load. This is because highly loaded links have a greater impact on services. Increasing their weight can make the current node more inclined to choose links with lower loads during parent node selection, thereby avoiding link congestion and improving data transmission efficiency and stability. For example, in file download services, selecting links with lower loads can ensure stable download speeds and reduce download times.

[0098] Adjustment example: Assume that the original final link load weight is 0.2. According to the preset rule, when the link load is greater than 70%, the weight is increased by 0.1, and the adjusted weight becomes 0.3.

[0099] By dynamically adjusting the weights of various metrics based on the business scenario, the current node can more accurately select a parent node suitable for the current business. When signal strength is relatively unstable but still within an acceptable range, reducing the weight of the link's received signal strength can avoid excessive focus on signal strength and neglect other important metrics, thereby improving the rationality of parent node selection. When the link load is high, increasing the weight of the final link load can guide the current node to select a link with a lower load, effectively avoiding link congestion and ensuring smooth and stable data transmission.

[0100] S208: The parent node with the largest comprehensive score is used as the target parent node.

[0101] Based on the calculated comprehensive scores of each candidate parent node, the current node selects the parent node with the highest comprehensive score as its target parent node. A higher comprehensive score indicates that the candidate parent node performs better in terms of link received signal strength, final link latency, final link load, and number of child nodes, making it more suitable as the parent node for the current node. Selecting a target parent node is a critical step in connecting the current node to a mesh network, directly impacting the quality and efficiency of subsequent data transmission.

[0102] For example, assume that the comprehensive score of candidate parent node 1 is 0.4451 and the comprehensive score of candidate parent node 2 is 0.42. Since candidate parent node 1 has a higher comprehensive score, the current node selects candidate parent node 1 (MAC address 00:1A:2B:3C:4D:5E) as the target parent node.

[0103] S209: Associating with the target parent node. After successful association, sending a management frame carrying link depth, link delay, number of child nodes, link load and its own MAC address through the broadcast channel.

[0104] After the current node selects its target parent node, it needs to associate with it. The association process typically includes sending an association request frame and the target parent node returning an association response frame. Through the exchange of these frames, a communication connection is established between the current node and the target parent node. After a successful association, the current node officially becomes part of the Mesh network. To announce its existence and provide relevant information to other nodes in the network, the current node sends a management frame carrying link depth, link latency, number of child nodes, link load, and its own MAC address via a broadcast channel. After receiving this management frame, other nodes can update their network topology information to facilitate subsequent data transmission and network management.

[0105] In some possible embodiments of the present application, the management frame is a BEACON frame or a probe response frame. The current node periodically sends a BEACON frame through a broadcast channel, and when it receives a probe request frame sent by an offline node, it responds with a probe response frame. Both the BEACON frame and the probe response frame carry link depth, link delay, number of sub-nodes, link load and its own MAC address.

[0106] For example, the current node sends an association request frame to target parent node 1 (MAC address 00:1A:2B:3C:4D:5E). After receiving the request, target parent node 1 checks its own resources and, if it allows the current node to access, returns an association response frame. After the current node receives the response frame, the association is successful. The current node then generates a management frame containing its own link depth (assumed to be 4, since it is accessed through target parent node 1 and its link depth is 1 greater than that of target parent node 1), link latency (22ms), number of child nodes (initially 0), link load (initially 0%), and its own MAC address (assumed to be 00:1A:2B:3C:4D:60), and sends it via the broadcast channel.

[0107] In some possible embodiments of the present application, calculating the link load of the current node includes:

[0108] Calculate the queue load of the current node: (send queue length of the current node / maximum queue length of the current node)*100%;

[0109] Calculate the packet error rate load of the current node: (number of error packets of the current node / total number of packets sent by the current node) * 100%;

[0110] Calculate the RSSI load of the current node: {1-(RSSI-RSSI min ) / (RSSI max -RSSI min )}*100%, RSSI represents the RSSI of the parent node measured by the current node, RSSI min Indicates the preset minimum signal strength, RSSI max Indicates the preset maximum signal strength;

[0111] The link load of the current node is obtained by taking a weighted average of the above three calculation results.

[0112] The send queue plays a crucial role in a node's network communications. The send queue stores data packets waiting to be sent, and its length reflects the amount of data the node needs to send. The maximum queue length of a node is a threshold set during node design or configuration, representing the maximum number of data packets the node can handle. By calculating the ratio of the node's send queue length to the maximum queue length and multiplying by 100%, we can calculate the node's queue load percentage. This percentage provides a visual representation of the node's send queue occupancy. A high queue load indicates that the node has a large number of data packets waiting to be sent, potentially increasing data transmission delays as data packets need to be queued for processing. For example, when network traffic suddenly increases, a large number of data packets flood the send queue, rapidly increasing the queue length and the queue load. This can affect the efficiency of data exchange between the node and other nodes.

[0113] For example, suppose the maximum queue length of the current node is 100 packets, and there are 30 packets stored in the send queue at the current moment. The queue load is calculated as (30 / 100) * 100% = 30%. This means that the send queue of the current node has occupied 30% of its capacity.

[0114] The packet error rate (PER) is a key metric for measuring data transmission quality. During data transmission at a node, various factors, such as signal interference, long transmission distances, and equipment failures, may cause some data packets to fail to be received correctly during transmission. The number of packet errors for a node refers to the number of data packets sent but not received correctly within a specific time period. The total number of packets sent for a node refers to the total number of data packets sent by the node during that time period. The PER percentage for the node is calculated by multiplying the ratio of the number of packet errors to the total number of packets sent by the node by 100%. A higher PER percentage indicates a greater incidence of errors during data transmission. This not only requires data retransmission, increasing network overhead, but can also compromise data integrity and accuracy. For example, in a high-interference environment, the PER may increase significantly, and the PER percentage will also increase, impacting overall network performance.

[0115] For example, suppose the current node sends 500 data packets in one minute, 25 of which are not received correctly due to errors during transmission. The packet error rate load is calculated as (25 / 500) * 100% = 5%. This indicates that the current node's packet error rate load is 5%.

[0116] RSSI (Received Signal Strength Indication) is the received signal strength indicator, which reflects the strength of the wireless signal between the current node and the parent node. The preset minimum signal strength (RSSI min ) and maximum signal strength (RSSI max ) is a range set according to the network design requirements and actual environment conditions. RSSI min Indicates the minimum signal strength that can ensure normal communication. A value lower than this may cause communication quality to deteriorate or even be interrupted; RSSI max It indicates the maximum signal strength that can be received theoretically. By calculating {1-(RSSI-RSSI min ) / (RSSI max -RSSI min )}*100%, you can get the RSSI load percentage of the current node. The function of this formula is to map the RSSI value to a load percentage. The closer the RSSI value is to the RSSI min When the RSSI load is higher, it means that the signal quality is poor, which may affect the stability and reliability of data transmission; when the RSSI value is closer to RSSI max When the RSSI load is low, the signal quality is better. For example, if the distance between the current node and the parent node is far or there are obstacles blocking the way, the RSSI value will decrease and the RSSI load will increase, thereby increasing the risk of data transmission.

[0117] For example: Assuming the preset RSSI min -90dBm, RSSI max The RSSI load of the parent node is -30dBm, and the RSSI of the parent node measured by the current node is -70dBm. The RSSI load calculation formula is {1-(-70-(-90)) / (-30-(-90))}*100%={1-(-20) / 60}*100%≈66.67%. This indicates that the RSSI load of the current node is approximately 66.67%.

[0118] To comprehensively consider the impact of queue load, packet error rate load, and RSSI load on the current node link, a weighted average of the three calculated results is performed. The weights for this weighted average can be set based on actual needs, reflecting the importance of each load metric within the link load. For example, if data transmission accuracy is of primary concern, a higher weight could be assigned to the packet error rate load; if signal quality is of primary concern, a higher weight could be assigned to the RSSI load. The link load calculated using this weighted average provides a more comprehensive and accurate reflection of the current node link's busyness and communication quality.

[0119] For example, assume the queue load weight is 0.3, the packet error rate weight is 0.4, and the RSSI weight is 0.3. Previously, we calculated that the queue load is 30%, the packet error rate weight is 5%, and the RSSI weight is approximately 66.67%. Therefore, the current node's link load is 30% * 0.3 + 5% * 0.4 + 66.67% * 0.3 ≈ 30%.

[0120] Calculating the current node's link load using the above method comprehensively considers multiple factors related to link performance, including data transmission queue occupancy, data transmission error rate, and signal strength. This makes link load assessment more comprehensive and accurate, helping the current node better understand its own network status. In practical applications, accurate link load information can help nodes more effectively allocate resources, such as adjusting data transmission rates based on link load and selecting more appropriate parent nodes. This improves network stability and data transmission efficiency, reduces data loss and transmission delays, and enhances the performance of the entire mesh network.

[0121] This application includes the following benefits:

[0122] This approach not only considers the link's received signal strength, but also integrates multiple key indicators such as link depth, link latency, the number of child nodes, and link load. Link depth reflects the distance from the node to the root node, link latency reflects the timeliness of data transmission, the number of child nodes is related to the network topology and node load capacity, and link load is directly related to the node's data processing capacity. By comprehensively considering these indicators, the link quality between the node and the parent node can be more comprehensively and accurately assessed, avoiding the limitations of relying solely on the received signal strength indicator.

[0123] When calculating the final link load, the maximum value of the link load between the current node and the parent node and the resolved link load of the parent node is taken, fully considering the overall load of the parent node. This way, when selecting the target parent node, the node with lower load will be selected, avoiding the selection of the parent node that is already in a high load state.

[0124] Each time a node connects, it re-receives management frames sent by online nodes, parses the relevant information, and recalculates the comprehensive scores of each candidate parent node. This means that even if network conditions change, such as the movement of other nodes or the appearance or disappearance of obstacles, causing changes in the signal strength and link quality of a parent node, the new method can promptly detect and re-evaluate the strengths and weaknesses of each candidate parent node, selecting the most suitable parent node at the current moment.

[0125] The following are device embodiments of the present application, which can be used to implement the method embodiments of the present application. For details not disclosed in the device embodiments of the present application, please refer to the method embodiments of the present application.

[0126] See Figure 3 , which shows a schematic diagram of the structure of a node device provided by an exemplary embodiment of the present application, hereinafter referred to as device 3. Device 3 can be implemented as all or part of a node device through software, hardware, or a combination of both. Device 3 includes: a transceiver unit 301, a parsing unit 302, a measurement unit 303, a normalization unit 304, and a selection unit 305.

[0127] The transceiver unit 301 is configured to receive management frames sent by online nodes in an existing Mesh network. The management frames carry the link depth, link delay, number of child nodes, link load, and MAC address of the sending node. The link depth indicates the distance between the sending node and the root node, the link delay indicates the transmission delay between the sending node and the root node, the number of child nodes indicates the number of child nodes associated with the sending node, and the link load indicates the maximum load of each sublink between the sending node and the root node.

[0128] The parsing unit 302 is configured to parse the received management frame and generate a candidate parent node list according to the sender MAC address carried in the management frame; the candidate parent node list includes multiple candidate parent nodes;

[0129] A measuring unit 303 is configured to measure the received signal strength between the current node and the candidate parent node, and use the measurement result as the link received signal strength;

[0130] The measuring unit 303 is further configured to measure the signal delay between the current node and the parent node, and to sum the measured signal delay and the resolved link delay of the parent node to obtain a final link delay;

[0131] The measuring unit 303 is further configured to measure the link load between the current node and the parent node, and take the maximum value of the calculated link load and the resolved link load of the parent node to obtain a final link load;

[0132] A normalization unit 304 is configured to normalize the resolved link depth, link received signal strength, final link delay, final link load, and the resolved number of child nodes;

[0133] The selection unit 305 is configured to perform a weighted summation of the normalized index values ​​to obtain a comprehensive score of each candidate parent node, and select the parent node with the largest comprehensive score as the target parent node;

[0134] The transceiver unit 301 is further configured to associate with the target parent node, and after successful association, send a management frame carrying link depth, link delay, number of child nodes, link load and its own MAC address through a broadcast channel.

[0135] In one or more possible embodiments, measuring the link load between the current node and the parent node includes:

[0136] Calculate the queue load of the current node: (send queue length of the current node / maximum queue length of the current node)*100%;

[0137] Calculate the packet error rate load of the current node: (number of error packets of the current node / total number of packets sent by the current node) * 100%;

[0138] Calculate the RSSI load of the current node: {1-(RSSI-RSSI min ) / (RSSI max -RSSI min )}*100%, RSSI represents the RSSI of the parent node measured by the current node, RSSI min Indicates the preset minimum signal strength, RSSI max Indicates the preset maximum signal strength;

[0139] The link load of the current node is obtained by taking a weighted average of the above three calculation results.

[0140] In one or more possible embodiments, measuring the signal delay between the current node and the parent node includes:

[0141] The current node sends multiple test data packets to the parent node;

[0142] Statistics on the transmission time of each data packet;

[0143] The signal delay is obtained by averaging the statistical transmission time.

[0144] In one or more possible embodiments, the resolved link depth, link received signal strength, final link delay, final link load, and the resolved number of sub-nodes are normalized according to the following formula:

[0145] x normal ={1-(xx min ) / (x max -x min +α)}, x represents the index value before normalization, xmin represents the preset minimum index value, xmin represents the preset maximum index value, α represents the preset constant value, x normal Indicates the normalized indicator value.

[0146] In one or more possible embodiments, it further includes:

[0147] The deleting unit is configured to remove the candidate parent node from the candidate parent node list if the received signal strength of the candidate parent node is less than a first strength threshold.

[0148] In one or more possible embodiments, the weights of various indicator values ​​are dynamically adjusted according to the business scenario:

[0149] When the measured link received signal strength value is less than the second strength threshold and greater than the first strength threshold, reducing the weight of the link received signal strength according to a preset weight adjustment rule;

[0150] When the calculated final link load is greater than the load threshold, the weight of the final link load is increased according to a preset weight adjustment rule.

[0151] In one or more possible embodiments, sending the management frame carrying the link depth, link delay, number of child nodes, link load, and own MAC address through the broadcast channel includes:

[0152] Periodically sending BEACON frames in a broadcast channel; the management frames are BEACON frames or probe response frames;

[0153] When receiving a probe request frame sent by an offline node, it responds with a probe response frame.

[0154] It should be noted that the device 3 provided in the above embodiment, when executing the transmission path selection method for a mesh network, only uses the division of the above-mentioned functional modules as an example. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the above-mentioned functions. In addition, the node device provided in the above embodiment and the embodiment of the transmission path selection method for a mesh network are based on the same concept. The implementation process is detailed in the method embodiment and will not be repeated here.

[0155] The serial numbers of the above embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.

[0156] See also Figure 4 , is a computer storage medium provided in an embodiment of the present application. The computer storage medium may be a disk, an optical disk, a tape, or a USB flash drive. The computer storage medium may store multiple instructions (i.e., computer programs), which are suitable for being loaded and executed by a processor as described above. Figure 1 The method steps of the embodiment shown, the specific execution process can be found in Figure 1 The detailed description of the illustrated embodiment will not be repeated here.

[0157] The present application also provides a computer program product, which stores at least one instruction, and the at least one instruction is loaded and executed by the processor to implement the transmission path selection method of the Mesh network as described in the above embodiments.

[0158] See Figure 5 , provides a schematic diagram of the structure of a node device according to an embodiment of the present application. Figure 5 As shown, the node device 500 may include: at least one processor 501 , at least one network interface 504 , a user interface 503 , a memory 505 , and at least one communication bus 502 .

[0159] The communication bus 502 is used to implement the connection and communication between these components.

[0160] The user interface 503 is used to perform user interaction operations. For example, the user interface is an input and output device such as a touch screen, a display screen, and a keyboard.

[0161] The network interface 504 may optionally include a standard wired interface or a wireless interface (such as a WI-FI interface).

[0162] The processor 501 may include one or more processing cores. The processor 501 utilizes various interfaces and circuits to connect various components within the node device 500. It executes various functions and processes data within the node device 500 by running or executing instructions, programs, code sets, or instruction sets stored in the memory 505, as well as accessing data stored in the memory 505. Optionally, the processor 501 may be implemented using at least one hardware form selected from the group consisting of a digital signal processing (DSP), a field-programmable gate array (FPGA), and a programmable logic array (PLA). The processor 501 may integrate one or a combination of a central processing unit (CPU), a graphics processing unit (GPU), and a modem. The CPU primarily processes the operating system, user interface, and application programs; the GPU is responsible for rendering and drawing the content displayed on the display screen; and the modem handles wireless communications. It is understood that the modem may not be integrated into the processor 501 and may be implemented separately on a separate chip.

[0163] Among them, the memory 505 may include a random access memory (Random Access Memory, RAM) and may also include a read-only memory (Read-Only Memory). Optionally, the memory 505 includes a non-transitory computer-readable storage medium. The memory 505 can be used to store instructions, programs, codes, code sets or instruction sets. The memory 505 may include a program storage area and a data storage area, wherein the program storage area may store instructions for implementing an operating system, instructions for at least one function (such as a touch function, a sound playback function, an image playback function, etc.), instructions for implementing the above-mentioned various method embodiments, etc.; the data storage area may store data involved in the above-mentioned various method embodiments, etc. The memory 505 may also be optionally at least one storage device located away from the aforementioned processor 501. As Figure 5 As shown, the memory 505 as a computer storage medium may include an operating system, a network communication module, a user interface module, and an application program.

[0164] exist Figure 5 In the node device 500 shown in FIG. 1 , the user interface 503 is mainly used to provide an input interface for the user and obtain the data input by the user; and the processor 501 can be used to call the application stored in the memory 505 and specifically execute the following steps: Figure 2 The specific process can be referred to the method shown in Figure 2 As shown, no further details are given here.

[0165] Those skilled in the art will appreciate that all or part of the processes in the above-described method embodiments can be implemented by instructing related hardware through a computer program. The program can be stored in a computer-readable storage medium, and when executed, the program can include the processes in the above-described method embodiments. The storage medium can be a magnetic disk, an optical disk, a read-only memory, or a random access memory.

[0166] The above disclosure is only a preferred embodiment of the present application, and certainly cannot be used to limit the scope of rights of the present application. Therefore, equivalent changes made according to the claims of the present application are still within the scope covered by the present application.

Claims

1. A transmission path selection method for a Mesh network, characterized in that: include: Receive management frames sent by online nodes in an existing Mesh network. The management frames carry the link depth, link delay, number of child nodes, link load, and MAC address of the sending node. Link depth represents the distance between the sender node and the root node, link delay represents the transmission delay between the sender node and the root node, number of child nodes represents the number of child nodes associated with the sender node, and link load represents the maximum load of each child link between the sender node and the root node; Parse the received management frame and generate a list of candidate parent nodes based on the sender MAC address carried in the management frame; The candidate parent node list includes multiple candidate parent nodes; Measure the received signal strength between the current node and the candidate parent node, and use the measurement result as the link received signal strength; Measure the signal delay between the current node and the parent node, and sum the measured signal delay and the resolved link delay of the parent node to obtain the final link delay; Measure the link load between the current node and the parent node, and take the maximum value of the calculated link load and the resolved link load of the parent node to obtain the final link load; Normalize the resolved link depth, link received signal strength, final link delay, final link load, and the number of resolved child nodes; Perform weighted summation on the normalized index values ​​to obtain the comprehensive score of each candidate parent node; The parent node with the largest comprehensive score is selected as the target parent node; Associate with the target parent node. After successful association, send a management frame carrying link depth, link delay, number of child nodes, link load and its own MAC address through the broadcast channel.

2. The method according to claim 1, characterized in that The measuring of the link load between the current node and the parent node includes: Calculate the queue load of the current node: (send queue length of the current node / maximum queue length of the current node)*100%; Calculate the packet error rate load of the current node: (number of error packets of the current node / total number of packets sent by the current node) * 100%; Calculate the RSSI load of the current node: {1-(RSSI-RSSI min ) / (RSSI max -RSSI min )}*100%, RSSI represents the RSSI of the parent node measured by the current node, RSSI min Indicates the preset minimum signal strength, RSSI max Indicates the preset maximum signal strength; The link load of the current node is obtained by taking a weighted average of the above three calculation results.

3. The method according to claim 1 or 2, characterized in that The measuring of the signal delay between the current node and the parent node includes: The current node sends multiple test data packets to the parent node; Statistics on the transmission time of each data packet; The signal delay is obtained by averaging the statistical transmission time.

4. The method according to claim 3, characterized in that The resolved link depth, link received signal strength, final link delay, final link load, and the number of resolved child nodes are normalized according to the following formula: x normal ={1-(xx min ) / (x max -x min +α)}, x represents the index value before normalization, xmin represents the preset minimum index value, xmin represents the preset maximum index value, α represents the preset constant value, x normal Indicates the normalized indicator value.

5. The method according to claim 4, characterized in that Also includes: If the received signal strength of the candidate parent node is less than the first strength threshold, the candidate parent node is removed from the candidate parent node list.

6. The method according to claim 5, characterized in that Dynamically adjust the weight of each indicator value according to the business scenario: When the measured link received signal strength value is less than the second strength threshold and greater than the first strength threshold, reducing the weight of the link received signal strength according to a preset weight adjustment rule; When the calculated final link load is greater than the load threshold, the weight of the final link load is increased according to a preset weight adjustment rule.

7. The method according to claim 3, 4 or 5, characterized in that: The sending of a management frame carrying link depth, link delay, number of child nodes, link load, and own MAC address through a broadcast channel includes: Periodically sending BEACON frames in a broadcast channel; the management frames are BEACON frames or probe response frames; When receiving a probe request frame sent by an offline node, it responds with a probe response frame.

8. A node device, characterized in that: include: The transceiver unit is used to receive management frames sent by online nodes in an existing Mesh network. The management frames carry the link depth, link delay, number of child nodes, link load, and MAC address of the sending node. The link depth indicates the distance between the sending node and the root node, the link delay indicates the transmission delay between the sending node and the root node, the number of child nodes indicates the number of child nodes associated with the sending node, and the link load indicates the maximum load of each sublink between the sending node and the root node. A parsing unit, configured to parse a received management frame and generate a candidate parent node list based on the sender MAC address carried in the management frame; The candidate parent node list includes multiple candidate parent nodes; A measurement unit is used to measure the received signal strength between the current node and the candidate parent node, and use the measurement result as the link received signal strength; The measuring unit is further configured to measure the signal delay between the current node and the parent node, and to sum the measured signal delay and the resolved link delay of the parent node to obtain a final link delay; The measuring unit is further configured to measure the link load between the current node and the parent node, and take the maximum value of the calculated link load and the resolved link load of the parent node to obtain a final link load; A normalization unit, configured to normalize the resolved link depth, link received signal strength, final link delay, final link load, and the number of resolved child nodes; A selection unit is used to perform weighted summation of the normalized index values ​​to obtain a comprehensive score of each candidate parent node, and to select the parent node with the largest comprehensive score as the target parent node; The transceiver unit is further configured to associate with the target parent node, and after successful association, send a management frame carrying link depth, link delay, number of child nodes, link load and its own MAC address through a broadcast channel.

9. A computer storage medium, characterized in that The computer storage medium stores a plurality of instructions, which are suitable for being loaded by a processor and executing the method steps according to any one of claims 1 to 7.

10. A node device, characterized in that: include: A processor and a memory; wherein the memory stores a computer program, and the computer program is suitable for being loaded by the processor and executing the method steps according to any one of claims 1 to 7.

Images