A wireless network networking method, device, system and storage medium

Abstract

The present application relates to the technical field of wireless communication network, and particularly relates to a wireless network networking method, device, system and storage medium. In the present application, the capacity threshold of the parent node is dynamically and accurately adjusted by analyzing the change (the first quantity and the second quantity) of the number of expansion requests received by the parent node in the continuous time window, and combining the historical expansion capacity to determine the expansion capacity of the current time window. This method can effectively avoid the problem of idle or overload of resources under the traditional fixed threshold strategy, significantly improve the network resource utilization and the success rate of node access, and reduce the load pressure of a single parent node through data-driven elastic expansion, enhance the stability and carrying capacity of the whole wireless network, and realize load balancing.

Description

Technical Field

[0001] This invention relates to the field of wireless communication network technology, and specifically to a wireless network networking method, apparatus, system, and storage medium. Background Technology

[0002] In a Wi-SUN network, newly joined nodes need to select a suitable parent node for connection. Traditional parent node selection methods often rely on factors such as signal strength and distance, which can easily overload some parent nodes, affecting the overall network performance and stability. Furthermore, when selecting a parent node, these factors are typically compared directly to manually defined static thresholds, leading to resource waste and load imbalance. Summary of the Invention

[0003] This invention provides a wireless network networking method, apparatus, system, and storage medium to solve the problem that the use of static thresholds in the prior art can easily lead to resource waste.

[0004] In a first aspect, the present invention provides a wireless network networking method, the method comprising:

[0005] Receive expansion request commands sent by child nodes;

[0006] Count the first number of expansion request command requests received in the current time window and the second number of expansion request command requests received in the previous time window;

[0007] Based on the first quantity, the second quantity, and the expansion capacity in the previous time window, determine the expansion capacity in the current time window, and determine the parent node capacity threshold after candidate expansion.

[0008] Determine whether the candidate expanded parent node capacity threshold exceeds the maximum number of child nodes of the parent node. If it does, use the maximum number of child nodes of the parent node as the expanded parent node capacity threshold.

[0009] If the capacity threshold of the candidate expanded parent node is not exceeded, the expanded parent node capacity threshold will be used as the expanded parent node capacity threshold, and a successful expansion message will be sent back to the child node.

[0010] In this invention, the capacity threshold of the parent node is dynamically and accurately adjusted by analyzing the changes in the number of expansion requests received by the parent node within a continuous time window (a first number and a second number) and combining this with historical expansion capacity data. This method effectively avoids the resource idleness or overload problems under traditional fixed threshold strategies, significantly improves network resource utilization and child node access success rate, and reduces the load pressure on individual parent nodes through data-driven elastic expansion, thereby enhancing the stability and carrying capacity of the entire wireless network and achieving load balancing.

[0011] In one optional implementation, the expansion capacity within the current time window is determined based on the first quantity, the second quantity, and the expansion capacity within the previous time window, and the parent node capacity threshold after candidate expansion is determined, including:

[0012] The capacity to be expanded is determined by multiplying the ratio of the first quantity and the second quantity with the expansion capacity in the previous time window and the aggressive coefficient.

[0013] Determine the larger value between the capacity to be expanded and the minimum capacity for a single expansion, compare the larger value with the maximum capacity for a single expansion, and select the smaller value as the expansion capacity within the current time window;

[0014] Calculate the sum of the expansion capacity within the current time window and the current parent node capacity threshold. When the calculated sum is less than the maximum capacity of the parent node, use the sum as the candidate parent node capacity threshold after expansion.

[0015] In this invention, the current capacity to be expanded is dynamically calculated based on the ratio of the current number of expansion requests to the historical number of expansion requests, combined with the previous expansion capacity. Then, through dual constraints of "taking the larger value" and "taking the smaller value," it is ensured that the capacity expansion in a single instance is neither lower than the minimum effective unit nor exceeds the safety limit. Finally, it takes effect after verification with the total capacity of the parent node. This method effectively avoids the blind allocation of resources, actively expanding capacity according to real-time needs to improve access success rate and resource utilization, while strictly preventing resource waste or system overload caused by excessive expansion. This achieves accurate, controllable, and secure elastic resource management under traffic fluctuations.

[0016] In an optional implementation, the method further includes:

[0017] The number of child nodes connected to the parent node within the current time period is obtained according to a preset time interval, and the relationship between the number of child nodes and the product of the current parent node capacity threshold and the conservative coefficient is determined.

[0018] A circular buffer is used to record the judgment results. When all judgment results are less than the target value, the parent node enters a continuous low-load state.

[0019] Otherwise, continue to use a circular buffer to record the judgment results;

[0020] If a sustained low-load state is entered, determine whether the current parent node's capacity threshold is greater than the preset safety lower limit;

[0021] If the value exceeds the preset safety lower limit, determine whether expansion has been performed.

[0022] When expansion has been performed, the larger of the parent node capacity threshold before the last expansion and the preset safety lower limit is used as the target threshold.

[0023] If the current parent node capacity threshold is greater than the target threshold, the target threshold will be used as the parent node capacity threshold after scaling down.

[0024] This invention achieves accurate and stable judgment of the parent node's load status through periodic detection at preset time intervals and a circular buffer recording mechanism. It effectively distinguishes between instantaneous low load and sustained low load, avoiding misjudgments caused by short-term business fluctuations, thus ensuring that resource reclamation operations such as scaling down are only triggered when the node is under prolonged low load. Furthermore, by using whether expansion has been performed as a key decision criterion and introducing a preset safety lower limit as a hard constraint, the capacity threshold of the parent node after scaling down is determined. This method effectively avoids insufficient network service capacity due to excessive scaling down, ensuring that the system always operates above the most basic guarantee level. Simultaneously, by rolling back to the larger value of historical expansion nodes or the safety lower limit, it achieves reasonable reclamation of idle resources and ensures the smoothness and reliability of resource adjustments, thereby significantly enhancing the system's adaptability and long-term operational stability under different load conditions.

[0025] In one optional implementation, counting a first number of expansion request command requests received within the current time window and a second number of expansion request command requests received within the previous time window includes:

[0026] Determine whether the received expansion request command is the first expansion request command request within the current time window;

[0027] When the first expansion request command is requested, start the current time window timer;

[0028] If it is not the first expansion request, check if it is a duplicate request; if so, discard it.

[0029] When it is not a duplicate request, increment the count of the current time window timer by one, and count the first number of expansion request command requests received within the current time window after the timer expires.

[0030] Get the second number of expansion request command requests received within the previous time window.

[0031] In an optional implementation, after receiving the expansion request command sent by the child node, the method further includes:

[0032] Determine whether the current capacity threshold of the parent node exceeds the maximum number of child nodes of the parent node;

[0033] When the limit is exceeded, send an error message to the child nodes indicating that the limit has been exceeded.

[0034] Secondly, the present invention provides a wireless network networking method applied to a child node, the method comprising:

[0035] Send request information to neighboring nodes in the wireless network;

[0036] Receive the reply information sent by the neighbor node based on the request information, and take the neighbor node that sent the reply information as the candidate parent node. The reply information includes the number of child nodes connected to the candidate parent node, the capacity threshold of the parent node after expansion, the level value, and the received signal strength indication value.

[0037] Calculate the decision value of the candidate parent node that can be connected based on the response information;

[0038] Sort the decision values ​​of connectable candidate parent nodes and determine whether the sorting results meet the preset conditions.

[0039] If the conditions are met, select the candidate parent node with the largest decision value and connect it;

[0040] If the requirements are not met, a capacity expansion request command is sent to the candidate parent node so that the candidate parent node executes the wireless network networking method described in the first aspect and any one of the first aspects of the present invention.

[0041] This invention achieves intelligent parent node selection by enabling child nodes to actively collect and comprehensively analyze multi-dimensional parameters such as real-time load, capacity, hierarchy, and signal strength of candidate parent nodes. Its core benefit lies in triggering a dynamic scaling-up / scaling-down mechanism when conventional selection fails, causing parent node resources to adjust elastically according to network demands. This not only significantly improves the access success rate of child nodes and network resource utilization but also achieves automatic load balancing from a global perspective, effectively avoiding local congestion and thus ensuring high stability and excellent overall performance in complex, large-scale wireless networks.

[0042] In one optional implementation, the decision values ​​of connectable candidate parent nodes are sorted, and it is determined whether the sorting result meets a preset condition. If it does, the candidate parent node with the largest decision value is selected for connection; otherwise, an expansion request command is sent to the candidate parent node, including:

[0043] Sort the decision values ​​of connectable candidate parent nodes. When there is a maximum decision value among the candidate parent nodes, the candidate parent node corresponding to the maximum decision value is used as the parent node for connection.

[0044] When all candidate parent nodes have the same maximum decision value, select the candidate parent node with the smallest hierarchical value among the maximum decision values ​​as the parent node for connection.

[0045] When all the hierarchical values ​​in the maximum decision values ​​are equal, the candidate parent node corresponding to the one with the largest received signal strength indication value in the maximum decision value is connected as the parent node.

[0046] When the maximum decision value and the maximum received signal strength indication value are both equal, the first candidate parent node that sends a reply message is selected as the parent node for connection.

[0047] When the decision value of all candidate parent nodes is 0, it is determined that no connectable candidate parent node has been found.

[0048] This invention provides a clear and standardized process for parent node selection through multi-level decision rules (comparing decision values, level values, signal strength, and response order in sequence). This structured decision-making mechanism can efficiently and unambiguously select the parent node with the best overall performance from multiple candidate nodes, effectively avoiding the limitations of traditional single-index selection strategies. This significantly enhances the reliability of connection establishment.

[0049] Thirdly, the present invention provides a wireless network networking system, the system comprising child nodes and parent nodes;

[0050] The child node is used to send request information to neighboring nodes in the wireless network; receive reply information sent by neighboring nodes based on the request information, and designate the neighboring node that sent the reply information as a candidate parent node. The reply information includes the number of child nodes connected to the candidate parent node, the parent node capacity threshold after expansion, the hierarchical value, and the received signal strength indication value; calculate the decision value of the connectable candidate parent node based on the reply information; sort the decision values ​​of the connectable candidate parent nodes, and determine whether the sorting result meets the preset conditions. If it does, select the candidate parent node with the largest decision value for connection; if it does not meet the conditions, send an expansion request command to the candidate parent node.

[0051] The parent node is used to receive expansion request commands sent by child nodes; count the first number of expansion request commands received in the current time window and the second number of expansion request commands received in the previous time window; determine the expansion capacity in the current time window based on the first number, the second number, and the expansion capacity in the previous time window, and determine the candidate expansion-after parent node capacity threshold; determine whether the candidate expansion-after parent node capacity threshold exceeds the maximum number of child nodes of the parent node. If it exceeds, the maximum number of child nodes of the parent node is used as the expansion-after parent node capacity threshold; if it does not exceed, the candidate expansion-after parent node capacity threshold is used as the expansion-after parent node capacity threshold, and the parent node replies with expansion success information to the child nodes.

[0052] Fourthly, the present invention provides a wireless network networking device, the device comprising:

[0053] The request receiving module is used to receive expansion request commands sent by child nodes;

[0054] The statistics module is used to count the first number of expansion request command requests received in the current time window and the second number of expansion request command requests received in the previous time window.

[0055] The capacity expansion determination module is used to determine the capacity expansion in the current time window based on the first quantity, the second quantity, and the capacity expansion in the previous time window, and to determine the capacity threshold of the parent node after the candidate expansion.

[0056] The judgment module is used to determine whether the candidate expanded parent node capacity threshold exceeds the maximum number of child nodes of the parent node. When it exceeds the maximum number of child nodes of the parent node, the maximum number of child nodes of the parent node is used as the expanded parent node capacity threshold.

[0057] The response module is used to use the candidate expanded parent node capacity threshold as the expanded parent node capacity threshold when the capacity limit is not exceeded, and to reply with expansion success information to the child nodes.

[0058] Fifthly, the present invention provides a wireless network networking device for use in a child node, the device comprising:

[0059] The request information sending module is used to send request information to neighboring nodes in the wireless network;

[0060] The response receiving module is used to receive response information sent by neighboring nodes based on request information, and to regard the neighboring node that sent the response information as a candidate parent node. The response information includes the number of child nodes connected to the candidate parent node, the capacity threshold of the candidate parent node after expansion, the level value, and the received signal strength indication value.

[0061] The calculation module is used to calculate the decision value of the connectable candidate parent node based on the response information;

[0062] The sorting and judgment module is used to sort the decision values ​​of connectable candidate parent nodes and determine whether the sorting result of the decision values ​​meets the preset conditions.

[0063] A connection sending module is used to select a candidate parent node with the largest decision value for connection if the condition is met, so that the candidate parent node executes the wireless network networking method according to the first aspect and any one of the first aspects of the present invention.

[0064] The command request sending module is used to send an expansion request command to the candidate parent node if the conditions are not met.

[0065] In a sixth aspect, the present invention provides an electronic device, comprising: a memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the computer instructions to perform the wireless network networking method of the first aspect or any corresponding embodiment thereof, or the wireless network networking method of the second aspect or any corresponding embodiment thereof.

[0066] In a seventh aspect, the present invention provides a computer-readable storage medium storing computer instructions, the computer instructions being configured to cause a computer to execute the wireless network networking method of the first aspect or any corresponding embodiment thereof, or the wireless network networking method of the second aspect or any corresponding embodiment thereof.

[0067] Eighthly, the present invention provides a computer program product, including computer instructions, which are used to cause a computer to execute the wireless network networking method of the first aspect or any corresponding embodiment thereof, or the wireless network networking method of the second aspect or any corresponding embodiment thereof. Attached Figure Description

[0068] To more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the specific embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0069] Figure 1 This is a schematic diagram of the first type of wireless network networking method according to an embodiment of the present invention;

[0070] Figure 2 This is a schematic diagram of a second process for a wireless network networking method according to an embodiment of the present invention;

[0071] Figure 3 This is a schematic diagram of a first type of wireless network networking system according to an embodiment of the present invention;

[0072] Figure 4 This is a second flowchart of a wireless network networking system according to an embodiment of the present invention;

[0073] Figure 5 This is a third flowchart of a wireless network networking system according to an embodiment of the present invention;

[0074] Figure 6 This is a first structural block diagram of a wireless network networking device according to an embodiment of the present invention;

[0075] Figure 7 This is a second structural block diagram of a wireless network networking device according to an embodiment of the present invention;

[0076] Figure 8 This is a schematic diagram of the hardware structure of an electronic device according to an embodiment of the present invention. Detailed Implementation

[0077] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0078] It is understood that before using the technical solutions disclosed in the various embodiments of the present invention, users should be informed of the types, scope of use, and usage scenarios of the personal information involved in the present invention and their authorization should be obtained in accordance with relevant laws and regulations through appropriate means.

[0079] The terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this invention, "a plurality of" means two or more, unless otherwise explicitly specified.

[0080] According to an embodiment of the present invention, a wireless network networking method embodiment is provided. It should be noted that the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in a different order than that shown here.

[0081] This embodiment provides a wireless network networking method. Figure 1 This is a flowchart of a wireless network networking method according to an embodiment of the present invention, such as... Figure 1 As shown, the process includes the following steps:

[0082] Step S101: Receive the expansion request command sent by the child node.

[0083] Wireless networks are networks that use wireless communication technology. For example, such a wireless network could be a Wi-SUN network (Wireless Smart Utility Network). Devices (nodes) in this network communicate using Wi-SUN technology; these devices are also called Wi-SUN devices. A single Wi-SUN network can support communication between tens of thousands of network nodes and can be used in outdoor, large-scale IoT applications such as smart grids and smart cities.

[0084] Specifically, in this embodiment, a Personal Area Network (PAN) is formed by a collection of Wi-SUN devices within a certain physical range. Within this PAN, devices share a single network identifier and communicate using Wi-SUN communication technology. These Wi-SUN devices can be smart meters, smart water meters, or similar devices. In other embodiments, the Wi-SUN devices can also be distributed energy sources, smart streetlights, etc. This embodiment does not impose specific limitations on them.

[0085] In a personal area network (PAN) consisting of multiple Wi-SUN devices, when a new device joins, it needs to select a neighboring device within the PAN to connect to. This newly joined device is called a child node, and the connected neighboring device is called a parent node. When selecting a parent node, the child node must consider the parent node's capacity threshold. If the number of currently connected child nodes reaches or exceeds this capacity threshold, the parent node will not accept any new child nodes. Therefore, after joining the network, a child node first needs to select a parent node based on the capacity threshold of each neighboring node. However, if no connectable parent node can be found based on the neighboring node's capacity threshold, a capacity expansion request is sent to the neighboring nodes. When a neighboring node (hereinafter referred to as the parent node) receives this capacity expansion request, it determines whether its own capacity threshold can be adjusted so that the newly joined device can find a connectable parent node.

[0086] The initial parent node capacity threshold can be determined based on the maximum number of child nodes that the parent node can connect to. Specifically, initially, a maximum number of child nodes (MAX) can be set for each parent node based on its CPU processing power (in GHz), memory size (in GB), and network bandwidth (in Mbps). total Then, by reserving a certain amount of redundancy, the capacity threshold of the parent node is obtained. For example, if the redundancy is 15% and the maximum number of child nodes is 20, then the capacity threshold of the parent node is 17.

[0087] Step S102: Count the first number of expansion request command requests received in the current time window and the second number of expansion request command requests received in the previous time window.

[0088] Specifically, when a parent node receives a scaling request, it does not perform a scaling decision in real time. Instead, it sets a time window and counts the number of scaling requests received within each time window, then calculates the scaling based on that count. It's important to note that each parent node can receive scaling requests from multiple child nodes within each time window. Conversely, each child node can send scaling requests to multiple parent nodes.

[0089] Step S103: Determine the expansion capacity in the current time window based on the first quantity, the second quantity, and the expansion capacity in the previous time window, and determine the parent node capacity threshold after candidate expansion.

[0090] Specifically, when calculating the expansion capacity for the current time window, it is necessary to comprehensively consider the number of expansion request commands received in the current time window, the number of expansion request commands received in the previous time window, and the expansion capacity of the previous time window, so as to reasonably determine the expansion capacity within the current time window. For example, it can be determined based on the relationship between the number of expansion request commands received in each time window and the expansion capacity. After determining the expansion capacity within the current time window, it is added to the current parent node capacity threshold to obtain the parent node capacity threshold after expansion.

[0091] It should be noted that for each parent node, within each time window, steps S101 to S103 can be executed to perform expansion processing based on the connection status of each child node.

[0092] Step S104: Determine whether the candidate expanded parent node capacity threshold exceeds the maximum number of child nodes of the parent node. If it does, use the maximum number of child nodes of the parent node as the expanded parent node capacity threshold.

[0093] Step S105: If the capacity threshold of the candidate expanded parent node is not exceeded, the expanded parent node capacity threshold is used as the expanded parent node capacity threshold, and the expanded success information is replied to the child node.

[0094] When calculating the capacity threshold of the candidate parent node after expansion, it is also necessary to determine the maximum number of connections (MAX) between the parent node and its maximum number of child nodes. total The comparison is performed; if the parent node capacity threshold after the candidate expansion is less than or equal to MAX... total Then, the threshold value of the parent node after expansion will be used as the threshold value of the parent node after expansion. If the threshold value of the parent node after expansion is greater than MAX... total Then MAXtotal This serves as the capacity threshold for the parent node after expansion. Simultaneously, the relevant expansion values ​​are recorded, and a successful expansion message is sent to the child nodes, allowing them to re-evaluate which parent nodes are connectable.

[0095] This embodiment provides a wireless network networking method, which includes the following steps:

[0096] Step S201: Receive the expansion request command sent by the child node. For details, please refer to [link to relevant documentation]. Figure 1 Step S101 of the illustrated embodiment will not be described again here.

[0097] Step S202: Determine whether the current capacity threshold of the parent node exceeds the maximum number of child nodes of the parent node; if it does, reply to the child nodes with information indicating that the upper limit has been reached. Specifically, after receiving a capacity expansion request, the relationship between the current capacity threshold of the parent node and the maximum number of child node connections of the parent node can be determined first. Only if the current capacity threshold of the parent node is not greater than the maximum number of child node connections of the parent node will subsequent capacity expansion operations be performed; otherwise, a reply will be sent directly to the child nodes indicating that the upper limit has been reached. Alternatively, when receiving a capacity expansion request, the number can be counted first before determining whether the upper limit has been exceeded. This embodiment does not specifically limit the processing order.

[0098] Step S203: Count the first number of expansion request command requests received in the current time window and the second number of expansion request command requests received in the previous time window.

[0099] Specifically, step S203 includes:

[0100] Step S2031: Determine whether the received expansion request command is the first expansion request command request within the current time window.

[0101] Step S2032: When it is the first expansion request command request, start the current time window timer.

[0102] Step S2033: If it is not the first expansion request, determine whether it is a duplicate request. If so, discard it.

[0103] Step S2034: When it is not a duplicate request, increment the count of the current time window timer by one, and count the first number of expansion request command requests received in the current time window after the timer ends.

[0104] Step S2035: Obtain the second number of expansion request command requests received within the previous time window.

[0105] During the statistics process, for each received expansion request command, it is determined whether it is the first request within the current time window. If so, the system switches to expansion collection mode and starts a time window timer (the specific duration is determined according to actual needs, for example, 500ms). Within the timer's duration, the count is incremented by 1 for each received expansion request command. If it is not the first request within the current time window, it is checked whether it is a duplicate of an already received expansion request command within the current time window. If it is a duplicate, it is discarded; otherwise, the count is incremented by 1. Expansion request commands are continuously received within the current time window until the timer expires, at which point the current time window ends, and the initial count of expansion request commands received within the current time window is obtained. The same method can be used to determine the count of received expansion request commands for each time window.

[0106] Step S204: Based on the first quantity, the second quantity, and the expansion capacity within the previous time window, determine the expansion capacity within the current time window, and determine the capacity threshold of the candidate expanded parent node. Specifically, step S204 includes:

[0107] Step S2041: Determine the capacity to be expanded based on the ratio of the first quantity and the second quantity, the product of the expansion capacity in the previous time window and the aggressive coefficient.

[0108] Step S2042: Determine the larger value between the capacity to be expanded and the minimum capacity for a single expansion, compare the larger value with the maximum capacity for a single expansion, and select the smaller value as the expansion capacity within the current time window.

[0109] Specifically, the capacity expansion within the current time window is determined using the following formula:

[0110]

[0111] In the formula, Indicates the first quantity. Indicates the second quantity. This indicates the capacity expansion within the previous time window. Indicates the radical coefficient. This represents the floor function, ensuring that the expanded capacity is an integer. Indicates the minimum expansion capacity in a single operation. This indicates the maximum capacity expansion in a single operation.

[0112] The aggressiveness factor is set to a value greater than 1, which slightly overestimates the calculated expansion capacity to more aggressively meet demand and avoid frequent expansions. For example, this aggressiveness factor could be set to 1.2. The minimum expansion capacity per operation can be set to 1, ensuring that even if the calculated expansion capacity is small, at least one unit will be added, guaranteeing the expansion operation is effective. The maximum expansion capacity per operation can be determined based on actual conditions to prevent excessive expansion in a single operation, which could lead to resource waste and network instability. For example, the maximum expansion capacity per operation could be set to 6.

[0113] Step S2043: Calculate the sum of the expansion capacity within the current time window and the current parent node capacity threshold. When the calculated sum is less than the maximum capacity of the parent node, use the sum as the candidate expansion parent node capacity threshold. Specifically, after calculating the expansion capacity within the current time window, add it to the current parent node capacity threshold to obtain the candidate expansion parent node capacity threshold, i.e., candidate expansion parent node capacity threshold = current threshold + EQ new .

[0114] Step S205: Determine whether the candidate expanded parent node capacity threshold exceeds the maximum number of child nodes of the parent node. If it does, use the maximum number of child nodes of the parent node as the expanded parent node capacity threshold. For details, please refer to [link to relevant documentation]. Figure 1 Step S104 of the illustrated embodiment will not be described again here.

[0115] Step S206: If the capacity threshold is not exceeded, use the candidate expanded parent node capacity threshold as the expanded parent node capacity threshold, and reply with expansion success information to the child nodes. For details, please refer to [link to relevant documentation]. Figure 1 Step S105 of the illustrated embodiment will not be described again here.

[0116] Step S207: Obtain the number of child nodes connected to the parent node within the current time period according to a preset time interval, and determine the relationship between the number of child nodes and the product of the current parent node capacity threshold and the conservative coefficient.

[0117] Specifically, if the network traffic returns to normal after the peak period of child node additions following expansion of the parent node, maintaining a high parent node capacity threshold at this time would lead to resource idleness, waste, and load imbalance. Therefore, the parent node can perform a scaling-down operation by checking whether it enters a sustained low-load state, i.e., lowering the parent node capacity threshold. Whether to enter a sustained low-load state can be determined by a preset time period. For example, after the parent node starts, its internal scaling-down timer begins running, triggering periodically according to a preset period (which can be determined based on actual conditions, such as 30 minutes). The sustained low-load state can be determined based on the number of child nodes connected to the parent node within the current time period.

[0118] Within each time period, the parent node retrieves the number of its connected child nodes at regular intervals. It then determines the relationship between this number of child nodes and the product of the current parent node's capacity threshold and a conservatism coefficient. If the current number of child nodes is less than the current parent node's capacity threshold multiplied by the conservatism coefficient, the result is true; otherwise, the result is false. It's important to note that the conservatism coefficient is a value less than 1, meaning that setting a conservatism coefficient helps prevent threshold oscillations. For example, the conservatism coefficient can be set to 0.8.

[0119] Step S208: A circular buffer is used to record the judgment results. When all judgment results are less than a certain value, the parent node enters a continuous low-load state. Specifically, a circular buffer mechanism can be used to record the judgment results, with a fixed-size circular buffer set up. When the number of child nodes is obtained at a preset time interval and a judgment result is obtained, this result can be recorded in the circular buffer. After recording the judgment results for a given time period, all records are checked. When all records are true, the parent node is determined to enter a continuous low-load state.

[0120] Step S209: Otherwise, continue to use the circular buffer to record the judgment result; specifically, when the circular buffer completes the recording of one time period, if a new record is written, it will automatically overwrite the oldest record in the buffer, thereby realizing the continuous recording of the circular buffer and the determination of the judgment result for each time period.

[0121] Step S210: If a continuous low-load state is entered, determine whether the current parent node capacity threshold is greater than a preset safety lower limit; the preset safety lower limit can be the initially set parent node capacity threshold, that is, the preset safety lower limit is determined by the maximum number of child nodes and redundancy, wherein the preset safety lower limit is determined by the following formula:

[0122] .

[0123] In the formula, This indicates redundancy.

[0124] Step S211: When the load exceeds the preset safety lower limit, determine whether expansion has been performed. Specifically, when the parent node determines that it has entered a continuous low load state in a certain time period, the parent node needs to further determine whether expansion has been performed. Only the parent node that has performed expansion will perform subsequent shrinkage. Otherwise, it will wait for the continuous low load state judgment in the next time period.

[0125] If the parent node's capacity threshold is not greater than the preset safety lower limit, it means the node is already at its minimum safe capacity and cannot be scaled down further; in this case, it returns to the waiting state. If it is greater than the preset safety lower limit, it continues to determine whether it has been expanded. For example, it can check the expansion history list (which records relevant data for each expansion). If the list is empty, it means the node has never been expanded, and it continues to return to the waiting state.

[0126] Step S212: When expansion has been performed, the larger of the parent node capacity threshold before the last expansion and the preset safety lower limit is used as the target threshold. Specifically, when it is determined that expansion has been performed (i.e., the expansion history list is not empty), the most recent expansion record is retrieved from the list, and the parent node capacity threshold before the expansion in that record is used as a candidate target. This target threshold is compared with the preset safety lower limit, and the larger value is selected as the target threshold. That is, target threshold = max(preset safety lower limit, parent node capacity threshold before the last expansion). This ensures that scaling down will not exceed the safety threshold and allows for multi-level rollback.

[0127] Step S213: If the current parent node capacity threshold is greater than the target threshold, the target threshold is used as the parent node capacity threshold after scaling down. Specifically, after determining the target threshold, the current parent node capacity threshold is compared with the target threshold. If the current parent node capacity threshold is greater than the target threshold, a scaling down operation is performed, that is, the current parent node capacity threshold is updated to the target threshold; otherwise, the process returns to a waiting state. Simultaneously, the relevant data from this scaling down operation is written to the log or historical records, and the process returns to a waiting state, awaiting the next trigger of the scaling down timer.

[0128] This embodiment provides a wireless network networking method, applied to child nodes, such as... Figure 2 As shown, the method includes the following steps:

[0129] Step S301: Send request information to neighboring nodes in the wireless network. Specifically, the wireless network can be referred to the explanation of the wireless network in step S101 above, and will not be repeated here. Among them, when the wireless network is a personal area network built based on Wi-SUN communication technology, after a new node joins a PAN network and becomes a member of the PAN network, it needs to select a parent node and establish a route. At this time, the new node sends request information to surrounding neighboring nodes, namely DIS (DODAG Information Solicitation) information.

[0130] Specifically, after a child node joins a personal area network, it can broadcast DIS information to all neighboring nodes within its wireless signal range to inform other nodes of the new node's addition and to request neighboring nodes to reply with their own information.

[0131] Step S302: Receive the reply information sent by the neighbor node based on the request information, and take the neighbor node that sent the reply information as the candidate parent node. The reply information includes the number of child nodes connected to the candidate parent node, the capacity threshold of the parent node after expansion, the level value, and the received signal strength indication value.

[0132] Specifically, after receiving the DIS information, a neighboring node sends a reply message, namely a DIO (DODAG Information Object) message, to its child node. When a child node receives one or more DIO messages, it extracts information from each DIO message, such as the number of child nodes connected to the candidate parent node, the parent node capacity threshold after expansion, the level value, and the Received Signal Strength Indication (RSSI) value, to select a parent node. Specifically, whenever a child node receives a DIO message from a neighboring node, it considers that neighboring node as a candidate parent node, and then selects the optimal node from among the candidate parent nodes.

[0133] Step S303: Calculate the decision value of the connectable candidate parent node based on the response information.

[0134] Specifically, when calculating the decision value of a candidate parent node, information such as the number of child nodes connected to each candidate parent node, the capacity threshold of the parent node after expansion, the hierarchical value, and the received signal strength indicator value are comprehensively considered. The number of child nodes connected to each candidate parent node and the capacity threshold of the parent node after expansion determine the load of each candidate parent node. The hierarchical value characterizes the distance of the candidate parent node from the central node (i.e., its depth in the tree network topology), and the received signal strength indicator value represents the link quality between two nodes. By comprehensively considering these factors in the selection of parent nodes, global load balancing and performance optimization are achieved.

[0135] Step S304: Sort the decision values ​​of the connectable candidate parent nodes and determine whether the sorting result of the decision values ​​meets the preset conditions. Specifically, after calculating the decision value of each candidate parent node, sort all the decision values ​​and determine whether the sorted decision values ​​meet the preset conditions, such as whether the sorted first or the largest decision value meets the preset conditions.

[0136] Step S305: If satisfied, select the candidate parent node with the largest decision value for connection; wherein when the largest decision value satisfies the preset condition, its corresponding candidate parent node is connected as a child node.

[0137] Step S306: If the conditions are not met, a capacity expansion request command is sent to the candidate parent node so that the candidate parent node executes the wireless network networking method described above. Specifically, when the conditions are not met, a capacity expansion request command is sent to all candidate parent nodes. The node receiving the capacity expansion request command request uses the wireless network networking method described above to expand and shrink its capacity.

[0138] This embodiment provides a wireless network networking method applied to a child node, which includes the following steps:

[0139] Step S401: Send a request message to neighboring nodes in the wireless network; for details, please refer to [link to relevant documentation]. Figure 1 Step S301 of the illustrated embodiment will not be described again here.

[0140] Step S402: Receive reply information sent by neighboring nodes based on the request information, and designate the neighboring node that sent the reply information as a candidate parent node. The reply information includes the number of child nodes connected to the candidate parent node, the parent node capacity threshold after expansion, the hierarchical value, and the received signal strength indication value. For details, please refer to [link to relevant documentation]. Figure 1 Step S302 of the illustrated embodiment will not be described again here.

[0141] Step S403: Calculate the decision value of the connectable candidate parent node based on the response information.

[0142] Specifically, step S403 includes:

[0143] Step S4031: Determine the load of the candidate parent node based on the ratio of the number of child nodes connected to the candidate parent node to the capacity threshold of the candidate parent node after expansion; specifically, Load = Number of connected child nodes / Current capacity threshold of the candidate parent node after expansion (MAX). Threshold The closer the load value is to 1, the heavier the load on the parent node.

[0144] Step S4032: The candidate parent node's load, hierarchical value, and received signal strength indication value are weighted using preset weights to obtain the decision value of the candidate parent node; specifically, this weighting process can be expressed by the following formula:

[0145]

[0146] In the formula, DF represents the decision value, and Rank represents the hierarchy value. , and This represents the corresponding weighting coefficient. The value of the weighting coefficient can be adjusted according to actual conditions. In this embodiment, the adjustment is mainly based on the load size; that is, as the load increases, The value decreases. The value of increases, and because the absolute value of RSSI is usually much larger than Load and Rank, therefore The value is fixed at 0.2. and The value is dynamically adjusted. The specific adjustment method is shown in Table 1 below:

[0147] Table 1 Weighting Factor Adjustment Table

[0148]

[0149] Step S404: Sort the decision values ​​of the connectable candidate parent nodes and determine whether the sorting result of the decision values ​​meets the preset conditions.

[0150] Step S405: If satisfied, select the candidate parent node with the largest decision value for connection.

[0151] Step S406: If the conditions are not met, send an expansion request command to the candidate parent node so that the candidate parent node can execute the above wireless network networking method.

[0152] In an optional implementation, steps S404, S405, and S406 include:

[0153] Step a1: Sort the decision values ​​of connectable candidate parent nodes. When there is a maximum decision value among the candidate parent nodes, the candidate parent node corresponding to the maximum decision value is selected as the parent node for connection. Specifically, when there is only one maximum decision value after sorting, the candidate parent node corresponding to that maximum decision value is directly selected as the parent node. For example, a child node receives DIO information from three candidate parent nodes: Parent node A: Load = 90%, Rank = 2, RSSI = -75 dBm; Parent node B: Load = 70%, Rank = 2, RSSI = -73 dBm; Parent node A: Load = 50%, Rank = 2, RSSI = -73 dBm. The decision values ​​of the candidate parent nodes are calculated as follows: A's decision value is -14.73, B's decision value is -13.85, and C's decision value is -13.45. Therefore, candidate parent node C is ultimately selected as its parent node.

[0154] Step a2: When there is a maximum decision value among the candidate parent nodes that are equal, select the candidate parent node with the smallest level value among the maximum decision values ​​as the parent node for connection. Specifically, when there is more than one maximum decision value after sorting, the level value needs to be further considered. That is, obtain the level value corresponding to each maximum decision value, and then select the candidate parent node with the smallest level value as the optimal parent node for connection.

[0155] Step a3: When the hierarchical values ​​of the equal maximum decision values ​​are all equal, the candidate parent node corresponding to the one with the largest received signal strength indication value among the maximum decision values ​​is used as the parent node for connection; specifically, when there is more than one sorted maximum decision value, and the hierarchical values ​​of the maximum decision values ​​are all the same, RSSI is further considered, that is, the RSSI corresponding to each maximum decision value is obtained, and the candidate parent node with the largest RSSI is used as the optimal parent node for connection.

[0156] Step a4: When the hierarchical value and the maximum received signal strength indication value are both equal among the maximum decision values, select the first candidate parent node that sends the reply information as the parent node for connection.

[0157] Step a5: When the decision value of all candidate parent nodes is 0, it is determined that no connectable candidate parent node has been found. Specifically, when the decision value of all candidate parent nodes is 0, it means that each candidate parent node cannot be connected. At this time, the parent node capacity threshold adjustment strategy after candidate expansion (i.e., expansion operation) is initiated.

[0158] This embodiment also provides a wireless network networking system, which includes child nodes and parent nodes;

[0159] The child node is used to send request information to neighboring nodes in the wireless network; receive reply information sent by neighboring nodes based on the request information, and designate the neighboring node that sent the reply information as a candidate parent node. The reply information includes the number of child nodes connected to the candidate parent node, the parent node capacity threshold after expansion, the hierarchical value, and the received signal strength indication value; calculate the decision value of the connectable candidate parent node based on the reply information; sort the decision values ​​of the connectable candidate parent nodes, and determine whether the sorting result meets the preset conditions. If it does, select the candidate parent node with the largest decision value for connection; if it does not meet the conditions, send an expansion request command to the candidate parent node.

[0160] The parent node is used to receive expansion request commands sent by child nodes; count the first number of expansion request commands received in the current time window and the second number of expansion request commands received in the previous time window; determine the expansion capacity in the current time window based on the first number, the second number, and the expansion capacity in the previous time window, and determine the candidate expansion-after parent node capacity threshold; determine whether the candidate expansion-after parent node capacity threshold exceeds the maximum number of child nodes of the parent node. If it exceeds, the maximum number of child nodes of the parent node is used as the expansion-after parent node capacity threshold; if it does not exceed, the candidate expansion-after parent node capacity threshold is used as the expansion-after parent node capacity threshold, and the parent node replies with expansion success information to the child nodes.

[0161] As one or more specific application embodiments of the present invention, such as Figure 3 , Figure 4 and Figure 5 As shown, this wireless network load balancing system operates according to the following process:

[0162] 1. Initially, a maximum number of child nodes (MAX) is set for each parent node based on its CPU processing power (in GHz), memory size (in GB), and network bandwidth (in Mbps). total Capacity threshold (MAX) Threshold The choice is to reserve 15% redundancy. For example, if a parent node can manage a maximum of 20 child nodes, then MAX... Threshold Set to 17. This is applied when the number of current child nodes of a parent node reaches or exceeds this MAX value. Threshold When the threshold is reached, it will no longer accept new child nodes.

[0163] 2. In the Wi-Sun network, after a new node successfully joins a PAN network and becomes a member, it selects a parent node and establishes routes. The new node sends a DIS (DODAG Information Solicitation) message, requesting surrounding neighboring nodes to send DIO (DODAG Information Object) messages. Upon receiving the DIS message, surrounding neighboring nodes adjust their Trickle timers to start sending DIO messages at the fastest possible frequency. After receiving one or more DIO messages, the new node selects the optimal one from these messages as its parent node.

[0164] 3. When a new node receives a DIO frame from its surrounding neighboring nodes (candidate parent nodes), it extracts the number of child nodes and the capacity threshold (MAX) of the current candidate parent node from the message frame. Threshold The system obtains and records the Rank value, as well as the Received Signal Strength Index (RSSI) value.

[0165] 4. Calculate the load of the candidate parent node. Load = Number of current child nodes (Count) / Capacity threshold of the current candidate parent node (MAX) Threshold The closer the load value is to 1, the heavier the load on the parent node.

[0166] 5. Construct the parent node's decision function: The decision function is the decision value. The weighting coefficients can be adjusted according to actual conditions. The main adjustment is based on the Load value. Specific adjustment strategies are shown in Table 1. New nodes select parent nodes based on the decision function value, with higher-valued parent nodes being selected first. If the calculated decision value is 0, it indicates that the candidate parent node is fully loaded and will no longer accept child nodes; the decision value is then stored in the list of decision values ​​of 0. If the calculated decision value is not 0, it is stored in the decision value comparison list, and the maximum decision value is selected based on this list. If no maximum decision values ​​are equal, the candidate parent node corresponding to the maximum decision value is chosen as the final parent node. If the maximum decision values ​​are equal, the node's Rank is determined, and the node with the smaller Rank value is selected as the parent node. If the Rank values ​​are also the same, the RSSI value is determined, and the node with the larger value is selected as the parent node. If the RSSI values ​​are also equal, the candidate parent node that first responds is selected as the final parent node. When the decision values ​​of all surrounding candidate parent nodes found by a newly joined node are 0, the maximum threshold adjustment strategy for candidate parent nodes is activated.

[0167] 6. Maximum threshold adjustment strategy - expansion.

[0168] A unicast request command (Request) is sent to this candidate parent node. Upon receiving the Request command, the candidate parent node determines if it is the first request within the current time window. If so, it switches to expansion collection mode, starts a very short time window timer T (e.g., T=500ms), and increments the request count by 1. If it is not the first request, it checks if it is a duplicate request; if so, it discards the request; otherwise, it increments the request count by 1. Requests are continuously received during the window period until the timer expires. The window period ends when the time window timer T expires. The node then checks if the current threshold is less than the maximum number of child nodes (MAX). total (Physical Limit) If the current threshold is greater than the maximum number of child nodes, then the NACK response has reached the physical limit.

[0169] Otherwise, calculate the expansion capacity EQ_new according to the following expansion formula:

[0170]

[0171] Then, an expansion operation is performed, i.e., the new threshold = current threshold + EQ_new, and it is checked whether the new threshold is less than the physical upper limit MAX. total If the threshold is less than the current threshold, then the new threshold = current threshold + EQ_new; otherwise, the new threshold = MAX. total Then update the expansion history (timestamp, old threshold, new threshold). Reply with ACK for successful expansion.

[0172] 7. Maximum threshold adjustment strategy - shrinking.

[0173] After the parent node starts, it enters a waiting state. An internal shrink timer begins to run, which triggers periodically according to a preset period (e.g., 30 minutes).

[0174] When the current scaling-down timer is triggered, the parent node does not immediately scale down. Instead, it first initiates a round of continuous low-load condition judgment. This judgment uses a circular buffer mechanism: the parent node calculates the current load state: current number of child nodes < (current threshold × conservative coefficient). This judgment result (True / False) is written as a new record to a fixed-size circular buffer. This operation automatically overwrites the oldest historical record in the buffer.

[0175] The parent node then checks all records in the circular buffer. Only if all records in the buffer are True (i.e., each recent check meets the low-load condition) is the "continuous low-load" condition deemed valid, and subsequent condition checks are performed. Otherwise, it returns to a waiting state. The parent node checks whether its current threshold is greater than the preset safety lower limit (i.e., the initially set parent node capacity threshold).

[0176] If the current threshold is not greater than the lower safety limit, it means the node is already at its minimum safe capacity and cannot be scaled down further, so it returns to a waiting state. If it is greater, the parent node checks its expansion history list: if the list is empty (indicating the node has never scaled up), it returns to a waiting state. If the list is not empty (indicating the node has performed an expansion operation), it retrieves the most recent expansion record from the list and uses the previous expansion threshold (old_threshold) as a candidate target. The final target threshold is determined as max(lower safety limit, previous expansion old_threshold). This ensures that scaling down will not exceed the safety limit and allows for multi-level rollback.

[0177] Compare the current threshold with the calculated target threshold. A scaling-down operation is only necessary if the current threshold > the target threshold. Perform the scaling-down operation: update the parent node's current threshold to the target threshold.

[0178] The system writes detailed information about this operation (including timestamp, threshold before scaling down, and target threshold after scaling down) to the log or history. The system then returns to a waiting state, awaiting the next trigger of the scaling down timer.

[0179] This embodiment also provides a wireless network networking device for implementing the above embodiments and preferred embodiments; details already described will not be repeated. As used below, the term "module" can refer to a combination of software and / or hardware that performs a predetermined function. Although the device described in the following embodiments is preferably implemented in software, hardware implementation, or a combination of software and hardware, is also possible and contemplated.

[0180] This embodiment provides a wireless network networking device, applied to a parent node, such as... Figure 6 As shown, it includes:

[0181] The request receiving module 61 is used to receive the expansion request command request sent by the child node;

[0182] The statistics module 62 is used to count the first number of expansion request command requests received in the current time window and the second number of expansion request command requests received in the previous time window.

[0183] The capacity expansion determination module 63 is used to determine the capacity expansion in the current time window based on the first quantity, the second quantity and the capacity expansion in the previous time window, and to determine the capacity threshold of the parent node after the candidate expansion.

[0184] The judgment module 64 is used to determine whether the candidate expanded parent node capacity threshold exceeds the maximum number of child nodes of the parent node. When it exceeds the maximum number of child nodes of the parent node, the maximum number of child nodes of the parent node is used as the expanded parent node capacity threshold.

[0185] The response module 65 is used to use the candidate expanded parent node capacity threshold as the expanded parent node capacity threshold when the capacity is not exceeded, and to reply with expansion success information to the child node.

[0186] This embodiment provides a wireless network networking device, applied to child nodes, such as... Figure 7 As shown, the device includes:

[0187] The request information sending module 71 is used to send request information to neighboring nodes in the wireless network;

[0188] The reply receiving module 72 is used to receive reply information sent by neighboring nodes based on request information, and to regard the neighboring node that sent the reply information as a candidate parent node. The reply information includes the number of child nodes connected to the candidate parent node, the capacity threshold of the parent node after expansion, the level value, and the received signal strength indication value.

[0189] Calculation module 73 is used to calculate the decision value of the connectable candidate parent node based on the response information;

[0190] The sorting and judgment module 74 is used to sort the decision values ​​of connectable candidate parent nodes and determine whether the sorting result of the decision values ​​meets a preset threshold.

[0191] The connection sending module 75 is used to select the candidate parent node with the largest decision value for connection if the conditions are met;

[0192] The command request sending module 76 is used to send an expansion request command to the candidate parent node if the conditions are not met, so that the candidate parent node can execute the above wireless network networking method.

[0193] The wireless network networking device provided in this embodiment of the invention can execute the wireless network networking method provided in any embodiment of the invention, and has the corresponding functional modules and beneficial effects for executing the method. Further functional descriptions of the various modules and units described above are the same as in the corresponding embodiments described above, and will not be repeated here.

[0194] Figure 8 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention.

[0195] The following is a detailed reference. Figure 8 This diagram illustrates a structural schematic suitable for implementing an electronic device according to embodiments of the present invention. The electronic device may include a processor (e.g., a central processing unit, a graphics processing unit, etc.) 11, which can perform various appropriate actions and processes according to a program stored in read-only memory (ROM) 12 or a program loaded from memory 18 into random access memory (RAM) 13. The RAM 13 also stores various programs and data required for the operation of the electronic device. The processor 11, ROM 12, and RAM 13 are interconnected via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0196] Typically, the following devices can be connected to I / O interface 15: input devices 16 including, for example, touchscreens, touchpads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, etc.; output devices 17 including, for example, liquid crystal displays (LCDs), speakers, vibrators, etc.; memory devices 18 including, for example, magnetic tapes, hard disks, etc.; and communication devices 19. Communication device 19 allows electronic devices to communicate wirelessly or wiredly with other devices to exchange data. Although Figure 8 Electronic devices with various devices are shown, but it should be understood that it is not required to implement or have all of the devices shown, and more or fewer devices may be implemented or have instead.

[0197] In particular, according to embodiments of the present invention, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of the present invention include a computer program product comprising a computer program carried on a non-transitory computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication device 19, or installed from a memory 18, or installed from a ROM 12. When the computer program is executed by the processor 11, it performs the functions defined in the wireless network networking method of the embodiments of the present invention.

[0198] Figure 8 The electronic device shown is merely an example and should not be construed as limiting the functionality and scope of use of the embodiments of the present invention.

[0199] This invention also provides a computer-readable storage medium. The methods described above according to embodiments of the invention can be implemented in hardware or firmware, or implemented as computer code that can be recorded on a storage medium, or implemented as computer code downloaded via a network and originally stored on a remote storage medium or a non-transitory machine-readable storage medium and then stored on a local storage medium. Thus, the methods described herein can be processed by software stored on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. The storage medium can be a magnetic disk, optical disk, read-only memory, random access memory, flash memory, hard disk, or solid-state drive, etc.; further, the storage medium can also include combinations of the above types of memory. It is understood that computers, processors, microprocessor controllers, or programmable hardware include storage components capable of storing or receiving software or computer code. When the software or computer code is accessed and executed by the computer, processor, or hardware, the wireless network networking method shown in the above embodiments is implemented.

[0200] A portion of this invention can be applied as a computer program product, such as computer program instructions, which, when executed by a computer, can invoke or provide the methods and / or technical solutions according to the invention through the operation of the computer. Those skilled in the art will understand that the forms in which computer program instructions exist in a computer-readable medium include, but are not limited to, source files, executable files, installation package files, etc. Correspondingly, the ways in which computer program instructions are executed by a computer include, but are not limited to: the computer directly executing the instructions, or the computer compiling the instructions and then executing the corresponding compiled program, or the computer reading and executing the instructions, or the computer reading and installing the instructions and then executing the corresponding installed program. Here, the computer-readable medium can be any available computer-readable storage medium or communication medium accessible to a computer.

[0201] Although embodiments of the invention have been described in conjunction with the accompanying drawings, those skilled in the art can make various modifications and variations without departing from the spirit and scope of the invention, and such modifications and variations all fall within the scope defined by the appended claims.

Claims

1. A wireless network networking method, characterized in that, The method includes: Receive expansion request commands sent by child nodes; Count the first number of expansion request command requests received in the current time window and the second number of expansion request command requests received in the previous time window; Based on the first quantity, the second quantity, and the expansion capacity in the previous time window, determine the expansion capacity in the current time window, and determine the parent node capacity threshold after candidate expansion. Determine whether the candidate expanded parent node capacity threshold exceeds the maximum number of child nodes of the parent node. If it does, use the maximum number of child nodes of the parent node as the expanded parent node capacity threshold. If the capacity threshold of the candidate expanded parent node is not exceeded, the expanded parent node capacity threshold will be used as the expanded parent node capacity threshold, and a successful expansion message will be sent back to the child node.

2. The method according to claim 1, characterized in that, Based on the first quantity, the second quantity, and the expansion capacity within the previous time window, the expansion capacity within the current time window is determined, and the capacity threshold of the parent node after candidate expansion is determined, including: The capacity to be expanded is determined by multiplying the ratio of the first quantity and the second quantity with the expansion capacity in the previous time window and the aggressive coefficient. Determine the larger value between the capacity to be expanded and the minimum capacity for a single expansion, compare the larger value with the maximum capacity for a single expansion, and select the smaller value as the expansion capacity within the current time window; Calculate the sum of the expansion capacity within the current time window and the current parent node capacity threshold. When the calculated sum is less than the maximum capacity of the parent node, use the sum as the candidate parent node capacity threshold after expansion.

3. The method according to claim 1, characterized in that, The method further includes: The number of child nodes connected to the parent node within the current time period is obtained according to a preset time interval, and the relationship between the number of child nodes and the product of the current parent node capacity threshold and the conservative coefficient is determined. A circular buffer is used to record the judgment results. When all judgment results are less than the target value, the parent node enters a continuous low-load state. Otherwise, continue to use a circular buffer to record the judgment results; If a sustained low-load state is entered, determine whether the current parent node's capacity threshold is greater than the preset safety lower limit; If the value exceeds the preset safety lower limit, determine whether expansion has been performed. When expansion has been performed, the larger of the parent node capacity threshold before the last expansion and the preset safety lower limit is used as the target threshold. If the current parent node capacity threshold is greater than the target threshold, the target threshold will be used as the parent node capacity threshold after scaling down.

4. The method according to claim 1, characterized in that, The statistics include: the first number of expansion request command requests received within the current time window and the second number of expansion request command requests received within the previous time window, including: Determine whether the received expansion request command is the first expansion request command request within the current time window; When the first expansion request command is requested, start the current time window timer; If it is not the first expansion request, check if it is a duplicate request; if so, discard it. When it is not a duplicate request, increment the count of the current time window timer by one, and count the first number of expansion request command requests received within the current time window after the timer expires. Get the second number of expansion request command requests received within the previous time window.

5. The method according to claim 1, characterized in that, After receiving the expansion request command sent by the child node, the method further includes: Determine whether the current capacity threshold of the parent node exceeds the maximum number of child nodes of the parent node; When the limit is exceeded, send an error message to the child nodes indicating that the limit has been exceeded.

6. A wireless network networking method, characterized in that, Applied to child nodes, the method includes: Send request information to neighboring nodes in the wireless network; Receive the reply information sent by the neighbor node based on the request information, and take the neighbor node that sent the reply information as the candidate parent node. The reply information includes the number of child nodes connected to the candidate parent node, the capacity threshold of the parent node after expansion, the level value, and the received signal strength indication value. Calculate the decision value of the candidate parent node that can be connected based on the response information; Sort the decision values ​​of connectable candidate parent nodes and determine whether the sorting results meet the preset conditions. If the conditions are met, select the candidate parent node with the largest decision value and connect it; If the conditions are not met, a capacity expansion request is sent to the candidate parent node so that the candidate parent node executes the wireless network networking method according to any one of claims 1-5.

7. The method according to claim 6, characterized in that, Sort the decision values ​​of connectable candidate parent nodes, and determine whether the sorting result meets preset conditions. If it does, select the candidate parent node with the largest decision value for connection; otherwise, send an expansion request command to the candidate parent node, including: Sort the decision values ​​of connectable candidate parent nodes. When there is a maximum decision value among the candidate parent nodes, the candidate parent node corresponding to the maximum decision value is used as the parent node for connection. When all candidate parent nodes have the same maximum decision value, select the candidate parent node with the smallest hierarchical value among the maximum decision values ​​as the parent node for connection. When all the hierarchical values ​​in the maximum decision values ​​are equal, the candidate parent node corresponding to the one with the largest received signal strength indication value in the maximum decision value is connected as the parent node. When the maximum decision value and the maximum received signal strength indication value are both equal, the first candidate parent node that sends a reply message is selected as the parent node for connection. When the decision value of all candidate parent nodes is 0, it is determined that no connectable candidate parent node has been found.

8. A wireless network networking system, characterized in that, The system includes child nodes and parent nodes. The child node is used to send request information to neighboring nodes in the wireless network; receive reply information sent by neighboring nodes based on the request information, and regard the neighboring node that sent the reply information as a candidate parent node. The reply information includes the number of child nodes connected to the candidate parent node, the capacity threshold of the parent node after expansion, the level value, and the received signal strength indication value; and calculate the decision value of the connectable candidate parent node based on the reply information. Sort the decision values ​​of connectable candidate parent nodes, and determine whether the sorting result meets the preset conditions. If it does, select the candidate parent node with the largest decision value for connection; otherwise, send an expansion request command to the candidate parent node. The parent node is used to receive expansion request commands sent by the child node; The system counts the first number of expansion request command requests received in the current time window and the second number of expansion request command requests received in the previous time window; it determines the expansion capacity in the current time window based on the first number, the second number, and the expansion capacity in the previous time window, and determines the candidate parent node capacity threshold after expansion; it judges whether the candidate parent node capacity threshold after expansion exceeds the maximum number of child nodes of the parent node. If it does, the maximum number of child nodes of the parent node is used as the parent node capacity threshold after expansion. If the capacity threshold of the candidate expanded parent node is not exceeded, the expanded parent node capacity threshold will be used as the expanded parent node capacity threshold, and a successful expansion message will be sent back to the child node.

9. A wireless network networking device, characterized in that, The device includes: The request receiving module is used to receive expansion request commands sent by child nodes; The statistics module is used to count the first number of expansion request command requests received in the current time window and the second number of expansion request command requests received in the previous time window. The capacity expansion determination module is used to determine the capacity expansion in the current time window based on the first quantity, the second quantity, and the capacity expansion in the previous time window, and to determine the capacity threshold of the parent node after the candidate expansion. The judgment module is used to determine whether the candidate expanded parent node capacity threshold exceeds the maximum number of child nodes of the parent node. When it exceeds the maximum number of child nodes of the parent node, the maximum number of child nodes of the parent node is used as the expanded parent node capacity threshold. The response module is used to use the candidate expanded parent node capacity threshold as the expanded parent node capacity threshold when the capacity limit is not exceeded, and to reply with expansion success information to the child nodes.

10. A wireless network networking device, characterized in that, Applied to child nodes, the device includes: The request information sending module is used to send request information to neighboring nodes in the wireless network; The response receiving module is used to receive response information sent by neighboring nodes based on request information, and to regard the neighboring node that sent the response information as a candidate parent node. The response information includes the number of child nodes connected to the candidate parent node, the capacity threshold of the candidate parent node after expansion, the level value, and the received signal strength indication value. The calculation module is used to calculate the decision value of the connectable candidate parent node based on the response information; The sorting and judgment module is used to sort the decision values ​​of connectable candidate parent nodes and determine whether the sorting result of the decision values ​​meets the preset conditions. The connection sending module is used to select the candidate parent node with the largest decision value for connection if the conditions are met. The command request sending module is used to send an expansion request command to the candidate parent node if the conditions are not met, so that the candidate parent node executes the wireless network networking method according to any one of claims 1-5.

11. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions for causing the computer to perform the wireless network networking method according to any one of claims 1 to 5 or the wireless network networking method according to claim 6 or 7.

Images