Path selection method for emergency wireless broadband Mesh ad hoc network in disaster areas

Abstract

The present invention relates to the technical field of routing path selection, and in particular to a path selection method for emergency wireless broadband Mesh self-organizing network in disaster areas. The method comprises: obtaining the overall evaluation value of the current node structure diagram according to historical nodes, current nodes, historical communication data vectors and current communication data vectors; obtaining the initial evaluation value of each current node according to the neighboring nodes of the current node, and recording the product of the overall evaluation value and the initial evaluation value of each current node as the target evaluation value of the corresponding current node; obtaining each cluster to be updated according to the original clustering cluster and the current node; updating each cluster to be updated according to the target evaluation value of each current node, obtaining the current clustering result at the current moment, and obtaining the routing path that meets the transmission requirements according to the current clustering result and the clustering DSR routing protocol. The present invention can select the routing path more accurately and efficiently.

Description

Technical Field

[0001] The present invention relates to the technical field of routing path selection, and in particular to a path selection method for emergency wireless broadband Mesh ad hoc network in disaster areas. Background Art

[0002] When natural disasters or man-made disasters occur, they are usually accompanied by the destruction and paralysis of communication infrastructure, which will cause the communication means used in normal times to basically fail. The wireless broadband Mesh ad hoc network has the characteristics of not relying on preset basic communication facilities, temporary networking, rapid deployment, no control center, and strong anti-destruction. It can quickly establish a communication network in the event of a disaster and provide real-time information for disaster relief command. That is, wireless broadband Mesh ad hoc networks are currently widely used in disaster area emergency or rescue and disaster relief fields; however, the transmission capacity, stability, and reliability of wireless broadband Mesh ad hoc networks are all related to the routing path selection of wireless broadband Mesh ad hoc networks, that is, for wireless broadband Mesh ad hoc networks used for disaster area emergency, routing path selection is crucial to the performance of wireless broadband Mesh ad hoc networks.

[0003] In the prior art, routing paths are usually selected based on the clustered DSR routing protocol. In the process of routing path selection based on the clustered DSR routing protocol, the clustering results of the Mesh nodes in the Mesh self-organizing network need to be updated in real time. However, in the current process of updating the clustering results, there is a situation where the update cannot be performed efficiently and accurately, which will lead to low efficiency and accuracy in routing path selection, and further lead to low transmission capacity, stability and reliability of the Mesh self-organizing network. Therefore, how to improve the efficiency and accuracy of routing path selection is an urgent problem to be solved. Summary of the invention

[0004] In order to solve the above problems, the present invention provides a path selection method for emergency wireless broadband Mesh ad hoc network in disaster areas, and the technical solution adopted is as follows:

[0005] An embodiment of the present invention provides a path selection method for a disaster area emergency wireless broadband Mesh ad hoc network, comprising the following steps:

[0006] Obtain a historical node structure diagram, a current node structure diagram, a historical communication data vector corresponding to each historical node in the historical node structure diagram, and a current communication data vector corresponding to each current node in the current node structure diagram of the Mesh ad hoc network;

[0007] Clustering all historical nodes in the historical node structure graph to obtain original clusters;

[0008] According to the historical node, the current node, the historical communication data vector and the current communication data vector, an overall evaluation value of the current node structure graph is obtained; according to the neighboring nodes of the current node, an initial evaluation value of each current node is obtained, and the product of the overall evaluation value and the initial evaluation value of each current node is recorded as the target evaluation value of the corresponding current node;

[0009] According to the original clustering cluster and the current node, each cluster to be updated is obtained; according to the target evaluation value of each current node, each cluster to be updated is updated to obtain the current clustering result at the current moment; according to the current clustering result and the clustering DSR routing protocol, a routing path that meets the transmission requirements is obtained.

[0010] Beneficial effect: The present invention obtains the overall evaluation value of the current node structure diagram based on the acquired historical nodes, current nodes, historical communication data vectors and current communication data vectors, and then obtains the initial evaluation value of each current node based on the neighborhood nodes of the current node, and determines the target evaluation value of each current node based on the acquired overall evaluation value and the initial evaluation value of each current node; then, based on the original clustering clusters and the current nodes obtained by clustering the historical nodes, each cluster to be updated is obtained, and based on the target evaluation value of each current node, each cluster to be updated is updated to obtain the current clustering result at the current moment, and finally, based on the current clustering result and the clustering DSR routing protocol, a routing path that meets the transmission requirements is obtained. Therefore, the present invention can obtain the current clustering result at the current moment more efficiently and accurately through the target evaluation value of the current node, and can select the routing path more accurately and efficiently based on the acquired current clustering result and the clustering DSR routing protocol. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] In order to more clearly illustrate the technical solutions and advantages in the embodiments of the present invention or the prior art, the drawings required for use in the embodiments or the prior art descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0012] Figure 1 The present invention is a flow chart of a path selection method for emergency wireless broadband Mesh ad hoc network in disaster areas. DETAILED DESCRIPTION

[0013] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field belong to the scope of protection of the embodiments of the present invention.

[0014] Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains.

[0015] This embodiment provides a path selection method for a disaster area emergency wireless broadband Mesh ad hoc network, which is described in detail as follows:

[0016] like Figure 1 As shown, the path selection method for the disaster area emergency wireless broadband Mesh self-organizing network includes the following steps:

[0017] Step S001, obtaining a historical node structure diagram, a current node structure diagram, a historical communication data vector corresponding to each historical node in the historical node structure diagram, and a current communication data vector corresponding to each current node in the current node structure diagram of the Mesh ad hoc network.

[0018] The main purpose of this embodiment is to accurately and efficiently update the clustering results of Mesh nodes in the wireless broadband Mesh ad hoc network used for disaster area emergency response in real time during the process of routing path selection based on the clustered DSR routing protocol, so as to ensure the transmission capacity, stability and reliability of the Mesh ad hoc network.

[0019] In addition, for ease of understanding and analysis, this embodiment will be analyzed later based on any wireless broadband Mesh ad hoc network used for emergency response in disaster areas, that is, the Mesh ad hoc network or ad hoc network that appears later in this embodiment refers to the same ad hoc network; and during the operation of the Mesh ad hoc network, the control terminal will record the ID information, location information and communication data information of each node in the Mesh ad hoc network at different times, and the control terminal is part of the Mesh ad hoc network.

[0020] First, the location information of each node in the Mesh self-organizing network recorded by the control terminal at the current moment is obtained, and based on the location information of each node in the Mesh self-organizing network recorded at the current moment, the current node structure diagram of the Mesh self-organizing network at the current moment is constructed, and all nodes in the current node structure diagram are recorded as current nodes.

[0021] Then, the communication data of each current node recorded by the control terminal at the current moment is obtained and recorded as the current communication data. The vector constructed by all the current communication data of each current node recorded by the control terminal at the current moment is recorded as the current communication data vector corresponding to the current node.

[0022] Afterwards, the location information of each node in the Mesh self-organizing network recorded by the control terminal at the historical moment is obtained, and based on the location information of each node in the Mesh self-organizing network recorded at the historical moment, the historical node structure diagram of the Mesh self-organizing network at the historical moment is constructed, and all nodes in the historical node structure diagram are recorded as historical nodes, and the historical moment is the moment closest to the current moment.

[0023] Then, the communication data of each historical node recorded by the control terminal at the historical moment is obtained and recorded as historical communication data. The vector constructed by all the historical communication data of each historical node recorded by the control terminal at the current moment is recorded as the historical communication data vector corresponding to the corresponding historical node.

[0024] In addition, the communication data type in this embodiment includes but is not limited to received signal strength data, signal-to-noise ratio and packet loss rate; and in this embodiment, the communication data types of different nodes obtained at different times are consistent, and the types of communication data at the same position in the constructed communication data vector are also consistent; for example, if the communication data recorded in this embodiment includes received signal strength data, signal-to-noise ratio and packet loss rate, then the communication data vectors appearing in this embodiment are all composed of received signal strength data, signal-to-noise ratio and packet loss rate, and if the rth parameter in a communication data vector is received signal strength data, then the rth parameters in the remaining communication data vectors are also received signal strength data.

[0025] In addition, the time interval between the historical moment and the current moment in this embodiment is the time interval when the control terminal records data. For example, if the control terminal records data once every 1 second, then the time interval between the historical moment and the current moment in this embodiment is 1 second, and both the historical moment and the current moment refer to the moments in the Mesh self-organizing network.

[0026] So far, this embodiment has obtained the historical node structure diagram corresponding to the Mesh ad hoc network, the current node structure diagram, the historical communication data vectors corresponding to each historical node in the historical node structure diagram, and the current communication data vectors corresponding to each current node in the current node structure diagram.

[0027] Step S002: clustering all the historical nodes in the historical node structure graph to obtain original clusters.

[0028] This embodiment then uses the SA-Cluster graph clustering algorithm to cluster all historical nodes in the historical node structure graph, and each cluster obtained after complete clustering is recorded as an original cluster cluster, and the cluster to be updated needs to be obtained through the original cluster cluster later.

[0029] In addition, the process of clustering using the SA-Cluster graph clustering algorithm is a well-known technique, and thus will not be described in detail in this embodiment.

[0030] Step S003, obtaining the overall evaluation value of the current node structure diagram according to the historical node, the current node, the historical communication data vector and the current communication data vector; obtaining the initial evaluation value of each current node according to the neighborhood nodes of the current node, and recording the product of the overall evaluation value and the initial evaluation value of each current node as the target evaluation value of the corresponding current node.

[0031] This embodiment mainly selects a routing path for a wireless broadband Mesh ad hoc network used for emergency response in disaster areas. Currently, the selection of routing paths is usually implemented based on a clustered DSR routing protocol. In addition, since the nodes in the Mesh ad hoc network will change or move during operation, that is, the ad hoc network allows nodes in the network to dynamically join or leave. Currently, in order to ensure the efficiency and accuracy of path routing selection, it is necessary to determine in real time whether the node has changed or moved. If it is determined that the node has changed or moved, it is necessary to update the clustering results, that is, to cluster the nodes in the ad hoc network again. However, currently, when determining whether the node has moved, it is generally determined only based on the location information of the node itself. In this case, an error in judgment may occur, which will lead to the inability to update the clustering results in a timely and accurate manner, resulting in a low selection accuracy when performing subsequent path selection, that is, the selected routing path may not be the optimal routing path, and will further lead to low transmission capacity, stability and reliability of the Mesh ad hoc network.

[0032] In addition, currently, as long as there is movement or transformation of nodes in the self-organizing network, no matter how many or few nodes move or transform, all nodes in the self-organizing network usually need to be re-clustered. In this case, the amount of calculation when updating the clustering results will be large, and more computing resources will be wasted, that is, the clustering results cannot be updated efficiently, which will lead to low efficiency in routing path selection. When the efficiency of routing path selection is low, the transmission capacity, stability and reliability of the Mesh self-organizing network will be low.

[0033] In order to avoid the phenomenon of low transmission capacity, stability and reliability of the Mesh self-organizing network, this embodiment only needs to re-cluster the nodes that meet the update conditions when updating the clustering results. The nodes that meet the update conditions are nodes that need to be re-clustered, including at least newly added nodes and nodes that have undergone major changes; and this method can not only ensure the accuracy of clustering result updates but also improve the efficiency of updates, thereby making the efficiency and accuracy of subsequent routing path selection higher.

[0034] Therefore, the present embodiment needs to obtain a node that meets the update conditions next. In the present embodiment, the target evaluation value of the current node and whether the current node is a newly added node are used to evaluate whether the corresponding current node meets the update conditions. When determining the target evaluation value of the current node, it is necessary to first analyze the overall change degree of the current node structure diagram, that is, it is necessary to first determine the overall evaluation value of the current node structure diagram, the overall evaluation value can reflect the overall movement degree of the current node structure diagram, and then analyze the initial evaluation value of the current node based on the neighborhood nodes of the current node. The initial evaluation value can reflect the local link change of the corresponding node, and then combine the overall evaluation value and the initial evaluation value of the current node to determine the target evaluation value of the current node, and then determine whether to re-cluster the current node based on the target evaluation value; it can be seen that the determination of the overall evaluation value and the initial evaluation value are more important for the subsequent cluster update, so the present embodiment next obtains the overall evaluation value of the current node structure diagram and the initial evaluation value of the current node, then the specific process of obtaining the overall evaluation value of the current node structure diagram in the present embodiment is:

[0035] First, a neighbor node set corresponding to each current node and a neighbor node set corresponding to each historical node are obtained, and the process of obtaining the neighbor node set includes: in the current node structure diagram, a preset number of current nodes closest to each current node are obtained, and they are all recorded as neighbor nodes corresponding to the current node, and a set constructed by all the neighbor nodes of each current node is recorded as the neighbor node set corresponding to the current node; similarly, in the historical node structure diagram, a preset number of historical nodes closest to each historical node are obtained, and they are all recorded as neighbor nodes of the corresponding historical node, and a set constructed by all the neighbor nodes of each historical node is recorded as the neighbor node set corresponding to the corresponding historical node.

[0036] In addition, in specific applications, the implementer needs to set the value of the preset number according to actual conditions. For example, in this embodiment, the preset number can be set to 20.

[0037] Afterwards, the ID data of each historical node and the ID data of each current node are obtained, and the ID data of the node refers to a unique identifier used to identify each node in the Mesh network; and in this embodiment, the ID data belonging to the same node at different times are the same. For example, if a node in the ad hoc network at the first moment is device 1, and a node in the ad hoc network at the second moment is also device 1, then this indicates that the nodes that are device 1 at these two moments are the same node or the same device, that is, in the ad hoc network of this embodiment, the ID data of the same device is consistent, and the ID data of different devices are inconsistent.

[0038] Therefore, according to the ID data of each historical node and the ID data of each current node obtained above, this embodiment can obtain the set of nodes to be analyzed corresponding to the current node structure diagram and the same historical nodes of each node to be analyzed in the set of nodes to be analyzed. The same historical nodes of the nodes to be analyzed and the nodes to be analyzed are the basis for subsequently obtaining the overall evaluation value. Therefore, the specific process of obtaining the set of nodes to be analyzed and the same historical nodes of each node to be analyzed in the set of nodes to be analyzed in this embodiment is:

[0039] For any current node A in the current node structure diagram: if it is determined that there is a historical node with the same ID data as the current node a in the historical node structure diagram, the current node A is recorded as the node to be analyzed in the current node structure diagram, that is, if the current node A is not a newly added node compared with the historical node structure diagram, it indicates that the current node A is the node to be analyzed.

[0040] Therefore, according to the above process, all the nodes to be analyzed in the current node structure diagram can be obtained, and then the set constructed by all the nodes to be analyzed in the current node structure diagram is recorded as the node set to be analyzed corresponding to the current node structure diagram, and the historical nodes with the same ID data as each node to be analyzed in the node set to be analyzed are recorded as the same historical nodes corresponding to the nodes to be analyzed, and if the ID data of the node to be analyzed and the historical node are the same, it indicates that the node to be analyzed and the historical node are the same device.

[0041] After obtaining the neighbor node set and the node to be analyzed, the present embodiment then obtains the first difference value of each node to be analyzed according to the neighbor node set corresponding to each node to be analyzed and the neighbor node set corresponding to the same historical node of each node to be analyzed, and obtains the second difference value of each node to be analyzed according to the current communication data vector corresponding to each node to be analyzed and the historical communication data vector corresponding to the same historical node of each node to be analyzed. The first difference value and the second difference value are both important indicators for determining the overall evaluation value later. In addition, for ease of understanding, the present embodiment will take the process of obtaining the first difference value and the second difference value of any node a to be analyzed in the current node structure diagram as an example for description, that is, the process of obtaining the first difference value and the second difference value of the node a to be analyzed is:

[0042] First, the first distance of each neighboring node in the neighboring node set corresponding to the node a to be analyzed is obtained, and the average of the first distances of all neighboring nodes in the neighboring node set corresponding to the node a to be analyzed is recorded as the first average link distance; and the method for obtaining the first distance includes: for the bth neighboring node in the neighboring node set corresponding to the node a to be analyzed, in the current node structure diagram, obtaining the shortest path distance between the node a to be analyzed and the bth neighboring node, and recording it as the first distance of the bth neighboring node.

[0043] Then, the set of neighbor nodes corresponding to the same historical node of the node a to be analyzed is recorded as the neighbor node set Y, and then the second distance of each neighbor node in the neighbor node set Y is obtained, and the average of the second distances of all neighbor nodes in the neighbor node set Y is recorded as the second average link distance; and the method for obtaining the second distance includes: for the cth neighbor node in the neighbor node set corresponding to the same historical node of the node a to be analyzed, in the historical node structure diagram, the shortest path distance between the same historical node of the node a to be analyzed and the cth neighbor node is obtained, and recorded as the second distance of the cth neighbor node.

[0044] After obtaining the first average link distance and the second average link distance, the absolute value of the difference between the first average link distance and the second average link distance is calculated and recorded as the first difference value of the node a to be analyzed.

[0045] Then, the difference between the current communication data vector corresponding to the node a to be analyzed and the historical communication data vector corresponding to the same historical node of the node a to be analyzed is obtained and recorded as the feature vector. Then, the absolute value of each parameter in the feature vector is obtained and recorded as the first parameter value of the corresponding parameter. After that, the first parameter value of each parameter in the feature vector is normalized, and the normalized value is recorded as the target parameter value of the corresponding parameter. Then, the cumulative sum of the target parameters of all parameters in the feature vector is obtained and recorded as the second difference value of the node a to be analyzed. At this time, the Norm() normalization function is used to normalize the first parameter value.

[0046] Therefore, this embodiment can obtain the first difference value and the second difference value of all nodes to be analyzed according to the above-mentioned method of obtaining the first difference value and the second difference value of the node a to be analyzed; after obtaining the first difference value and the second difference value of all nodes to be analyzed, this embodiment next calculates the mean of the first difference values ​​of all nodes to be analyzed in the node set to be analyzed, and records it as the first difference mean corresponding to the current node structure diagram, and then normalizes the first difference mean, and records the normalized value as the first eigenvalue, and then calculates the mean of the second difference values ​​of all nodes to be analyzed in the node set to be analyzed, and records it as the second difference mean corresponding to the current node structure diagram, and then normalizes the second difference mean, and records the normalized value as the second eigenvalue.

[0047] Then, the obtained first eigenvalue and second eigenvalue are weightedly summed, and the value obtained by weighted summation is recorded as the overall evaluation value of the current node structure graph, that is, the overall evaluation value can evaluate the status of the current node in the current node structure graph; in addition, the specific expression for obtaining the overall evaluation value of the current node structure graph is:

[0048]

[0049] Where ξ is the overall evaluation value of the current node structure graph, α1 is the first weight value, α2 is the second weight value, exp() is an exponential function with the natural constant e as the base, N is the total number of nodes in the node set to be analyzed, and δ i is the first difference value of the i-th node to be analyzed in the set of nodes to be analyzed, is the first difference mean, γ i is the second difference value of the i-th node to be analyzed in the set of nodes to be analyzed, is the second difference mean.

[0050] In addition, when the values ​​of the first difference mean and the second difference mean are larger, it indicates that the value of ξ is larger, and the larger the value of ξ, the more nodes are moved in the current node structure diagram, and the more nodes are moved, the more it is necessary to re-cluster the nodes in the current node structure diagram or update the clustering results. Conversely, it indicates that there is no need to re-cluster the nodes in the current node structure diagram or update the clustering results. In specific applications, the implementer needs to set the first weight value and the second weight value according to the actual situation. For example, in this embodiment, the first weight value and the second weight value are set to 0.6 and 0.4 respectively.

[0051] Therefore, this embodiment obtains the overall evaluation value of the current node structure diagram through the above process. After obtaining the overall evaluation value, in order to further achieve the purpose of improving the transmission capacity, stability and reliability of the Mesh self-organizing network, this embodiment will then obtain the initial evaluation value of each current node. The initial evaluation value is an important indicator for the subsequent determination of the target evaluation value. In addition, for ease of understanding, this embodiment will take the acquisition process of the initial evaluation value of the current node A in the current node structure diagram as an example for description, that is, the acquisition process of the initial evaluation value of the current node A is:

[0052] First, in the current node structure diagram, all current nodes directly connected to the current node A are obtained, and they are all recorded as neighbor nodes of the current node A. Then, a set constructed by all the neighbor nodes of the current node A is recorded as the neighbor node set A1 of the current node A. After that, the reverse nearest neighbor node set A2 of the current node A is obtained, and the process of obtaining the reverse nearest neighbor node set is a well-known technology, so it will not be described in detail in this embodiment.

[0053] Then, the total number of nodes in the reverse nearest neighbor node set A2 is counted and recorded as the first characterization value, and the total number of neighbor nodes in the neighbor node set A1 is counted and recorded as the second characterization value; then, the ratio of the first characterization value to the second characterization value is calculated and recorded as the first ratio, and the difference between the preset first constant and the first ratio is recorded as the first index value of the current node A, and the first index value can reflect the degree of local link change of the current node A, that is, the greater the difference between the reverse nearest neighbor node and the neighbor node of the current node A, that is, the smaller the first ratio and the larger the first index value, it indicates that the current node A has a large link change in the self-generated local area, and the larger the link change.

[0054] In a specific application, the implementer needs to set the preset first constant according to the actual situation. For example, in this embodiment, the preset first constant is set to 1.

[0055] Then the neighbor node set corresponding to the current node A is recorded as the neighbor node set B, and any neighbor node in the neighbor node set B is selected as the feature neighbor node, and then a straight line is drawn through the feature neighbor node and the current node A, and recorded as the feature straight line of the current node A, that is, the feature straight line passes through the current node A and the feature neighbor node; then the feature straight line is rotated in a clockwise direction, that is, 360 degrees, and all the neighbor nodes in the neighbor node set B are sorted according to the order in which the feature straight line rotates to the neighbor nodes, and the neighbor node sequence corresponding to the current node A is obtained; for example, if the feature straight line first rotates to the neighbor node a0 in the neighbor node set B, and then rotates to the neighbor node a1 in the neighbor node set B after rotating to the neighbor node a0, then the first neighbor node in the neighbor node sequence is the feature neighbor node, the second neighbor node is the neighbor node a0, and the third neighbor node is the neighbor node a1.

[0056] Then, the rotation angle sequence corresponding to the neighbor node set B is obtained, and the fth rotation angle in the rotation angle sequence refers to the rotation angle of the feature line from the f-1th neighbor node in the neighbor node sequence to the fth neighbor node in the neighbor node sequence. Then, the variance of the rotation angle sequence is calculated and recorded as the second index value of the current node A, and the second index value can reflect the position of the current node A in the original cluster.

[0057] In addition, the larger the value of the second index is, the more concentrated the neighboring nodes of the current node A are in multiple directions. This means that the current node A is more likely to be located at the boundary of the original cluster. The greater the possibility of being located at the boundary of the original cluster, the greater the impact of the movement of the current node A on data transmission. This means that the movement of the current node A has a greater impact on the transmission capacity of the self-service network. Therefore, it is necessary to focus on the current node located at the boundary of the original cluster. That is, the greater the possibility that the current node is located at the boundary of the original cluster, the more the corresponding node needs to be re-clustered or re-clustered when updating the cluster.

[0058] Next, this embodiment calculates the normalized value of the product of the first index value of the current node A and the second index value of the current node A, and records it as the initial evaluation value of the current node A. The expression for obtaining the initial evaluation value of the current node A is:

[0059]

[0060] Among them, T A is the initial evaluation value of the current node A, Norm() is the normalization function, M' A is the total number of nodes in the reverse nearest neighbor node set A2, MA is the total number of neighbor nodes in the neighbor node set A1, is the first index value of the current node A, G A is the rotation angle sequence corresponding to the neighbor node set B, σ(G A ) is the variance of the rotation angle sequence, and is also the second index value of the current node A.

[0061] In addition, when The smaller the value of σ(G A ) is larger, indicating that the initial evaluation value of the current node A is larger. The larger the initial evaluation value of the current node A is, the more likely it is that the link of the current node A in its own local range may have changed significantly or that the current node A is located at the boundary of the original cluster. It also indicates that the current node A is more likely to need to be re-clustered later.

[0062] After obtaining the overall evaluation value and the initial evaluation value, it is necessary to determine the target evaluation value in combination with the overall evaluation value and the initial evaluation value. Specifically, calculate the product of the overall evaluation value of the current node structure diagram and the initial evaluation value of each current node, and record it as the target evaluation value of the corresponding current node. The larger the overall evaluation value and the initial evaluation value of the corresponding current node, the larger the target evaluation value of the corresponding current node. The larger the target evaluation value of the current node, the more likely it is that the corresponding current node will need to participate in re-clustering in the future.

[0063] Therefore, this embodiment can obtain the target evaluation value of each current node through the above process.

[0064] Step S004, obtaining each cluster to be updated according to the original clustering cluster and the current node; updating each cluster to be updated according to the target evaluation value of each current node to obtain the current clustering result at the current moment, and obtaining a routing path that meets the transmission requirements according to the current clustering result and the clustering DSR routing protocol.

[0065] Based on the above, the present embodiment obtains the target evaluation values ​​of each original cluster and the current node. Next, the present embodiment first obtains each cluster to be updated based on the original cluster and the current node. The specific process is as follows:

[0066] For the original cluster C: obtain all the first historical nodes in the original cluster C, and record the set constructed by all the first historical nodes in the original cluster C as the first historical node set of the original cluster C, and then record the cluster constructed by the current node with the same ID data as all the first historical nodes in the first historical node set as the cluster to be updated corresponding to the original cluster C.

[0067] The process of obtaining the first historical node includes: for any historical node g in any original cluster C, if it is determined that there is a current node with the same ID data as the historical node g in the current node structure diagram, then the historical node g is recorded as the first historical node in the original cluster C.

[0068] Therefore, each cluster to be updated can be obtained according to the above process. After the cluster to be updated is obtained, this embodiment will update each cluster to be updated according to the target evaluation value of each current node to obtain the current clustering result at the current moment. Subsequently, the best routing path that meets the transmission requirements at the current moment will be obtained based on the current clustering result obtained at the current moment. Therefore, the process of updating each cluster to be updated and obtaining the current clustering result at the current moment is as follows:

[0069] First, all current nodes whose target evaluation values ​​are greater than the preset first threshold are obtained and recorded as nodes to be updated; then, in the current node structure diagram, all current nodes except the nodes to be analyzed are recorded as nodes to be updated, and in the current node structure diagram, the current nodes except the nodes to be analyzed are newly added nodes, and for the newly added nodes, they all need to be clustered at the current moment.

[0070] In a specific application, the implementer needs to set the preset first threshold according to the actual situation. For example, in this embodiment, the preset first threshold is set to 0.7.

[0071] Then, each target node to be updated corresponding to each cluster to be updated is obtained, and the process of obtaining each target node to be updated corresponding to each cluster to be updated includes:

[0072] For any node H to be updated: the set constructed by all neighbor nodes belonging to the cluster to be updated in the neighbor node set of the node H to be updated is recorded as the first neighbor node set of the node H to be updated; and all neighbor nodes in the first neighbor node set of the node H to be updated are divided to obtain each subset corresponding to the first neighbor node set of the node H to be updated; then the shortest path distance between the node H to be updated and each neighbor node in each subset is obtained, and recorded as the characteristic distance of the corresponding neighbor node, and then the average of the characteristic distances of all neighbor nodes in each subset is obtained, and recorded as the link characteristic distance of the corresponding subset; then the subset corresponding to the minimum link characteristic distance is selected, and recorded as the target subset, and then the cluster to be updated to which the neighbor nodes in the target subset belong is recorded as cluster W to be updated, and the node H to be updated is used as the target node to be updated corresponding to cluster W to be updated.

[0073] The rule for dividing all neighbor nodes in the first neighbor node set of the node H to be updated is: dividing neighbor nodes in the first neighbor node set that belong to the same cluster to be updated into the same subset, and dividing neighbor nodes in the first neighbor node set that do not belong to the same cluster to be updated into different subsets.

[0074] Therefore, according to the above method, all the nodes to be updated corresponding to each cluster to be updated can be obtained; for any cluster to be updated V0, the cluster cluster formed by all current nodes except the node to be updated in the cluster to be updated V0 and all target nodes to be updated corresponding to the cluster to be updated V0 is recorded as the cluster cluster after the update of the cluster to be updated V, and the cluster cluster after the update of the cluster to be updated V is recorded as the current cluster cluster at the current moment.

[0075] Therefore, according to the above process, all the clusters to be updated can be updated, thereby obtaining the current clustering cluster. That is, by updating the clusters to be updated, the current clustering result at the current moment is obtained.

[0076] Finally, according to the current clustering result and the clustering DSR routing protocol, the best routing path that meets the transmission requirements can be obtained, that is, based on the current clustering result and the clustering DSR routing protocol, the routing path is selected or determined for the transmission request at the current moment, and then the best routing path that meets the transmission request at the current moment is obtained; and the process of selecting or determining the routing path based on the current clustering result and the clustering DSR routing protocol is a well-known technology, so this embodiment will not be described in detail.

[0077] In summary, this embodiment obtains the overall evaluation value of the current node structure diagram based on the acquired historical nodes, current nodes, historical communication data vectors and current communication data vectors, and then obtains the initial evaluation value of each current node based on the neighborhood nodes of the current node, and determines the target evaluation value of each current node based on the acquired overall evaluation value and the initial evaluation value of each current node; then, based on the original clustering clusters and the current node obtained by clustering the historical nodes, each cluster to be updated is obtained, and based on the target evaluation value of each current node, each cluster to be updated is updated to obtain the current clustering result at the current moment, and finally, based on the current clustering result and the clustering DSR routing protocol, a routing path that meets the transmission requirements is obtained. Therefore, this embodiment can obtain the current clustering result at the current moment more efficiently and accurately through the target evaluation value of the current node, and based on the acquired current clustering result and the clustering DSR routing protocol, the routing path can be selected more accurately and efficiently.

[0078] The embodiments described above are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.

Claims

1. A path selection method for emergency wireless broadband Mesh ad hoc network in disaster areas, characterized in that: The method comprises the following steps: Obtain a historical node structure diagram, a current node structure diagram, a historical communication data vector corresponding to each historical node in the historical node structure diagram, and a current communication data vector corresponding to each current node in the current node structure diagram of the Mesh ad hoc network; Clustering all historical nodes in the historical node structure graph to obtain original clusters; According to the historical node, the current node, the historical communication data vector and the current communication data vector, an overall evaluation value of the current node structure graph is obtained; according to the neighboring nodes of the current node, an initial evaluation value of each current node is obtained, and the product of the overall evaluation value and the initial evaluation value of each current node is recorded as the target evaluation value of the corresponding current node; According to the original clustering cluster and the current node, each cluster to be updated is obtained; according to the target evaluation value of each current node, each cluster to be updated is updated to obtain the current clustering result at the current moment, and according to the current clustering result and the clustering DSR routing protocol, a routing path that meets the transmission requirements is obtained; The method for obtaining the overall evaluation value of the current node structure graph includes: obtaining the neighbor node set corresponding to each current node, the neighbor node set corresponding to each historical node, the ID data of each historical node and the ID data of each current node; obtaining the node set to be analyzed corresponding to the current node structure graph and the same historical nodes of each node to be analyzed in the node set to be analyzed according to the ID data of each historical node and the ID data of each current node; obtaining the first difference value of each node to be analyzed according to the neighbor node set corresponding to each node to be analyzed and the neighbor node set corresponding to the same historical node; obtaining the first difference value of each node to be analyzed according to the current communication data vector. and the historical communication data vector corresponding to the same historical node, to obtain the second difference value of each node to be analyzed; the mean of the first difference values ​​of all nodes to be analyzed in the set of nodes to be analyzed is recorded as the first difference mean corresponding to the current node structure graph, and the normalized value of the first difference mean is recorded as the first eigenvalue; the mean of the second difference values ​​of all nodes to be analyzed in the set of nodes to be analyzed is recorded as the second difference mean corresponding to the current node structure graph, and the normalized value of the second difference mean is recorded as the second eigenvalue; the value obtained by weighted summation of the first eigenvalue and the second eigenvalue is recorded as the overall evaluation value of the current node structure graph; The method for obtaining the first difference value of each node to be analyzed includes: For any node a to be analyzed in the current node structure diagram: obtain the first distance of each neighboring node in the neighboring node set corresponding to the node a to be analyzed, and record the average of the first distances of all neighboring nodes in the neighboring node set corresponding to the node a to be analyzed as the first average link distance; the first distance of the bth neighboring node in the neighboring node set corresponding to the node a to be analyzed is the shortest path distance between the node a to be analyzed and the bth neighboring node; record the neighboring node set corresponding to the same historical node of the node a to be analyzed as the neighboring node set Y, obtain the second distance of each neighboring node in the neighboring node set Y, and record the average of the second distances of all neighboring nodes in the neighboring node set Y as the second average link distance; the second distance of the cth neighboring node in the neighboring node set Y is the shortest path distance between the same historical node of the node a to be analyzed and the cth neighboring node; record the absolute value of the difference between the first average link distance and the second average link distance as the first difference value of the node a to be analyzed; The method for obtaining the second difference value of each node to be analyzed includes: For the node a to be analyzed: obtain the difference between the current communication data vector corresponding to the node a to be analyzed and the historical communication data vector corresponding to the same historical node of the node a to be analyzed, and record it as a feature vector, record the normalized value of the absolute values ​​of all parameters in the feature vector as the target parameter value of each parameter in the feature vector, and record the cumulative sum of the target parameters of all parameters in the feature vector as the second difference value of the node a to be analyzed; The method for obtaining the initial evaluation value of each current node includes: For any current node A in the current node structure diagram: obtain a neighbor node set A1 and a reverse nearest neighbor node set A2 of the current node A, wherein the neighbor node set A1 is composed of current nodes directly connected to the current node A; record the total number of nodes in the reverse nearest neighbor node set A2 as a first characterization value, and record the total number of neighbor nodes in the neighbor node set A1 as a second characterization value; record the ratio of the first characterization value to the second characterization value as a first ratio, and record the difference between a preset first constant and the first ratio as a first index value; obtain a characteristic straight line of the current node A, wherein the characteristic straight line passes through the current node A and a characteristic neighbor node, and the characteristic neighbor node is a neighbor node corresponding to the current node A. any neighbor node in the node set B; rotate the feature line one circle in the clockwise direction, and sort all the neighbor nodes in the neighbor node set B according to the order in which the feature line is rotated to the neighbor node, to obtain the neighbor node sequence corresponding to the current node A; obtain the rotation angle sequence corresponding to the neighbor node set B, the fth rotation angle in the rotation angle sequence refers to the rotation angle of the feature line from the f-1th neighbor node in the neighbor node sequence to the fth neighbor node in the neighbor node sequence; record the variance of the rotation angle sequence as the second index value; record the normalized value of the product of the first index value and the second index value as the initial evaluation value of the current node A.

2. A path selection method for emergency wireless broadband Mesh ad hoc network in disaster areas as claimed in claim 1, characterized in that: The method for obtaining the neighbor node set includes: In the current node structure diagram, a preset number of current nodes closest to each current node are obtained, and all of them are recorded as neighboring nodes of the corresponding current node, and a set constructed by all the neighboring nodes of each current node is recorded as the neighboring node set corresponding to the current node; in the historical node structure diagram, a preset number of historical nodes closest to each historical node are obtained, and all of them are recorded as neighboring nodes of the corresponding historical node, and a set constructed by all the neighboring nodes of each historical node is recorded as the neighboring node set corresponding to the corresponding historical node.

3. A path selection method for emergency wireless broadband Mesh ad hoc network in disaster areas as claimed in claim 1, characterized in that: The set of nodes to be analyzed and a method for obtaining the same historical nodes of each node to be analyzed in the set of nodes to be analyzed include: For any current node A in the current node structure graph: if there is a historical node with the same ID data as the current node A in the historical node structure graph, the current node A is recorded as the node to be analyzed in the current node structure graph; the set constructed by all the nodes to be analyzed in the current node structure graph is recorded as the node set to be analyzed corresponding to the current node structure graph, and the historical nodes with the same ID data as each node to be analyzed in the node set to be analyzed are recorded as the same historical nodes of the corresponding nodes to be analyzed.

4. A path selection method for emergency wireless broadband Mesh ad hoc network in disaster areas as claimed in claim 1, characterized in that: The method of obtaining each cluster to be updated includes: For any historical node g in any original clustering cluster C, if there is a current node with the same ID data as the historical node g in the current node structure diagram, then the historical node g is recorded as the first historical node in the original clustering cluster C; for the original clustering cluster C, the set constructed by all the first historical nodes in the original clustering cluster C is recorded as the first historical node set of the original clustering cluster C, and the clustering cluster constructed by the current node with the same ID data as all the first historical nodes in the first historical node set is recorded as the cluster to be updated corresponding to the original clustering cluster C.

5. A path selection method for emergency wireless broadband Mesh ad hoc network in disaster areas as claimed in claim 3, characterized in that: The method of updating the clusters to be updated to obtain the current clustering result at the current moment includes: All current nodes whose target evaluation values ​​are greater than a preset first threshold are recorded as nodes to be updated; in the current node structure diagram, all current nodes except the node to be analyzed are also recorded as nodes to be updated; Obtain each target node to be updated corresponding to each cluster to be updated; for any cluster to be updated V0, record the cluster formed by all current nodes in the cluster to be updated V0 except the node to be updated and all target nodes to be updated corresponding to the cluster to be updated V0 as the updated cluster of the cluster to be updated V, and record the updated cluster of the cluster to be updated V as the current cluster at the current moment.

6. A path selection method for emergency wireless broadband Mesh ad hoc network in disaster areas as claimed in claim 5, characterized in that: The method for obtaining each target node to be updated corresponding to each cluster to be updated includes: For any node H to be updated: a set constructed by all neighbor nodes belonging to the cluster to be updated in the neighbor node set of the node H to be updated is recorded as the first neighbor node set of the node H to be updated; the neighbor nodes in the first neighbor node set are divided to obtain subsets corresponding to the first neighbor node set; in the first neighbor node set, neighbor nodes belonging to the same cluster to be updated are divided into the same subset, and neighbor nodes not belonging to the same cluster to be updated are divided into different subsets; the shortest path distance between the node H to be updated and each neighbor node in each subset is recorded as the characteristic distance of the corresponding neighbor node, and the average of the characteristic distances of all neighbor nodes in each subset is recorded as the link characteristic distance of the corresponding subset; the cluster to be updated to which the neighbor nodes in the subset corresponding to the minimum link characteristic distance belong is obtained, and recorded as cluster W to be updated, and the node H to be updated is used as the target node to be updated corresponding to the cluster W to be updated.

Images