Non-signal area wireless ad hoc network building method and device based on chain networking

Abstract

The invention relates to the technical field of wireless communication, and discloses a method and a device for constructing a wireless ad hoc network without a signal area based on chain networking, and the method comprises the steps: carrying out the collaborative fusion of an identity label and a communication capability of a node in the chain networking, and obtaining the node capability information of the chain networking; performing relay capability evaluation on a target node in the wireless ad hoc network to obtain a topology construction basis; performing optimization forming on candidate nodes in the wireless ad hoc network to obtain a chain network topology of the wireless ad hoc network; establishing a bidirectional communication link between nodes in the chain network topology to form a preliminary communication network of the wireless ad hoc network; detecting the link communication quality of the preliminary communication network step by step to obtain a hierarchical link state of the wireless ad hoc network; dynamically negotiating a hierarchical link state, and establishing a stable communication path of the wireless ad hoc network; according to the invention, the construction accuracy of the chain networking-based wireless ad hoc network in the non-signal area can be improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of wireless communication, in particular to a method and device for building a wireless ad hoc network in a signal-free area based on chain networking. BACKGROUND

[0002] In the process of building a wireless ad hoc network in a signal-free area, the existing technology lacks systematicness and comprehensiveness in evaluating the capabilities of nodes in chain networking. The traditional method only considers the communication signal strength or basic connection properties of nodes, without synergistically integrating the type, role attribute and communication capability parameters in the node identity, resulting in one-sided node capability information that cannot accurately reflect the actual relay potential of nodes. The relay capability evaluation based on this relies on fixed weight allocation and cannot dynamically adjust the weight of evaluation dimensions in combination with the identity credibility and historical connectivity stability of nodes, making the comprehensive relay efficiency calculation deviate greatly and making it difficult to form a reliable basis for topology construction, directly affecting the rationality and stability of the subsequent chain network topology.

[0003] The existing technology has obvious defects in the aspects of network topology construction and communication path optimization. In the topology shaping stage, the candidate nodes are not screened by relay efficiency threshold and verified by bidirectional reachability of logical link, which is prone to problems such as node connection rupture or excessive redundant links, resulting in vulnerabilities in the preliminary chain network topology structure; and in the link quality detection and path negotiation process, there is a lack of hierarchical detection mechanism and dynamic adjustment strategy, only a general detection is made on the overall communication network, which cannot accurately locate the communication bottleneck nodes and unstable links, even if the problems are found, it is difficult to generate an optimal adjustment scheme through the coordination and negotiation among nodes, and the communication path of the ad hoc network built finally is prone to data transmission interruption and high delay, which cannot meet the demand for stable communication in a signal-free area. SUMMARY

[0004] The present application provides a method and device for building a wireless ad hoc network in a signal-free area based on chain networking to solve the problems raised in the background.

[0005] To achieve the above-mentioned purpose, the present application provides a method for building a wireless ad hoc network in a signal-free area based on chain networking, comprising:

[0006] S1. synergistically integrating the identity of nodes in chain networking and the communication capability to obtain the node capability information of the chain networking;

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

[0008] S3. based on the basis for topology construction, optimizing and shaping the candidate nodes in the wireless ad hoc network to obtain the chain network topology of the wireless ad hoc network.

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

[0010] S5. Detecting link communication quality of the preliminary communication network step by step to obtain hierarchical link states of the wireless ad hoc network;

[0011] S6. Dynamically negotiating the hierarchical link states to build stable communication paths of the wireless ad hoc network.

[0012] In a preferred embodiment, the identity of the node in the chain network and the communication capability are fused to obtain the node capability information of the chain network, including:

[0013] Extracting identity features of the node in the chain network to obtain identity information of the node;

[0014] Analyzing node type and role attributes in the identity information of the node to generate identity description data of the node;

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

[0016] Associating and mapping the identity description data and the communication capability parameters to form a comprehensive capability identifier of the node in the chain network;

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

[0018] In a preferred embodiment, based on the node capability information, the relay capability of the target node in the wireless ad hoc network is evaluated to obtain the topology construction basis of the wireless ad hoc network, including:

[0019] According to the identity credibility and historical connectivity stability in the node capability information, the target node in the wireless ad hoc network is dynamically weighted to obtain a relay evaluation weight of the target node;

[0020] Based on the relay evaluation weight, the real-time communication bandwidth and the remaining energy level of the target node are multi-dimensionally fused to obtain a comprehensive relay efficiency of the wireless ad hoc network;

[0021] According to the comprehensive relay efficiency, the target node is prioritized in relay to obtain a multi-level relay sequence of the wireless ad hoc network;

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

[0023] In a preferred embodiment, the multi-dimensional fusion of the real-time communication bandwidth and the residual energy level of the target node based on the relay evaluation weight is used to obtain the comprehensive relay performance of the wireless ad hoc network, including:

[0024] The relay evaluation weight is dynamically proportionally analyzed to obtain a fusion dominant factor of the real-time communication bandwidth and the residual energy level;

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

[0026] According to the efficiency mapping relationship, the real-time communication bandwidth value and the residual energy level value are respectively mapped into a bandwidth performance index and an energy performance index;

[0027] According to the fusion dominant factor, the bandwidth performance index and the energy performance index are linearly and adaptively fused to generate the comprehensive relay performance of the target node, wherein the calculation formula of the comprehensive relay performance is as follows:

[0028] ;

[0029] In the formula, is the comprehensive relay performance, is the fusion dominant factor, is the bandwidth performance index, is the energy performance index, is an adaptive adjustment index, is the absolute difference between the energy performance index and the bandwidth performance index.

[0030] In a preferred embodiment, the candidate nodes in the wireless ad hoc network are optimized and shaped based on the topology construction basis to obtain a chain network topology of the wireless ad hoc network, including:

[0031] According to the relay priority of the target node in the topology construction basis, a trunk node sequence of the chain topology in the wireless ad hoc network is determined;

[0032] Based on the trunk node sequence, the relay performance threshold value of the candidate nodes in the wireless ad hoc network is screened to obtain a topology connection point in the wireless ad hoc network that meets a preset condition;

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

[0034] According to the effective logical link, dynamically adjusting the node arrangement order in the backbone node sequence, generating the preliminary chain network topology of the wireless ad hoc network;

[0035] Performing redundancy link elimination on the preliminary chain network topology, obtaining the chain network topology of the wireless ad hoc network.

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

[0037] Based on the effective logical link, constructing a directed graph for the actual connection relationship between adjacent nodes in the backbone node sequence, obtaining the actual connection topology graph of the backbone node sequence;

[0038] According to the actual connection topology graph, rearranging the positions of the broken and redundant nodes existing in the backbone node sequence, obtaining the optimized node sequence of the backbone node sequence;

[0039] Reconstructing the logical topology of the optimized node sequence, obtaining the preliminary chain network topology of the wireless ad hoc network.

[0040] In a preferred embodiment, the step of establishing bidirectional communication links between nodes in the chain network topology to form the preliminary communication network of the wireless ad hoc network comprises:

[0041] Based on the node connection relationship of the chain network topology, performing request-response interaction on the communication connection between upstream nodes and downstream nodes in the wireless ad hoc network, obtaining the bidirectional communication connection confirmation signal of the wireless ad hoc network;

[0042] Based on the bidirectional communication connection confirmation signal, verifying the bidirectional connectivity of the logical link between nodes in the wireless ad hoc network, obtaining the standardized bidirectional communication link of the wireless ad hoc network;

[0043] Integrating the standardized bidirectional communication link to obtain the preliminary communication network of the wireless ad hoc network.

[0044] In a preferred embodiment, the step of detecting the link communication quality of the preliminary communication network level by level to obtain the hierarchical link state of the wireless ad hoc network comprises:

[0045] Based on the chain topology structure of the preliminary communication network, determining the hierarchical detection order of the chain topology structure from the starting node to the end node;

[0046] According to the hierarchical detection sequence, a state evaluation of a two-way communication link between adjacent nodes in the preliminary communication network is performed in a hierarchical manner to obtain a communication quality parameter of the preliminary communication network;

[0047] According to the communication quality parameter, a real-time communication state of the communication link in the preliminary communication network is determined;

[0048] The real-time communication state and network hierarchy information of the preliminary communication network are collected to generate a hierarchical link state of the wireless ad hoc network.

[0049] In a preferred embodiment, the hierarchical link state is dynamically negotiated to build a stable communication path of the wireless ad hoc network, including:

[0050] The hierarchical link state is dynamically analyzed to obtain a communication bottleneck node and an unstable link existing in the preliminary communication network;

[0051] According to the location and hierarchy of the communication bottleneck node and the unstable link, an alternative path adjustment scheme of the wireless ad hoc network is generated;

[0052] The alternative path adjustment scheme is distributed to relevant nodes of the wireless ad hoc network for collaborative negotiation to determine an optimal adjustment scheme of the wireless ad hoc network;

[0053] According to the optimal adjustment scheme, a connection relationship and a data forwarding strategy of nodes in the wireless ad hoc network are reconfigured to obtain a stable node connection architecture of the wireless ad hoc network;

[0054] According to the stable node connection architecture, a stable communication path of the wireless ad hoc network is established.

[0055] To solve the above problems, the application also provides a signal-free area wireless ad hoc network building device based on a chain-shaped network, which comprises:

[0056] A collaborative fusion module is configured to collaboratively fuse an identity and a communication capability of a node in the chain-shaped network to obtain node capability information of the chain-shaped network;

[0057] A capability evaluation module is configured to evaluate a relay capability of a target node in the wireless ad hoc network based on the node capability information to obtain a topological construction basis of the wireless ad hoc network;

[0058] A topological construction module is configured to optimize and shape a candidate node in the wireless ad hoc network based on the topological construction basis to obtain a chain-shaped network topology of the wireless ad hoc network.

[0059] The network establishment module is configured to establish bidirectional communication links between nodes in the chain network topology, and form a preliminary communication network of the wireless ad hoc network.

[0060] The step-by-step detection module is configured to detect the link communication quality of the preliminary communication network step by step, and obtain the hierarchical link state of the wireless ad hoc network.

[0061] The stable path determination module is configured to dynamically negotiate the hierarchical link state, and build a stable communication path of the wireless ad hoc network.

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

[0063] 1. The wireless ad hoc network building method and device based on chain networking in a signal-free area can greatly improve the efficiency and reliability of the self-organizing network in the signal-free area. The technology generates comprehensive node capability information by synergistically integrating node identity and communication capability, dynamically allocates relay evaluation weights in combination with identity credibility and historical connectivity stability, accurately calculates the comprehensive relay performance through a formula, and sorts the topology construction basis to make the node capability evaluation more in line with the actual relay demand. Based on the basis, the topology connection points are screened, the logical link bidirectional reachability is verified, and redundant links are eliminated to generate a chain network topology, thereby guaranteeing the rationality of the topology structure from the source and laying a solid foundation for subsequent communication network building.

[0064] 2. The technical scheme has significant advantages in communication network stability and path optimization. After establishing bidirectional communication links between nodes and integrating to form a preliminary communication network, the link communication quality is detected in a hierarchical order to accurately obtain the link state of each level. By dynamically analyzing and positioning the communication bottleneck nodes and unstable links, an alternative solution is generated, and the optimal adjustment strategy is determined through node coordination negotiation. The node connection relationship and data forwarding strategy are reconfigured, and the finally built stable communication path can effectively reduce the data transmission interruption and delay problem, fully meet the demand for continuous and stable communication in the signal-free area, and improve the overall operation efficiency of the self-organizing network. BRIEF DESCRIPTION OF DRAWINGS

[0065] Figure 1 A flowchart of a wireless ad hoc network building method based on chain networking in a signal-free area is provided for an embodiment of the present application.

[0066] Figure 2 A functional module diagram of a wireless ad hoc network building device based on chain networking in a signal-free area is provided for an embodiment of the present application.

[0067] The implementation, functional features and advantages of the present application will be further described with reference to the embodiments and the accompanying drawings. DETAILED DESCRIPTION

[0068] It should be understood that the specific embodiments described herein are merely exemplary and do not limit the application.

[0069] The embodiment of the present application provides a signal-free area wireless ad hoc network construction method based on chain networking. The execution subject of the signal-free area wireless ad hoc network construction method based on chain networking includes but is not limited to at least one of electronic devices such as a server, a terminal, and the like, which can be configured to execute the method provided by the embodiment of the present application. In other words, the signal-free area wireless ad hoc network construction method based on chain networking can be executed by software or hardware installed in 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, and the like. The server can be a stand-alone server, or a cloud server providing cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, content distribution networks (CDN), and basic cloud computing services such as big data and artificial intelligence platforms.

[0070] Referring to Figure 1 FIG. 1 shows a flowchart of a signal-free area wireless ad hoc network construction method based on chain networking provided by an embodiment of the present application. In the embodiment, the signal-free area wireless ad hoc network construction method based on chain networking includes the following steps.

[0071] S1. Cooperatively fusing the identity identification and communication capability of a node in chain networking to obtain node capability information of the chain networking;

[0072] In the embodiment of the present application, the cooperatively fusing the identity identification and communication capability of a node in chain networking to obtain node capability information of the chain networking includes:

[0073] Extracting identity identification features of a node in chain networking to obtain identity information of the node;

[0074] Analyzing node types and role attributes in the identity information of the node to generate identity description data of the node;

[0075] Monitoring communication signal strength and channel availability of the node in the chain networking to obtain communication capability parameters of the node;

[0076] Associating and mapping the identity description data and the communication capability parameters to form node comprehensive capability identification of the chain networking;

[0077] According to the node comprehensive capability identification, constructing node capability information of the chain networking.

[0078] Specifically, when extracting the identity features of the nodes in the chain network, all nodes to be analyzed in the network are first determined, and the unique hardware identifier of each node, such as the serial number and MAC address, is obtained through a node hardware identifier reading module. Then, the preset network identifier, such as a fixed number and a 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 nodes, which is the identity information of the nodes.

[0079] Further, when analyzing the node type and role attribute in the node identity information, the node type related field is filtered from the identity information. If the field contains keywords such as "collection node", "forwarding node", and "control node", the type is directly determined. If there is no direct annotation, the function description field is analyzed, such as "responsible for data collection and preliminary upload" corresponding to a collection node, "responsible for data transmission" corresponding to a forwarding node, and "responsible for network control" corresponding to a control node. Then, the node type and role attribute are recorded in a structured text to generate the identity description data of the node.

[0080] Further, when monitoring the communication signal strength and channel availability of the nodes in the chain 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 waveform of the communication between the node and the adjacent node, measures the peak amplitude, and compares it with the preset reference standard to convert it into a quantized value in dBm units, which is the communication signal strength data. The channel detection unit scans all available communication channels and records the number of disturbances and the duration of transmission interruptions in a preset time period. If there is no disturbance or interruption, the channel is available. If there is a disturbance or interruption, the frequency and proportion are determined to determine the availability of the channel. The available channel quantity, identifier, and disturbance interruption situation are integrated to form the channel availability data, and the two types of data are combined to obtain the communication capability parameters of the node.

[0081] Further, when associating and mapping the identity description data and the communication capability parameters, a rule is first established to determine the correspondence between the identity description field and the communication capability parameter, such as the association of high signal strength parameters with collection nodes and the association of multiple available channel parameters with core role nodes. According to the rule, the node type and role attribute are matched with the communication signal strength and channel availability, such as the binding of "-70dBm signal strength + 2 available channels" for "collection node + edge role". A unique identification code is assigned to each binding combination, with the first half representing the node type and role and the second half representing the signal strength level and the number of available channels, forming the node comprehensive capability identifier of the chain network.

[0082] Further, according to the node comprehensive capability identifier, a storage structure containing a node unique identifier, a node comprehensive capability identifier, an identity description detail, and a communication capability detail field is created. The node unique hardware or network identifier, the comprehensive capability identifier, the identity description data, and the communication capability parameter are respectively filled into the corresponding fields, all node information is summarized, and the structured data set containing all node capability related information is formed according to the position or number order of the nodes in the networking, which is the node capability information of the chain-shaped networking.

[0083] In general, the identity information of the nodes in the chain-shaped networking is obtained by extracting the identity features of the nodes, that is, the hardware identifiers such as the factory serial number MAC address and the network identifiers such as the subnet identifier of the fixed number, and the two types of identifiers are integrated to form information that can uniquely distinguish the nodes.

[0084] In general, the identity description data of the nodes is generated by analyzing the node type and role attribute in the identity information of the nodes, that is, the keywords such as the collection node, the forwarding node, and the control node are filtered from the identity information to determine the node type, and the role attribute is determined by analyzing the function description field when there is no direct annotation, and the data is generated in the form of structured text record.

[0085] In general, the communication capability parameter of the nodes in the chain-shaped networking is obtained by monitoring the communication signal strength and channel availability of the nodes, that is, the signal strength monitoring unit and the channel detection unit are deployed on the nodes, the former converts the signal peak amplitude into a quantized value in dBm unit, and the latter scans the channel to determine the availability by counting the number of disturbances and the duration of interruptions, and the two types of data are integrated to form the parameter.

[0086] In general, the node comprehensive capability identifier of the chain-shaped networking is formed by associating and mapping the identity description data and the communication capability parameter, that is, the association rule is established, the node type and role attribute are matched with the communication signal strength and channel availability according to the rule, and a unique identifier code containing the identity and communication capability features is assigned to each matching combination.

[0087] In general, the node capability information of the chain-shaped networking is constructed according to the node comprehensive capability identifier, that is, a storage structure containing a node unique identifier, a node comprehensive capability identifier, an identity description detail, and a communication capability detail field is created, the corresponding information of each node is filled in, and the structured data set is formed by summarizing and arranging according to the position or number order of the nodes.

[0088] 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;

[0089] In the embodiment of the present application, the node capability information is used to evaluate the relay capability of the target node in the wireless ad hoc network, and the topology construction basis of the wireless ad hoc network is obtained, comprising:

[0090] According to the identity credibility and the historical communication stability in the node capability information, the dynamic weight distribution of the target node in the wireless ad hoc network is performed, and the relay evaluation weight of the target node is obtained;

[0091] 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;

[0092] According to the comprehensive relay efficiency, the relay priority of the target node is sorted, and the multi-level relay sequence of the wireless ad hoc network is obtained;

[0093] The multi-level relay sequence is cooperatively corrected, and the topology construction basis of the wireless ad hoc network is obtained.

[0094] The relay evaluation weight is used to multi-dimensionally fuse the real-time communication bandwidth and the residual energy level of the target node, and the comprehensive relay efficiency of the wireless ad hoc network is obtained, comprising:

[0095] The relay evaluation weight is dynamically proportionally analyzed, and the fusion dominant factor of the real-time communication bandwidth and the residual energy level is obtained;

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

[0097] According to the efficiency mapping relationship, 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;

[0098] According to the fusion dominant factor, the bandwidth efficiency index and the energy efficiency index are linearly adaptively fused to generate the comprehensive relay efficiency of the target node, wherein the calculation formula of the comprehensive relay efficiency is as follows:

[0099] ;

[0100] In the formula, is the comprehensive relay efficiency, is the fusion dominant factor, is the bandwidth efficiency index, is the energy efficiency index, is an adaptive adjustment index, is the absolute difference between the energy efficiency index and the bandwidth efficiency index.

[0101] Specifically, the identity credibility of each target node is extracted from the node capability information, which is determined according to the verification result of the node identity, and the official authentication and no tampering record are high, and the information is fuzzy or tampered with. The higher the proportion of stable connection time in the past fixed time, the higher the stability. Set the dynamic weight rule: when the identity credibility and stability are high, the weight proportion is 40% and 60% respectively; when one is high and the other is medium or both are medium, the proportion is 50%; when any dimension is low, the low dimension is 20% and the other dimension is 80%. The comprehensive weight value is calculated according to the actual grade of the node, that is, the relay evaluation weight of the target node.

[0102] Further, the real-time communication bandwidth and the remaining energy level of each target node are obtained from the node capability information, the real-time communication bandwidth is the upper limit of the current stable data transmission rate of the node, which is determined by monitoring the data transmission process, and the remaining energy level is the percentage of the remaining battery power, which is determined by reading the real-time power. According to the relay evaluation weight, the contribution proportion is determined: when the weight is high, the real-time communication bandwidth accounts for 60% and the remaining energy level accounts for 40%; when the weight is medium, both account for 50%; when the weight is 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, which is converted according to the highest real-time communication bandwidth that the node in the ad hoc network can reach, and the remaining energy level is directly used as a percentage score. The standardized real-time communication bandwidth score and the remaining energy level score are multiplied by the corresponding contribution proportion and added, and the result is the comprehensive relay efficiency of the wireless ad hoc network.

[0103] Further, the comprehensive relay efficiency of all target nodes is collected, and the target nodes are arranged in order from large to small. When the comprehensive relay efficiency values of two or more target nodes are the same, the historical connection stability of these nodes is compared first, and the node with higher historical connection stability is arranged in a more forward position; if the historical connection stability is also the same, the identity credibility of the node is compared, and the node with higher identity credibility is arranged in a more forward position. In this way, all target nodes are arranged in an ordered list, and the target node in the list is arranged in a more forward position, and the relay priority is higher. The list is the multi-level relay sequence of the wireless ad hoc network.

[0104] Further, the communication reachability between two adjacent target nodes in the multi-stage relay sequence is checked, test signals are sent to the two adjacent target nodes respectively, if both nodes can successfully receive the test signals of the other party and return feedback information, it is determined that the communication is reachable; if any node cannot receive the test signal or cannot return the feedback information, it is determined that the communication is unreachable. For the pair of adjacent nodes that are not communicable, find other target nodes that can achieve communication reachability with both nodes from the node capability information, insert them between the two unreachable nodes, and adjust the positions of the nodes after the insertion position in the original sequence one by one. Check whether there is an isolated node in the sequence, an isolated node refers to a node that can only communicate with one adjacent node in the sequence and cannot communicate with other nodes. For such nodes, replace them with target nodes that can communicate with the isolated node and more nodes in the sequence from the node capability information; if no suitable replacement node can be found, remove the isolated node from the sequence, and adjust the positions of all nodes after the removed node one by one. Compare the communication coverage range of all nodes in the corrected sequence with the service area of the wireless ad hoc network, if there is an uncovered area, select a target node that can cover the area and has a comprehensive relay performance meeting the requirements from the node capability information, and add it to the corresponding position in the sequence. After the above processing, the final multi-stage relay sequence obtained is the basis for the topology construction of the wireless ad hoc network.

[0105] Specifically, it is determined that the value range of the relay evaluation weight is 0 to 100, the weight is a comprehensive value determined based on the identity credibility and historical communication stability of the target node, and is used to reflect the basic adaptation ability of the node in the relay task. A dynamic proportion analysis rule is set, if the relay evaluation weight is between 80 and 100, it means that the node is excellent in identity verification and historical communication performance, at this time the fusion proportion corresponding to the real-time communication bandwidth is set to 70%, and the fusion proportion corresponding to the remaining energy level is set to 30%, the two proportions are directly used as the fusion dominant factor of the real-time communication bandwidth and the remaining energy level; if the relay evaluation weight is between 50 and 79, it means that the node has a medium comprehensive performance, the fusion proportions of the real-time communication bandwidth and the remaining energy level are both set to 50% to form the corresponding fusion dominant factor; if the relay evaluation weight is between 0 and 49, it means that the node has a weak comprehensive performance, and the energy support needs to be prioritized to avoid frequent offline, the fusion proportion of the real-time communication bandwidth is set to 30%, and the fusion proportion of the remaining energy level is set to 70% to determine the corresponding fusion dominant factor. Through the analysis process, the fusion dominant factor of the real-time communication bandwidth and the remaining energy level is directly obtained.

[0106] Further, the historical real-time communication bandwidth data and the historical residual energy level data of all target nodes in the wireless ad hoc network in the past 30 days are collected, and it is statistically concluded that the common value range of the real-time communication bandwidth is 1 Mbps to 20 Mbps, and the common value range of the residual energy level is 10% to 100%. According to the fusion dominant factor to determine the focus direction of the performance mapping, if the real-time communication bandwidth occupies a higher proportion in the fusion dominant factor, when establishing the mapping relationship, the real-time communication bandwidth value is divided into more detailed intervals, specifically, 1 Mbps to 5 Mbps is the low bandwidth interval, 6 Mbps to 15 Mbps is the medium bandwidth interval, and 16 Mbps to 20 Mbps is the high bandwidth interval, each interval corresponds to a different performance level; at the same time, the residual energy level is divided into 10% to 40% as the low energy interval, 41% to 70% as the medium energy interval, and 71% to 100% as the high energy interval, to ensure that the bandwidth interval division precision is higher than the energy interval. If the residual energy level occupies a higher proportion in the fusion dominant factor, then the reverse operation is performed, and the residual energy level is divided into more detailed intervals, and the real-time communication bandwidth is divided into coarser intervals. If the proportions of the two are the same, then the real-time communication bandwidth and the residual energy level are both divided into low, medium and high intervals with the same precision, and each interval has similar coverage. By clearly defining the correspondence between the data interval and the performance level, the performance mapping relationship between the real-time communication bandwidth and the residual energy level is established.

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

[0108] Further, first confirm the proportion of real-time communication bandwidth and the proportion of residual energy level in the fusion dominant factor, for example, the fusion dominant factor is that real-time communication bandwidth accounts for 60%, and residual energy level accounts for 40%. Then calculate the contribution value of each performance index, multiply the bandwidth performance index by the proportion corresponding to the real-time communication bandwidth to obtain the bandwidth performance contribution value, for example, the bandwidth performance index is 70, and 70 multiplied by 60% obtains the bandwidth performance contribution value of 42; multiply the energy performance index by the proportion corresponding to the residual energy level to obtain the energy performance contribution value, for example, the energy performance index is 80, and 80 multiplied by 40% obtains the energy performance contribution value of 32. Then add the bandwidth performance contribution value and the energy performance contribution value to obtain the sum, which is the comprehensive relay performance of the target node, for example, 42 plus 32 obtains 72, and 72 is the comprehensive relay performance of the target node. If the proportions of the two in the fusion dominant factor are both 50%, then directly add the bandwidth performance index and the energy performance index and divide by 2 to obtain the comprehensive relay performance; if the proportion of real-time communication bandwidth is 30% and the proportion of residual energy level is 70%, then add the contribution values calculated according to the corresponding proportions to ensure that the contribution proportions of the two are adjusted according to the fusion dominant factor during the fusion process, and finally generate the comprehensive relay performance of the target node.

[0109] Specifically, the fusion dominant factor is the fusion proportion of real-time communication bandwidth and residual energy level obtained by dynamically proportionally analyzing the relay evaluation weight, the bandwidth performance index is a result obtained by mapping the real-time communication bandwidth value according to the performance mapping relationship, the energy performance index is a result obtained by mapping the residual energy level value according to the performance mapping relationship, the adaptive adjustment index is a fixed value set according to the network load of the wireless ad hoc network, the index takes a larger value when the network load is higher, and the index takes a smaller value when the network load is lower, and the absolute difference between the energy performance index and the bandwidth performance index is a result obtained by calculating the difference between the energy performance index and the bandwidth performance index and taking the absolute value.

[0110] Further, the meaning of the formula is to comprehensively consider the fusion dominant factor, the bandwidth performance index, the energy performance index, and the absolute difference between the two, to quantitatively evaluate the relay capability of the target node, and the comprehensive relay performance obtained can fully reflect the comprehensive performance of the target node in terms of real-time communication bandwidth and residual energy level, thereby providing an accurate quantitative basis for subsequent relay priority sorting of the target node.

[0111] Further, when the fusion dominant factor is biased to real-time communication bandwidth, the bandwidth performance index has a greater impact on the comprehensive relay performance, and with the increase of the bandwidth performance index, the comprehensive relay performance shows an upward trend, while the change of the energy performance index has a relatively small impact on the comprehensive relay performance; when the fusion dominant factor is biased to the remaining energy level, the energy performance index has a greater impact on the comprehensive relay performance, and with the increase of the energy performance index, the comprehensive relay performance shows an upward trend, while the change of the bandwidth performance index has a relatively small impact on the comprehensive relay performance; when the absolute difference between the bandwidth performance index and the energy performance index increases, no matter which side the fusion dominant factor is biased to, the comprehensive relay performance will show a downward trend, and the greater the adaptive adjustment index, the more obvious this downward trend; when the bandwidth performance index and the energy performance index increase at the same time, the comprehensive relay performance will increase significantly, and vice versa.

[0112] In summary, the relay evaluation weight is obtained by dynamically allocating weights to the target nodes of the wireless ad hoc network according to the identity credibility and historical connectivity stability in the node capability information, which determines the weight proportion by combining the identity credibility and the historical connectivity stability. The identity credibility is determined by official authentication and non-tampering, and the historical connectivity stability is determined by the proportion of stable connection time. When both are high, the identity credibility accounts for 40% and the historical connectivity stability accounts for 60%. When one is high and the other is medium or both are medium, they both account for 50%. When either dimension is low, the low dimension accounts for 20% and the other dimension accounts for 80%. Then the comprehensive weight value of each target node is calculated by combining the actual grade of the node.

[0113] In summary, the comprehensive relay performance of the wireless ad hoc network is obtained by multi-dimensionally fusing the real-time communication bandwidth and the remaining energy level of the target nodes based on the relay evaluation weight, which determines the fusion proportion by the relay evaluation weight. When the weight is high, the real-time communication bandwidth accounts for 60% and the remaining energy level accounts for 40%. When the weight is medium, both account for 50%. When the weight is low, the real-time communication bandwidth accounts for 40% and the remaining energy level accounts for 60%. The real-time communication bandwidth is converted to a percentage score in proportion to the highest bandwidth, and the remaining energy level is converted to a percentage score. Then the fusion evaluation value is obtained by weighted summation according to the proportion.

[0114] In summary, the multi-level relay sequence of the wireless ad hoc network is obtained by ranking the relay priority of the target nodes according to the comprehensive relay performance, which collects the comprehensive relay performance of all target nodes, arranges them from large to small, compares the historical connectivity stability when the values are the same, arranges the nodes with high historical connectivity stability in the front, and compares the identity credibility when the values are still the same, arranges the nodes with high identity credibility in the front, and arranges the nodes into an ordered list in this way.

[0115] Overall, the multi-stage relay sequence is corrected cooperatively to obtain the basis for the topology construction of the wireless ad hoc network, that is, the communication reachability of adjacent nodes is verified first, test signals are exchanged with adjacent nodes, and if both can receive feedback, it is reachable, otherwise, a node that can communicate with both is inserted and the position of the subsequent node is adjusted, then isolated nodes are processed, isolated nodes can only communicate with one adjacent node, and nodes that can communicate with more nodes are used to replace or directly remove and adjust the order, finally, the node coverage range and service area are compared, and nodes that meet the performance requirements are added to the uncovered area, and the final multi-stage relay sequence is formed after correction.

[0116] Overall, the dynamic proportional analysis of the relay evaluation weight obtains the fusion dominant factor of real-time communication bandwidth and residual energy level, which is to determine that the relay evaluation weight value range is 0 to 100, to determine the fusion proportion of real-time communication bandwidth and residual energy level according to different intervals of 80 to 100, 50 to 79 and 0 to 49, and these proportions are the fusion dominant factor.

[0117] Overall, the performance mapping relationship between real-time communication bandwidth and residual energy level is established based on the fusion dominant factor, which is to collect the historical data of the target node in the past 30 days to determine the common value range of the two, to determine the mapping emphasis according to the fusion dominant factor, to divide more detailed intervals for parameters with high proportion, and to divide the same precision interval for parameters with the same proportion, and to determine the correspondence between the interval and the performance level.

[0118] Overall, the real-time communication bandwidth value and the residual energy level value are respectively mapped into bandwidth performance index and energy performance index according to the performance mapping relationship, which is to obtain the current real-time communication bandwidth value and the residual energy level value of the node, to compare the mapping relationship and to match the preset index, and the boundary value is attributed according to the left-closed right-open rule.

[0119] Overall, the comprehensive relay performance of the target node is generated by linearly and adaptively fusing the bandwidth performance index and the energy performance index according to the fusion dominant factor and combining the formula, which is to calculate the contribution value by determining the fusion proportion of the two according to the fusion dominant factor and to add them, and to calculate the comprehensive relay performance by substituting the formula, combining the fusion dominant factor, the double index, the absolute difference between the two and the adaptive adjustment index set according to the network load.

[0120] S3. Based on the topology construction basis, the candidate nodes in the wireless ad hoc network are optimized and shaped to obtain the chain network topology of the wireless ad hoc network.

[0121] In the embodiment of the application, based on the topology construction basis, the candidate nodes in the wireless ad hoc network are optimized and shaped to obtain the chain network topology of the wireless ad hoc network, which includes:

[0122] According to the topology construction, the relay priority of the target node is determined, and a backbone node sequence of the chain topology in the wireless ad hoc network is determined.

[0123] Based on the backbone node sequence, relay performance threshold screening is performed on candidate nodes in the wireless ad hoc network, and a topology connection point in the wireless ad hoc network that meets a preset condition is obtained.

[0124] Based on the communication coverage range of the topology connection point, bidirectional reachability verification is performed on the logical link between adjacent nodes in the wireless ad hoc network, and an effective logical link of the wireless ad hoc network is obtained.

[0125] According to the effective logical link, the arrangement order of the nodes in the backbone node sequence is dynamically adjusted, and a preliminary chain network topology structure of the wireless ad hoc network is generated.

[0126] The preliminary chain network topology structure is subjected to redundant link elimination, and a chain network topology of the wireless ad hoc network is obtained.

[0127] The preliminary chain network topology structure is subjected to redundant link elimination, and a chain network topology of the wireless ad hoc network is obtained.

[0128] Based on the effective logical link, a directed graph is constructed based on the actual connection relationship between adjacent nodes in the backbone node sequence, and an actual connection topology graph of the backbone node sequence is obtained.

[0129] According to the actual connection topology graph, the positions of the broken and redundant nodes existing in the backbone node sequence are rearranged, and an optimized node sequence of the backbone node sequence is obtained.

[0130] The optimized node sequence is subjected to logical topology reconstruction, and a preliminary chain network topology structure of the wireless ad hoc network is obtained.

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

[0132] Further, the comprehensive relay performance of the backbone nodes is obtained, and the average value is calculated as the relay performance threshold. The comprehensive relay performance of all candidate nodes is extracted, and the nodes greater than or equal to the threshold are retained and sorted into a set containing node identifiers and comprehensive relay performance, as the topology connection points that meet the conditions.

[0133] Further, the communication coverage range data of each topology connection point is acquired, and other nodes within the coverage range are determined as adjacent nodes. Test signals are exchanged between adjacent nodes, and if the feedback is received within 1 second, the link is verified, and the verified links are integrated to form an effective logical link.

[0134] Further, the node with the highest priority is taken as the starting node, and the adjacent node with the highest comprehensive relay performance is accessed in sequence along the effective logical link until all the nodes form a preliminary arrangement. Non-main nodes are accessed to adjacent nodes that have been accessed along the effective logical link, and the connection relationship is presented by a visual chart to form a preliminary chain-like network topology.

[0135] Further, the link that has two or more independent links or is still connected after being disconnected is determined as a redundant link. The links are traversed, and the redundant links are eliminated according to the rule of “retaining the link containing nodes with high comprehensive relay performance”, and the final chart containing nodes, effective links and connection relationships is formed, which is the chain-like network topology.

[0136] Specifically, on the blank canvas of the drawing tool, the main nodes are represented by circular icons and labeled with unique identifiers, the effective logical links connecting the main nodes are selected, the line segments with double-headed arrows are drawn according to the bidirectional reachability and labeled with link identifiers and “effective” status, and no line segment is drawn if there is no connection, thereby forming an actual connection topology chart.

[0137] Further, the actual connection topology chart is checked, the adjacent main nodes connected by a line segment without a double-headed arrow are determined as broken, a node capable of forming an effective connection with the two ends of the broken line is inserted, and the link is supplemented; a node that forms two or more effective links with other non-adjacent nodes in addition to the front and rear connections is determined as a redundant node, which is moved to the place with the most connections, and an optimized node sequence is formed.

[0138] Further, the first node in the optimized node sequence is taken as the starting point, and the node circular icons are drawn in sequence on a new canvas and labeled with identifiers, and the adjacent nodes are connected by line segments with double-headed arrows to form a straight main chain link. The non-main nodes are connected according to their effective logical links, and the corresponding main nodes are drawn beside them, and all the identifiers and link annotations are checked to form a preliminary chain-like network topology.

[0139] In summary, according to the topology construction, the relay priority of the target node is used to determine the main node sequence of the chain-like topology in the wireless ad hoc network. The relay priority sorting result is extracted from the multi-level relay sequence used as the basis for topology construction, the number of main nodes is determined by 30% of the total number and rounded up, the corresponding nodes are selected according to the priority from high to low, and the ordered list containing node identifiers and relay priorities is formed, which guarantees that the main nodes have strong relay capabilities and lays the core framework for the chain-like topology.

[0140] In summary, the candidate nodes in the wireless ad hoc network are screened based on the backbone node sequence to obtain the topology connection points meeting the preset conditions, the comprehensive relay performance of the backbone nodes is obtained, the average value is calculated as the relay performance threshold, the comprehensive relay performance of all candidate nodes is extracted and compared with the threshold, the candidate nodes greater than or equal to the threshold are reserved, a set containing the node identifier and the comprehensive relay performance is formed, and it is ensured that the topology connection points meet the basic requirements of relay capability.

[0141] In summary, the bidirectional reachability of the logical link between the adjacent nodes in the wireless ad hoc network is verified based on the communication coverage range of the topology connection points to obtain the effective logical link, the communication coverage range data of each topology connection point is obtained, other nodes in the coverage range are determined as adjacent nodes, test signals are exchanged with the adjacent nodes, and bidirectional receiving feedback is verified within 1 second, the links with bidirectional reachability are reserved and arranged into a set containing the node identifier and the link state, and it is ensured that the link has stable communication foundation.

[0142] In summary, the node arrangement order in the backbone node sequence is dynamically adjusted according to the effective logical link to generate the preliminary chain network topology structure of the wireless ad hoc network, the backbone node arrangement order is determined from the effective logical link according to the principle of priority of comprehensive relay performance, the non-backbone topology connection points are accessed to the adjacent nodes that have been accessed, the node connection relationship and arrangement order are presented by a visual chart, a preliminary topology structure with backbone links and branch nodes is formed, and it is ensured that the topology structure meets the basic form of chain networking.

[0143] In summary, the preliminary chain network topology structure is subjected to redundant link elimination to obtain the chain network topology of the wireless ad hoc network, the links with two or more independent links or still connected after being disconnected are determined as redundant links, the redundant links are deleted according to the rule of retaining the link where the node with high comprehensive relay performance is located, and a final chart containing nodes, effective links and connection relationships is arranged, so as to reduce resource waste and improve the stability of the topology structure.

[0144] In summary, the actual connection relationship between the adjacent nodes in the backbone node sequence is constructed based on the effective logical link to obtain the actual connection topology graph of the backbone node sequence, in a 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 screened, the line segments with bidirectional arrows are drawn according to the bidirectional reachability of the links and labeled with the link identifier and the effective state, and if there is no effective link, the line segment is not drawn, a graph intuitively presenting the node connection relationship is formed, and a clear visual basis is provided for subsequent node adjustment.

[0145] In general, according to the actual connection topology map, the break and redundant nodes existing in the backbone node sequence are rearranged in position to obtain the optimized node sequence of the backbone node sequence, the adjacent nodes without the connection of the bidirectional arrow line segment in the topology map are determined as the break, the node capable of forming effective connection with the nodes at both ends of the break is inserted; the node determined to form two or more effective links with other non-adjacent nodes in addition to the connection with the front and rear nodes is the redundant node, which is moved to the position with the most connection nodes, and the nodes are arranged in the list according to the new order, so as to solve the problems of node connection break and redundancy in the sequence.

[0146] In general, the logical topology reconstruction of the optimized node sequence obtains the preliminary chain network topology structure of the wireless ad hoc network, the first node of the optimized sequence is taken as the starting point, the node circular icon is drawn in sequence and the identification is labeled, the adjacent nodes are connected by the bidirectional arrow line segment and the link information is labeled to form the backbone link, the non-backbone topology connection point is connected to the adjacent backbone node according to the effective logical link, and the complete figure is formed after checking all node identifications and link information, so as to construct the preliminary topology which meets the chain shape and is stable in connection.

[0147] S4. Establishing the bidirectional communication link between the nodes in the chain network topology to form the preliminary communication network of the wireless ad hoc network;

[0148] In the embodiment of the application, the establishment of the bidirectional communication link between the nodes in the chain network topology to form the preliminary communication network of the wireless ad hoc network comprises:

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

[0150] Based on the bidirectional communication connection confirmation signal, the effectiveness of the bidirectional connectivity of the logical link between the nodes in the wireless ad hoc network is verified, so as to obtain the standardized bidirectional communication link of the wireless ad hoc network;

[0151] The standardized bidirectional communication link is integrated to obtain the preliminary communication network of the wireless ad hoc 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] Generally, the node connection relationship based on the chain network topology is used to obtain the bidirectional communication connection confirmation signal through the request-response interaction between the upstream node and the downstream node, the upstream node in the chain structure is determined first, the upstream node sends a connection request containing its own identification and verification information, the downstream node returns a response signal after verification, the upstream node records the successful interaction after checking, a signal containing node identification, interaction time and confirmation state is formed to ensure the effectiveness of the initial connection between nodes.

[0156] Generally, the bidirectional connectivity of the logical link between nodes is verified based on the bidirectional communication connection confirmation signal to obtain the standardized bidirectional communication link, the node pairs and corresponding links of the successful interaction are extracted, the nodes exchange short messages containing random verification codes at a fixed frequency and verify the transmission and matching, the link is determined to be effective after continuous verification, the information of the two end nodes and the link type is recorded in a unified format, a standardized link set is formed to ensure the stability of the bidirectional communication of the link.

[0157] Generally, the preliminary communication network of the wireless ad hoc network is obtained by networking and integrating the standardized bidirectional communication link, a framework containing network identification, communication protocol version and other parameters is created, all node information is recorded to form a node information table, the standardized link is associated with the corresponding node to establish a mapping relationship, the communication rules such as backbone link priority and data transmission order are configured, a network model showing the node connection mode, communication path and operation rules is integrated, and a preliminary network with basic communication function is constructed.

[0158] S5. 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.

[0159] In the embodiment of the application, 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:

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

[0161] According to the hierarchical detection order, the state of the bidirectional communication link between adjacent nodes in the preliminary communication network is evaluated level by level to obtain the communication quality parameter of the preliminary communication network;

[0162] According to the communication quality parameter, the real-time communication state of the communication link in the preliminary communication network is determined;

[0163] 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.

[0164] Specifically, based on the chain topology of the preliminary communication network, the starting node and the terminal node are determined in the chain topology, the starting node is the first node of the chain structure, and the terminal node is the last node. According to the node arrangement order, the starting node is marked as the first level detection node, the next node directly connected to it is marked as the second level detection node, and so on until the terminal node. The level number of each node is consistent with its position order. The level of the bidirectional communication link between adjacent nodes is the same as that of the upstream node, such as the link between the first level and the second level nodes is the first level detection link, and all link levels are determined in this way. An ordered list is formed in the order of the first level to the last level detection link, which is the hierarchical detection order.

[0165] Further, when evaluating the state of the bidirectional communication link between adjacent nodes according to the hierarchical detection order, the first level detection link is selected first, and the communication quality detection module of the two end nodes is started. The detection module records the bidirectional data transmission within 1 minute, calculates the transmission success rate as the ratio of the number of successful transmissions to the total number of transmissions, calculates the transmission delay as the average of each transmission time interval, and calculates the transmission error number as the number of data loss or errors. After completing the first level evaluation, the same detection is performed on the subsequent links in order, and the transmission success rate, transmission delay, and transmission error number of each link are recorded. All link data are sorted by level to form a data set containing link level, transmission success rate, transmission delay, and transmission error number, which is the communication quality parameter.

[0166] Further, according to the communication quality parameter to determine the real-time state of the communication link, the determination criteria are set as follows: a link with a transmission success rate ≥ 95%, a transmission delay ≤ 100 milliseconds, and a transmission error number of 0 is in an optimal state; a link with a transmission success rate of 90%-94%, a transmission delay of 101-200 milliseconds, and a transmission error number ≤ 3 is in a good state; a link with a transmission success rate of 80%-89%, a transmission delay of 201-500 milliseconds, and a transmission error number of 4-10 is in a medium state; a link with a transmission success rate < 80%, a transmission delay > 500 milliseconds, or a transmission error number > 10 is in a poor state. The parameters of each link are compared with the criteria one by one, and the real-time state is strictly determined according to the interval that meets the criteria, such as a link with a transmission success rate of 96%, a delay of 80 milliseconds, and an error number of 0 is in an optimal state, and a link with a transmission success rate of 85%, a delay of 300 milliseconds, and an error number of 5 is in a medium state. The link identification is associated with the real-time state and recorded to form a list, which is the real-time communication state of the communication link.

[0167] Further, when generating the hierarchical link state by collecting the real-time communication state and the network level information, the network level information is extracted from the preliminary 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 state of each link is matched with the network level information according to the link level and is classified into the corresponding level. The link states in each level are summarized and counted to calculate the number of excellent, good, medium and poor state links and the proportion of the number in the total number of links in the level, such as 2 excellent links, 2 good links and 1 medium link in 5 links in the second level, and the statistics are 40% excellent, 40% good, 20% medium and 0% poor. The network level information, the real-time state of each link and the statistical results of each level are integrated to form a structured document containing level division, link state details and statistical data, which is the hierarchical link state of the wireless ad hoc network.

[0168] In general, the hierarchical detection order from the starting node to the end node is determined based on the chain topology structure of the preliminary communication network. The first node of the chain structure is determined as the starting node, the last node is determined as the end node, the node is marked with a level number according to the node arrangement order, the link level between adjacent nodes is consistent with the level of the upstream node, and an ordered detection list is formed according to the link level from low to high, which provides a clear and ordered execution basis for subsequent step-by-step detection and avoids omission or repetition caused by chaotic detection order.

[0169] In general, the communication quality parameters are obtained by performing step-by-step state evaluation on the bidirectional communication links between adjacent nodes according to the hierarchical detection order. Each link is selected in turn according to the detection order, the transmission success rate, the transmission delay and the transmission error number in a fixed time period are recorded by the detection module, and all the data of the links are sorted according to the level to form a data set containing the link level, the transmission success rate, the transmission delay and the transmission error number, which provides accurate quantitative data support for subsequent link state determination and avoids deviation caused by subjective evaluation.

[0170] In general, the real-time communication state of the communication link in the preliminary communication network is determined according to the communication quality parameters. The transmission success rate, the transmission delay and the transmission error number of each link are compared with the preset interval corresponding to different states, and the link is determined as excellent, good, medium and poor according to the interval that meets the requirements. The link identification is associated with the corresponding state to ensure the objectivity and consistency of the link state determination and to provide a clear basis for subsequent link operation.

[0171] In summary, the real-time communication status and the network level information of the preliminary communication network are collected to generate the hierarchical link state of the wireless ad hoc network, the level of the nodes and links in the network level information and the number of nodes and links in each level are extracted, the real-time status of each link is matched and classified according to the level, the number and proportion of links in different states in each level are counted, the network level information, the link state details and the statistical results are integrated to form a structured document, and the operation of the links in each level is comprehensively presented to provide a complete link state reference for subsequent dynamic negotiation of stable communication paths.

[0172] S6. dynamically negotiating the hierarchical link state to build a stable communication path of the wireless ad hoc network.

[0173] In the embodiment of the application, the dynamic negotiation of the hierarchical link state to build a stable communication path of the wireless ad hoc network comprises:

[0174] The hierarchical link state is dynamically analyzed to obtain the communication bottleneck nodes and unstable links existing in the preliminary communication network;

[0175] According to the positions and levels of the communication bottleneck nodes and unstable links, an alternative path adjustment scheme of the wireless ad hoc network is generated;

[0176] The alternative path adjustment scheme is distributed to the related nodes of the wireless ad hoc network for collaborative negotiation to determine an optimal adjustment scheme of the wireless ad hoc network;

[0177] According to the optimal adjustment scheme, the connection relationship and data forwarding strategy of the nodes in the wireless ad hoc network are reconfigured to obtain a stable node connection architecture of the wireless ad hoc network;

[0178] According to the stable node connection architecture, a stable communication path of the wireless ad hoc network is established.

[0179] Specifically, when the hierarchical link state is dynamically analyzed, the real-time communication status and the level of all links are extracted, and the poor status links are selected as unstable links. The proportion of unstable links of each node is counted, and the node with a proportion of 50% or more is determined as a communication bottleneck node. The identification, level and associated unstable link information of the bottleneck node are recorded, and the identification, level and state parameters of the two end nodes of the unstable link are recorded to form an analysis result, and the bottleneck node and the unstable link in the preliminary communication network are determined.

[0180] Further, when generating the alternative path adjustment scheme, first determine the location of the bottleneck node and unstable link in the chain topology and the influence range on data transmission. For the bottleneck node, find a non-bottleneck node with higher comprehensive relay performance from the same level or adjacent level as a replacement node, and design a link switching scheme; for the unstable link, first check the good and excellent state stable links of the nodes at the same level or adjacent level, and if there is, design a switching scheme, and if not, select the nodes at the adjacent level as relays to build a new bypass path. Classify and organize all schemes, and each scheme contains adjustment object, replacement node or new link information, path change details and expected effect.

[0181] Further, when determining the optimal scheme through coordination and negotiation, distribute the scheme to the relevant nodes according to the node range involved in the scheme. The nodes evaluate whether the replacement node or new link is within their own communication coverage, has sufficient residual energy and real-time communication bandwidth, and if so, feedback the agreement and resource status, otherwise, feedback the refusal and reason. Select the scheme with the highest agreement rate and the core node agreement as the optimal adjustment scheme. If the agreement rate is the same, select the scheme that can make more links reach the excellent state.

[0182] Further, when reconfiguring node connection and forwarding strategy, disconnect the unstable link according to the optimal scheme, build new connections between the replacement node and the relevant nodes or enable stable links; update the routing table to specify the forwarding direction, and specify that the excellent and good state links are preferred, and when a fault occurs, automatically switch to the standby link; configure the forwarding priority for the nodes, and the important data between backbone nodes is preferentially forwarded, and the ordinary data of non-backbone nodes is sequentially forwarded, forming a stable node connection architecture containing new connection relationships, routing tables and forwarding rules.

[0183] Further, when establishing a stable communication path, extract the node connection relationship and routing table from the stable node connection architecture, take the start node as the starting point and the end node as the terminal point, and form a main path along the excellent and good state links according to the routing table direction. Each main path is equipped with at least one non-overlapping standby path, and the node sequence, link information and switching condition of the main and standby paths are recorded to the network communication protocol, forming a stable communication path containing main and standby paths and switching mechanism.

[0184] In summary, dynamic analysis of hierarchical link state obtains communication bottleneck nodes and unstable links, which are screened as unstable links, and the proportion of unstable links of nodes is counted to determine the bottleneck node. The location, level and other information of the two are recorded to accurately locate the key problem affecting communication and provide clear objects for subsequent adjustment.

[0185] Overall, according to the position and level of the bottleneck node and the unstable link, the alternative path adjustment scheme is generated, the influence range of the transmission is determined, the efficient substitute node of the same level or adjacent level for the bottleneck node is found, the switching or bypassing scheme for the unstable link is designed, a plurality of targeted adjustment schemes are formed, and the adjustment direction selection is provided.

[0186] Overall, the optimal adjustment scheme is determined by distributing the alternative scheme to the related nodes for collaborative negotiation, the node assesses the feasibility of the scheme and feeds back, the approval rate is counted and combined with the link optimization effect, the scheme with high approval rate and good optimization effect is selected, and the scheme is ensured to adapt to the actual networking situation.

[0187] Overall, the stable node connection architecture is obtained by reconfiguring the node connection and forwarding strategy according to the optimal scheme, the unstable link is disconnected, the new connection is established, the routing table is updated and the forwarding priority is set, the architecture containing the new connection relationship, routing table and forwarding rule is formed, and the stable communication foundation is built.

[0188] Overall, the stable communication path is established according to the stable node connection architecture, the connection relationship and the routing table are extracted, the main path is formed by selecting the optimal or good state link and the standby path is configured, the path information and switching conditions are recorded, the main and standby combined path system is constructed, and the stable communication in the signal-free area is ensured.

[0189] As shown in Figure 2 It is a functional module diagram of a signal-free area wireless ad hoc network building device based on chain networking provided by an embodiment of the application.

[0190] The signal-free area wireless ad hoc network building device 100 based on chain networking can be installed in an electronic device. According to the functions realized, the signal-free area wireless ad hoc network building device 100 based on chain networking can include a collaborative fusion module 101, a capability evaluation 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 modules of the application can also be referred to as units, which refer to a series of computer program segments that can be executed by an electronic device processor and can complete fixed functions, and are 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 for collaboratively fusing the identity and communication capability of the nodes in the chain networking to obtain the node capability information of the chain networking;

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

[0194] The topology construction module 103 is configured to perform optimization shaping on the candidate nodes in the wireless ad hoc network based on the topology construction criterion, to obtain a chain network topology of the wireless ad hoc network.

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

[0196] The step-by-step detection module 105 is configured to perform step-by-step detection on the link communication quality of the preliminary communication network, to obtain a hierarchical link state of the wireless ad hoc network.

[0197] The stable path determination module 106 is configured to dynamically negotiate the hierarchical link state, to build a stable communication path of the wireless ad hoc network.

[0198] In several embodiments provided in the present application, it should be understood that the disclosed method and device can be implemented in other manners. For example, the described device embodiments are merely schematic, and the division of the modules is merely a logical function division, and there can be another division manner in actual implementation.

[0199] The modules illustrated as separated components can or can not be physically separated, and the components illustrated as modules can or can not be physical units, that is, they can be located in one place, or can be distributed on a plurality of network units. According to actual needs, some or all of the modules can be selected to achieve the purpose of the embodiments.

[0200] In addition, each function module in each embodiment of the present application can be integrated in one processing unit, or each unit can be physically present separately, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware, or in the form of hardware plus software function modules.

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

[0202] The embodiments of the present application can acquire and process related data based on artificial intelligence technology. Artificial intelligence is a theory, method, technology and application device for simulating, extending and expanding human intelligence by using a digital computer or a machine controlled by a digital computer, perceiving an environment, acquiring knowledge and using the knowledge to obtain optimal results.

[0203] Finally, it should be noted that the above examples are merely intended to illustrate the technical solutions of the present application and not to limit the present application. Although the present application has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solutions of the present application can be modified or equivalently replaced without departing from the spirit and scope of the technical solutions of the present application.

Claims

1. A method for constructing a wireless self-organizing network in a signal-free area based on chain-like networking, characterized in that, The method includes: 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; 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; S3. Based on the aforementioned topology construction criteria, the candidate nodes in the wireless ad hoc network are optimized and shaped to obtain the chain-like network topology of the wireless ad hoc network, including: 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. 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. 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; The multi-level relay sequence is collaboratively corrected to obtain the basis for the topology construction of the wireless ad hoc network; S4. Establish bidirectional communication links between nodes in the chain network topology to form the initial communication network of the wireless ad hoc network; 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; S6. Dynamically negotiate the hierarchical link status to establish a stable communication path for the wireless ad hoc network.

2. 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 process 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: Extract the identity features of nodes in the chain network to obtain the identity information of the nodes; Parse the node type and role attributes from the node's identity information to generate the node's identity description data; 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 is associated and mapped with the communication capability parameters to form the node comprehensive capability identifier of the chain network; Based on the node comprehensive capability identifier, 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 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: 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; Based on the aforementioned fusion dominant factor, an efficiency mapping relationship between the real-time communication bandwidth and the remaining energy level is established; 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; 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: ； 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.

4. 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, Based on the aforementioned topology construction criteria, the candidate nodes in the wireless ad hoc network are optimized and shaped to obtain a chain-like network topology for the wireless ad hoc network, including: 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; 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. 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. 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. Redundant links are eliminated from the initial chain network topology to obtain the chain network topology of the wireless ad hoc network.

5. The method for constructing a wireless self-organizing network in a signal-free area based on chain-like networking as described in claim 4, characterized in that, 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: 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. 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. Logical topology reconstruction is performed on the optimized node sequence to obtain the preliminary chain network topology of the wireless ad hoc network.

6. 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 establishment of bidirectional communication links between nodes in the chain-like network topology, forming the initial communication network of the wireless ad hoc network, includes: 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. 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. The standardized bidirectional communication links are networked and integrated to obtain the preliminary communication network of the wireless self-organizing 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 step-by-step detection of link communication quality in the initial communication network to obtain the hierarchical link status of the wireless ad hoc network includes: 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. 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. Based on the communication quality parameters, determine the real-time communication status of the communication links in the preliminary communication network; 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.

8. 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 dynamic negotiation of the hierarchical link states to establish a stable communication path for the wireless ad hoc network includes: The hierarchical link status is dynamically analyzed to obtain the communication bottleneck nodes and unstable links existing in the initial communication network. 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. 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. 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. Based on the stable node connection architecture, a stable communication path is established for the wireless ad hoc network.

9. A device for constructing a wireless self-organizing network in a signal-free area based on chain-like networking, characterized in that, The device includes: 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. 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. 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. 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; 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. 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.

Images