A networking method, device, equipment and medium of a wireless network

Abstract

This invention discloses a wireless network networking method, apparatus, device, and medium. The wireless network networking method includes the following steps: based on the power-on state of the node to be joined, performing channel scanning on multiple physical channels within the operating frequency band to obtain channel activity information for each physical channel; based on the channel activity information, selecting candidate channels from each physical channel whose corresponding channel activity information meets preset activity conditions to obtain a candidate channel set; acquiring current network broadcast frames from the candidate channels included in the candidate channel set, determining the network topology level of the parent node of the node to be joined based on the current network broadcast frames, and determining the current topology level of the node to be joined based on the network topology level; calculating the backoff time of the node to be joined based on the current topology level, and waiting until the backoff time expires before adding the node to the preset wireless network. This method significantly improves networking efficiency and reduces the probability of node joining conflicts.

Description

Technical Field

[0001] This invention relates to the field of wireless communication technology, and in particular to a method, apparatus, device, and medium for setting up a wireless network. Background Technology

[0002] Wireless networks are an important component of the wireless communication technology field, and are widely used in scenarios such as the Internet of Things (IoT), smart grids, and industrial automation. For example, Wi-SUN (Wireless Smart Ubiquitous Network), a low-power wide-area network technology based on the IEEE 802.15.4g standard, is widely used in large-scale IoT applications (such as smart electricity metering and smart streetlights).

[0003] However, with the continuous expansion of IoT node scale and the increasing demands for real-time performance, traditional networking mechanisms mainly achieve node access through passive scanning, channel polling, and centralized coordination. Nodes use a passive scanning mode to traverse the entire frequency band, blindly polling until they capture a PA frame (Piconet Area Network Advertisement frame). This process is time-consuming, has a low success rate, and is prone to severe channel collisions when a large number of nodes simultaneously initiate network access requests (such as after a power outage in a residential area). Therefore, existing networking methods suffer from low node access efficiency and are prone to node access conflicts. Summary of the Invention

[0004] This invention provides a method, apparatus, device, and medium for building a wireless network to solve the problems of low node access efficiency and easy node access conflicts in existing networking methods.

[0005] In a first aspect, this application provides a method for networking a wireless network, comprising the steps of: performing channel scanning on multiple physical channels within the operating frequency band based on the power-on state of a node to be joined, and obtaining channel activity information for each physical channel; selecting candidate channels from each physical channel whose corresponding channel activity information meets a preset activity condition based on the channel activity information, and obtaining a candidate channel set; collecting current network broadcast frames from the candidate channels included in the candidate channel set, determining the network topology level of the parent node of the node to be joined based on the current network broadcast frames, and determining the current topology level of the node to be joined based on the network topology level; determining the backoff priority coefficient of the node to be joined based on the current topology level, calculating the backoff duration of the node to be joined based on the current topology level and the backoff priority coefficient, and waiting until the backoff duration expires, and adding the node to a preset wireless network; wherein the backoff priority coefficient is positively correlated with the current topology level.

[0006] Secondly, this application provides a networking device for a wireless network, comprising: a channel scanning module, configured to perform channel scanning on multiple physical channels within a working frequency band based on the power-on state of a node to be joined, and obtain channel activity information of each physical channel; a channel filtering module, configured to filter candidate channels from each physical channel whose corresponding channel activity information meets a preset activity condition according to the channel activity information, and obtain a candidate channel set; a hierarchy determination module, configured to collect current network broadcast frames from the candidate channels included in the candidate channel set, determine the network topology hierarchy of the parent node of the node to be joined according to the current network broadcast frames, and determine the current topology hierarchy of the node to be joined according to the network topology hierarchy; and a node joining module, configured to determine the backoff priority coefficient of the node to be joined according to the current topology hierarchy, calculate the backoff duration of the node to be joined according to the current topology hierarchy and the backoff priority coefficient, and wait until the backoff duration expires before adding the node to a preset wireless network; wherein the backoff priority coefficient is positively correlated with the current topology hierarchy.

[0007] Thirdly, this application provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the above-described networking method.

[0008] Fourthly, this application provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described networking method.

[0009] In the above-mentioned technical solutions for the networking method, apparatus, computer equipment, and storage medium of the wireless network, the networking method of the wireless network includes the following steps: based on the power-on state of the node to be joined, performing channel scanning on multiple physical channels within the operating frequency band to obtain channel activity information of each physical channel; according to the channel activity information, selecting candidate channels from each physical channel whose corresponding channel activity information meets the preset activity conditions to obtain a candidate channel set; collecting the current network broadcast frame from the candidate channels included in the candidate channel set, determining the network topology level of the parent node of the node to be joined based on the current network broadcast frame, and determining the current topology level of the node to be joined based on the network topology level; determining the backoff priority coefficient of the node to be joined based on the current topology level, calculating the backoff duration of the node to be joined based on the current topology level and the backoff priority coefficient, and waiting until the backoff duration expires before adding the node to the preset wireless network; the backoff priority coefficient is positively correlated with the current topology level. This method effectively avoids high-interference channels through a channel selection mechanism limited by channel activity, and significantly reduces the probability of node entry conflicts by dynamically sensing the dual constraints of channel load and topology, thereby improving the self-organization efficiency of large-scale heterogeneous terminals in high-density scenarios. At the same time, relying on a hierarchical backoff mechanism, it effectively avoids the response lag problem of traditional fixed backoff strategies when the topology changes dynamically, and significantly enhances the adaptive convergence speed and robustness of the network topology. Attached Figure Description

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

[0011] Figure 1 This is a flowchart of a wireless network networking method according to an embodiment of the present invention; Figure 2 This is a detailed flowchart of step S2 in a wireless network networking method according to an embodiment of the present invention; Figure 3 This is a detailed flowchart of the backoff time calculation in step S4 of the wireless network networking method in one embodiment of the present invention; Figure 4 This is a detailed flowchart of step S4 in the wireless network networking method of an embodiment of the present invention, which involves the node to be joined to join the network. Figure 5 This is a flowchart illustrating a closed-loop update of the channel activity matrix in a wireless network networking method according to an embodiment of the present invention. Figure 6This is a topology diagram illustrating the network connection process of a node to be connected to the network in a wireless network configuration method according to an embodiment of the present invention. Figure 7 This is a schematic diagram of the channel energy intensity distribution of each physical channel obtained by the networking method of a wireless network in one embodiment of the present invention; Figure 8 This is a schematic diagram showing the distribution of channel activity scores for each physical channel obtained by the networking method of a wireless network in one embodiment of the present invention. Figure 9 This is a schematic diagram of the channel dwell probability distribution of each physical channel obtained by the networking method of a wireless network in one embodiment of the present invention; Figure 10 This is a schematic diagram illustrating the mapping relationship between the backoff priority coefficient and the current topology level corresponding to the node to be joined in the network in a wireless network networking method according to an embodiment of the present invention. Figure 11 This is a schematic diagram comparing the performance of a hierarchical backoff strategy in a wireless network networking method according to an embodiment of the present invention with that of an existing backoff strategy. Figure 12 This is a schematic diagram of a wireless network networking device according to an embodiment of the present invention; Figure 13 This is a schematic diagram of a computer device according to an embodiment of the present invention. Detailed Implementation

[0012] 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, not all, of the embodiments of the present invention. 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.

[0013] It should be noted that a wireless network is a distributed, self-organizing, multi-hop communication network. Its nodes possess dynamic sensing, autonomous decision-making, and collaborative optimization capabilities, enabling channel assessment, topology access, and load balancing without relying on a centralized controller. Typical application scenarios for wireless networks include low-power wide-area network (LPWAN) devices such as smart meters, environmental monitoring sensors, and industrial IoT terminals, including communication protocols such as LoRaWAN and NB-IoT within LPWAN, as well as multi-hop mesh networks for smart cities. The following section primarily uses the Wi-SUN network as a typical application scenario to explain its networking methods. The networking process strictly adheres to the IEEE 802.15.4g standard, balancing low power consumption, high reliability, and wide coverage requirements.

[0014] In one embodiment, such as Figure 1 As shown, a method for setting up a wireless network is provided, including the following steps: Step S1: Based on the power-on status of the node to be connected to the network, perform channel scanning on multiple physical channels within the operating frequency band to obtain the channel activity information of each physical channel.

[0015] First, the technical terms involved in step S1 are explained as follows: A node waiting to join the network is a new node that needs to connect to the wireless network. After it is powered on, it starts the autonomous networking process. This includes nodes that are joining the network for the first time without having connected to the wireless network, as well as nodes that have connected to the wireless network but are temporarily offline and need to reconnect to the network.

[0016] The operating frequency band is the range of frequencies supported by the node to be added to the network and that can be used for network communication. It is usually the 2.4 GHz or 5 GHz band, depending on the node hardware configuration and the regional radio management regulations.

[0017] A physical channel is an independent communication resource unit with a fixed center frequency and bandwidth, allocated within the operating frequency band of a wireless network. It belongs to the physical layer communication resource. Nodes can only transmit and receive signals on the corresponding physical channel. Channels are independent of each other and there is no signal crosstalk. For example, the 2.4 GHz band can be divided into 13 physical channels with a bandwidth of 20 MHz (center frequency interval of 5 MHz). The center frequency and bandwidth parameters of each physical channel must meet the mandatory requirements of the IEEE 802.15.4g standard for the allocation of the Wi-SUN band.

[0018] Channel activity information is a quantitative data measure of the usable value of a single physical channel. It includes the channel energy intensity of each physical channel and the historical hit count of network broadcast frames on each physical channel, reflecting both the real-time load and historical usage preferences of the physical channel. The network broadcast frame hit count is the cumulative number of times a node has successfully received, verified, and parsed a valid network broadcast frame within the corresponding physical channel. Network broadcast frames are topology announcement frames periodically broadcast by higher-level nodes on the network, used to synchronize network topology and node hierarchy information.

[0019] In this embodiment, channel scanning is performed on each physical channel within the wireless network to obtain the channel energy intensity and historical hit count for each physical channel.

[0020] like Figure 6As shown, the wireless network includes a border router (BR) and nodes A, B, C, and D connected to the border router BR via multiple hops. Nodes A and B are direct child nodes of the border router BR; nodes C and D are child nodes of nodes A and B, respectively. Node E is the node to be added to the network. After node E completes its power-on reset, a full-band short-window RSSI energy scan is immediately initiated, traversing all physical channels within the operating frequency band one by one. A fixed 40ms detection window is set for each physical channel. Only channel radio frequency energy is collected throughout the scan; network broadcast frames are not waited for, and wireless packets are not demodulated. After the scan is completed, two sets of core data are collected simultaneously: one is the channel energy intensity of each physical channel, which directly reflects the current interference and signal strength of the channel, corresponding to... Figure 7 The first is the distribution of channel energy intensity of different physical channels; the second is the historical hit count of historical network broadcast frames of each physical channel, which records the number of times network broadcast frames were successfully captured within the historical scanning period of the corresponding physical channel, and is used to indicate whether the physical channel is more likely to carry network beacons, thereby obtaining the channel activity information of each physical channel.

[0021] like Figure 7 The diagram shows the channel energy intensity of each physical channel obtained through step S1. The horizontal axis represents the channel number (i.e., which physical channel it corresponds to), and the vertical axis represents the channel energy intensity. It can be seen that the energy distribution of each channel exhibits a significant non-uniform characteristic. The channel energy intensities of the 4th, 5th, 12th, 13th, and 19th physical channels are significantly higher than those of other physical channels. These physical channels are likely to be preferentially selected as candidate channels in subsequent steps, indicating that their radio frequency energy levels are high in the current or recent window, suggesting strong interference and frequent historical broadcast activity. Further verification of their true availability is needed by considering the historical hit count of historical network broadcast frames.

[0022] In this application, a lightweight short-window scanning method is adopted, stripping away all upper-layer protocol operations and focusing only on the acquisition of raw channel data at the lower level, thereby minimizing the initial scanning time after power-on. Simultaneously, the acquired dual-channel raw data provides complete and reliable raw input for the subsequent step S2 to accurately quantify channel activity, ensuring the accuracy and effectiveness of subsequent channel selection results.

[0023] Step S2: Based on the activity information of each channel, select candidate channels from each physical channel whose corresponding channel activity information meets the preset activity conditions to obtain a candidate channel set.

[0024] It should be noted that the preset activity level condition is set based on a weighted fusion strategy of channel energy intensity and historical hit count, balancing the dual objectives of real-time interference suppression and historical communication reliability, and is used to eliminate inferior channels and simplify the monitoring scope. Candidate channels are physical channels with high network quality and access potential obtained after screening various physical channels, and are the sole data basis for subsequent channel screening and dwell decisions. The candidate channel set is a collection of multiple candidate channels that meet the preset activity level condition; its number of elements is dynamically variable, depending on the channel quality distribution of the current network environment and the strictness of the preset probability threshold.

[0025] In this embodiment, based on the channel energy intensity and historical hit count collected in step S1, a weighted fusion calculation is performed to generate the channel activity score for the corresponding physical channel. The channel activity scores of each physical channel are then comprehensively summarized to form a complete channel activity matrix. The channel activity matrix is ​​then subjected to probability normalization to obtain the channel dwell probability for each physical channel. A preset activity condition is that the channel dwell probability of the corresponding physical channel exceeds a preset probability threshold. Based on this preset probability threshold, the channel dwell probabilities are filtered, eliminating physical channels with probabilities below the threshold and retaining channels with high dwell probabilities to form a candidate channel set. This reduces invalid dwelling on low-activity channels, thereby shortening the blind search time before subsequent network broadcast frame capture.

[0026] Specifically, such as Figure 2 As shown, step S2 includes the following sub-steps: Step S21: Calculate the channel activity score of each physical channel based on the energy intensity of each channel and the number of historical hits, and obtain the channel activity matrix.

[0027] It should be noted that the channel activity matrix is ​​a one-dimensional matrix that stores the channel activity scores of all physical channels, generated by weighted calculation based on the channel activity information of each physical channel collected in step S1. Each element of the matrix uniquely corresponds to the comprehensive activity level of a physical channel.

[0028] In this embodiment, for each physical channel, its corresponding channel energy intensity is normalized to obtain an average signal strength indication value mapped to the [0,1] interval, eliminating the dimensional differences in energy between different physical channels and providing a unified numerical basis for subsequent weighted fusion. Furthermore, the historical hit counts are smoothed to suppress short-term fluctuations caused by sudden broadcast frame interference and improve the robustness of activity assessment. Subsequently, the normalized energy intensity value and the smoothed historical hit counts are linearly weighted according to preset weights to obtain the channel activity score for each physical channel. The channel activity score for each physical channel can be expressed as: ; in, Indicates the first Channel activity score for each physical channel; and These represent the preset channel energy intensity weight and the historical hit count weight, respectively. ; For the first The normalized average signal strength indication value of the channel energy intensity of each physical channel. For the first The number of times a physical channel successfully captures historical network broadcast frames within a historical window.

[0029] like Figure 8 As shown, in Figure 7 Based on the obtained channel energy intensity distribution map, a channel activity distribution map is generated by overlaying historical hit counts. The horizontal axis represents the channel number of the physical channel, and the vertical axis represents the channel activity score. As can be seen from the figure, the channel activity score exhibits a significant non-uniform distribution: the 4th physical channel has the highest channel activity score, reaching 2.5; the 5th, 12th, 13th, and 19th physical channels have the next highest channel activity scores, all above 1.0. Figure 7 The distribution of channel energy intensity is perfectly matched, reflecting the priority given to channel energy intensity in this scheme.

[0030] As an example , The channel energy intensity normalization value of the 4th physical channel is 1.0, the corresponding historical hit count is 6, and the final channel activity score M[4]=0.7×1.0+0.3×6=2.5, which is the highest activity value among all channels. Although the channel energy intensity of the 13th and 19th physical channels is similar to that of the 4th physical channel, the historical hit count is slightly lower, resulting in a lower final channel activity score. This reflects the synergistic effect mechanism of channel energy intensity and historical hit count in activity assessment.

[0031] It should be noted that, This reflects the priority given to channel energy intensity in this scheme. and The value is not fixed, but can be dynamically adjusted according to the network deployment phase: during the initial network construction phase, the focus is on the breadth of signal coverage, and the value is appropriately increased. Weighting is adjusted to account for historical communication memories in areas with weak signals; during peak traffic periods, it is strengthened. It takes the lead in quickly responding to sudden changes in channel energy to adapt to the dynamic needs of different business scenarios.

[0032] In this application, by characterizing both channel energy intensity and historical hit count, even if the instantaneous channel energy intensity of some physical channels is not high, as long as the historical hit count of network broadcast frames is relatively high, it can still pass through. This improves its channel activity score, thereby taking into account both "instantaneous energy perception" and "historical beacon evidence" and reducing the probability of missing the real working channel.

[0033] Step S22: Normalize the channel activity matrix to obtain the channel dwell probability of each physical channel.

[0034] It should be noted that probability normalization converts the channel activity score into a probability value between 0 and 1, eliminating the dimensional differences of the original data and ensuring that the total probability of all channels in the network is always 1. The channel dwell probability is the proportion of nodes waiting to join the network that will preferentially dwell on and collect data from the corresponding physical channel. The higher the value, the better the network quality of that physical channel and the higher the access success rate.

[0035] In this embodiment, the channel activity matrix is ​​globally normalized to obtain the channel dwell probability of each physical channel. The channel dwell probability of each physical channel can be expressed as: ; in, Indicates the first Channel dwell probability of each physical channel Indicates the first Channel activity score for each physical channel; This represents the sum of the channel activity scores of all N physical channels, where N represents the total number of physical channels within the operating frequency band.

[0036] like Figure 9 The diagram shows the channel dwell probability distribution for each physical channel. The horizontal axis represents the channel number of the physical channel, and the vertical axis represents the channel dwell probability (0~1), with each channel dwell probability accurate to two decimal places. Figure 9 The data clearly shows the channel dwell probability of each physical channel. The fourth physical channel has the highest dwell probability at 0.24, significantly higher than the other physical channels. The fifth physical channel is second with a dwell probability of 0.23. The twelfth physical channel is third with a dwell probability of 0.2. The thirteenth and nineteenth physical channels are tied for fourth with a dwell probability of 0.12. The dwell probabilities of the remaining physical channels are all below 0.05, reflecting the typical characteristic of network resources converging towards a few high-quality channels.

[0037] Step S23: Based on the dwell probability of each channel, select candidate channels from each physical channel whose dwell probability exceeds a preset probability threshold to obtain a candidate channel set.

[0038] It should be noted that the preset probability threshold is a pre-set channel filtering threshold used to filter out low-quality, invalid channels without effective network signals.

[0039] In this embodiment, the preset probability threshold is set to 0.15. This value comprehensively considers the balance between network robustness and access efficiency, thereby selecting the 4th, 5th, and 12th physical channels as candidate channels, obtaining the corresponding candidate channel set, namely {4,5,12}. The candidate channel set is represented using a set of corresponding physical channel numbers, facilitating direct retrieval and iteration in subsequent steps.

[0040] Combination Figure 9 The 4th, 5th, and 12th physical channels together constitute the "first tier" of dwell probability, accounting for a total of 0.67, forming a highly reliable access backbone. The 13th and 19th physical channels form the "second tier." Although their individual point probabilities are slightly lower, their collaboration can improve access redundancy and anti-interference resilience. The total probability of the remaining physical channels is less than 0.09. Selecting the 4th, 5th, and 12th physical channels as candidate channels and obtaining the corresponding candidate channel set can significantly improve the node's network access success rate and network convergence efficiency.

[0041] It should be noted that the preset probability threshold is not fixed, but can be dynamically adjusted according to the actual deployment environment, network load status, and service quality requirements. For example, in high-density access scenarios, it can be appropriately increased to 0.18 to enhance the strictness of channel screening, while in low-interference, light-load scenarios, it can be lowered to 0.12 to improve channel utilization and access flexibility.

[0042] In other embodiments, the channel dwell probabilities corresponding to each physical channel can be sorted to obtain a descending order of dwell probability from high to low. The top K physical channels with the highest dwell probabilities can then be selected. The value of K is dynamically adjusted based on network size and real-time load; for example, it can be set to 3 in light-load scenarios and extended to 5 in heavy-load or high-interference scenarios, ensuring that the candidate set remains both concise and environmentally adaptable. This dynamically adjustable K-value mechanism not only gives the system stronger scene awareness but also exhibits good robustness in complex electromagnetic environments.

[0043] In this application, step S2 first quantifies the channel quality through a channel activity matrix, then distinguishes channel value through probability normalization, and finally completes channel simplification and screening based on probability thresholds. Compared with the traditional method of scanning the entire frequency band by network nodes and then collecting all physical channels in turn using an equal probability approach, which wastes a lot of monitoring time on low-activity channels with no network or high interference, resulting in a low success rate of broadcast frame acquisition, the proposed solution in this application significantly reduces the subsequent channel monitoring range of nodes, reduces the dwell time on invalid channels, and further accelerates the speed of network broadcast frame acquisition. On the other hand, it enables monitoring resources to be tilted towards highly available channels, conforms to the actual channel distribution characteristics of wireless networks, avoids the waste of resources caused by blind channel polling, improves the accuracy and efficiency of network discovery, and adapts to the dynamically changing channel environment of frequency-hopping wireless networks.

[0044] Step S3: Collect the current network broadcast frame from the candidate channels included in the candidate channel set, determine the network topology level of the parent node of the node to be joined based on the current network broadcast frame, and determine the current topology level of the node to be joined based on the network topology level.

[0045] It should be noted that the current network broadcast frame is a network broadcast frame periodically broadcast by the parent node after the node to be added to the network has completed channel selection. It carries key fields such as the parent node's network topology level, parent node ID, timestamp, and network lifetime. The network broadcast frame is a topology announcement frame periodically broadcast by the network's superior nodes, carrying core data such as basic network information and the parent node's topology level. The parent node is the superior network node through which the node to be added directly communicates uplink, responsible for forwarding network access requests and issuing network configuration and security tokens. The network topology level is the depth identifier of the parent node of the node to be added to the network within the network tree structure, representing the communication hops from the corresponding node to the network root node (border router BR). The smaller the level number, the closer the corresponding node is to the network core gateway, and the higher its network access priority.

[0046] In this embodiment, after completing the channel selection for the node to be added to the network, the node continuously collects the current network broadcast frame from all candidate channels in the candidate channel set. After successfully capturing the current network broadcast frame, it parses the network topology hierarchy of the parent node encapsulated in the current network broadcast frame. Then, its own level is calculated using a fixed formula: .

[0047] like Figure 6 As shown, the network root node is the border router BR, which is directly connected to nodes A and B. The corresponding topology levels for nodes A and B are as follows: Node A is a sub-connector to node C, and node B is a sub-connector to node D. The corresponding topological hierarchy for nodes C and D is as follows: Taking edge node E as an example, if node E is only connected to node C, it captures the current network broadcast frame of its parent node C and parses it to obtain the network topology layer of its parent node C. The value is 2, therefore the current topological level of node E itself is 2. The value is 3.

[0048] Furthermore, if node E simultaneously captures current network broadcast frames from multiple parent nodes, it compares the network topology levels of all parent nodes based on the corresponding current network broadcast frames, and selects the parent node with the smallest corresponding network topology level to establish a communication link, ensuring that its hop count from the root node is minimized and accessing the network via the optimal path. For example, if node E simultaneously captures the current network broadcast frames from node A (… ) and node C ( The current network broadcast frame of node A corresponds to the network topology level of node A. Since the value is 1, node E should preferentially choose node A as its parent node to stabilize its current topology level. This significantly shortens the communication path with the root node, improving data transmission efficiency and network robustness.

[0049] It should be noted that in this embodiment, the Border Router (BR) is used as the root node of the wireless network, and the current topology level is referred to as such. This represents the hop count distance of the corresponding node to be added to the network relative to the border router (BR) in the wireless network topology, rather than an arbitrary abstract number. In engineering practice, devices such as central concentrators, master data collectors, or backhaul gateways, if they are the same hardware entity or the same gateway node as the border router (BR), then they assume the same root-side role as the border router (BR) in terms of the protocol stack. In this case, the current topology layer... It is still defined as "the number of hops from the node to be added to the network to the border router (BR)".

[0050] In this application, the candidate channel set determined in step S2 enables step S3 to concentrate monitoring resources on candidate channels with a high probability of carrying network beacons, improving the acquisition efficiency of the current network broadcast frame and shifting the initial scanning from an approximately equal probability traversal to a "high-priority channel priority" approach. This helps reduce the scanning complexity from being approximately linearly related to the total number of channels to being related to a few candidate channels. Simultaneously, in step S3, the network topology level of the corresponding parent node is obtained by parsing the current network broadcast frame sent by the parent node of the node to be added to the network. This accurately identifies the network locations of backbone and edge nodes, binding physical channel contention to network topology location. The subsequent backoff duration can be configured differently based on this topology level parameter, allowing the channel contention strategy to align with the natural topology construction logic of the wireless network from the inside out and with backbone priority. This provides core input parameters for subsequent hierarchical backoff, addressing the root cause of disordered access at the topology level.

[0051] Step S4: Determine the backoff priority coefficient of the node to be added to the network based on the current topology level, calculate the backoff duration of the node to be added to the network based on the current topology level and the backoff priority coefficient, and wait until the backoff duration expires before adding the node to the preset wireless network.

[0052] It should be noted that the backoff duration is a key time parameter set by a node seeking to join the network after completing topology layer identification to avoid channel conflicts and ensure orderly network access. It represents a quiet interval reserved for the node before joining the network, and its length directly affects access latency and channel resource utilization during network initialization. The backoff priority coefficient is a competition weight parameter for a node seeking to join the network within the wireless network topology. Its value is calculated from the current topology layer using a preset nonlinear mapping function, used to quantify the priority of nodes at different layers in channel contention. A larger backoff priority coefficient indicates a lower priority for the node seeking to join the network in channel contention. The backoff priority coefficient is positively correlated with the current topology layer; that is, a smaller current topology layer corresponds to a smaller backoff priority coefficient, giving the node a higher priority in channel contention and allowing it to gain an advantage.

[0053] In this embodiment, firstly, it is necessary to determine the current topology level obtained in step S3. By combining preset formulas, the backoff time of nodes to be added to the network is calculated. The core of this method lies in establishing the current topology level. The nonlinear mapping relationship between the current topology level and the backoff time: the closer the current topology level is to the root node ( The smaller the value, the higher the priority and the shorter the backoff time; the further the current topology level is from the root node ( The larger the value, the lower the priority and the longer the backoff time, thus naturally forming a topologically ordered access order of "root nearest first, edge far last" in the time dimension. At the same time, the nodes waiting to join the network remain silent until the backoff timer expires, and then the network access request frame is sent to carry out the network access request frame sending and subsequent access verification process, realizing the orderly access and session management of the nodes waiting to join the network, and ensuring low collision rate, high determinism and scalability in the network initialization phase.

[0054] Specifically, such as Figure 3 As shown, the specific steps for calculating the retreat time are as follows: Step S411: Perform logarithmic decay on the current topology level to obtain the backoff priority coefficient of the node to be added to the network.

[0055] It should be noted that logarithmic decay is a nonlinear transformation method that balances hierarchical discriminability and numerical stability. This ensures that the output value maintains topological hierarchical discriminability while avoiding backoff window imbalance due to excessively large values, and preserves the fine-grained resolution of lower-level nodes. The backoff priority coefficient is a continuous competition weight obtained by mapping the topological hierarchy through a logarithmic function. It is used to adjust the size of the random backoff window, achieving a smooth change in competition intensity with the topological hierarchy. This ensures rapid response from backbone nodes while reserving sufficient channel awareness and competition windows for edge nodes. The entire network initialization process possesses both deterministic timing constraints and flexible adaptability to large-scale topology evolution.

[0056] In this embodiment, the corresponding logarithmic decay function is used to logarithmically decay the current topology level to obtain the backoff priority coefficient of the node to be added to the network. The corresponding logarithmic decay function can be expressed as: ; in, Indicates the retreat priority coefficient; Indicates the current topology level; Let e ​​be the base of the natural logarithm, and e ≈ 2.71828.

[0057] like Figure 10 The figure shows the trend of the backoff priority coefficient as the current topology level changes. The horizontal axis represents the current topology level (range 1-10), and the vertical axis represents the calculated backoff priority coefficient. The curve begins at hour , Increase The value of approaches linear growth. hour , hour And so on, until... hour Its function graph exhibits a monotonically increasing but gradually slowing logarithmic curve shape, intuitively reflecting that its logarithmic growth characteristic mathematically naturally suppresses exponential expansion at higher order levels, while retaining the fine adjustment granularity required for millisecond-level responses at lower order nodes.

[0058] In this embodiment, the calculation of the backoff priority coefficient maps the discrete hop count to a continuously, sublinearly growing competition intensity parameter, providing a non-uniform scale that varies with the current topology level for the subsequent calculation of the backoff duration, effectively suppressing competition at higher topology levels (such as...). To mitigate the risk of numerical explosion caused by excessively high priority coefficients, and to prevent backoff window imbalance due to excessively high priority coefficients; while for lower topology levels (such as...) This preserves sufficient resolution to ensure that the response advantages of the root node and the backbone node are clearly distinguishable.

[0059] Step S412: Based on the current topology level and backoff priority coefficient, perform a backoff assessment on the node to be added to the network to obtain the backoff duration.

[0060] In this embodiment, a hierarchical backoff strategy is adopted. Combining the current topology level and the backoff priority coefficient, the final backoff duration for the node to be added to the network is calculated. Based on the backoff duration of the corresponding level, the node to be added to the network starts its backoff timing when the channel is idle. The backoff duration for the corresponding node to be added to the network can be expressed as: ; in, This indicates the backoff time for the corresponding node to be added to the network; This represents the preset minimum time window base, which is the preset minimum contention window length during the network initialization phase. This represents the backoff priority coefficient for the corresponding node to be added to the network; Indicates the interval A random number that is uniformly distributed within the range; Represents an empirical constant; This reflects the cumulative delay effect between topological levels, causing the backoff time to increase in a stepwise manner as the level deepens; This indicates the additional delay duration for the corresponding node to be added to the network.

[0061] It should be noted that the minimum time window base A balance needs to be struck between channel bandwidth, propagation delay, and node density, ensuring that the root node has sub-millisecond response capabilities while maintaining institutional respect for fair access to edge nodes. (Empirical constants) These are engineering parameters determined based on the network deployment scenario, and their actual values ​​can be related to the minimum time window base. The unit backoff time and typical concurrent network scale are matched, and determined through simulation or field testing, so as to achieve a balance between suppressing PAS message collisions and avoiding excessive delays in deep nodes.

[0062] It should be noted that, in addition to the standard contention window random term, this invention introduces a deterministic additional delay that monotonically increases with topology depth. This is to ensure that the first-hop node closest to the border router (BR) ( The deterministic additional delay is not superimposed, thus prioritizing channel contention. This deterministic additional delay is written as... .in, Instead of reducing the current topology level of the node to be added to the network by 1, it is defined as an additional order of the level. ,correspond This represents the additional delay duration, which is an empirical constant with the corresponding hierarchical order added to the backoff time of the current node waiting to join the network. When hour, 0, meaning the additional delay duration is zero; when hour, 1, that is, adding an empirical constant. ;when hour, That is, adding two empirical constants. And so on. In other words, This indicates "the direct connection layer relative to the border router (BR)". The additional "levels" are used to implement queuing and peak-shifting from shallow to deep. Minimum time window base. With random numbers The product of is a random term, where Then used for Adjusting the scale of the random competition window, in conjunction with the linear additional delay of L, together constitutes a system based on... A tiered avoidance strategy.

[0063] by =16、 Taking 10 as an example, Additional latency of nodes A and B The value is 0, and the backoff before node A and node B join the network is mainly due to... The decision is made based on the backoff priority coefficients of nodes A and B. The smaller the size, the shorter the average retreat time; In addition to the random items, node E also has an additional delay duration. The linear additional delay results in a longer overall backoff time for node E. This additional delay, in scenarios with a large number of nodes powering on concurrently, allows shallow nodes closer to the border router (BR) to prioritize channel contention and send network access request frames, while deeper nodes automatically stagger their activity. This reduces the probability of PAS / EAPOL packet collisions, promotes stable link establishment from the outside in or from shallow to deep within the wireless network, and alleviates the problem of repeated topology reconstruction.

[0064] It should be noted that existing backoff strategies typically employ the standard CSMA / CA (Carrier Sense Multiple Access with Collision Avoidance), a media access control protocol specifically designed for wireless networks. It manages access to a shared channel by multiple devices through carrier sense and collision avoidance mechanisms. Using a uniform backoff mechanism for nodes at different topology levels, without distinguishing between them, results in deep-layer nodes and shallow-layer nodes having equal priority in channel contention. This easily leads to problems such as high-order nodes joining the network in a concentrated manner, increased packet collision rates, and link establishment failures.

[0065] like Figure 11 The figure shows a performance comparison between the proposed hierarchical backoff strategy and existing backoff strategies (standard CSMA / CA). The horizontal axis represents the current topology level of the node to be added to the network (range 1-10), and the vertical axis represents the corresponding backoff duration (in milliseconds). It can be seen that the proposed hierarchical backoff strategy... At that time, the backoff time for the corresponding node to be added to the network is slightly reduced compared to the existing strategy, only about 72% of the existing backoff strategy; with As the number of nodes seeking to join the network increases, the backoff time obtained through the tiered backoff strategy proposed in this application continues to rise gradually, until... It achieves approximately three times the speed of existing strategies, significantly alleviating channel congestion caused by concentrated competition among high-order nodes, while ensuring that the root node can quickly join the network within a millisecond window.

[0066] In this application, the backoff priority coefficient of the node to be joined is first calculated based on the current topology level of the node to be joined. Then, the backoff duration corresponding to the node to be joined is calculated by combining the minimum time window base with the linear combination of the backoff priority coefficient. This achieves dynamic adaptation of the backoff duration and hierarchical awareness of peak scheduling, ensuring the coordination and unity of determinism and timeliness of the network entry behavior of nodes at each level during the network topology expansion process.

[0067] like Figure 4 As shown, the specific steps for a node to be added to the network are as follows: Step S421: Receive the network access request frame sent by the node to be joined.

[0068] It should be noted that the network access request frame is a dedicated network access interaction message initiated by the node to the uplink parent node after the backoff waiting period ends. It is the only signaling message for a node to apply for access to the wireless network. The frame body contains three fixed fields: node hardware identifier, local cache token field, and channel state information.

[0069] In this embodiment, after the node to be joined completes the hierarchical backoff timer, it immediately exits the silent waiting state and broadcasts a network entry request frame to the parent node that has been successfully matched on the current optimal candidate channel. The parent node continuously monitors the candidate channel, captures downlink node packets in real time, completes the reception and header parsing of the network entry request frame, confirms that the packet source is a legitimate node to be joined, and enters the subsequent token identification process.

[0070] This mainly relies on a pre-level backoff mechanism to stagger the timing of message transmission, avoid a large number of network access request frames from flooding the parent node at the same time, reduce the risk of buffer overflow in the parent node's message reception, ensure that network access request messages can be stably received by the parent node, and lay a solid foundation for subsequent security authentication interactions.

[0071] Step S422: Identify whether the network access request frame carries a local session token.

[0072] It should be noted that the local session token is a lightweight secure session credential issued by the parent node after the node passes a complete security verification upon its initial network entry. It is unique, time-sensitive, and bound to the node's hardware address and network session key. The token identification field is a dedicated storage field reserved in the network entry request frame, used to store the local session token; this field is empty when no token is available.

[0073] In this embodiment, after the parent node receives the network access request frame, it extracts the token identification field from the frame body and quickly determines whether valid token data exists. This step only identifies the presence of the field and does not verify the token content. The identification time is controlled within 2ms, resulting in extremely high efficiency and no additional latency to network access.

[0074] Among them, the network access scenario can be quickly split by extremely simple field recognition. It can distinguish between new nodes and offline reconnection nodes without parsing the complete message content. The network access path splitting is completed with extremely low computing power overhead, which is suitable for the hardware characteristics of low power IoT nodes with limited computing power.

[0075] Step S423: If the network access request frame does not carry a local session token, then determine that the node to be accessed is a first-time network access node, and perform identity verification on the first-time network access node.

[0076] It should be noted that a newly joined node is a completely new device that has never been connected to the current wireless network, has no local session history, and no valid cached token. Identity verification uses a standard four-way EAPOL security handshake, including three layers of verification logic: device hardware whitelist comparison, network key matching, and access permission verification, ensuring that unauthorized devices cannot access the internal network.

[0077] In this embodiment, when the token identification field is empty, the parent node determines that the node is a first-time network access node and initiates a complete security authentication process. Taking the field meter node as an example, the parent node sequentially verifies whether the meter's MAC address is in the device whitelist and whether the node's pre-set network key matches, performing a complete security handshake interaction throughout the process.

[0078] Among these measures, a complete security verification process is retained for unfamiliar and entirely new nodes, thus strengthening the network security access barrier, preventing unauthorized and malicious nodes from accessing the wireless network, ensuring the security of the entire network's communication data, and meeting the high-security access requirements of IoT private networks.

[0079] Step S424: When the first-time network-entry node passes the identity legitimacy verification, the parent node of the first-time network-entry node issues a local session token to the first-time network-entry node, enabling the first-time network-entry node to join the wireless network.

[0080] In this embodiment, after all security verifications of the first-time network-entry node pass, the parent node generates a unique local session token based on the node number and session random key, and sends it to the first-time network-entry node through a downlink response frame. After receiving the local session token, the first-time network-entry node officially accesses the wireless network. At the same time, the local session token is cached locally and stored in a local non-volatile storage area, with the cache validity period saved to ensure that the token can be reused within the validity period. The token data will not be lost in the event of a short power outage or short-term offline status, so as to complete the network registration. In subsequent short-term offline situations, the token can be directly reused for quick reconnection.

[0081] Among them, the first node to join the network completes the security access through the first network entry, and at the same time, it is pre-configured with fast reconnection credentials. The result of a complete security handshake is reused in the subsequent multiple reconnection processes, which reduces the subsequent repeated security interactions from the mechanism and provides the pre-support conditions for the subsequent lightweight fast reconnection.

[0082] Step S425: If the network access request frame carries a local session token, then the node to be accessed is determined to be a reconnection node, and the validity of the local session token is verified by the parent node of the reconnection node.

[0083] It should be noted that the reconnecting node is a historical online node that has successfully connected to this wireless network, experienced a short-term offline disconnection, and still has a valid local session token cached locally. Token validity verification is a local offline verification performed by the parent node, comparing the token encryption key, device binding information, and token validity without interaction with the upper-layer server. Specifically, it uses HMAC (Hash-based Message Authentication Code), which generates a message digest using a key and hash algorithm to verify data integrity and authenticity.

[0084] In this embodiment, the parent node of the reconnecting node extracts the token data attached to the network access request frame, retrieves the local token ledger, and compares the token hash value, validity period, and bound device address. The entire verification is completed locally on the parent node, without the need for network-wide key synchronization interaction. This eliminates the need for the traditional reconnection network repeated four-way handshake process and simplifies the complex security interaction across devices and levels to a one-click comparison and verification on the parent node, greatly reducing the reconnection network authentication latency and adapting to high-frequency field scenarios such as short-term network fluctuations and temporary node disconnections.

[0085] Step S426: When the parent node verifies that the local session token is valid, confirm that the session of the reconnecting node in the wireless network has been restored.

[0086] In this embodiment, if the parent node verifies that the local session token is still valid and the bound device information is consistent with the parent node's ledger, the parent node directly restores the original network session of the reconnecting node and simultaneously opens the channel forwarding permission. That is, without reallocating the network address or resynchronizing the topology information, the communication link, data forwarding permission and network timing before the node went offline are directly restored.

[0087] Furthermore, if the local session token is abnormal, the network access request will be rejected directly, forcing the node to return to the initial network access verification process. That is, if the local session token expires, is tampered with, or does not match, the network access request will be rejected directly, requiring the node to re-execute the complete initial network access verification process and enter step S423, ensuring that the reconnection is safe and controllable.

[0088] In this application, under actual testing, the overall process takes ≤15ms, achieving millisecond-level fast session recovery. This reduces the traditional second-level reentry latency to the millisecond level, significantly improving network fault tolerance and link self-healing speed, while still retaining the security interception mechanism for abnormal tokens, balancing network efficiency and network security. Furthermore, it can distinguish the security paths for initial network entry and short-term reconnection, compressing short-term reconnection from second-level complete certificate exchange to the hundreds of millisecond level (depending on specific implementation parameters), reducing reentry overhead.

[0089] like Figure 5 As shown, after adding the node to be added to the preset wireless network, the process also includes: Step S51: Obtain the channel energy measurement values ​​of each physical channel.

[0090] It should be noted that the channel energy measurement value is the real-time channel RSSI radio frequency energy value obtained by periodically detecting the entire working frequency band after the node to join the wireless network. It is different from the channel energy intensity of the short window scan before joining the network. After joining the network, the node detection time is longer and the sampling frequency is higher, resulting in higher measurement accuracy.

[0091] In this embodiment, after a node successfully accesses the wireless network, it no longer performs a single short-window scan before network access. Instead, it continuously traverses all physical channels with a fixed periodic sampling period of 2 seconds, accurately collecting the real-time channel energy measurement value of each physical channel. At the same time, the node buffers multiple sets of continuous sampling data, eliminates abnormal extreme value data caused by instantaneous sudden interference, retains stable and effective channel energy measurement values, and finally sends the filtered effective channel energy measurement value to its corresponding parent node through the established stable uplink, completing the aggregation of the entire network channel measurement data.

[0092] Compared to a single static channel scan before network access, this step involves periodic and continuous sampling after network access, which can capture dynamic interference changes in the wireless environment in real time and avoid evaluation bias caused by channel measurement data at a single moment. At the same time, abnormal data filtering process can eliminate sudden noise interference from the environment, ensuring that the channel energy measurement values ​​reported to the parent node are true and reliable, and providing high-precision original measured data for subsequent accurate iteration of the activity matrix.

[0093] Step S52: Based on the channel energy measurement value, the channel activity matrix is ​​updated exponentially to obtain the updated channel activity matrix. The updated channel activity matrix is ​​used to obtain the candidate channel set for subsequent nodes to join the network.

[0094] It should be noted that the exponential update (exponential smooth update) is a time-series iterative algorithm that takes into account both historical channel state data and the latest measured data, avoiding the loss of historical channel features caused by directly overwriting the old matrix. The updated channel activity matrix is ​​a completely new one-dimensional matrix after iterative optimization, synchronously adapting to the latest wireless channel interference environment. Subsequent nodes to be added to the network are new nodes that power on and initiate network access requests after the current node has completed its network access.

[0095] In this embodiment, after the parent node receives the channel energy measurements reported by all incoming nodes in the network, it calls the exponential smoothing update formula to iteratively update the channel activity matrix initially constructed in step S2. The corresponding exponential smoothing update formula is: ; in, Indicates the updated number The channel activity score of the nth physical channel; M[k] represents the nth physical channel in the historical channel activity matrix. The current score of each physical channel; RSSI_new[k] represents the exponential smoothing coefficient, with a value range of (0,1), used to adjust the fusion weight of historical data and new measurements; RSSI_new[k] represents the k-th value obtained from the latest round of network aggregation. The filtered channel energy measurement value (unit: dBm) of each physical channel. The higher the value, the higher the corresponding channel activity score.

[0096] Furthermore, set the exponential smoothing coefficient. This involves retaining 80% of historical channel activity data and overlaying 20% ​​of the latest real-time channel energy data to ensure smooth matrix changes without abrupt changes. After the update, a completely new channel activity matrix is ​​generated and directly distributed to all monitoring nodes in the network. Subsequent nodes seeking network access will use this updated channel activity matrix to select candidate channels during step S2, enabling dynamic iteration of the channel evaluation criteria. For example, if the channel energy measurement of the 20th physical channel at night is slightly higher than the initial channel energy intensity, the updated matrix can still capture this subtle change through a weighted fusion mechanism, causing a gentle increase in the channel activity score of the 20th physical channel. This increases the channel dwell probability of the corresponding physical channel, potentially leading subsequent nodes seeking network access to include it in their candidate channel set, improving the network access success rate and the rationality of channel selection.

[0097] It should be noted that the exponential smoothing coefficient It is a weighting parameter that balances historical matrix data with the latest channel measurement data, and is an exponential smoothing coefficient. The value of is between 0 and 1, representing the exponential smoothing coefficient. The larger the value, the greater the impact of the latest real-time channel data on the channel activity matrix update.

[0098] In this embodiment, exponential smooth updates are used instead of direct full-coverage replacement. This preserves the historical characteristics of long-term channel operation and can quickly respond to real-time interference changes in the wireless environment, solving the defect that static activity matrices cannot adapt to dynamic wireless network environments. At the same time, the updated matrix is ​​globally reused for subsequent network access nodes, realizing the coordinated evolution of the entire network's channel awareness capabilities. This allows the entire networking method to have environmental self-adaptation and self-optimization capabilities, continuously reducing the probability of channel misjudgment under long-term operation and steadily improving the overall network access efficiency.

[0099] In this application, steps S51 and S52 constitute a complete closed-loop optimization link, which upgrades the networking method of the present invention from a one-time static networking to a continuously iterative dynamic adaptive networking system, making up for the shortcomings of traditional networking schemes that lack post-process environmental feedback and have unchanging strategies.

[0100] In summary, this application discloses a networking method for a wireless network, comprising the following steps: based on the power-on state of the node to be joined, performing channel scanning on multiple physical channels within the operating frequency band to obtain channel activity information for each physical channel; based on the channel activity information, selecting candidate channels from each physical channel whose corresponding channel activity information meets preset activity conditions to obtain a candidate channel set; collecting current network broadcast frames from the candidate channels included in the candidate channel set, determining the network topology level of the parent node of the node to be joined based on the current network broadcast frames, and determining the current topology level of the node to be joined based on the network topology level; calculating the backoff time of the node to be joined based on the current topology level, and waiting until the backoff time expires, and then adding the node to be joined to the preset wireless network. This method effectively avoids high-interference channels through a channel selection mechanism limited by channel activity, and significantly reduces the probability of node entry conflicts by dynamically sensing the dual constraints of channel load and topology, thereby improving the self-organization efficiency of large-scale heterogeneous terminals in high-density scenarios. At the same time, relying on a hierarchical backoff mechanism, it effectively avoids the response lag problem of traditional fixed backoff strategies when the topology changes dynamically, significantly enhancing the adaptive convergence speed and robustness of the network topology. It can also suppress access request collisions in high-density concurrent networking scenarios, alleviate channel contention and broadcast storms caused by a large number of nodes powering on simultaneously, and significantly improve the network's elastic fault tolerance capability in edge scenarios such as sudden batch power-on of nodes and rapid channel degradation. Furthermore, it achieves deep coupling between physical layer sensing, topology layer logical backoff strategy, and security layer rapid recovery mechanism, constructing a lightweight networking collaboration paradigm across protocol stacks.

[0101] The aforementioned networking methods can be applied to the smart energy sector, such as automatic meter reading systems (AMIs) for large-scale smart meters, water meters, and gas meters, especially suitable for rapid recovery scenarios after power outages. They can also be applied to smart cities, such as city-level smart street light monitoring and underground utility tunnel environmental sensing networks. Furthermore, they can be applied to emergency communications, such as temporary communication reconstruction after major disasters like earthquakes and floods, supporting second-level self-organizing networks and critical data backhaul without reliance on a central base station. Finally, they can be applied to the industrial Internet of Things (IIoT) sector, such as factory production line equipment status monitoring, AGV (Automated Guided Vehicle) collaborative scheduling, and wireless sensor network deployment in environments with high electromagnetic interference, particularly suitable for flexible networking needs in the renovation of old production lines where there are no pre-buried cables, rapid deployment is required, and deployment costs are sensitive.

[0102] It should be understood that the sequence number of each step in the above embodiments does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.

[0103] In one embodiment, a networking device for a wireless network is provided, which corresponds one-to-one with the networking methods for the wireless networks described in the above embodiments. For example... Figure 12 As shown, the networking device for this wireless network includes a channel scanning module 101, a channel filtering module 102, a hierarchy determination module 103, and a node access module 104. Detailed descriptions of each functional module are as follows: The channel scanning module 101 is used to perform channel scanning on multiple physical channels within the operating frequency band based on the power-on status of the node to be connected to the network, and to obtain the channel activity information of each physical channel.

[0104] The channel filtering module 102 is used to filter out candidate channels whose corresponding channel activity information meets the preset activity conditions from each physical channel based on the channel activity information, and obtain a candidate channel set.

[0105] The hierarchy determination module 103 is used to collect the current network broadcast frame from the candidate channels included in the candidate channel set, determine the network topology hierarchy of the parent node of the node to be joined based on the current network broadcast frame, and determine the current topology hierarchy of the node to be joined based on the network topology hierarchy.

[0106] The node joining module 104 is used to determine the backoff priority coefficient of the node to be joined according to the current topology level, calculate the backoff time of the node to be joined according to the current topology level and the backoff priority coefficient, and wait until the backoff time expires before adding the node to the preset wireless network; the backoff priority coefficient is positively correlated with the current topology level.

[0107] Specific limitations regarding the networking device for wireless networks can be found in the limitations on networking methods described above, and will not be repeated here. Each module in the aforementioned wireless network networking device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in the computer device in hardware form, or stored in the memory of the computer device in software form, so that the processor can call and execute the corresponding operations of each module.

[0108] In one embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as follows: Figure 13 As shown, the computer device includes a processor, memory, network interface, and database connected via a system bus. The processor provides computing and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and database. The internal memory provides an environment for the operation of the operating system and computer programs stored in the non-volatile storage media. The network interface is used for communication with external terminals via a network connection. When the computer program is executed by the processor, it implements a wireless network networking method.

[0109] In one embodiment, a computer device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the wireless network networking method described in the above embodiment, for example... Figure 1 As shown in S1-S4, or Figures 2 to 5 As shown, to avoid repetition, it will not be described again here. Alternatively, the processor executes a computer program to implement the functions of each module / unit in this embodiment of the wireless network networking device, for example... Figure 12 The functions of the channel scanning module 101, channel filtering module 102, hierarchy determination module 103, and node network entry module 104 shown are not described again here to avoid repetition.

[0110] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When executed by a processor, the computer program implements the networking method of the wireless network described in the above embodiment, for example... Figure 1 As shown in S1-S4, or as Figures 2 to 5 As shown, to avoid repetition, it will not be described again here. Alternatively, when the computer program is executed by the processor, it implements the functions of each module / unit in this embodiment of the wireless network networking device, for example... Figure 12 The functions of the channel scanning module 101, channel filtering module 102, hierarchy determination module 103, and node network access module 104 shown are not described again here to avoid repetition. The computer-readable storage medium can be non-volatile or volatile.

[0111] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. This computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments of the above methods. Any references to memory, storage, databases, or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), RAMbus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0112] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the above-described division of functional units and modules is used as an example. In practical applications, the above functions can be assigned to different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above.

[0113] It should be noted that any AI models, software tools, or components not belonging to this company appearing in the embodiments of this application are merely illustrative examples and do not represent actual use. All user personal information involved in the embodiments of this application has been authorized (with the knowledge and consent) by the relevant parties or has been fully authorized by all parties, and the executing entity may obtain it through various legal and compliant means. The collection, storage, use, processing, transmission, provision, and disclosure of the information, data, and signals involved all comply with relevant laws and regulations and do not violate public order and good morals.

[0114] The above-described embodiments are only used to illustrate the technical solutions of the present invention, and are not intended to limit it. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention, and should all be included within the protection scope of the present invention.

Claims

1. A method for setting up a wireless network, characterized in that, Including the following steps: Based on the power-on status of the node to be connected to the network, channel scanning is performed on multiple physical channels within the operating frequency band to obtain the channel activity information of each physical channel. Based on the channel activity information of each channel, candidate channels whose corresponding channel activity information meets the preset activity conditions are selected from each physical channel to obtain a candidate channel set. Collect current network broadcast frames from the candidate channels included in the candidate channel set, determine the network topology level of the parent node of the node to be joined based on the current network broadcast frames, and determine the current topology level of the node to be joined based on the network topology level. Based on the current topology level, determine the backoff priority coefficient of the node to be added to the network, and calculate the backoff duration of the node to be added to the network based on the current topology level and the backoff priority coefficient. Wait until the backoff duration expires, and then add the node to the network to the preset wireless network. The backoff priority coefficient is positively correlated with the current topology level.

2. The networking method according to claim 1, characterized in that, The step of determining the backoff priority coefficient of the node to be added to the network based on the current topology level, and calculating the backoff duration of the node to be added to the network based on the current topology level and the backoff priority coefficient, includes: Logarithmic decay is applied to the current topology level to obtain the backoff priority coefficient; Based on the current topology level and the backoff priority coefficient, a backoff assessment is performed on the node to be added to the network to obtain the backoff duration.

3. The networking method according to claim 1, characterized in that, The channel activity information includes the channel energy intensity of each physical channel and the historical hit count of historical network broadcast frames on each physical channel; the step of performing channel scanning on multiple physical channels within the operating frequency band to obtain the channel activity information of each physical channel includes: Perform channel scanning on each of the physical channels to obtain the corresponding channel energy intensity and the historical hit count.

4. The networking method according to claim 3, characterized in that, The preset activity condition is that the channel dwell probability of the corresponding physical channel exceeds a preset probability threshold; the step of selecting candidate channels from each of the physical channels whose corresponding channel activity information meets the preset activity condition based on the channel activity information, to obtain a candidate channel set, includes: Based on the channel energy intensity and the historical hit count of each channel, calculate the channel activity score of each physical channel to obtain the channel activity matrix; The channel activity matrix is ​​probability normalized to obtain the channel dwell probability of each physical channel; Based on the channel dwell probability of each channel, candidate channels whose corresponding channel dwell probability exceeds the preset probability threshold are selected from each physical channel to obtain the candidate channel set.

5. The networking method according to claim 1, characterized in that, The nodes to be connected to the network include nodes that are new to the network but have not yet connected to the wireless network; The step of adding the node to be added to the preset wireless network includes: Receive the network access request frame sent by the node to be joined; Identify whether the network access request frame carries a local session token; If the network access request frame does not carry a local session token, then the node to be accessed is determined to be a first-time network access node, and the identity legitimacy of the first-time network access node is verified. When the first-time network-entry node passes the identity legitimacy verification, a local session token is issued to the first-time network-entry node through its parent node, enabling the first-time network-entry node to join the wireless network.

6. The networking method according to claim 5, characterized in that, The nodes to be connected to the network also include nodes that have already connected to the wireless network but are temporarily offline and are reconnecting to the network. After identifying whether the network access request frame carries a local session token, the method further includes: If the network access request frame carries the local session token, then the node to be accessed is determined to be a reconnection node, and the validity of the local session token is verified by the parent node of the reconnection node. When the parent node verifies that the local session token is valid, it confirms that the session of the reconnecting node in the wireless network has been restored.

7. The networking method according to claim 4, characterized in that, After adding the node to be connected to the network to the preset wireless network, the process further includes: Obtain the channel energy measurement values ​​of each of the physical channels; Based on the channel energy measurement value, the channel activity matrix is ​​exponentially updated to obtain the updated channel activity matrix. The updated channel activity matrix is ​​used to obtain the candidate channel set for subsequent nodes to join the network.

8. A networking device for a wireless network, characterized in that, include: The channel scanning module is used to perform channel scanning on multiple physical channels within the operating frequency band based on the power-on status of the node to be connected to the network, and to obtain the channel activity information of each physical channel. The channel filtering module is used to filter out candidate channels whose corresponding channel activity information meets the preset activity conditions from each of the physical channels based on the channel activity information, and obtain a candidate channel set. The hierarchy determination module is used to collect current network broadcast frames in the candidate channels included in the candidate channel set, determine the network topology hierarchy of the parent node of the node to be joined based on the current network broadcast frames, and determine the current topology hierarchy of the node to be joined based on the network topology hierarchy. The node joining module is used to determine the backoff priority coefficient of the node to be joined according to the current topology level, calculate the backoff duration of the node to be joined according to the current topology level and the backoff priority coefficient, and wait until the backoff duration expires before adding the node to the preset wireless network. The backoff priority coefficient is positively correlated with the current topology level.

9. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the networking method as described in any one of claims 1 to 7.

10. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by the processor, it implements the networking method as described in any one of claims 1 to 7.

Images