A method and device for establishing a wireless ad hoc network in a signal-free area based on a chain network

Abstract

The application relates to the technical field of wireless communication, and discloses a signal-free area wireless ad hoc network construction method and device based on chain networking, which comprises the following steps: the identity and communication capacity of nodes in chain networking are cooperatively fused to obtain node capacity information of the chain networking; the relay capacity of a target node in the wireless ad hoc network is evaluated to obtain a basis for topology construction; candidate nodes in the wireless ad hoc network are optimized to obtain a chain network topology of the wireless ad hoc network; a bidirectional communication link between nodes in the chain network topology is established to form a preliminary communication network of the wireless ad hoc network; the link communication quality of the preliminary communication network is detected step by step to obtain a hierarchical link state of the wireless ad hoc network; the hierarchical link state is dynamically negotiated to build a stable communication path of the wireless ad hoc network; and the application can improve the accuracy of the signal-free area wireless ad hoc network construction based on chain networking.

Description

Technical Field

[0001] This invention relates to the field of wireless communication technology, and in particular to a method and apparatus for constructing a wireless self-organizing network in a signal-free area based on a chain-like networking structure. Background Technology

[0002] In the process of building wireless ad hoc networks in areas without signal coverage, existing technologies lack a systematic and comprehensive approach to assessing the capabilities of chain-like network nodes. Traditional methods only consider the communication signal strength or basic connectivity attributes of nodes, failing to integrate the type and role attributes in node identification with communication capability parameters. This results in incomplete node capability information that cannot accurately reflect the actual relay potential of nodes. Relay capability assessments based on this approach often rely on fixed weight allocation, failing to dynamically adjust the weights of assessment dimensions based on node identity credibility and historical connectivity stability. This leads to significant deviations in the calculation of overall relay performance, making it difficult to form a reliable basis for topology construction and directly affecting the rationality and stability of the subsequent chain-like network topology.

[0003] Existing technologies have significant shortcomings in network topology construction and communication path optimization. During the topology shaping phase, candidate nodes are not screened for relay performance thresholds or their logical link bidirectional reachability is not verified, leading to issues such as broken node connections or excessive redundant links, resulting in vulnerabilities in the initial chain-like network topology. Furthermore, the link quality detection and path negotiation processes lack hierarchical detection mechanisms and dynamic adjustment strategies, only performing a general inspection of the overall communication network. This fails to accurately locate communication bottleneck nodes and unstable links, and even if problems are identified, it is difficult to generate an optimal adjustment plan through inter-node collaborative negotiation. Consequently, the resulting ad hoc network communication path is prone to data transmission interruptions and excessive latency, failing to meet the stable communication requirements of areas without signal coverage. Summary of the Invention

[0004] This invention provides a method and apparatus for building a wireless self-organizing network in a signal-free area based on chain-like networking, in order to solve the problems mentioned in the background art.

[0005] To achieve the above objectives, the present invention provides a method for constructing a wireless self-organizing network in a signal-free area based on a chain-like networking structure, comprising:

[0006] S1. The identity and communication capabilities of nodes in the chain network are fused together to obtain the node capability information of the chain network;

[0007] S2. Based on the node capability information, evaluate the relay capability of the target nodes in the wireless ad hoc network to obtain the basis for the topology construction of the wireless ad hoc network;

[0008] S3. Based on the topology construction criteria, optimize and shape the candidate nodes in the wireless ad hoc network to obtain the chain network topology of the wireless ad hoc network;

[0009] S4. Establish bidirectional communication links between nodes in the chain network topology to form the initial communication network of the wireless ad hoc network;

[0010] S5. The link communication quality of the preliminary communication network is detected step by step to obtain the hierarchical link status of the wireless ad hoc network;

[0011] S6. Dynamically negotiate the hierarchical link status to establish a stable communication path for the wireless ad hoc network.

[0012] In a preferred embodiment, the step of collaboratively fusing the identity and communication capabilities of nodes in the chain-like network to obtain the node capability information of the chain-like network includes:

[0013] Extract the identity features of nodes in the chain network to obtain the identity information of the nodes;

[0014] Parse the node type and role attributes from the node's identity information to generate the node's identity description data;

[0015] Monitor the communication signal strength and channel availability of the nodes in the chain network to obtain the communication capability parameters of the nodes;

[0016] The identity description data is associated and mapped with the communication capability parameters to form the node comprehensive capability identifier of the chain network;

[0017] Based on the node comprehensive capability identifier, the node capability information of the chain network is constructed.

[0018] In a preferred embodiment, the step of evaluating the relay capabilities of target nodes in the wireless ad hoc network based on the node capability information to obtain the basis for the topology construction of the wireless ad hoc network includes:

[0019] Based on the identity credibility and historical connectivity stability in the node capability information, the target nodes of the wireless ad hoc network are dynamically weighted to obtain the relay evaluation weight of the target nodes.

[0020] Based on the relay evaluation weight, the real-time communication bandwidth and remaining energy level of the target node are fused in multiple dimensions to obtain the comprehensive relay performance of the wireless ad hoc network.

[0021] Based on the comprehensive relay performance, the target nodes are sorted by relay priority to obtain the multi-level relay sequence of the wireless ad hoc network;

[0022] The multi-level relay sequence is collaboratively corrected to obtain the basis for the topology construction of the wireless ad hoc network.

[0023] In a preferred embodiment, the step of multi-dimensionally fusing the real-time communication bandwidth and remaining energy level of the target node based on the relay evaluation weight to obtain the comprehensive relay performance of the wireless ad hoc network includes:

[0024] Dynamic proportional analysis is performed on the relay evaluation weights to obtain the fusion dominant factor of the real-time communication bandwidth and the remaining energy level;

[0025] Based on the aforementioned fusion dominant factor, an efficiency mapping relationship between the real-time communication bandwidth and the remaining energy level is established;

[0026] Based on the performance mapping relationship, the real-time communication bandwidth value and the remaining energy level value are respectively mapped to the bandwidth performance index and the energy performance index;

[0027] Based on the aforementioned fusion dominant factor, the bandwidth efficiency index and the energy efficiency index are linearly and adaptively fused to generate the comprehensive relay efficiency of the target node. The calculation formula for the comprehensive relay efficiency is as follows:

[0028] ;

[0029] In the formula, For the aforementioned integrated relay performance, The fusion-dominant factor, The bandwidth efficiency index is... The energy efficiency index is mentioned above. To adaptively adjust the index, The absolute difference between the energy efficiency index and the bandwidth efficiency index.

[0030] In a preferred embodiment, the step of optimizing and shaping candidate nodes in the wireless ad hoc network based on the topology construction criteria to obtain the chain-like network topology of the wireless ad hoc network includes:

[0031] Based on the relay priority of the target node in the topology construction criteria, the sequence of backbone nodes in the chain topology of the wireless ad hoc network is determined;

[0032] Based on the backbone node sequence, candidate nodes in the wireless ad hoc network are screened using relay performance thresholds to obtain topology connection points in the wireless ad hoc network that meet preset conditions.

[0033] Based on the communication coverage of the topology connection point, bidirectional reachability verification is performed on the logical links between adjacent nodes in the wireless ad hoc network to obtain the effective logical links of the wireless ad hoc network.

[0034] Based on the effective logical links, the node arrangement order in the backbone node sequence is dynamically adjusted to generate the preliminary chain network topology of the wireless ad hoc network.

[0035] Redundant links are eliminated from the initial chain network topology to obtain the chain network topology of the wireless ad hoc network.

[0036] In a preferred embodiment, the step of dynamically adjusting the node arrangement order in the backbone node sequence according to the effective logical links to generate the preliminary chain network topology of the wireless ad hoc network includes:

[0037] Based on the effective logical links, a directed graph is constructed on the actual connection relationships between adjacent nodes in the backbone node sequence to obtain the actual connection topology graph of the backbone node sequence.

[0038] Based on the actual connection topology, the positions of broken and redundant nodes in the backbone node sequence are rearranged to obtain an optimized node sequence of the backbone node sequence.

[0039] Logical topology reconstruction is performed on the optimized node sequence to obtain the preliminary chain network topology of the wireless ad hoc network.

[0040] In a preferred embodiment, establishing bidirectional communication links between nodes in the chain-like network topology to form the initial communication network of the wireless ad hoc network includes:

[0041] Based on the node connection relationship of the chain network topology, a request-response interaction is performed on the communication connection between the upstream and downstream nodes in the wireless ad hoc network to obtain the bidirectional communication connection confirmation signal of the wireless ad hoc network.

[0042] Based on the bidirectional communication connection confirmation signal, the bidirectional connectivity of the logical link between nodes in the wireless ad hoc network is validated to obtain the standardized bidirectional communication link of the wireless ad hoc network.

[0043] The standardized bidirectional communication links are networked and integrated to obtain the preliminary communication network of the wireless self-organizing network.

[0044] In a preferred embodiment, the step of performing step-by-step detection of the link communication quality of the initial communication network to obtain the hierarchical link status of the wireless ad hoc network includes:

[0045] Based on the chain topology of the preliminary communication network, the hierarchical detection order from the starting node to the ending node in the chain topology is determined.

[0046] According to the hierarchical detection order, the bidirectional communication links between adjacent nodes in the preliminary communication network are evaluated step by step to obtain the communication quality parameters of the preliminary communication network.

[0047] Based on the communication quality parameters, determine the real-time communication status of the communication links in the preliminary communication network;

[0048] By combining the real-time communication status and the network hierarchy information of the initial communication network, a hierarchical link status of the wireless ad hoc network is generated.

[0049] In a preferred embodiment, the dynamic negotiation of the hierarchical link states to establish a stable communication path for the wireless ad hoc network includes:

[0050] The hierarchical link status is dynamically analyzed to obtain the communication bottleneck nodes and unstable links existing in the initial communication network.

[0051] Based on the location and hierarchy of the communication bottleneck node and unstable link, an alternative path adjustment scheme for the wireless ad hoc network is generated.

[0052] The alternative path adjustment schemes are distributed to the relevant nodes of the wireless ad hoc network for collaborative negotiation to determine the optimal adjustment scheme for the wireless ad hoc network.

[0053] Based on the optimal adjustment scheme, the connection relationships and data forwarding strategies of the nodes in the wireless ad hoc network are reconfigured to obtain a stable node connection architecture for the wireless ad hoc network.

[0054] Based on the stable node connection architecture, a stable communication path is established for the wireless ad hoc network.

[0055] To address the aforementioned problems, the present invention also provides a device for establishing a wireless self-organizing network in a signal-free area based on a chain-like networking structure, the device comprising:

[0056] The collaborative fusion module is used to collaboratively fuse the identity and communication capabilities of nodes in the chain network to obtain the node capability information of the chain network.

[0057] The capability assessment module is used to assess the relay capability of target nodes in the wireless ad hoc network based on the node capability information, and to obtain the basis for the topology construction of the wireless ad hoc network.

[0058] The topology construction module is used to optimize and shape candidate nodes in the wireless ad hoc network based on the topology construction criteria to obtain the chain network topology of the wireless ad hoc network.

[0059] The network establishment module is used to establish bidirectional communication links between nodes in the chain network topology, forming the initial communication network of the wireless ad hoc network;

[0060] The step-by-step detection module is used to perform step-by-step detection of the link communication quality of the initial communication network to obtain the hierarchical link status of the wireless ad hoc network.

[0061] The stable path determination module is used to dynamically negotiate the hierarchical link status and establish a stable communication path for the wireless ad hoc network.

[0062] Compared with the prior art, the present invention has the following beneficial effects:

[0063] 1. This invention provides a method and apparatus for building wireless ad hoc networks in signal-free areas based on chain-like networking, which can significantly improve the efficiency and reliability of building ad hoc networks in signal-free areas. This technology generates comprehensive node capability information by collaboratively integrating node identity and communication capabilities. It dynamically allocates relay evaluation weights based on identity credibility and historical connectivity stability, and then accurately calculates and ranks the comprehensive relay performance using a formula to form the basis for topology construction, making node capability evaluation more aligned with actual relay needs. Based on this basis, it selects topology connection points, verifies the bidirectional reachability of logical links, and eliminates redundant links to generate a chain-like network topology, ensuring the rationality of the topology structure from the source and laying a solid foundation for subsequent communication network construction.

[0064] 2. This invention demonstrates significant advantages in communication network stability and path optimization through its technical solution. After establishing bidirectional communication links between nodes and integrating them to form a preliminary communication network, the link communication quality is detected in a hierarchical order to accurately obtain the link status at each level. By dynamically analyzing and locating communication bottleneck nodes and unstable links, alternative solutions are generated, and the optimal adjustment strategy is determined through node collaborative negotiation. Node connection relationships and data forwarding strategies are reconfigured, and the final stable communication path effectively reduces data transmission interruptions and delays, fully meeting the needs of areas without signal for continuous and stable communication, and improving the overall operational efficiency of the ad hoc network. Attached Figure Description

[0065] Figure 1 This is a flowchart illustrating a method for constructing a wireless self-organizing network in a signal-free area based on a chain-like networking scheme, as provided in an embodiment of the present invention.

[0066] Figure 2 A functional block diagram of a wireless self-organizing network construction device for signal-free areas based on chain-like networking is provided in an embodiment of the present invention.

[0067] The realization of the objective, functional features and advantages of the present invention will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

[0068] It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

[0069] This application provides a method for building a wireless ad hoc network in a signal-free area based on a chain-like networking topology. The execution entity of this method includes, but is not limited to, at least one of the following electronic devices that can be configured to execute the method provided in this application: a server, a terminal, etc. In other words, this method can be executed by software or hardware installed on a terminal device or a server device. The server includes, but is not limited to, a single server, a server cluster, a cloud server, or a cloud server cluster. The server can be an independent server or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, content delivery networks (CDNs), and big data and artificial intelligence platforms.

[0070] Reference Figure 1 The diagram shown is a flowchart illustrating a method for constructing a wireless ad hoc network in a signal-free area based on a chain-like network topology, according to an embodiment of the present invention. In this embodiment, the method for constructing a wireless ad hoc network in a signal-free area based on a chain-like network topology includes:

[0071] S1. The identity and communication capabilities of nodes in the chain network are fused together to obtain the node capability information of the chain network;

[0072] In this embodiment of the invention, the step of collaboratively fusing the identity and communication capabilities of nodes in the chain-like network to obtain the node capability information of the chain-like network includes:

[0073] Extract the identity features of nodes in the chain network to obtain the identity information of the nodes;

[0074] Parse the node type and role attributes from the node's identity information to generate the node's identity description data;

[0075] Monitor the communication signal strength and channel availability of the nodes in the chain network to obtain the communication capability parameters of the nodes;

[0076] The identity description data is associated and mapped with the communication capability parameters to form the node comprehensive capability identifier of the chain network;

[0077] Based on the node comprehensive capability identifier, the node capability information of the chain network is constructed.

[0078] Specifically, when extracting the identity features of nodes in a chain network, all nodes to be analyzed within the network are first identified. The unique hardware identifier of each node, such as the factory serial number and MAC address, is obtained through the node hardware identifier reading module. Then, the preset network identifier, such as the fixed number and the subnet identifier, is extracted from the node system configuration file. The hardware identifier and the network identifier are integrated to form an information set that can uniquely distinguish the node. This set is the identity information of the node.

[0079] Furthermore, when parsing the node type and role attributes in the node identity information, the node type-related fields are filtered from the identity information. Fields containing keywords such as "collection node," "forwarding node," and "control node" directly determine the type. If no direct label is found, the functional description fields are analyzed; for example, "responsible for data collection and initial uploading" corresponds to a collection node, "responsible for data transmission" corresponds to a forwarding node, and "responsible for network control" corresponds to a control node. Then, the role attribute-related content is analyzed, and the node type and role attributes are recorded as structured text to generate the node's identity description data.

[0080] Furthermore, when monitoring the communication signal strength and channel availability of nodes in the chain-like network, a signal strength monitoring unit and a channel detection unit are deployed at each node. The signal strength monitoring unit continuously receives the signal waveforms of communication between the node and its neighboring nodes, measures the peak amplitude, compares it with a preset reference standard, and converts it into a quantized value in dBm units, which is the communication signal strength data. The channel detection unit scans all currently available communication channels, records the number of interferences and the duration of transmission interruptions for each channel within a preset time period. A state with no interference and no interruptions is considered available; if there is interference or interruption, the frequency and proportion are statistically analyzed to determine the availability. The number of available channels, their identifiers, and the interference and interruption status are integrated to form channel availability data. The communication capability parameters of the node are obtained by combining these two types of data.

[0081] Furthermore, when associating identity description data with communication capability parameters, rules are first established to clarify the correspondence between identity description fields and communication capability parameters. For example, data acquisition nodes are preferentially associated with high signal strength parameters, and core role nodes are preferentially associated with multiple available channel parameters. Node type and role attributes are matched with communication signal strength and channel availability according to the rules. For example, "data acquisition node + edge role" is bound to "-70dBm signal strength + 2 available channels." A unique identifier code is assigned to each binding combination. The first half of the code represents the node type and role, and the second half represents the signal strength level and the number of available channels, forming the comprehensive capability identifier of the nodes in the chain-like network.

[0082] Furthermore, when constructing node capability information based on the node's comprehensive capability identifier, a storage structure is created containing fields for the node's unique identifier, comprehensive capability identifier, identity description details, and communication capability details. The node's unique hardware or network identifier, comprehensive capability identifier, identity description data, and communication capability parameters are filled into the corresponding fields. All node information is then summarized and arranged according to the node's position or number in the network, forming a structured dataset containing all node capability-related information. This dataset constitutes the node capability information of the chain-like network.

[0083] In summary, extracting the identity features of nodes in a chain network to obtain node identity information involves obtaining hardware identifiers such as the factory serial number and MAC address, and network identifiers such as the subnet identifier with a fixed number from the node. These two types of identifiers are then integrated to form information that can uniquely distinguish the node.

[0084] In summary, parsing the node identity information to generate node identity description data involves filtering out keyword segments such as collection node, forwarding node, and control node from the identity information to determine the node type. When there is no direct label, the functional description field is analyzed, and the role attributes are determined by combining identifiers or connection relationships such as master node and slave node. The data is generated using structured text records.

[0085] In summary, monitoring the communication signal strength and channel availability of nodes in a chain network to obtain the communication capability parameters of the nodes involves deploying signal strength monitoring units and channel detection units at the nodes. The former converts the peak signal amplitude into a quantitative value in dBm units, while the latter scans the channel to count the number of interferences and the duration of interruptions to determine availability. The two types of data are then integrated to form parameters.

[0086] In summary, the process of associating identity description data with communication capability parameters to form a chain-like network of node comprehensive capability identifiers involves establishing association rules, matching node type role attributes with communication signal strength and channel availability according to the rules, and assigning a unique identifier code containing identity and communication capability characteristics to each matching combination.

[0087] In summary, the node capability information for constructing a chain-like network based on the node's comprehensive capability identifier involves creating a storage structure containing fields such as unique node identifier, comprehensive capability identifier, identity description details, and communication capability details. The corresponding information for each node is then filled in, and the data is aggregated and arranged in order of node position or number to form a structured dataset.

[0088] S2. Based on the node capability information, evaluate the relay capability of the target nodes in the wireless ad hoc network to obtain the basis for the topology construction of the wireless ad hoc network;

[0089] In this embodiment of the invention, the step of evaluating the relay capabilities of target nodes in a wireless ad hoc network based on the node capability information to obtain the basis for topology construction of the wireless ad hoc network includes:

[0090] Based on the identity credibility and historical connectivity stability in the node capability information, the target nodes of the wireless ad hoc network are dynamically weighted to obtain the relay evaluation weight of the target nodes.

[0091] Based on the relay evaluation weight, the real-time communication bandwidth and remaining energy level of the target node are fused in multiple dimensions to obtain the comprehensive relay performance of the wireless ad hoc network.

[0092] Based on the comprehensive relay performance, the target nodes are sorted by relay priority to obtain the multi-level relay sequence of the wireless ad hoc network;

[0093] The multi-level relay sequence is collaboratively corrected to obtain the basis for the topology construction of the wireless ad hoc network.

[0094] The step of fusing the real-time communication bandwidth and remaining energy level of the target node in multiple dimensions based on the relay evaluation weight to obtain the comprehensive relay performance of the wireless ad hoc network includes:

[0095] Dynamic proportional analysis is performed on the relay evaluation weights to obtain the fusion dominant factor of the real-time communication bandwidth and the remaining energy level;

[0096] Based on the aforementioned fusion dominant factor, an efficiency mapping relationship between the real-time communication bandwidth and the remaining energy level is established;

[0097] Based on the performance mapping relationship, the real-time communication bandwidth value and the remaining energy level value are respectively mapped to the bandwidth performance index and the energy performance index;

[0098] Based on the aforementioned fusion dominant factor, the bandwidth efficiency index and the energy efficiency index are linearly and adaptively fused to generate the comprehensive relay efficiency of the target node. The calculation formula for the comprehensive relay efficiency is as follows:

[0099] ;

[0100] In the formula, For the aforementioned integrated relay performance, The fusion-dominant factor, The bandwidth efficiency index is... The energy efficiency index is mentioned above. To adaptively adjust the index, The absolute difference between the energy efficiency index and the bandwidth efficiency index.

[0101] Specifically, the identity credibility and historical connectivity stability of each target node are extracted from the node capability information. Identity credibility is determined based on the verification results of the node's identity identifier; official certification with no tampering records is considered high, while ambiguous information or tampering records are considered low. Historical connectivity stability is determined by statistically analyzing the percentage of stable connection time over a fixed period; a higher percentage indicates higher stability. Dynamic weighting rules are set: when both identity credibility and stability are high, the weighting is 40% and 60% respectively; when one is high and the other is medium, or both are medium, the weighting is 50% each; when either dimension is low, the low dimension accounts for 20% and the other dimension accounts for 80%. The comprehensive weight value is calculated by combining the actual node level, which is the relay evaluation weight of the target node.

[0102] Furthermore, the current real-time communication bandwidth and remaining energy level of each target node are obtained from the node capability information. Real-time communication bandwidth is the upper limit of the node's current stable data transmission rate, determined by monitoring the data transmission process. Remaining energy level is the percentage of battery charge remaining, determined by reading real-time battery levels. The contribution ratio is determined according to the relay evaluation weights: high weight results in 60% for real-time communication bandwidth and 40% for remaining energy level; medium weight results in both being 50%; and low weight results in 40% for real-time communication bandwidth and 60% for remaining energy level. The real-time communication bandwidth is converted to a percentage score, proportionally calculated based on the highest possible real-time communication bandwidth achievable by nodes in the ad hoc network. The remaining energy level is directly represented by its percentage value as a percentage score. The standardized real-time communication bandwidth score and remaining energy level score are multiplied by their respective contribution ratios and then summed to obtain the overall relay performance of the wireless ad hoc network.

[0103] Furthermore, the overall relay performance of all target nodes is collected and arranged in descending order of value. When two or more target nodes have the same overall relay performance value, their historical connectivity stability is compared first, with nodes having higher historical connectivity stability ranked higher. If the historical connectivity stability is also the same, the node identity credibility is compared, with nodes having higher identity credibility ranked higher. In this way, all target nodes are arranged into an ordered list, with target nodes ranking higher in the list having higher relay priority. This list constitutes the multi-level relay sequence of the wireless ad hoc network.

[0104] Furthermore, the reachability between two adjacent target nodes in the multi-level relay sequence is checked. Test signals are sent to each of the two adjacent target nodes. If both nodes successfully receive the test signal and return feedback information, communication is determined to be reachable; if either node fails to receive the test signal or return feedback information, communication is determined to be unreachable. For unreachable adjacent node pairs, other target nodes that can communicate with both nodes are found from the node capability information and inserted between the two unreachable nodes. At the same time, the nodes after the insertion position in the original sequence are adjusted to the next position. The sequence is then checked for isolated nodes. An isolated node is a node that can only communicate with one adjacent node in the sequence and cannot communicate with other nodes. For such nodes, target nodes that can communicate with the isolated node and more nodes in the sequence are selected from the node capability information to replace it. If no suitable replacement node can be found, the isolated node is removed from the sequence, and all nodes after the removed node are adjusted to the next position. The communication coverage of all nodes in the corrected sequence is compared with the service area of ​​the wireless ad hoc network. If there are uncovered areas, target nodes that can cover those areas and whose overall relay performance meets the requirements are selected from the node capability information and added to the corresponding positions in the sequence. After the above processing, the final multi-level relay sequence is the basis for the topology construction of the wireless ad hoc network.

[0105] Specifically, the relay evaluation weight is defined to range from 0 to 100. This weight is a comprehensive value determined based on the target node's identity credibility and historical connectivity stability, reflecting the node's basic adaptability in relay tasks. A dynamic ratio analysis rule is set: if the relay evaluation weight is between 80 and 100, it indicates that the node performs well in both identity verification and historical connectivity. In this case, the fusion ratio corresponding to real-time communication bandwidth is set to 70%, and the fusion ratio corresponding to remaining energy level is set to 30%. These two ratios directly serve as the dominant fusion factors for real-time communication bandwidth and remaining energy level. If the relay evaluation weight is between 50 and 79, it indicates that the node's overall performance is moderate. The fusion ratio of real-time communication bandwidth and remaining energy level is set to 50% for both, forming the corresponding dominant fusion factor. If the relay evaluation weight is between 0 and 49, it represents a weaker overall node performance, requiring priority to ensure energy support to avoid frequent offline events. The fusion ratio of real-time communication bandwidth is set to 30%, and the fusion ratio of remaining energy level is set to 70%, determining the corresponding dominant fusion factor. This analysis process directly yields the dominant fusion factor for real-time communication bandwidth and remaining energy level.

[0106] Furthermore, historical real-time communication bandwidth data and historical remaining energy level data of all target nodes in the wireless ad hoc network were collected over the past 30 days. Statistics showed that the common range for real-time communication bandwidth was 1Mbps to 20Mbps, and the common range for remaining energy level was 10% to 100%. The emphasis of performance mapping was determined based on the fusion dominant factor. If the proportion of real-time communication bandwidth in the fusion dominant factor was higher, the real-time communication bandwidth value was divided into more granular intervals when establishing the mapping relationship: 1Mbps to 5Mbps for low bandwidth, 6Mbps to 15Mbps for medium bandwidth, and 16Mbps to 20Mbps for high bandwidth, each interval corresponding to a different performance level. Simultaneously, the remaining energy level was divided into 10% to 40% for low energy, 41% to 70% for medium energy, and 71% to 100% for high energy, ensuring that the bandwidth interval division was more precise than the energy interval division. If the proportion of remaining energy level in the fusion dominant factor was higher, the operation was reversed, dividing the remaining energy level into more granular intervals while the real-time communication bandwidth was divided into coarser intervals. If the proportions of the two are the same, the real-time communication bandwidth and the remaining energy level are divided into three intervals of the same precision: low, medium and high, and the coverage of each interval is similar. By clarifying the correspondence between the data intervals and the performance level, a performance mapping relationship between the real-time communication bandwidth and the remaining energy level is established.

[0107] Furthermore, the current real-time communication bandwidth and remaining energy level of the target node are obtained. For example, a target node currently has a real-time communication bandwidth of 12Mbps and a remaining energy level of 65%. Referring to the established performance mapping relationship, if the real-time communication bandwidth mapping relationship shows a bandwidth range of 6Mbps to 15Mbps, and the bandwidth performance index corresponding to this range is 60, then the 12Mbps real-time communication bandwidth value is directly mapped to a bandwidth performance index of 60. For the remaining energy level, if the mapping relationship shows an energy range of 41% to 70%, and the energy performance index corresponding to this range is 60, then the 65% remaining energy level value is mapped to an energy performance index of 60. If the real-time communication bandwidth value or the remaining energy level value is at the boundary of the interval, such as a real-time communication bandwidth value of 5Mbps, which is exactly the upper limit of the low bandwidth interval of 1Mbps to 5Mbps and the lower limit of the medium bandwidth interval of 6Mbps to 15Mbps, then according to the inclusion rule of "interval left closed and right open" in the mapping relationship, 5Mbps is classified into the low bandwidth interval and corresponds to a bandwidth efficiency index of 30. Through such a comparison mapping process, the bandwidth efficiency index and the energy efficiency index are obtained respectively.

[0108] Further, first confirm the proportions of real-time communication bandwidth and remaining energy level in the fusion dominant factor. For example, the fusion dominant factor might be 60% for real-time communication bandwidth and 40% for remaining energy level. Next, calculate the contribution value of each performance index. Multiply the bandwidth performance index by the corresponding proportion of real-time communication bandwidth to obtain the bandwidth performance contribution value. For example, if the bandwidth performance index is 70, multiplying 70 by 60% gives a bandwidth performance contribution value of 42. Then, multiply the energy performance index by the corresponding proportion of remaining energy level to obtain the energy performance contribution value. For example, if the energy performance index is 80, multiplying 80 by 40% gives an energy performance contribution value of 32. Finally, add the bandwidth performance contribution value and the energy performance contribution value together. The sum is the overall relay performance of the target node. For example, 42 plus 32 equals 72, and 72 is the overall relay performance of the target node. If both the bandwidth efficiency index and the energy efficiency index account for 50% in the fusion dominant factor, then the bandwidth efficiency index and the energy efficiency index are added together and divided by 2 to obtain the comprehensive relay efficiency. If the real-time communication bandwidth accounts for 30% and the remaining energy level accounts for 70%, then the contribution values ​​are calculated separately according to the corresponding proportions and added together to ensure that the fusion process adjusts the contribution ratio of the two according to the fusion dominant factor, and finally generates the comprehensive relay efficiency of the target node.

[0109] Specifically, the fusion dominant factor comes from the fusion ratio of real-time communication bandwidth and remaining energy level obtained after dynamic proportional analysis of relay evaluation weights. The bandwidth efficiency index is the result of mapping the real-time communication bandwidth value according to the efficiency mapping relationship. The energy efficiency index is the result of mapping the remaining energy level value according to the efficiency mapping relationship. The adaptive adjustment index is a fixed value set according to the network load of the wireless ad hoc network. When the network load is high, the index value is larger, and when the network load is low, the index value is smaller. The absolute difference between the energy efficiency index and the bandwidth efficiency index is the result of calculating the difference between the energy efficiency index and the bandwidth efficiency index and taking the absolute value.

[0110] Furthermore, the significance of this formula lies in comprehensively considering the dominant fusion factor, bandwidth efficiency index, energy efficiency index, and the absolute difference between the two to quantitatively evaluate the relay capability of the target node. The resulting comprehensive relay efficiency can fully reflect the comprehensive performance of the target node in terms of real-time communication bandwidth and remaining energy level, providing an accurate quantitative basis for subsequent relay priority ranking of the target node.

[0111] Furthermore, when the fusion dominant factor is biased towards real-time communication bandwidth, the bandwidth efficiency index has a greater impact on the overall relay efficiency. As the bandwidth efficiency index increases, the overall relay efficiency shows an upward trend, while the change in the energy efficiency index has a relatively small impact on the overall relay efficiency. When the fusion dominant factor is biased towards the remaining energy level, the energy efficiency index has a greater impact on the overall relay efficiency. As the energy efficiency index increases, the overall relay efficiency shows an upward trend, while the change in the bandwidth efficiency index has a relatively small impact on the overall relay efficiency. When the absolute difference between the bandwidth efficiency index and the energy efficiency index increases, the overall relay efficiency will show a downward trend regardless of which side the fusion dominant factor is biased towards, and the larger the adaptive adjustment index, the more obvious this downward trend is. When both the bandwidth efficiency index and the energy efficiency index increase simultaneously, the overall relay efficiency will increase significantly, and vice versa.

[0112] In summary, the relay evaluation weight is obtained by dynamically assigning weights to target nodes in the wireless ad hoc network based on the identity credibility and historical connectivity stability in the node capability information. The weight ratio is determined by combining identity credibility and historical connectivity stability. Identity credibility is judged as high or low based on official certification and no tampering. Historical connectivity stability is judged as good or bad based on the proportion of stable connection time. When both are high, identity credibility accounts for 40% and historical connectivity stability accounts for 60%. When one is high and the other is medium or both are medium, both account for 50%. When any dimension is low, the low dimension accounts for 20% and the other dimension accounts for 80%. The comprehensive weight value of each target node is then calculated by combining the actual level of the node.

[0113] In summary, the comprehensive relay performance of a wireless ad hoc network is obtained by multi-dimensionally fusing the real-time communication bandwidth and remaining energy level of the target node based on relay evaluation weights. The fusion ratio of the two is determined according to the relay evaluation weights. When the weights are high, the real-time communication bandwidth accounts for 60% and the remaining energy level accounts for 40%. When the weights are medium, both account for 50%. When the weights are low, the real-time communication bandwidth accounts for 40% and the remaining energy level accounts for 60%. The real-time communication bandwidth is converted into a percentage score according to the highest bandwidth ratio, and the remaining energy level is also converted into a percentage score. The weighted sums are then calculated according to the ratios to obtain the fusion evaluation value.

[0114] In summary, the multi-level relay sequence of the wireless ad hoc network is obtained by prioritizing the target nodes based on their overall relay performance. This involves collecting the overall relay performance of all target nodes, arranging them from largest to smallest, and comparing historical connectivity stability when the values ​​are the same. Nodes with higher historical connectivity stability are ranked higher. If they are still the same, their identity credibility is compared, with nodes with higher identity credibility ranked higher. Nodes are then arranged into an ordered list in this manner.

[0115] In summary, the topology construction basis for obtaining the wireless ad hoc network by collaboratively correcting the multi-level relay sequence is as follows: First, verify the reachability of neighboring nodes by sending test signals to each other. If both can receive feedback, the nodes are reachable. If they are not reachable, insert nodes that can communicate with both and adjust the positions of subsequent nodes. Then, handle isolated nodes, which can only communicate with one neighboring node. Replace them with nodes that can communicate with more nodes or remove them directly and adjust their order. Finally, compare the node coverage with the service area. Add nodes that meet the performance requirements to the uncovered areas. After correction, the final multi-level relay sequence is formed.

[0116] In summary, the dynamic proportional analysis of relay evaluation weights yields the dominant factor for the fusion of real-time communication bandwidth and remaining energy level. This involves defining the relay evaluation weight range as 0 to 100, and determining the fusion ratio of real-time communication bandwidth and remaining energy level based on weights falling within different intervals: 80 to 100, 50 to 79, and 0 to 49. These ratios are the dominant factors for fusion.

[0117] In summary, establishing a performance mapping relationship between real-time communication bandwidth and remaining energy level based on the fusion dominant factor involves collecting historical data of target nodes over the past 30 days to determine the common value ranges of both, determining the mapping emphasis according to the fusion dominant factor, dividing parameters with higher proportions into more detailed intervals, and dividing intervals of the same precision for parameters with the same proportions, thus clarifying the correspondence between intervals and performance levels.

[0118] In summary, the real-time communication bandwidth value and the remaining energy level value are mapped to bandwidth efficiency index and energy efficiency index respectively according to the efficiency mapping relationship. This involves obtaining the current real-time communication bandwidth value and the remaining energy level value of the node, classifying them into the corresponding interval according to the mapping relationship, and matching them with the preset index. Boundary values ​​are assigned according to the interval left-closed and right-open rule.

[0119] In summary, the comprehensive relay performance of the target node is generated by linearly and adaptively fusing the bandwidth performance index and energy performance index based on the fusion dominant factor and combining them with the formula. This involves determining the contribution value of the two by the fusion dominant factor, calculating their fusion ratio, adding them together, and then substituting them into the formula. The comprehensive relay performance is then calculated by combining the fusion dominant factor, the two indices, the absolute difference between the two, and the adaptive adjustment index set according to the network load.

[0120] S3. Based on the topology construction criteria, optimize and shape the candidate nodes in the wireless ad hoc network to obtain the chain network topology of the wireless ad hoc network;

[0121] In this embodiment of the invention, the step of optimizing and shaping candidate nodes in the wireless ad hoc network based on the topology construction criteria to obtain the chain-like network topology of the wireless ad hoc network includes:

[0122] Based on the relay priority of the target node in the topology construction criteria, the sequence of backbone nodes in the chain topology of the wireless ad hoc network is determined;

[0123] Based on the backbone node sequence, candidate nodes in the wireless ad hoc network are screened using relay performance thresholds to obtain topology connection points in the wireless ad hoc network that meet preset conditions.

[0124] Based on the communication coverage of the topology connection point, bidirectional reachability verification is performed on the logical links between adjacent nodes in the wireless ad hoc network to obtain the effective logical links of the wireless ad hoc network.

[0125] Based on the effective logical links, the node arrangement order in the backbone node sequence is dynamically adjusted to generate the preliminary chain network topology of the wireless ad hoc network.

[0126] Redundant links are eliminated from the initial chain network topology to obtain the chain network topology of the wireless ad hoc network.

[0127] The step of dynamically adjusting the node arrangement order in the backbone node sequence according to the effective logical links to generate the preliminary chain-like network topology of the wireless ad hoc network includes:

[0128] Based on the effective logical links, a directed graph is constructed on the actual connection relationships between adjacent nodes in the backbone node sequence to obtain the actual connection topology graph of the backbone node sequence.

[0129] Based on the actual connection topology, the positions of broken and redundant nodes in the backbone node sequence are rearranged to obtain an optimized node sequence of the backbone node sequence.

[0130] Logical topology reconstruction is performed on the optimized node sequence to obtain the preliminary chain network topology of the wireless ad hoc network.

[0131] Specifically, the target node relay priority sorting result is extracted from the multi-level relay sequence, the number of backbone nodes is determined by rounding up by 30% of the total number, and the corresponding nodes are selected and sorted according to the priority from high to low to form a backbone node sequence containing node identifiers and relay priorities.

[0132] Furthermore, the overall relay performance of the backbone nodes is obtained, and the average value is calculated as the relay performance threshold. The overall relay performance of all candidate nodes is extracted, and nodes with a performance greater than or equal to the threshold are retained and organized into a set containing node identifiers and overall relay performance, which are then used as the topology connection points that meet the criteria.

[0133] Furthermore, the communication coverage data of each topology connection point is obtained, and other nodes within the coverage area are identified as neighboring nodes. Test signals are exchanged between neighboring nodes; bidirectional feedback within one second verifies the connection, and the verified links are integrated to form a valid logical link.

[0134] Furthermore, starting with the highest priority backbone node, adjacent backbone nodes with the highest integrated relay efficiency are selected and connected sequentially according to the effective logical links until all backbone nodes form a preliminary arrangement. Non-backbone nodes connect to adjacent connected nodes according to the effective logical links, and the connection relationship is presented using a visual chart to form a preliminary chain-like network topology.

[0135] Furthermore, links with two or more independent links or links that remain connected after being disconnected are considered redundant links. The links are traversed, and redundancy is eliminated according to the rule of "retaining links containing nodes with high integrated relay efficiency." The resulting diagram, containing nodes, valid links, and connection relationships, is the final diagram of the chain network topology.

[0136] Specifically, on the blank canvas of the drawing tool, use circular icons to represent backbone nodes and label them with unique identifiers. Filter the valid logical links connecting backbone nodes, draw line segments with bidirectional arrows according to bidirectional reachability and label the link identifier and "valid" status. If there is no connection, do not draw line segments to form the actual connection topology diagram.

[0137] Further, examine the actual connection topology diagram. Adjacent backbone nodes without bidirectional arrow line segments are identified as broken. Insert nodes that can form effective connections with both ends of the break and draw the links. Nodes that form two or more effective links with other non-adjacent nodes in addition to the connections before and after are identified as redundant nodes. Move them to the location with the most connected nodes and organize them into an optimized node sequence.

[0138] Furthermore, starting with the first node in the optimized node sequence, draw circular icons of nodes sequentially on a new canvas and label them. Connect adjacent nodes with bidirectional arrow lines to form a straight backbone link. Draw non-backbone nodes next to their corresponding backbone nodes according to their valid logical links and connect them. Verify all labels and link markings to form a preliminary chain-like network topology.

[0139] In summary, determining the backbone node sequence of a chain topology in a wireless ad hoc network based on the relay priority of the target nodes in the topology construction basis involves extracting the relay priority ranking results from the multi-level relay sequence used as the basis for topology construction, determining the number of backbone nodes by rounding up to 30% of the total number, selecting corresponding nodes from high to low priority and arranging them sequentially to form an ordered list containing node identifiers and relay priorities. This ensures that the backbone nodes have strong relay capabilities and lays the core framework for the chain topology.

[0140] In summary, the method of filtering candidate nodes in a wireless ad hoc network based on the backbone node sequence using relay performance thresholds to obtain topology connection points that meet preset conditions involves obtaining the comprehensive relay performance of the backbone nodes, calculating the average value as the relay performance threshold, extracting the comprehensive relay performance of all candidate nodes and comparing it with the threshold, retaining candidate nodes that are greater than or equal to the threshold, forming a set containing node identifiers and comprehensive relay performance, and ensuring that the topology connection points meet the basic requirements for relay capability.

[0141] In summary, the bidirectional reachability verification of logical links between adjacent nodes in a wireless ad hoc network based on the communication coverage of topology connection points is used to obtain the communication coverage data of each topology connection point, identify other nodes within the coverage area as adjacent nodes, send test signals to adjacent nodes and verify the bidirectional reception feedback within 1 second, retain the bidirectional reachable links and organize them into a set containing node identifiers and link status to ensure that the links have a stable communication foundation.

[0142] In summary, the preliminary chain network topology of the wireless ad hoc network is generated by dynamically adjusting the node arrangement order in the backbone node sequence based on the effective logical links. This involves determining the backbone node arrangement order from the effective logical links according to the principle of prioritizing comprehensive relay efficiency, connecting non-backbone topology connection points to adjacent connected nodes, and using a visual chart to present the node connection relationship and arrangement order, thus forming a preliminary topology that combines backbone links and branch nodes, ensuring that the topology structure conforms to the basic form of chain networking.

[0143] In summary, eliminating redundant links in the initial chain network topology to obtain the chain network topology of the wireless ad hoc network involves identifying redundant links as those with two or more independent links or links that remain connected after being disconnected. Redundant links are then deleted according to the rule of retaining links containing nodes with high integrated relay efficiency. The final diagram containing nodes, effective links, and connection relationships is then generated, reducing resource waste and improving the stability of the topology.

[0144] In summary, the actual connection topology of the backbone node sequence is obtained by constructing a directed graph based on the actual connection relationships between adjacent nodes in the backbone node sequence according to the effective logical links. In the drawing tool, each backbone node is represented by a circular icon and labeled with a unique identifier. The effective logical links connecting the backbone nodes are filtered, and line segments with bidirectional arrows are drawn according to the bidirectional reachability of the links, and the link identifier and effective status are labeled. If there are no effective links, no line segments are drawn, forming a graphic that intuitively presents the node connection relationships, providing a clear visual basis for subsequent node adjustments.

[0145] In summary, the optimized node sequence of the backbone node sequence is obtained by rearranging the positions of broken and redundant nodes in the actual connection topology based on the actual connection topology. This involves checking adjacent nodes in the topology without bidirectional arrow segments for broken nodes and inserting nodes that can form effective connections with the nodes at both ends of the broken node. Nodes that form two or more effective links with other non-adjacent nodes in addition to being connected to the nodes before and after them are identified as redundant nodes. These nodes are moved to the position with the most connected nodes, and the nodes are reorganized into a list according to the new order, thus resolving the problem of broken and redundant node connections in the sequence.

[0146] In summary, logical topology reconstruction of the optimized node sequence yields a preliminary chain-like network topology for the wireless ad hoc network. This involves drawing circular icons of nodes sequentially, labeling them, connecting adjacent nodes with bidirectional arrow lines and labeling the link information to form a backbone link, and connecting non-backbone topology connection points to adjacent backbone nodes according to valid logical links. After verifying all node labels and link information, a complete graph is formed, constructing a preliminary topology that conforms to the chain shape and has stable connections.

[0147] S4. Establish bidirectional communication links between nodes in the chain network topology to form the initial communication network of the wireless ad hoc network;

[0148] In this embodiment of the invention, establishing bidirectional communication links between nodes in the chain-like network topology to form the initial communication network of the wireless ad hoc network includes:

[0149] Based on the node connection relationship of the chain network topology, a request-response interaction is performed on the communication connection between the upstream and downstream nodes in the wireless ad hoc network to obtain the bidirectional communication connection confirmation signal of the wireless ad hoc network.

[0150] Based on the bidirectional communication connection confirmation signal, the bidirectional connectivity of the logical link between nodes in the wireless ad hoc network is validated to obtain the standardized bidirectional communication link of the wireless ad hoc network.

[0151] The standardized bidirectional communication links are networked and integrated to obtain the preliminary communication network of the wireless self-organizing network.

[0152] Specifically, based on the node connection relationships in the chain-like network topology, when upstream and downstream nodes engage in request-response interactions, the upstream and downstream relationships are determined from the chain-like network topology. Nodes at the front of the chain are upstream, and those directly connected to the rear are downstream. The upstream node generates a connection request signal containing its own identifier, request timestamp, and connection verification information according to a preset communication protocol, and sends it to the corresponding downstream node via a pre-defined logical link. Upon receiving the signal, the downstream node parses the identifier and verification information. If the verification matches and the identifier belongs to an upstream node in the topology record, it generates a response signal containing its own identifier, response timestamp, and confirmation information, and returns it via the same link. The upstream node verifies the downstream identifier and response timestamp. If they meet preset standards, the interaction is recorded as successful. The signal generated during this process, containing upstream and downstream identifiers, interaction time, and confirmation status, is the bidirectional communication connection confirmation signal.

[0153] Furthermore, when verifying the bidirectional connectivity of the logical link based on the bidirectional communication connection confirmation signal, the successfully interacting node pairs and corresponding links in the signal are extracted. Continuous verification is initiated for each node and link pair. The upstream node sends a short message containing a random verification code to the downstream node every 1 second, and the downstream node must return a response containing the verification code within 0.5 seconds. Simultaneously, the downstream node sends short messages containing different verification codes to the upstream node at the same frequency, and the upstream node responds according to the same rules. After 10 consecutive verifications, if all bidirectional messages are successfully sent and received and the verification codes match, the link connectivity is deemed valid; if there is a single message loss or a mismatched verification code, the link is deemed invalid and marked. The verified valid links are recorded in a standardized format, including the identifiers of both ends of the node, the link type, the verification result, and the validity period. The resulting set of links is the standardized bidirectional communication link.

[0154] Furthermore, when integrating standardized bidirectional communication links into a network, a framework containing basic parameters such as network identifier, coverage area, and communication protocol version is first created. All nodes in the chain topology are entered into the framework according to their location and identifier, forming a node information table containing unique node identifiers, hardware attributes, and the region to which they belong. Then, each standardized link is associated with the corresponding node in the table, establishing a mapping relationship between nodes and links within the framework, clarifying the node attributes corresponding to each link. Next, communication rules are configured, including that links between backbone nodes have higher priority than links between non-backbone nodes, data is transmitted sequentially along the chain structure, and simultaneous transmission is ordered according to node identifier size. Finally, the node information, link mapping relationship, and communication rules are integrated to form a complete network model that can intuitively display the node connection method, communication path, and operating rules. This model is the preliminary communication network of the aforementioned wireless ad hoc network.

[0155] In summary, the node connection relationship based on the chain network topology enables the upstream and downstream nodes to exchange requests and responses to obtain a bidirectional communication connection confirmation signal. This process involves first identifying the upstream node at the front of the chain structure and the downstream node directly connected to it. The upstream node sends a connection request containing its own identifier and verification information. After the downstream node verifies the match, it returns a response signal. Once the upstream node confirms that everything is correct, it records the interaction as successful, forming a signal containing the node identifier, interaction time, and confirmation status, thus ensuring the validity of the initial connection between nodes.

[0156] In summary, a standardized bidirectional communication link is obtained by validating the bidirectional connectivity of the logical link between nodes based on the bidirectional communication connection confirmation signal. This involves extracting successfully interacting node pairs and their corresponding links, exchanging short messages containing random verification codes at a fixed frequency between nodes and verifying the sending, receiving, and matching status. If the verification passes continuously, the link is deemed valid. The valid links are recorded in a unified format, including the node identifiers at both ends and the link type, forming a standardized link set to ensure the stability of the bidirectional connectivity of the link.

[0157] In summary, the initial communication network of a wireless ad hoc network is obtained by networking and integrating standardized bidirectional communication links. This involves creating a framework containing parameters such as network identifiers and communication protocol versions, recording all node information to form a node information table, establishing mapping relationships between standardized links and corresponding nodes, configuring communication rules such as backbone link priority and data transmission order, and integrating them to form a network model that displays node connection methods, communication paths, and operating rules, thus constructing a preliminary network with basic communication functions.

[0158] S5. The link communication quality of the preliminary communication network is detected step by step to obtain the hierarchical link status of the wireless ad hoc network;

[0159] In this embodiment of the invention, the step of performing step-by-step detection of the link communication quality of the initial communication network to obtain the hierarchical link status of the wireless ad hoc network includes:

[0160] Based on the chain topology of the preliminary communication network, the hierarchical detection order from the starting node to the ending node in the chain topology is determined.

[0161] According to the hierarchical detection order, the bidirectional communication links between adjacent nodes in the preliminary communication network are evaluated step by step to obtain the communication quality parameters of the preliminary communication network.

[0162] Based on the communication quality parameters, determine the real-time communication status of the communication links in the preliminary communication network;

[0163] By combining the real-time communication status and the network hierarchy information of the initial communication network, a hierarchical link status of the wireless ad hoc network is generated.

[0164] Specifically, based on the chain-like topology of the initial communication network, when determining the hierarchical detection order, the starting node and the ending node are identified from the chain-like topology. The starting node is the first node in the chain structure, and the ending node is the last node. According to the node arrangement order, the starting node is marked as a Level 1 detection node, the next node directly connected to it is marked as a Level 2 detection node, and so on until the ending node. The level number of each node is consistent with its positional order. The bidirectional communication link level between adjacent nodes is the same as the upstream node level; for example, the link between Level 1 and Level 2 nodes is a Level 1 detection link. All link levels are determined in this way. An ordered list is formed according to the order of the detection links from Level 1 to the last level, which is the hierarchical detection order.

[0165] Furthermore, when evaluating the bidirectional communication link status between adjacent nodes according to the hierarchical detection sequence, the first-level detection link is selected, and the communication quality detection module of both ends of the link is activated. The detection module records the bidirectional data transmission within one minute of the link, calculates the ratio of successful transmissions to the total number of transmissions as the transmission success rate, calculates the average time interval of each transmission as the transmission delay, and counts the number of data loss or errors as the transmission error count. After completing the first-level evaluation, the same detection is performed on subsequent links at each level in sequence, recording the transmission success rate, transmission delay, and transmission error count for each link. All link data is organized by level to form a dataset containing link level, transmission success rate, transmission delay, and transmission error count, which is the aforementioned communication quality parameter.

[0166] Furthermore, when determining the real-time status of a communication link based on communication quality parameters, the following criteria are set: a link with a transmission success rate ≥ 95%, transmission delay ≤ 100 milliseconds, and 0 transmission errors is considered excellent; a link with a transmission success rate of 90%–94%, transmission delay of 101–200 milliseconds, and ≤ 3 transmission errors is considered good; a link with a transmission success rate of 80%–89%, transmission delay of 201–500 milliseconds, and 4–10 transmission errors is considered average; and a link with a transmission success rate < 80%, transmission delay > 500 milliseconds, or transmission error > 10 is considered poor. The parameters of each link are compared with the criteria one by one, and the real-time status is strictly determined according to the range that meets the criteria. For example, a link with a transmission success rate of 96%, a delay of 80 milliseconds, and 0 errors is considered excellent; a link with a transmission success rate of 85%, a delay of 300 milliseconds, and 5 errors is considered average. The link identifier is associated with the real-time status, and the resulting list represents the real-time communication status of the communication link.

[0167] Furthermore, when generating hierarchical link status by aggregating real-time communication status and network hierarchy information, network hierarchy information is extracted from the initial communication network, including the level of each node and link, and the number of nodes and links contained in each level. The real-time communication status of each link is matched with the network hierarchy information according to the link level and assigned to the corresponding level. The link status within each level is summarized and statistically analyzed, calculating the number of links with excellent, good, medium, and poor statuses and their proportion of the total number of links in that level. For example, in level 2, there are 5 links: 2 excellent, 2 good, and 1 medium, which translates to 40% excellent, 40% good, 20% medium, and 0% poor. The network hierarchy information, the real-time status of each link, and the statistical results of each level are integrated to form a structured document containing level divisions, link status details, and statistical data, which is the hierarchical link status of the wireless ad hoc network.

[0168] In summary, determining the hierarchical detection order from the starting node to the ending node based on the chain topology of the initial communication network means clearly defining the first node of the chain structure as the starting node and the last node as the ending node, assigning node level numbers according to the node arrangement order, ensuring that the link level between adjacent nodes is consistent with the upstream node level, and forming an ordered detection list from low to high link level. This provides a clear and orderly execution basis for subsequent step-by-step detection, avoiding omissions or duplications caused by chaotic detection order.

[0169] In summary, the communication quality parameters are obtained by evaluating the status of bidirectional communication links between adjacent nodes in a hierarchical detection order. This involves selecting each link sequentially according to the detection order, recording the transmission success rate, transmission delay, and number of transmission errors within a fixed time period through the detection module, and organizing all the data from all links into a dataset containing link level, transmission success rate, transmission delay, and number of transmission errors. This provides accurate quantitative data support for subsequent determination of link status and avoids bias caused by subjective evaluation.

[0170] In summary, determining the real-time communication status of communication links in the initial communication network based on communication quality parameters involves pre-setting parameter ranges corresponding to different statuses, comparing the transmission success rate, transmission delay, and number of transmission errors of each link with the preset ranges, and strictly determining the link's status as excellent, good, medium, or poor according to the ranges that meet the criteria. The link identifier is then associated with the corresponding status and recorded to ensure the objectivity and consistency of the link status determination, providing a clear basis for subsequent understanding of the link's operational status.

[0171] In summary, generating a hierarchical link status for a wireless ad hoc network by aggregating real-time communication status and network hierarchy information of the initial communication network involves extracting the levels of nodes and links in the network hierarchy information, as well as the number of nodes and links at each level. The real-time status of each link is matched and categorized by level, and the number and proportion of links in different states within each level are statistically analyzed. The network hierarchy information, link status details, and statistical results are integrated into a structured document that comprehensively presents the operational status of links at each level, providing a complete link status reference for subsequent dynamic negotiation of stable communication paths.

[0172] S6. Dynamically negotiate the hierarchical link status to establish a stable communication path for the wireless ad hoc network.

[0173] In this embodiment of the invention, the dynamic negotiation of the hierarchical link state to establish a stable communication path for the wireless ad hoc network includes:

[0174] The hierarchical link status is dynamically analyzed to obtain the communication bottleneck nodes and unstable links existing in the initial communication network.

[0175] Based on the location and hierarchy of the communication bottleneck node and unstable link, an alternative path adjustment scheme for the wireless ad hoc network is generated.

[0176] The alternative path adjustment schemes are distributed to the relevant nodes of the wireless ad hoc network for collaborative negotiation to determine the optimal adjustment scheme for the wireless ad hoc network.

[0177] Based on the optimal adjustment scheme, the connection relationships and data forwarding strategies of the nodes in the wireless ad hoc network are reconfigured to obtain a stable node connection architecture for the wireless ad hoc network.

[0178] Based on the stable node connection architecture, a stable communication path is established for the wireless ad hoc network.

[0179] Specifically, when dynamically parsing the hierarchical link status, the real-time communication status and hierarchy of all links are first extracted, and links with poor status are selected as unstable links. The proportion of unstable links for each node is counted, and nodes with a proportion of 50% or more are identified as communication bottleneck nodes. The identifier, hierarchy, and associated unstable link information of the bottleneck nodes are recorded. At the same time, the identifiers, hierarchy, and status parameters of the two ends of the unstable links are recorded to form the parsing results and identify the bottleneck nodes and unstable links in the initial communication network.

[0180] Furthermore, when generating alternative path adjustment schemes, the location of bottleneck nodes and unstable links in the chain topology and their impact on data transmission are first determined. For bottleneck nodes, non-bottleneck nodes with higher overall relay efficiency are found at the same or adjacent levels as replacement nodes, and link switching schemes are designed. For unstable links, stable links in good or good condition at the same or adjacent levels of both ends are checked first. If they are found, a switching scheme is designed; otherwise, nodes at adjacent levels are selected as relays to construct new detour paths. All schemes are classified and organized, and each scheme includes the adjustment object, information on replacement nodes or new links, path change details, and expected effects.

[0181] Furthermore, when collaboratively negotiating to determine the optimal solution, the solution is distributed to relevant nodes according to the scope of nodes involved. Each node assesses whether the replacement node or new link is within its own communication coverage area and whether it has sufficient remaining energy and real-time communication bandwidth. If it meets these requirements, it reports its agreement and resource status; otherwise, it reports its rejection and the reason. The agreement rate of each solution is calculated, and the solution with the highest agreement rate and the core nodes' agreement is selected. If the agreement rates are the same, the solution that allows more links to reach a good or excellent state is selected as the optimal adjustment solution.

[0182] Furthermore, when reconfiguring node connection and forwarding policies, unstable links are disconnected according to the optimal solution, and new connections are established between alternative nodes and relevant nodes or stable links are enabled; the routing table is updated to clarify the forwarding direction, specifying priority to pass through links in good and good condition, and automatically switching to backup links in case of failure; forwarding priorities are configured for nodes, with important data between backbone nodes being forwarded first, and ordinary data between non-backbone nodes being forwarded in sequence, forming a stable node connection architecture containing new connection relationships, routing tables and forwarding rules.

[0183] Furthermore, when establishing a stable communication path, the node connection relationship and routing table are extracted from the stable node connection architecture. Starting from the starting node and ending from the ending node, a main path is formed along the links in good and good condition according to the routing table direction. Each main path is equipped with at least one non-overlapping backup path. The node sequence, link information and switching conditions of the main and backup paths are recorded in the network communication protocol to form a stable communication path containing the main and backup paths and the switching mechanism.

[0184] In summary, dynamic analysis of hierarchical link status identifies communication bottleneck nodes and unstable links. This process filters poorly performing links as unstable links, statistically analyzes the proportion of unstable links among nodes to determine bottleneck nodes, and records information such as their location and hierarchy. This allows for precise identification of key issues affecting communication, providing clear targets for subsequent adjustments.

[0185] In summary, generating alternative path adjustment schemes based on the location and hierarchy of bottleneck nodes and unstable links determines their impact on transmission, finds high-efficiency alternative nodes at the same or adjacent levels for bottleneck nodes, designs switching or detour schemes for unstable links, forms multiple targeted adjustment schemes, and provides options for adjustment direction.

[0186] In summary, distributing alternative solutions to relevant nodes for collaborative negotiation to determine the optimal adjustment plan allows nodes to evaluate the feasibility of the plan and provide feedback, calculate the agreement rate, and combine it with the link optimization effect to select the plan with a high agreement rate and good optimization effect, ensuring that the plan is suitable for the actual network topology.

[0187] In summary, reconfiguring node connection and forwarding strategies based on the optimal solution to obtain a stable node connection architecture involves disconnecting unstable links, establishing new connections, updating routing tables, and setting forwarding priorities, forming an architecture that includes new connection relationships, routing tables, and forwarding rules, thus laying a solid foundation for stable communication.

[0188] In summary, establishing a stable communication path based on a stable node connection architecture involves extracting connection relationships and routing tables, selecting links in good or excellent condition to form the primary path and configuring backup paths, recording path information and switching conditions, and constructing a path system that combines primary and backup to ensure stable communication in areas without signal coverage.

[0189] like Figure 2 The diagram shown is a functional block diagram of a wireless self-organizing network construction device for signal-free areas based on chain-like networking, provided by an embodiment of the present invention.

[0190] The wireless ad hoc network construction device 100 based on chain-like networking in a signal-free area, as described in this invention, can be installed in an electronic device. Depending on the functions implemented, the wireless ad hoc network construction device 100 may include a collaborative fusion module 101, a capability assessment module 102, a topology construction module 103, a network establishment module 104, a step-by-step detection module 105, and a stable path determination module 106. The module described in this invention can also be referred to as a unit, which refers to a series of computer program segments that can be executed by the processor of an electronic device and can perform a fixed function, stored in the memory of the electronic device.

[0191] In this embodiment, the functions of each module / unit are as follows:

[0192] The collaborative fusion module 101 is used to collaboratively fuse the identity and communication capabilities of nodes in the chain network to obtain the node capability information of the chain network.

[0193] The capability assessment module 102 is used to assess the relay capability of target nodes in the wireless ad hoc network based on the node capability information, and obtain the basis for the topology construction of the wireless ad hoc network.

[0194] The topology construction module 103 is used to optimize and shape candidate nodes in the wireless ad hoc network based on the topology construction criteria to obtain the chain network topology of the wireless ad hoc network.

[0195] The network establishment module 104 is used to establish bidirectional communication links between nodes in the chain network topology to form the initial communication network of the wireless ad hoc network.

[0196] The step-by-step detection module 105 is used to perform step-by-step detection on the link communication quality of the initial communication network to obtain the hierarchical link status of the wireless ad hoc network.

[0197] The stable path determination module 106 is used to dynamically negotiate the hierarchical link status and build a stable communication path for the wireless ad hoc network.

[0198] In the several embodiments provided by this invention, it should be understood that the disclosed methods and apparatus can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of modules is only a logical functional division, and other division methods may be used in actual implementation.

[0199] The modules described as separate components may or may not be physically separate. The components shown as modules may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs.

[0200] Furthermore, the functional modules in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or in the form of hardware plus software functional modules.

[0201] It will be apparent to those skilled in the art that the present invention is not limited to the details of the exemplary embodiments described above, and that the present invention can be implemented in other specific forms without departing from the spirit or essential characteristics of the present invention.

[0202] The embodiments of this application can acquire and process relevant data based on artificial intelligence technology. Artificial intelligence is the theory, method, technology, and application device that uses digital computers or machines controlled by digital computers to simulate, extend, and expand human intelligence, perceive the environment, acquire knowledge, and use that knowledge to obtain optimal results.

[0203] Finally, it should be noted that the above 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 preferred embodiments, those skilled in the art should understand that modifications or equivalent substitutions can be made to the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention.

Claims

1. A method for building a wireless ad hoc network in a signal-free zone based on a chain-like network, characterized by, The method comprises: S1. The identity of the node in the chain network is fused with the communication ability, and the node capability information of the chain network is obtained; S2. Based on the node capability information, the relay capability of the target node in the wireless ad hoc network is evaluated, and the topology construction basis of the wireless ad hoc network is obtained, including: According to the identity credibility and historical communication stability in the node capability information, the target node of the wireless ad hoc network is dynamically weighted, and the relay evaluation weight of the target node is obtained; Based on the relay evaluation weight, the real-time communication bandwidth and the residual energy level of the target node are multi-dimensionally fused, and the comprehensive relay efficiency of the wireless ad hoc network is obtained; According to the comprehensive relay efficiency, the target node is prioritized, and the multi-level relay sequence of the wireless ad hoc network is obtained; The multi-level relay sequence is cooperatively corrected, and the topology construction basis of the wireless ad hoc network is obtained; S3. Based on the topology construction basis, the candidate nodes in the wireless ad hoc network are optimized and shaped, and the chain network topology of the wireless ad hoc network is obtained, including: According to the relay priority of the target node in the topology construction basis, the backbone node sequence of the chain topology in the wireless ad hoc network is determined; Based on the backbone node sequence, the candidate nodes in the wireless ad hoc network are screened according to the relay efficiency threshold, and the topology connection points in the wireless ad hoc network that meet the preset conditions are obtained; Based on the communication coverage range of the topology connection points, the logical link between adjacent nodes in the wireless ad hoc network is verified for bidirectional reachability, and the effective logical link of the wireless ad hoc network is obtained; According to the effective logical link, the node arrangement order in the backbone node sequence is dynamically adjusted, and the preliminary chain network topology structure of the wireless ad hoc network is generated; The preliminary chain network topology structure is subjected to redundant link elimination, and the chain network topology of the wireless ad hoc network is obtained; S4. The bidirectional communication link between the nodes in the chain network topology is established, and the preliminary communication network of the wireless ad hoc network is formed; S5. The link communication quality of the preliminary communication network is detected level by level, and the hierarchical link state of the wireless ad hoc network is obtained; S6. The hierarchical link state is dynamically negotiated, and the stable communication path of the wireless ad hoc network is built.

2. The method of claim 1, wherein the method is characterized by: The identity of the node in the chain network is fused with the communication ability, and the node capability information of the chain network is obtained, including: Extract the identity features of the nodes in the chain network to obtain the identity information of the nodes; Parse the node type and role attribute in the identity information of the nodes to generate the identity description data of the nodes; Monitor the communication signal strength and channel availability of the nodes in the chain network to obtain the communication capability parameters of the nodes; The identity description data and the communication capability parameters are associated and mapped to form the node comprehensive capability identification of the chain network; According to the node comprehensive capability identification, the node capability information of the chain network is constructed.

3. The method for constructing a wireless self-organizing network in a signal-free area based on chain-like networking as described in claim 1, characterized in that, The multi-dimensional fusion of the real-time communication bandwidth and the residual energy level of the target node is performed based on the relay evaluation weight to obtain the comprehensive relay efficiency of the wireless ad hoc network, including: The dynamic proportional analysis of the relay evaluation weight is performed to obtain the fusion dominant factor of the real-time communication bandwidth and the residual energy level; The efficiency mapping relationship between the real-time communication bandwidth and the residual energy level is established based on the fusion dominant factor; The real-time communication bandwidth value and the residual energy level value are respectively mapped into a bandwidth efficiency index and an energy efficiency index according to the efficiency mapping relationship; The bandwidth efficiency index and the energy efficiency index are linearly and adaptively fused according to the fusion dominant factor to generate the comprehensive relay efficiency of the target node, wherein the calculation formula of the comprehensive relay efficiency is as follows: ； wherein is the integrated relay performance, is the fusion dominant factor, is the bandwidth performance index, is the energy performance index, is the adaptive adjustment index, is the absolute difference between the energy performance index and the bandwidth performance index.

4. The method of claim 1, wherein the method further comprises: determining whether the mobile node is in the signal-free zone; and if the mobile node is in the signal-free zone, establishing a chain-based network in the signal-free zone. 5 The node arrangement order in the backbone node sequence is dynamically adjusted according to the valid logical link to generate the preliminary chain network topology of the wireless ad hoc network, including: The actual connection relationship between adjacent nodes in the backbone node sequence is constructed based on the valid logical link to obtain the actual connection topology graph of the backbone node sequence; The position of the broken and redundant nodes in the backbone node sequence is rearranged according to the actual connection topology graph to obtain the optimized node sequence of the backbone node sequence; The logical topology of the optimized node sequence is reconstructed to obtain the preliminary chain network topology of the wireless ad hoc network.

5. The method of claim 1, wherein the method further comprises: determining whether the mobile node is in the signal-free zone; and if the mobile node is in the signal-free zone, establishing a chain-based network in the signal-free zone. The bidirectional communication link between nodes in the chain network topology is established to form the preliminary communication network of the wireless ad hoc network, including: The communication connection between the upstream node and the downstream node in the wireless ad hoc network is requested and responded to based on the node connection relationship of the chain network topology to obtain the bidirectional communication connection confirmation signal of the wireless ad hoc network; The bidirectional connectivity of the logical link between nodes in the wireless ad hoc network is verified based on the bidirectional communication connection confirmation signal to obtain the standardized bidirectional communication link of the wireless ad hoc network; The standardized bidirectional communication link is integrated to obtain the preliminary communication network of the wireless ad hoc network.

6. The method of claim 1, wherein the method further comprises: determining whether the mobile node is in the signal-free zone; and if the mobile node is in the signal-free zone, establishing a chain-based network in the signal-free zone. The link communication quality of the preliminary communication network is detected level by level to obtain the hierarchical link state of the wireless ad hoc network, including: The hierarchical detection order from the starting node to the end node in the chain topology structure is determined based on the chain topology structure of the preliminary communication network; The bidirectional communication link between adjacent nodes in the preliminary communication network is evaluated level by level according to the hierarchical detection order to obtain the communication quality parameter of the preliminary communication network; The real-time communication state of the communication link in the preliminary communication network is determined according to the communication quality parameter; The real-time communication state and the network level information of the preliminary communication network are collected to generate the hierarchical link state of the wireless ad hoc network.

7. The method for constructing a wireless self-organizing network in a signal-free area based on chain-like networking as described in claim 1, characterized in that, The hierarchical link state is dynamically negotiated to build the stable communication path of the wireless ad hoc network, including: dynamically analyzing the hierarchical link state to obtain a communication bottleneck node and an unstable link existing in the preliminary communication network; generating an alternative path adjustment scheme of the wireless ad hoc network according to the location and the hierarchy of the communication bottleneck node and the unstable link; distributing the alternative path adjustment scheme to relevant nodes of the wireless ad hoc network for collaborative negotiation to determine an optimal adjustment scheme of the wireless ad hoc network; reconfiguring the connection relationship and the data forwarding strategy of the nodes in the wireless ad hoc network according to the optimal adjustment scheme to obtain a stable node connection architecture of the wireless ad hoc network; establishing a stable communication path of the wireless ad hoc network according to the stable node connection architecture.

8. A device for constructing a wireless self-organizing network in a signal-free area based on chain-like networking, characterized in that, The device comprises: a collaborative fusion module configured to collaboratively fuse the identity and communication capability of the nodes in the chain network to obtain node capability information of the chain network; a capability evaluation module configured to evaluate the relay capability of a target node in the wireless ad hoc network based on the node capability information to obtain a topology construction basis of the wireless ad hoc network, including: dynamically assigning a weight to the target node in the wireless ad hoc network according to the identity credibility and historical connectivity stability in the node capability information to obtain a relay evaluation weight of the target node; fusing the real-time communication bandwidth and the residual energy level of the target node in a multi-dimensional manner based on the relay evaluation weight to obtain a comprehensive relay efficiency of the wireless ad hoc network; sequencing the target node according to the comprehensive relay efficiency to obtain a multi-level relay sequence of the wireless ad hoc network; collaboratively correcting the multi-level relay sequence to obtain the topology construction basis of the wireless ad hoc network; a topology construction module configured to optimize and shape a candidate node in the wireless ad hoc network based on the topology construction basis to obtain a chain network topology of the wireless ad hoc network, including: determining a backbone node sequence of the chain topology in the wireless ad hoc network according to the relay priority of the target node in the topology construction basis; performing relay efficiency threshold screening on the candidate node in the wireless ad hoc network based on the backbone node sequence to obtain a topology connection point in the wireless ad hoc network that meets a preset condition; verifying the bidirectional reachability of a logical link between adjacent nodes in the wireless ad hoc network based on the communication coverage range of the topology connection point to obtain an effective logical link of the wireless ad hoc network; dynamically adjusting the arrangement order of the nodes in the backbone node sequence according to the effective logical link to generate a preliminary chain network topology structure of the wireless ad hoc network; eliminating redundant links from the preliminary chain network topology structure to obtain the chain network topology of the wireless ad hoc network; a network establishment module configured to establish a bidirectional communication link between the nodes in the chain network topology to form a preliminary communication network of the wireless ad hoc network; a hierarchical detection module configured to detect the link communication quality of the preliminary communication network in a hierarchical manner to obtain a hierarchical link state of the wireless ad hoc network; a stable path determination module configured to dynamically negotiate the hierarchical link state to build a stable communication path of the wireless ad hoc network.

Images