Method and system for automatically searching nodes of wireless ad hoc network

Abstract

The invention provides a wireless ad hoc network node automatic search method and system, and relates to the technical field of wireless ad hoc networks, and the method comprises the steps: carrying out the coding and recombination of a node broadcast frame, and generating a coding sequence group corresponding to a locatable node which is automatically searched; generating a frequency hopping receiving channel corresponding to a directional receiving mode in automatic search according to the node receiving and transmitting mode and the time slot receiving and transmitting state corresponding to each coding bit in the coding sequence group; carrying out collaborative screening on the neighbor node identifiers to obtain a collaborative response boundary of a networking request in the ad hoc network, and then carrying out communication node deployment on the collaborative response boundary to obtain networking link resources during automatic searching of wireless ad hoc network nodes; and the networking routing table of the current network state is automatically updated and communication is established by the frequency hopping receiving channel and the networking link resources. According to the method and the device, when wireless channel resources are limited, routing self-adaptive updating can be carried out on automatic searching of the wireless ad hoc network nodes, so that the searching precision of the ad hoc network nodes is improved.

Description

Technical Field

[0001] This application relates to the technical field of wireless ad hoc networks. More specifically, this application relates to a method and system for automatically searching wireless ad hoc network nodes. Background Art

[0002] A wireless ad hoc network (Wireless Ad Hoc Network) is a dynamic distributed network structure in which multiple wireless nodes automatically discover, connect, and form a network through their own communication capabilities without the support of a fixed infrastructure. This network does not rely on a preset central control node. All nodes can act as either data senders or receivers, or as routing forwarding nodes to participate in the construction of data transmission paths. Wireless ad hoc networks have the characteristics of flexible deployment, autonomous networking, strong anti-destruction ability, and high dynamic expansion ability, and are suitable for various scenarios such as military communication, disaster emergency, networking in remote areas, and the sensing layer of the Internet of Things.

[0003] However, in the existing automatic search of wireless ad hoc network nodes, there are generally problems such as low node discovery efficiency, unstable communication link construction, and lagging routing information update. As a result, it is difficult for the network to achieve fast and stable networking deployment in the face of a highly dynamic environment, leading to increased access delay between nodes, reduced utilization of frequency hopping channels, and a significant decline in overall communication performance, thus restricting the reliability of wireless ad hoc networks. Therefore, how to perform routing adaptive update for the automatic search of wireless ad hoc network nodes when wireless channel resources are limited to improve the accuracy of self-organizing network node search is an issue faced by the industry. Summary of the Invention

[0004] This application provides a method and system for automatically searching wireless ad hoc network nodes, which can perform routing adaptive update for the automatic search of wireless ad hoc network nodes when wireless channel resources are limited to improve the accuracy of self-organizing network node search.

[0005] In a first aspect, this application provides a method for automatically searching wireless ad hoc network nodes. The automatic search method includes the following steps: During the initialization of the automatic search of wireless ad hoc network nodes, periodically listen to the node broadcast frames of the whole network center node, encode and reorganize the node broadcast frames to generate a coding sequence group corresponding to the locatable nodes automatically searched; Perform dynamic scanning on the coding sequence group to obtain the node transceiver modes of the locatable nodes in the wireless ad hoc network, and generate a frequency hopping receiving channel corresponding to the directional receiving mode in the automatic search according to the node transceiver mode and the time slot transceiver status corresponding to each coding bit in the coding sequence group; Determine the neighbor node identifiers of the located nodes during the automatic search of the wireless ad-hoc network nodes, perform collaborative screening on the neighbor node identifiers to obtain the collaborative response boundary of the networking request in the ad-hoc network, and then deploy communication nodes for the collaborative response boundary to obtain the networking link resources during the automatic search of the wireless ad-hoc network nodes; Automatically update the networking routing table of the current network status and establish communication based on the frequency-hopping receiving channel and the networking link resources.

[0006] In this embodiment, the node broadcast frame refers to a control frame that the node periodically sends to publish its own identifier, status, and channel information.

[0007] In this embodiment, the specific steps of encoding and reorganizing the node broadcast frame to generate a coding sequence group corresponding to the locatable nodes automatically searched include: Extract a coding parameter set based on the communication protocol characteristics of the node broadcast frame; Establish frame reorganization rule information with rule matching according to the coding parameter set; Perform serialized coding reconstruction on the node broadcast frame through the frame reorganization rule information to generate a coding sequence group corresponding to the locatable nodes automatically searched.

[0008] In this embodiment, the specific steps of dynamically scanning the coding sequence group to obtain the node transceiver mode of the locatable nodes in the wireless ad-hoc network nodes include: During the dynamic scanning process of the coding sequence group, construct a dynamic scanning strategy based on spatio-temporal identifiers; Dynamically capture the transceiver characteristics of the coding sequence group through the dynamic scanning strategy to obtain dynamic communication characteristics; Establish a pattern primitive library for the transceiver behaviors of the locatable nodes in the wireless ad-hoc network nodes based on the dynamic communication characteristics; Associate the dynamic transceiver sequences of the locatable nodes through the pattern primitive library to obtain the node transceiver mode of the locatable nodes in the wireless ad-hoc network nodes.

[0009] In this embodiment, the specific steps of generating a frequency-hopping receiving channel corresponding to the directional receiving mode during the automatic search according to the node transceiver mode and the time-slot transceiver status corresponding to each coding bit in the coding sequence group include: Extract the receiving channel parameters corresponding to the directional receiving mode according to the communication link characteristics in the node transceiver mode; Perform dynamic conflict detection on the receiving channel parameters based on the time-slot transceiver status corresponding to each coding bit in the coding sequence group to obtain the channel interaction information corresponding to the directional receiving mode; Determine the frequency-hopping receiving channel corresponding to the directional receiving mode during the automatic search according to the channel interaction information.

[0010] In this embodiment, the frequency-hopping receiving channel refers to the frequency band dynamically selected by a node for receiving signals in the frequency-hopping communication mode.

[0011] In this embodiment, determining the neighbor node identifiers of the located nodes during the automatic search of wireless ad-hoc network nodes specifically includes: Obtaining the communication link quality indicators of the located nodes during the automatic search of wireless ad-hoc network nodes; Filtering the candidate set of neighbor node identifiers of the located nodes through the communication link quality indicators to obtain steady-state link information; Determining the neighbor node identifiers of the located nodes during the automatic search of wireless ad-hoc network nodes according to the steady-state link information.

[0012] In this embodiment, deploying communication nodes on the collaborative response boundary to obtain the networking link resources during the automatic search of wireless ad-hoc network nodes specifically includes: Determining the node deployment strategy during the automatic search of wireless ad-hoc network nodes based on the collaborative response boundary; Generating a candidate node deployment plan set for the ad-hoc network during load balancing according to the node deployment strategy; Performing path connectivity verification on the candidate node deployment plan set to obtain the networking link resources during the automatic search of wireless ad-hoc network nodes.

[0013] In this embodiment, automatically updating the networking routing table of the current network state and establishing communication by the frequency-hopping receiving channel and the networking link resources specifically includes: Extracting the dynamic routing parameters of the current network state based on the spatio-temporal mapping relationship corresponding to the frequency-hopping receiving channel and the channel allocation table corresponding to the networking link resources; Determining the candidate routing paths in the current network state through the dynamic routing parameters; Performing end-to-end connectivity testing and load pressure verification on the candidate routing paths through the distributed routing verification protocol, automatically updating the networking routing table according to the verification results, and establishing communication links between nodes based on the networking routing table.

[0014] In a second aspect, the present application provides a wireless ad-hoc network node automatic search system for executing a wireless ad-hoc network node automatic search method. The automatic search system includes: A search monitoring module, configured to periodically monitor the node broadcast frames of the whole network center node during the initialization of the automatic search of wireless ad-hoc network nodes, encode and reorganize the node broadcast frames, and generate a coding sequence group corresponding to the locatable nodes automatically searched. A dynamic scanning module, which is used to dynamically scan the encoding sequence group to obtain the node transceiver mode of locatable nodes in the wireless ad hoc network nodes, and generate a frequency hopping receiving channel corresponding to the directional receiving mode in the automatic search according to the node transceiver mode and the time slot transceiver status corresponding to each encoding bit in the encoding sequence group; A link screening module, which is used to determine the neighbor node identifiers of the located nodes in the automatic search of the wireless ad hoc network nodes, perform collaborative screening on the neighbor node identifiers to obtain the collaborative response boundary of the networking request in the ad hoc network, and then deploy communication nodes on the collaborative response boundary to obtain the networking link resources during the automatic search of the wireless ad hoc network nodes; A network communication module, which is used to automatically update the networking routing table of the current network state by the frequency hopping receiving channel and the networking link resources and establish communication.

[0015] The technical solution provided by the embodiments disclosed in this application has the following beneficial effects: During the initialization of the automatic search of the wireless ad hoc network nodes, periodically monitor the node broadcast frames of the whole network center node, perform encoding recombination on the node broadcast frames to generate an encoding sequence group corresponding to the locatable nodes found automatically; dynamically scan the encoding sequence group to obtain the node transceiver mode of locatable nodes in the wireless ad hoc network nodes, and generate a frequency hopping receiving channel corresponding to the directional receiving mode in the automatic search according to the node transceiver mode and the time slot transceiver status corresponding to each encoding bit in the encoding sequence group; determine the neighbor node identifiers of the located nodes in the automatic search of the wireless ad hoc network nodes, perform collaborative screening on the neighbor node identifiers to obtain the collaborative response boundary of the networking request in the ad hoc network, and then deploy communication nodes on the collaborative response boundary to obtain the networking link resources during the automatic search of the wireless ad hoc network nodes; automatically update the networking routing table of the current network state by the frequency hopping receiving channel and the networking link resources and establish communication.

[0016] It can be seen that in this application, the networking efficiency and communication reliability of the wireless ad hoc network can be improved; among them, through the protocol feature extraction and frame recombination of the central node broadcast frame, the structured identification and coding modeling of the communication nodes in the whole network are realized, the coverage range and search accuracy of the node automatic search are improved, and an efficient basic identification mechanism is provided for subsequent directional reception and frequency hopping resource allocation; by dynamically scanning and behavior modeling to identify the transceiver timing characteristics of each node, and combining the time slot state of the coding bits to generate a frequency hopping receiving channel, the optimal allocation of spectrum resources and directional reception scheduling at the receiving end are realized, thereby improving the adaptability and anti-interference ability to the dynamic communication environment during the networking process; through the steady-state evaluation of the communication link quality of the located nodes, the neighbor nodes are accurately identified and a collaborative screening mechanism is established, thereby constructing a collaborative response boundary with high coverage accuracy and strong response consistency; by integrating the spatio-temporal characteristics of the frequency hopping receiving channel and the path connectivity of the link resources, the networking routing table is updated in real time and the communication path is self-organized, improving the routing robustness of the network in the dynamic environment and the stability of data transmission, accelerating the networking completion speed and optimizing the overall network performance.

[0017] In summary, the technical solution adopted in this application can adaptively update the routing of the automatic search of wireless ad hoc network nodes when the wireless channel resources are limited, so as to improve the accuracy of the search of ad hoc network nodes. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the drawings in the following description are only the embodiments of the present application. For those of ordinary skill in the art, without creative efforts, other drawings can also be obtained according to these drawings.

[0019] Figure 1 It is an exemplary flowchart of a method for automatically searching wireless ad hoc network nodes provided by the present application; Figure 2 It is a schematic flowchart for determining the transceiver mode of a node provided by the present application; Figure 3 It is a schematic flowchart for determining the collaborative response boundary provided by the present application; Figure 4 It is a module structure diagram of a system for automatically searching wireless ad hoc network nodes provided by the present application. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0020] The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present application without creative efforts shall fall within the protection scope of the present application.

[0021] The embodiments of the present application provide a method and system for automatically searching wireless ad-hoc network nodes. The core is that when initializing the automatic search of wireless ad-hoc network nodes, periodically listen to the node broadcast frames of the whole network center node, encode and reorganize the node broadcast frames to generate a coding sequence group corresponding to the locatable nodes automatically searched; dynamically scan the coding sequence group to obtain the node transceiver modes of the locatable nodes in the wireless ad-hoc network, and generate a frequency-hopping receiving channel corresponding to the directional receiving mode during automatic search according to the node transceiver mode and the time-slot transceiver status corresponding to each coding bit in the coding sequence group; determine the neighbor node identifiers of the located nodes during the automatic search of wireless ad-hoc network nodes, perform collaborative screening on the neighbor node identifiers to obtain the collaborative response boundary of the networking request in the self-organizing network, and then deploy communication nodes for the collaborative response boundary to obtain the networking link resources during the automatic search of wireless ad-hoc network nodes; automatically update the networking routing table of the current network state by the frequency-hopping receiving channel and the networking link resources and establish communication.

[0022] Embodiment 1. To better understand the above technical solutions, the above technical solutions will be described in detail below with reference to the accompanying drawings of the specification and specific implementation manners. Refer to Figure 1 As shown, this figure is an exemplary flowchart of a method for automatically searching wireless ad-hoc network nodes according to an embodiment of the present application. The automatic search method includes the following steps: In step S1, when initializing the automatic search of wireless ad-hoc network nodes, periodically listen to the node broadcast frames of the whole network center node, encode and reorganize the node broadcast frames to generate a coding sequence group corresponding to the locatable nodes automatically searched.

[0023] In specific implementation, when the wireless ad-hoc network node automatically searches for initialization, the periodic listening for the node broadcast frames of the whole network central node can be implemented in the following way, that is: during the process of the wireless ad-hoc network node automatically searching for initialization, the node activates the radio frequency receiving circuit and polls all available channels in each preset listening period (for example, every 50 milliseconds) by setting the timing receiving mechanism of the local wireless module, and passively captures the broadcast frames periodically sent by the central node in the network. In specific implementation, the node first loads the full-channel scanning configuration and controls the listening channel switching through the radio frequency synthesizer; in each listening time slot, it analyzes the content of the captured broadcast frame, including parameters such as the central node identifier, the current timestamp, the channel number, and its broadcast power. The parsed frame data is converted into an internally recognizable data field by the frame check and content extraction module and cached in the node's broadcast information buffer, and the node broadcast frame is obtained by reading the broadcast information buffer.

[0024] It should be noted that in this application, the whole network central node refers to the master node that plays the role of network connection management and broadcast synchronization in the current wireless ad-hoc network; the node broadcast frame refers to the control frame that the node periodically sends to publish its own identifier, status, and channel information.

[0025] In this embodiment, the encoding and recombination of the node broadcast frame to generate the encoding sequence group corresponding to the automatically searched locatable node can be implemented by the following steps: Extract the encoding parameter set based on the communication protocol characteristics of the node broadcast frame; Establish the frame recombination rule information with rule matching according to the encoding parameter set; Perform serialized encoding reconstruction on the node broadcast frame through the frame recombination rule information to generate the encoding sequence group corresponding to the automatically searched locatable node.

[0026] In specific implementation, first, after a wireless ad-hoc network node receives a broadcast frame sent by a central node or other activated nodes, based on the current communication protocol stack, where the current communication protocol stack can be IEEE 802.11s or a custom lightweight MAC protocol, key communication parameters in the node broadcast frame are extracted to form a set of coding parameters. The set of coding parameters includes, but is not limited to: node identifier, broadcast timestamp, transmit channel number, signal strength indication, frequency hopping flag, and synchronization flag bit, etc. Subsequently, a preset information library of frame recombination rules is called. The rule information in the information library of frame recombination rules is established based on the protocol field position, field length, and logical relationship between fields, and the field extraction order and coding order are defined by means of template matching. For example, a rule can be set to convert the node identifier into 16-bit binary, the transmit channel number into 6 bits, and the signal strength indication to be normalized to 8-bit bits, and they are connected in a fixed order to form a standard-length coded frame. Finally, each broadcast frame is serially encoded and reconstructed according to the rule information in the information library of frame recombination rules, and all the reconstructed coded frames are stored in a temporary coding buffer area and assembled into a coding sequence group in the order of reception.

[0027] It should be noted that in this application, a locatable node refers to a network node whose channel and time slot behavior characteristics can be accurately detected and identified by the current node; the communication protocol characteristics of the node broadcast frame represent a set of information-structured fields used to describe the node identity, timing behavior, and channel occupancy status; the set of coding parameters is a set of fields characterizing the node state and communication behavior; the frame recombination rule information refers to the data field coding format and field combination rules defined based on the communication protocol; the coding sequence group refers to a data set formed by arranging all the recombined coded frames in chronological order within a certain listening period.

[0028] In step S2, the coding sequence group is dynamically scanned to obtain the node transceiver mode of the locatable nodes in the wireless ad-hoc network node, and a frequency hopping receiving channel corresponding to the directional receiving mode in the automatic search is generated according to the node transceiver mode and the time slot transceiver status corresponding to each coding bit in the coding sequence group.

[0029] Preferably, in this embodiment, the coding sequence group is dynamically scanned to obtain the node transceiver mode of the locatable nodes in the wireless ad-hoc network node, referring to Figure 2 As shown, this figure is a schematic flowchart of determining the node transceiver mode in some embodiments of this application. The node transceiver mode can be determined in the following steps in this embodiment: In step S21, during the dynamic scanning process of the coding sequence group, a dynamic scanning strategy is constructed based on the spatio-temporal identifier; In step S22, the dynamic communication characteristics are obtained by dynamically capturing the transceiver characteristics of the coding sequence group through the dynamic scanning strategy; In step S23, a pattern primitive library of the transceiver behaviors of locatable nodes in the wireless ad hoc network is established based on the dynamic communication characteristics; In step S24, the dynamic transceiver sequences of the locatable nodes are associated through the pattern primitive library to obtain the node transceiver patterns of the locatable nodes in the wireless ad hoc network.

[0030] Specifically, first, the timestamp field and the corresponding node identifier included in each piece of encoded data are extracted from the encoded sequence group to construct a time-node mapping matrix. Combining the broadcast frequency of the node and the change of the signal strength over time, the appearance frequency and the channel activity of each locatable node in a specific time period are calculated, so as to extract the dynamic spatio-temporal identifier. On this basis, a dynamic scanning strategy is set. The dynamic scanning strategy includes two core dimensions: the length of the time sliding window (for example, 500 ms) and the threshold of the node channel coverage frequency (for example, more than 3 times is judged as active), which are used to limit the scanning granularity and rhythm. The dynamic scanning strategy controls the scanning process to continuously slide and analyze in the encoded sequence group in the way of time advancement to capture the behavior fluctuations of the nodes in the time and frequency dimensions. Then, during the execution of the dynamic scanning strategy, the behavior analysis is performed on the encoded items of the same node in each time window, and its transmission state in this window is extracted, where the transmission state includes: whether there is a channel activity mark, the reception state, and the reception state includes: whether there is a synchronous response mark and the channel number. All the extraction results are summarized with time as the axis to form a record of the dynamic communication characteristics of the node. The record of the dynamic communication characteristics includes: periodic transmission mode, frequency hopping trend, average transceiver ratio, continuous idle segment length, etc. Through the clustering analysis algorithm, the communication characteristics are further classified and sorted, and the classified and sorted communication characteristics are used as the dynamic communication characteristics. Then, the dynamic communication characteristics are mapped to a standard set of behavior labels, and the set of behavior labels can be labels such as "periodic transmission - high-frequency frequency hopping", "stable reception - single channel", "intermittent broadcast - weak signal synchronization", etc. Each label combination defines a "pattern primitive". A pattern primitive library is established through the pattern primitives, which is used as a standard classifier for the behavior characteristics of the locatable nodes, and is used for fitting analysis with the historical communication behaviors of each node to identify the behavior pattern that best matches it in different time periods. Finally, the pattern primitive library is used as a template to perform matching analysis on all the transceiver behavior sequences of the locatable nodes in the encoded sequence group. The dynamic time warping method is used to align the unequal-length behavior segments on the time axis, and the complete transceiver pattern description of the node is generated accordingly. The transceiver pattern output through the complete transceiver pattern description is represented in a structured table, recording the changes in the transceiver state, the channel hopping rule and the activity probability of the node in each time period.

[0031] It should be noted that in this application, the spatio-temporal identifier represents the activity characteristic marking information of the node communication behavior in the time and channel dimensions; the dynamic scanning strategy represents the execution logic of the coding sequence scanning formulated according to the variation laws of time, space, and channel behaviors; the dynamic communication characteristics represent the statistical characteristics that change with time, such as the transceiver state, channel usage behavior, and communication rhythm, extracted from the node coding sequence; the pattern primitive library represents a preset set of behavior templates for standardizing the description of node communication behavior characteristics; the dynamic transceiver sequence represents the sequence of transmission and reception states recorded by the node according to the communication behavior changes over a period of time; the node transceiver mode represents the sequence of transceiver behavior modes presented by the locatable node in the time and channel dimensions.

[0032] In this embodiment, the hopping receiving channel corresponding to the directional receiving mode in the automatic search can be generated according to the node transceiver mode and the time slot transceiver states corresponding to each coding bit in the coding sequence group by the following steps: Extract the receiving channel parameters corresponding to the directional receiving mode according to the communication link characteristics in the node transceiver mode; Based on the time slot transceiver states corresponding to each coding bit in the coding sequence group, perform dynamic conflict detection on the receiving channel parameters to obtain the channel interaction information corresponding to the directional receiving mode; Determine the hopping receiving channel corresponding to the directional receiving mode in the automatic search according to the channel interaction information.

[0033] In specific implementation, first, according to the communication link characteristics in the node transceiver mode, where the communication link characteristics can be channel frequency, time slot allocation, signal strength, hopping frequency pattern, etc., combined with the specific parameters of the node during communication in the network, the receiving channel parameters of each locatable node are analyzed. The receiving channel parameters include the receiving frequency range, signal strength threshold, and effective time slot range. The extraction process of the receiving channel parameters is based on the historical communication data of the nodes. Then, after the receiving channel parameters are extracted, dynamic collision detection is performed according to the time slot transceiver status information corresponding to each coding bit in the coding sequence group. This dynamic collision detection process involves determining whether there are conflicts in channel resources by scanning the transceiver activities within each time slot. For example, adjacent channel frequencies overlap, signal interference, etc. When a collision is detected, the system will process it according to a preset collision resolution mechanism, where the collision resolution mechanism includes adjusting the transmission power and selecting a hopping frequency strategy. After collision detection, channel interaction information is generated, which includes the transceiver interference situation between different nodes within each time slot, time slot allocation optimization suggestions, and channel frequency overlap degree, etc. Finally, according to the channel interaction information, further analyze which channels have the optimal receiving performance in the current dynamic environment, that is, the minimum interference and the most stable signal strength. By matching the receiving channel parameters with the channel interaction information, the system selects a suitable hopping receiving channel for each directional receiving mode. The selection of the hopping receiving channel not only considers the collision status of the current time slot but also the overall communication load and spectrum utilization efficiency of all network nodes. The determination process of the hopping receiving channel can be carried out through a genetic algorithm or a simulated annealing algorithm to ensure that the selected channel has the minimum collision probability and the maximum information transmission efficiency. Finally, each node automatically generates an adapted hopping receiving channel according to its own directional receiving mode and communication requirements.

[0034] It should be noted that in this application, the communication link characteristics refer to the parameters of the communication quality and behavior between nodes, including information such as channel frequency, signal strength, time slot allocation, etc.; the receiving channel parameters represent the parameters related to the signal receiving quality of the node, including frequency range, signal strength, effective time slot range, etc.; the time slot transceiver status refers to the sending and receiving activity status of the node within a specific time slot; the directional receiving mode refers to the communication mode in which the node selects to receive signals in a specific direction according to its communication requirements and environmental conditions; the channel interaction information refers to the channel interference and resource allocation situation caused by analyzing the time slot transceiver status between different nodes during the dynamic scanning process; the hopping receiving channel refers to the frequency band dynamically selected by the node for receiving signals in the hopping communication mode.

[0035] In step S3, determine the neighbor node identifiers of the located nodes during the automatic search of the wireless ad-hoc network nodes, perform collaborative screening on the neighbor node identifiers to obtain the collaborative response boundary of the networking requests in the ad-hoc network, and then deploy communication nodes for the collaborative response boundary to obtain the networking link resources during the automatic search of the wireless ad-hoc network nodes.

[0036] In this embodiment, determining the neighbor node identifiers of the located nodes during the automatic search of the wireless ad-hoc network nodes can be implemented by the following steps: Obtain the communication link quality metrics of the located nodes during the automatic search of the wireless ad-hoc network nodes; Screen the candidate set of neighbor node identifiers of the located nodes through the communication link quality metrics to obtain the steady-state link information; Determine the neighbor node identifiers of the located nodes during the automatic search of the wireless ad-hoc network nodes according to the steady-state link information.

[0037] Specifically, first, during the automatic search process, obtain the communication link quality metrics of the located nodes. The link quality metrics include but are not limited to signal strength, packet loss rate, latency, jitter, and transmission rate, etc. These metrics can be obtained in real time through the communication exchange between the node and the located nodes, where the communication exchange includes: sending probe frames and receiving feedback frames. The system will update these metrics regularly and use the updated metrics as the communication link quality metrics. In other embodiments, other methods can also be used to determine the communication link quality metrics, which are not limited here. Then, screen the candidate set of neighbor node identifiers of the located nodes. The candidate set of neighbor node identifiers includes all nodes that have ever established contact with the located nodes, and the identifiers of these nodes are usually stored in the neighbor table of the node. The screening process is based on the threshold of the link quality metrics. For example, set a minimum signal strength or packet loss rate threshold, and only when the link quality of the neighbor node is higher than this threshold will it be included in the candidate set of neighbor node identifiers. The system evaluates which neighbor nodes are the most stable currently through the dynamic change of the link quality metrics and performs screening to eliminate those nodes with unstable signals and poor link quality, thereby obtaining the steady-state link information. The acquisition of the node communication link quality can be completed through control channel measurement or the transmission quality feedback of data frames. Finally, after screening out the stable candidate set of neighbor nodes, the system will make a final judgment in combination with the stable link information to confirm the identifiers of the neighbor nodes that can be regarded as the effective neighbors of the currently located nodes. This process not only depends on the link quality metrics but may also combine other information, such as position estimation, synchronization status, etc., to further verify the reachability and communication effectiveness of the neighbors, and use the result of the judgment selection as the identifier of the neighbor node, where the steady-state link information includes the continuous communication time between nodes, the fluctuation range of signal strength, and the number of retry times, etc.

[0038] It should be noted that in this application, the communication link quality index refers to multiple parameters for evaluating the communication quality between nodes, such as signal strength, packet loss rate, latency, etc.; the neighbor node identifier candidate set refers to a list of all candidate nodes that have communicated with the located node in the neighbor table of the ad-hoc network node; the steady-state link information refers to the information where the communication link quality between nodes is stable and has small fluctuations during a specific time period; the located node refers to a network node in the wireless ad-hoc network that has successfully identified and determined its communication location and link quality through automatic search; the neighbor node identifier refers to the identifier information used to uniquely identify other nodes that communicate with the current node in the wireless ad-hoc network.

[0039] Preferably, in this embodiment, the neighbor node identifiers are collaboratively screened to obtain the collaborative response boundary of the networking request in the ad-hoc network, as shown in Figure 3 The figure is a schematic flowchart of determining the collaborative response boundary in some embodiments of this application. The collaborative response boundary in this embodiment can be implemented by the following steps: In step S31, the link collaborative attributes corresponding to the networking request in the ad-hoc network are determined according to the neighbor node identifiers; In step S32, the response evaluation index of the networking request in the ad-hoc network is determined through the link collaborative attributes; In step S33, the response evaluation index is jointly verified to obtain the response coverage area of the networking request in the ad-hoc network; In step S34, the collaborative response boundary of the networking request in the ad-hoc network is determined through the response coverage area.

[0040] In specific implementation, first, all neighbor nodes connected to the current node are identified through neighbor node identifiers. Based on the link quality metrics of all the identified neighbor nodes, which include signal strength, latency, jitter, etc., the link bandwidth, link latency, signal coverage range, signal strength, and reliability of each link are extracted, and the extracted link bandwidth, link latency, signal coverage range, signal strength, and reliability are used as link collaboration attributes. The link collaboration attributes of each neighbor node will affect the collaboration effect of the entire network. For example, if a neighbor node has a relatively high signal strength and stable communication, the link of this node may have a relatively high collaboration ability. Next, the quality of each link is evaluated as the link quality index based on factors such as link stability, bandwidth, and latency; the response speed of the node to the network formation request is evaluated as the response speed based on the link latency and response time; the reliability of the network is evaluated through parameters such as the packet loss rate and error rate of the link; the link quality index, response speed, and reliability evaluation results are used as the response evaluation metrics for the network formation request in the ad-hoc network. Then, based on the response evaluation metrics of multiple neighbor nodes, all the response evaluation metrics are jointly verified. In this process, methods such as weighted average and clustering analysis are used to comprehensively analyze the multiple response evaluation metrics to ensure that the evaluation results are more comprehensive and accurate. Through this method, the system can accurately evaluate the neighbor nodes that can effectively support the processing of the network formation request in the network topology, and use the evaluation results as the response coverage area, which represents the set of all neighbor nodes that can satisfy the network formation request within a specific area. The response coverage area includes not only the nodes with relatively fast and stable response speeds but also the nodes with good performance in collaborative cooperation. Finally, based on the response coverage area, the system determines the collaborative response boundary. The collaborative response boundary is the range drawn based on the collaborative response capabilities of all neighbor nodes, marking the area where effective network formation can be achieved in the ad-hoc network. The determination of the collaborative response boundary ensures that within this area, all nodes can efficiently respond to the network formation request and will not be interfered by low-quality links.

[0041] It should be noted that in this application, a network formation request refers to a request initiated by a node in a wireless ad-hoc network, aiming to establish or join a network and seek communication and collaboration with other nodes; a link collaboration attribute refers to an attribute that describes the collaboration ability of the communication links between nodes in the network; a response evaluation metric refers to a metric for evaluating the response ability of each neighbor node to the network formation request; a response coverage area refers to the area covered by neighbor nodes that can respond to the request and meet the performance requirements in the processing of the network formation request; a collaborative response boundary refers to the range of nodes that can effectively collaborate and respond to the network formation request.

[0042] In this embodiment, the deployment of communication nodes for the collaborative response boundary to obtain the network formation link resources during the automatic search of ad-hoc network nodes can be achieved by the following steps: Determine the node deployment strategy during the automatic search of wireless ad hoc network nodes based on the collaborative response boundary; Generate a set of candidate node deployment schemes for the ad hoc network during load balancing according to the node deployment strategy; Perform path connectivity verification on the set of candidate node deployment schemes to obtain the networking link resources during the automatic search of wireless ad hoc network nodes.

[0043] In specific implementation, first, based on the determined collaborative response boundary, a node deployment strategy for wireless ad-hoc network nodes is constructed. The collaborative response boundary defines the range of nodes in the network that can effectively respond to network formation requests, while the node deployment strategy refers to determining how to reasonably allocate nodes according to this boundary to meet the performance requirements of the network. Among them, the performance requirements of the network include: coverage range, transmission efficiency, load balancing, etc.; the node deployment strategy usually uses particle swarm optimization algorithm, genetic algorithm for calculation to ensure the best balance between the coverage range and performance requirements. Among them, the node deployment strategy needs to meet the following conditions: node distribution density, ensuring uniform node distribution within the network coverage area to reduce network blind spots and signal dead ends; resource requirements, allocating the positions of nodes according to network load and bandwidth requirements to ensure network stability; communication delay and bandwidth, optimizing the deployment of nodes according to the communication capabilities of nodes within the collaborative response boundary to reduce latency and improve bandwidth utilization. Then, according to the node deployment strategy, a set of candidate node deployment schemes is generated. Among them, the generation of the set of candidate node deployment schemes can be carried out through simulation tools for generating candidate schemes, which is not limited here. The set of candidate node deployment schemes contains multiple candidate schemes, aiming to achieve goals such as load balancing, communication efficiency, and network stability. Each candidate scheme describes the specific positions of nodes within the collaborative response boundary and takes into account the communication connectivity and resource requirements between nodes. The generation of the set of candidate node deployment schemes includes: load balancing requirements, ensuring that the load of each node is not too high or too low, avoiding some nodes becoming bottlenecks or overloaded; network topology optimization, selecting the optimal node positions according to the connectivity and link quality of nodes to maximize the overall performance of the network; power and signal coverage, optimizing the positions of nodes according to the propagation characteristics of wireless signals and transmission power limitations to ensure that the signal strength in the coverage area meets the communication requirements. Finally, path connectivity verification is performed on each candidate node deployment scheme in the set of candidate node deployment schemes. The purpose of path connectivity verification is to check whether the communication links between nodes in the network are smooth and stable and ensure that nodes can transmit data packets to each other; among them, path connectivity verification includes: node connectivity, checking whether there are direct communication links between different nodes or whether indirect connectivity can be established through relay nodes; link quality, analyzing quality indicators such as signal strength, delay, and bandwidth of each link to ensure compliance with communication requirements; network topology stability, verifying whether the network topology has sufficient redundancy to avoid single point of failure. Through path connectivity verification, node deployment schemes that meet the connection requirements are screened out, and finally effective network formation link resources are obtained. The network formation link resources include information such as the connection paths, communication bandwidth, and latency between each node and other nodes.

[0044] It should be noted that in this application, the node deployment strategy refers to the strategy of determining how to deploy nodes according to the collaborative response boundary and network requirements to ensure the optimization of network performance; the set of candidate node deployment schemes refers to a set of node deployment schemes generated according to the node deployment strategy, which contains multiple different candidate schemes, and each scheme has a different node location distribution; the load balancing of the ad hoc network refers to evenly distributing the communication tasks and node resources through reasonable allocation to make the processing pressure of each node uniform and improve the overall network efficiency and stability; the networking link resources refer to the communication paths and corresponding network resources between nodes in the verified node deployment scheme.

[0045] In step S4, the networking routing table of the current network state is automatically updated by the frequency-hopping receiving channel and the networking link resources, and communication is established.

[0046] In this embodiment, the automatic update of the networking routing table of the current network state by the frequency-hopping receiving channel and the networking link resources and the establishment of communication can be implemented by the following steps: Based on the spatio-temporal mapping relationship corresponding to the frequency-hopping receiving channel and the channel allocation table corresponding to the networking link resources, the dynamic routing parameters of the current network state are extracted; The candidate routing paths in the current network state are determined through the dynamic routing parameters; The end-to-end connectivity test and load pressure verification are performed on the candidate routing paths through the distributed routing verification protocol, the networking routing table is automatically updated according to the verification results, and the inter-node communication links are established based on the networking routing table.

[0047] In specific implementation, first, the current network state is perceived by using the frequency-hopping receiving channel and the networking link resources. The frequency-hopping receiving channel realizes reliable reception between nodes through a frequency-time dynamic scheduling mechanism. The corresponding space-time mapping relationship refers to the mapping configuration relationship of the frequency-hopping channel among different time slots and node positions, which is used to determine the time-domain and frequency-domain conditions for communication between nodes. At the same time, the networking link resources provide structural information such as the link quality, bandwidth allocation, and delay characteristics among nodes. The corresponding channel allocation table is a data structure that describes the channel numbers, time-slot positions, and transmission directions actually allocated on each communication link. By parsing the space-time mapping relationship and the channel allocation table, dynamic routing parameters are extracted. Among them, the dynamic routing parameters include: link reachability (whether it is reachable), the occupancy status of the current frequency resources, the path transmission delay and bandwidth capacity, and the node frequency-hopping synchronization window. The dynamic routing parameters reflect the current communication capabilities and resource status of the network. Then, based on the extracted dynamic routing parameters, a path selection algorithm, such as the dynamic source routing DSR or the improved AODV, is used to construct a set of candidate routing paths. This process includes: constructing an adjacency node graph, constructing a communication graph with the reachability of the frequency-hopping receiving channel as the edge and the nodes as the vertices; selecting paths based on indicators such as the optimal bandwidth, the minimum delay, and the minimum number of hops; avoiding the path nodes that are currently at the peak load or in the channel conflict state; incorporating the requirements of frequency reuse and frequency-hopping coordination to ensure that the frequencies of the nodes within the path do not conflict. Multiple candidate routing paths are generated according to the construction rules of the candidate routing path set, and the frequency-hopping channels and networking link characteristics used by each path are recorded. Finally, a distributed routing verification protocol is executed on the candidate paths. The distributed routing verification protocol establishes a test data stream between the source node and the destination node and performs the following verification operations: end-to-end connectivity test, verifying whether the entire path is reachable under the frequency-hopping channel scheduling, including frequency-hopping synchronization, channel occupancy conflict detection, the validity of the receiving window, etc.; load pressure verification, evaluating whether there are overloaded nodes or transmission bottlenecks according to the current data traffic carried by each path, and judging whether the path has stable availability. If a certain candidate routing path shows high communication reliability, low delay, and good load balance in the test, the system automatically writes the candidate routing path as an effective communication path into the networking routing table. The networking routing table records information such as the frequency-hopping scheduling plan, link bandwidth, and path effective period of each node on the candidate routing path. Finally, according to the updated networking routing table, the system establishes an actual communication link between nodes. The establishment of the communication link includes: setting the frequency-hopping scheduler to synchronize the frequency-hopping parameters of each node; activating the physical layer receiving and sending modules to ensure that data packets are received and sent at the correct frequency points and time slots; starting the link layer session management to complete operations such as link confirmation, handshaking, and link maintenance. After the communication link is successfully established, the nodes can perform data transmission in the ad hoc network, realizing stable and efficient communication capabilities in the dynamic network.

[0048] It should be noted that the networking routing table in the present application represents an information table that records all available communication paths and their related parameters in the network, and is the basis for node routing decisions; the space-time mapping relationship corresponding to the frequency hopping receiving channel represents the allocation and reception matching relationship of the frequency hopping channel at a specific time and space position; the channel allocation table corresponding to the networking link resources represents the resource allocation table of the specific frequency points, time slots and communication directions occupied by each communication link in the network; the dynamic routing parameters refer to the set of real-time communication control parameters for path calculation and update; the candidate routing path represents multiple optional communication paths calculated based on the current network status; the distributed routing verification protocol refers to a protocol mechanism that verifies path connectivity and communication load capacity in a multi-node network in a collaborative manner between nodes; end-to-end connectivity test and load pressure verification are represented.

[0049] It can be seen that in this application, the networking efficiency and communication reliability of the wireless self-organizing network can be improved; among them, by extracting the protocol features of the central node broadcast frame and reorganizing the frame, the structured identification and coding modeling of the communication nodes in the whole network are realized, the coverage range and search accuracy of the node automatic search are improved, and an efficient basic identification mechanism is provided for the subsequent directional reception and frequency hopping resource configuration; the transmission and reception timing characteristics of each node are identified through dynamic scanning and behavior modeling, and the frequency hopping receiving channel is generated in combination with the time slot state of the coding bit, so as to realize the optimal allocation of spectrum resources and directional reception scheduling at the receiving end, thereby improving the adaptability and anti-interference ability to the dynamic communication environment during the networking process; through the steady-state evaluation of the communication link quality of the located node, the neighboring nodes are accurately identified and a collaborative screening mechanism is established, so as to construct a collaborative response boundary with high coverage accuracy and strong response consistency; the spatiotemporal characteristics of the frequency hopping receiving channel and the path connectivity of the link resources are integrated, and the networking routing table is updated in real time and the communication path is self-organized, which improves the routing robustness and data transmission stability of the network in a dynamic environment, accelerates the networking completion speed and optimizes the overall network performance.

[0050] In summary, the technical solution adopted in the present application can perform route adaptive update on the automatic search of wireless ad hoc network nodes when wireless channel resources are limited, so as to improve the accuracy of ad hoc network node search.

[0051] Embodiment 2: This application provides a wireless ad hoc network node automatic search system, referring to Figure 4 As shown, this figure is a module structure diagram of a wireless ad hoc network node automatic search system according to this embodiment of the present application, and the automatic search system includes: The search and monitoring module 100 is used to periodically monitor the node broadcast frames of the central nodes of the entire network when the automatic search of the wireless ad hoc network nodes is initialized, encode and reorganize the node broadcast frames, and generate a coding sequence group corresponding to the automatically searched locatable nodes; The dynamic scanning module 200 is configured to dynamically scan the encoding sequence group to obtain the node transceiver modes of locatable nodes in the wireless ad hoc network nodes, and generate a hopping receiving channel corresponding to the directional receiving mode in the automatic search according to the node transceiver modes and the time slot transceiver states corresponding to each encoding bit in the encoding sequence group; The link screening module 300 is configured to determine the neighbor node identifiers of the located nodes in the automatic search of the wireless ad hoc network nodes, perform collaborative screening on the neighbor node identifiers to obtain the collaborative response boundary of the networking request in the ad hoc network, and then perform communication node deployment on the collaborative response boundary to obtain the networking link resources during the automatic search of the wireless ad hoc network nodes; The network communication module 400 is configured to automatically update the networking routing table of the current network state and establish communication by using the hopping receiving channel and the networking link resources.

[0052] This application is described with reference to the flowcharts and / or block diagrams of methods, apparatuses (systems), and computer program products according to embodiments of the present application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams can be implemented by computer program instructions, and the combination of the flows and / or blocks in the flowcharts and / or block diagrams can also be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing devices generate a device for implementing the functions specified in one Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0053] Those of ordinary skill in the art can understand that all or part of the steps in the various methods of the above embodiments can be completed by instructing relevant hardware through a program, and the program can be stored in a computer-readable storage medium. The storage medium includes read-only memory (ROM), random access memory (RAM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), one-time programmable read-only memory (OTPROM), electrically-erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM) or other optical disc memories, magnetic disc memories, tape memories, or any other medium that can be used to carry or store data and is computer-readable.

[0054] It should also be noted that the term "including", "comprising" or any other variant thereof is intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements not only includes those elements, but also includes other elements not expressly listed, or also includes elements inherent in such a process, method, commodity or device. Without further limitation, an element defined by the statement "including one..." does not exclude the existence of another identical element in the process, method, commodity or device including the element.

Claims

1. A method for automatically searching nodes in a wireless ad hoc network, characterized in that: The automatic search method comprises the following steps: When the wireless ad hoc network node automatic search is initialized, the node broadcast frames of the central node of the whole network are periodically monitored, the node broadcast frames are encoded and reorganized, and the coding sequence group corresponding to the automatically searched locatable node is generated; Dynamically scan the coding sequence group to obtain the node transceiver mode of the locatable node in the wireless ad hoc network node, and generate a frequency hopping receiving channel corresponding to the directional receiving mode in the automatic search according to the node transceiver mode and the time slot transceiver state corresponding to each coding bit in the coding sequence group; Determine the neighbor node identifiers of the located nodes in the automatic search of the wireless ad hoc network nodes, perform collaborative screening on the neighbor node identifiers, obtain the collaborative response boundary of the networking request in the ad hoc network, and then deploy communication nodes on the collaborative response boundary to obtain the networking link resources during the automatic search of the wireless ad hoc network nodes; The frequency hopping receiving channel and the networking link resources automatically update the networking routing table of the current network status and establish communication.

2. A method for automatically searching nodes in a wireless ad hoc network according to claim 1, characterized in that: The node broadcast frame refers to a control frame that is periodically sent by a node to publish its own identification, status and channel information.

3. A method for automatically searching nodes in a wireless ad hoc network according to claim 1, characterized in that: The node broadcast frame is encoded and reorganized to generate an encoding sequence group corresponding to the automatically searched locatable node, specifically comprising: Extracting a set of encoding parameters based on communication protocol features of the node broadcast frame; Establishing frame reassembly rule information for rule matching according to the encoding parameter set; The node broadcast frame is serialized and encoded and reconstructed using the frame reorganization rule information to generate a coding sequence group corresponding to the automatically searched locatable node.

4. A method for automatically searching nodes in a wireless ad hoc network as claimed in claim 1, characterized in that: Dynamically scanning the coding sequence group to obtain the node transceiver mode of the locatable node in the wireless ad hoc network node specifically includes: In the dynamic scanning process of the coding sequence group, a dynamic scanning strategy is constructed based on the spatiotemporal identifier; Dynamically capture the sending and receiving characteristics of the coding sequence group through the dynamic scanning strategy to obtain dynamic communication characteristics; Based on the dynamic communication characteristics, a pattern primitive library of the transmitting and receiving behaviors of the nodes in the wireless ad hoc network can be established; The dynamic transceiver sequences of the locatable nodes are associated through the pattern primitive library to obtain the node transceiver mode of the locatable nodes in the wireless ad hoc network node.

5. A method for automatically searching nodes in a wireless ad hoc network as claimed in claim 1, characterized in that: Generating a frequency hopping receiving channel corresponding to a directional receiving mode in automatic search according to the node transceiver mode and the time slot transceiver state corresponding to each coding bit in the coding sequence group specifically includes: Extracting receiving channel parameters corresponding to the directional receiving mode according to the communication link characteristics in the node transceiver mode; Performing dynamic conflict detection on the receiving channel parameters based on the time slot receiving and transmitting state corresponding to each coding bit in the coding sequence group to obtain channel interaction information corresponding to the directional receiving mode; A frequency hopping receiving channel corresponding to the directional receiving mode in the automatic search is determined according to the channel interaction information.

6. A method for automatically searching nodes in a wireless ad hoc network as claimed in claim 1, characterized in that: The frequency hopping receiving channel refers to the frequency band dynamically selected by the node for receiving signals in the frequency hopping communication mode.

7. A method for automatically searching nodes in a wireless ad hoc network as claimed in claim 1, characterized in that: Determining the neighbor node identifier of the located node in the automatic search of the wireless ad hoc network node specifically includes: Obtaining the communication link quality index of the located node in the automatic search of the wireless ad hoc network node; The candidate set of neighbor node identifiers of the located node is screened by the communication link quality indicator to obtain steady-state link information; The neighbor node identifier of the located node in the automatic search of the wireless ad hoc network node is determined according to the steady-state link information.

8. A method for automatically searching nodes in a wireless ad hoc network as claimed in claim 1, characterized in that: Deploying communication nodes on the coordinated response boundary to obtain networking link resources during automatic search of wireless ad hoc network nodes specifically includes: Determine the node deployment strategy when the wireless ad hoc network node automatically searches based on the collaborative response boundary; Generate a set of candidate node deployment solutions for load balancing in an ad hoc network according to the node deployment strategy; The path connectivity verification is performed on the candidate node deployment solution set to obtain the networking link resources when the wireless ad hoc network nodes are automatically searched.

9. A method for automatically searching for nodes in a wireless ad hoc network as claimed in claim 1, characterized in that: Automatically updating the networking routing table of the current network state and establishing communication by the frequency hopping receiving channel and the networking link resources specifically includes: Extracting dynamic routing parameters of the current network state based on the time-space mapping relationship corresponding to the frequency hopping receiving channel and the channel allocation table corresponding to the networking link resources; Determine a candidate routing path in the current network state by using the dynamic routing parameters; The candidate routing paths are subjected to end-to-end connectivity testing and load pressure verification through a distributed routing verification protocol, the networking routing table is automatically updated according to the verification results, and an inter-node communication link is established based on the networking routing table.

10. A wireless ad hoc network node automatic search system, used to execute a wireless ad hoc network node automatic search method according to any one of claims 1 to 9, characterized in that: The automatic search system comprises: A search and monitoring module is used to periodically monitor the node broadcast frames of the central node of the entire network when the automatic search of the wireless ad hoc network node is initialized, encode and reorganize the node broadcast frames, and generate a coding sequence group corresponding to the automatically searched locatable node; A dynamic scanning module is used to dynamically scan the coding sequence group to obtain the node transceiver mode of the locatable node in the wireless ad hoc network node, and generate a frequency hopping receiving channel corresponding to the directional receiving mode in the automatic search according to the node transceiver mode and the time slot transceiver state corresponding to each coding bit in the coding sequence group; A link screening module is used to determine the neighbor node identifiers of the located nodes in the automatic search of the wireless ad hoc network nodes, perform collaborative screening on the neighbor node identifiers, obtain the collaborative response boundary of the networking request in the ad hoc network, and then deploy communication nodes on the collaborative response boundary to obtain the networking link resources during the automatic search of the wireless ad hoc network nodes; The network communication module is used to automatically update the networking routing table of the current network status and establish communication by using the frequency hopping receiving channel and the networking link resources.

Images