Multi-protocol fusion emergency communication scheduling method

Abstract

The invention relates to the technical field of protocol conversion, in particular to a multi-protocol fusion emergency communication scheduling method, which comprises the following steps of: calculating a path value sequence by adopting a Dikstra algorithm, comparing path values of a starting node and a target node, and screening out an optimal path, thereby being capable of realizing multi-protocol fusion in a complex multi-protocol network environment. The optimal path is rapidly selected, rapid response in emergency communication is ensured, through a dynamic path switching mechanism and based on real-time link state monitoring, rapid response can be made to changes in a network environment, communication interruption caused by path failure is avoided, a Kalman filtering algorithm is introduced, real-time prediction and smoothing are carried out on time delay and packet loss rate, and the communication efficiency is improved. According to the method, the influence of measurement noise on path selection is reduced, the accurate estimation of the system on the link state is ensured, the stability and reliability of path selection are improved, the cooperation efficiency of multi-party rescue force and the task allocation speed are improved, and the robustness of the communication system is enhanced.

Description

Technical Field

[0001] This invention relates to the field of protocol conversion technology, and in particular to an emergency communication scheduling method that integrates multiple protocols. Background Technology

[0002] The field of protocol conversion technology aims to establish a technical system capable of parsing, mapping, and converting data formats, control commands, and transmission mechanisms between different protocols. This solves the problem of incompatibility between heterogeneous networks, enabling systems that could not communicate directly to achieve interconnection. Through protocol conversion, communication devices and platforms can complete data interaction and command interoperability between various types of networks, such as wireless, wired, satellite, private networks, and public networks, thereby supporting unified communication across systems, departments, and regions.

[0003] The purpose of this multi-protocol fusion emergency communication dispatch method is to resolve interoperability barriers caused by different rescue units using cellular network protocols, dedicated trunking communication protocols, satellite communication protocols, and Internet protocols during emergency events. By integrating multiple protocols, a unified emergency communication dispatch platform is constructed to achieve seamless cross-network and cross-system connection and command and dispatch. This includes eliminating compatibility issues caused by differences in communication protocols, ensuring interoperability of multiple source terminals, establishing voice, data, and command transmission links that can still be maintained in the event of single or partial network failures, improving the efficiency of multi-party rescue force collaboration and task allocation speed, and enhancing the robustness of the communication system by providing multi-path transmission and disaster recovery switching mechanisms to ensure uninterrupted communication and efficient and orderly dispatch in emergency scenarios.

[0004] Existing technologies for cross-network protocol communication primarily rely on standardized protocol conversion and mapping to achieve data transmission and command exchange between different networks. However, this approach suffers from significant latency and inefficiency in heterogeneous networks. Compatibility issues between different protocols and difficulties in selecting communication paths fail to meet real-time requirements, resulting in substantial delays during network switching. Furthermore, these technologies cannot efficiently adjust routes dynamically based on network quality and lack a real-time dynamic path switching mechanism. Consequently, they cannot quickly perform backup switching when network failures occur, leading to communication interruptions or losses. In addition, there is insufficient monitoring and prediction of link latency and packet loss rates, and a lack of adequate means to eliminate the impact of these uncertainties on communication quality, resulting in high communication latency and inefficient data transmission. Summary of the Invention

[0005] The purpose of this invention is to address the shortcomings of existing technologies by proposing a multi-protocol fusion emergency communication scheduling method.

[0006] To achieve the above objectives, the present invention adopts the following technical solution: a multi-protocol fusion emergency communication scheduling method, comprising the following steps:

[0007] S1: Based on a multi-protocol network environment, extract the node number of the cellular cluster satellite internet as the vertex, extract the link number, bandwidth value, latency value, packet loss rate value to generate triplet, establish the node set and triplet set, and generate a cross-network weighted topology structure.

[0008] S2: Based on the cross-network weighted topology, the reciprocal of the bandwidth value, the square of the delay value, and the logarithm of the packet loss rate are taken and summed to obtain a path value sequence. The Dixtra algorithm is used to compare and filter the path with the starting target node. When the difference is less than the threshold, the path with fewer hops is selected to generate a cross-network adapted path set.

[0009] S3: Based on the cross-network adaptation path set, parse the source protocol routing table to extract the instruction field and path number field, compare the path numbers and establish a corresponding relationship to generate a multi-protocol path mapping set;

[0010] S4: Based on the multi-protocol path mapping set, Kalman filtering is used to send probe messages to calculate the delay and packet loss rate and update the triplet. The path value sequence is regenerated and compared with the threshold. If the threshold is exceeded, a new selection is triggered and written into the multi-protocol path mapping set to generate a dynamic path switching result.

[0011] S5: Based on the dynamic path switching result, update the target protocol instruction set and corresponding path number, generate a scheduling table set and import it into the scheduling layer to obtain a cross-protocol unified scheduling set.

[0012] As a further embodiment of the present invention, the cross-network weighted topology includes a node set, a link set, and a link weight triplet; the cross-network adapted path set includes a path number, a node order, and a path weight; the multi-protocol path mapping set includes a source protocol instruction field, a target protocol path number, and a mapping table entry; the dynamic path switching result includes a new path number, a new path value, and a new node sequence; and the cross-protocol unified scheduling set includes a target protocol instruction field, a path number field, and a scheduling table entry set.

[0013] As a further aspect of the present invention, the specific steps for generating the cross-network weighted topology are as follows:

[0014] Based on a multi-protocol network environment, the node number of the cellular cluster satellite internet is extracted and marked as the vertex number. The link number is extracted and the bandwidth value, latency value and packet loss rate value are paired and combined into triplets to generate a set of node link triplets.

[0015] Based on the set of node link triples, node numbers are categorized and merged into the vertex set, triples are categorized into the edge set, a correspondence between the vertex set and the edge set is established and a structural framework is formed, generating a cross-network weighted topology structure.

[0016] As a further aspect of the present invention, the specific steps for generating the cross-network adaptation path set are as follows:

[0017] Based on the cross-network weighted topology, the reciprocal of the bandwidth value of each link is taken one by one, the reciprocal result is written into the corresponding link index position, and the index is matched with the node order to generate a bandwidth reciprocal index sequence.

[0018] Based on the bandwidth reciprocal index sequence, the delay value of each link is squared and written into the corresponding path unit, the logarithm of the packet loss rate is taken and written into the corresponding path unit, and the three types of values ​​are summed in the unit to generate a path value summation sequence.

[0019] Based on the sum of the path values, the Dixtra algorithm is used to compare the path values ​​of the starting node and the target node, filter the corresponding path numbers, and select the path number when the difference is less than the threshold to generate a cross-network adaptation path set.

[0020] As a further aspect of the present invention, the Dixtra algorithm first starts from the starting node and gradually traverses all unvisited nodes, calculating the path cost from the starting node to each node. The path cost consists of the sum of the path values ​​from the calculated nodes to the target node. Each time, an unvisited node is selected based on the cost, and the path cost of the adjacent nodes is updated. This process is repeated until the paths of all nodes are determined. Finally, the algorithm outputs a path number. When the difference in path values ​​is less than a set threshold, it is selected as the adaptation path, generating a cross-network adaptation path set.

[0021] As a further aspect of the present invention, the specific steps for generating the multi-protocol path mapping set are as follows:

[0022] Based on the cross-network optimal path set, the source protocol routing table is parsed item by item, the instruction field is read and matched with the path number field, the field number is written into a temporary lookup sequence, and a source protocol field path lookup table is generated.

[0023] Based on the source protocol field path lookup table, the source protocol instruction field and the target protocol path number are merged item by item, and the items are sorted and integrated to form a mapping set, generating a multi-protocol path mapping set.

[0024] As a further aspect of the present invention, the source protocol field path lookup table consists of multiple mapping entries. Each mapping entry contains a source protocol instruction field and a path number field value. The instruction field is used to characterize the control instructions in the source protocol, and the path number field value is used to characterize the path identifier selected in the cross-network adaptation path set. The two types of data are arranged in a one-to-one correspondence in the lookup table to form a mapping structure set.

[0025] As a further aspect of the present invention, the specific steps for generating the dynamic path switching result are as follows:

[0026] Based on the multi-protocol path mapping set, Kalman filtering is used to periodically send probe messages to the link nodes, record the round-trip time of the messages and calculate the average value and write it into the delay field, count the number of lost messages and convert it into the packet loss rate and write it into the packet loss field, and generate link status monitoring results.

[0027] Based on the link status monitoring results, the corresponding link triplet values ​​in the cross-network weighted topology are replaced, the delay field and packet loss field are updated, the path values ​​are recalculated and written into the sequence to generate an updated path value sequence.

[0028] Based on the updated path value sequence, each path value is compared with the threshold set one by one. When the value exceeds the threshold, a path number reselection operation is triggered and written into the multi-protocol path mapping set to generate a dynamic path switching result.

[0029] As a further aspect of the present invention, the Kalman filter first estimates the link latency and packet loss rate using an initial state and calculates the prediction error covariance. Then, it periodically updates the measured values ​​using probe messages, calculates the deviation between the current measured value and the predicted value, performs a weighted correction on the predicted value, and outputs the updated state estimate as the link state monitoring result. This process is iteratively updated until the link state stabilizes. Finally, the updated latency and packet loss rate values ​​are written into the latency field and packet loss field to generate the link state monitoring result.

[0030] As a further aspect of the present invention, the specific steps for generating the cross-protocol unified scheduling set are as follows:

[0031] Based on the dynamic path switching results, the new path number is extracted and matched with the target protocol instruction set field. The number and field are mapped to form a correspondence table, and the path number instruction correspondence table is obtained.

[0032] Based on the path number instruction correspondence table, the path numbers and instruction field entries are re-summarized, merged into a scheduling table set, and imported into the scheduling layer for unified arrangement, generating a cross-protocol unified scheduling set.

[0033] Compared with the prior art, the advantages and positive effects of the present invention are as follows:

[0034] In this invention, by weighting key parameters such as bandwidth, latency, and packet loss rate of each link in a multi-protocol network environment, a cross-network weighted topology is generated, making the interconnection between networks more efficient. The reciprocal of the bandwidth value, the square of the latency value, and the logarithm of the packet loss rate of each link are taken and summed to generate a path value sequence, providing a more accurate quantitative basis for path selection.

[0035] In this invention, the Dixtra algorithm is used to calculate the path value sequence and the optimal path is selected by comparing the path values ​​of the starting node and the target node. This enables the optimal path to be selected quickly in complex multi-protocol network environments, ensuring rapid response in emergency communications.

[0036] In this invention, a dynamic path switching mechanism based on real-time link status monitoring can quickly respond to changes in the network environment, avoiding communication interruptions caused by path failures. Furthermore, the introduction of a Kalman filter algorithm enables real-time prediction and smoothing of latency and packet loss rate, reducing the impact of measurement noise on path selection. This ensures accurate estimation of link status by the system, improves the stability and reliability of path selection, enhances the coordination efficiency and task allocation speed of multiple rescue forces, and strengthens the robustness of the communication system. Attached Figure Description

[0037] Figure 1 This is a schematic diagram of the main steps of the present invention. Detailed Implementation

[0038] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.

[0039] Example 1

[0040] Please see Figure 1 This invention provides a technical solution: a multi-protocol fusion emergency communication scheduling method, comprising the following steps:

[0041] S1: Based on a multi-protocol network environment, extract the node number of the cellular cluster satellite internet as the vertex, extract the link number, bandwidth value, latency value, packet loss rate value to generate triplet, establish the node set and triplet set, and generate a cross-network weighted topology structure.

[0042] S2: Based on the cross-network weighted topology, the reciprocal of the bandwidth value, the square of the latency value, and the logarithm of the packet loss rate are taken and summed to obtain a path value sequence. The Dixtra algorithm is used to compare and filter the path with the starting target node. When the difference is less than the threshold, the path with fewer hops is selected to generate a cross-network adapted path set.

[0043] S3: Based on the cross-network adaptive path set, the source protocol routing table is parsed to extract the instruction field and path number field, the path number is compared and a corresponding relationship is established to generate a multi-protocol path mapping set;

[0044] S4: Based on the multi-protocol path mapping set, Kalman filtering is used to send probe messages to calculate latency and packet loss rate and update triplet, regenerate path value sequence and compare with threshold, trigger reselection when the limit is exceeded and write to the multi-protocol path mapping set to generate dynamic path switching results;

[0045] S5: Based on the dynamic path switching results, update the target protocol instruction set and corresponding path number, generate a scheduling table set and import it into the scheduling layer to obtain a cross-protocol unified scheduling set.

[0046] The cross-network weighted topology includes a set of nodes, a set of links, and a triplet of link weights. The cross-network adapted path set includes path number, node order, and path weight. The multi-protocol path mapping set includes source protocol instruction field, target protocol path number, and mapping table entry. The dynamic path switching result includes new path number, new path value, and new node sequence. The cross-protocol unified scheduling set includes target protocol instruction field, path number field, and scheduling table entry set.

[0047] The specific steps for generating a cross-network weighted topology are as follows:

[0048] Based on a multi-protocol network environment, the node number of the cellular cluster satellite internet is extracted and marked as the vertex number. The link number is extracted and the bandwidth value, latency value and packet loss rate value are paired and combined into triplets to generate a set of node link triplets.

[0049] Based on the set of node link triples, node numbers are categorized and merged into the vertex set, triples are categorized into the edge set, the correspondence between the vertex set and the edge set is established and a structural framework is formed, generating a cross-network weighted topology structure.

[0050] Based on a multi-protocol network environment, Dijkstra's shortest path algorithm is used to extract the node numbers of a cellular cluster satellite internet network. Input parameters include an adjacency matrix of dimension N×N, with node numbers ranging from 1 to N. An initial array `dist` stores the distances from the source node to each node; the initial value of `dist` is infinity, and the source node's position value is set to 0. An initial array `visited` records the node's visit status, initially set to false. The operations performed include selecting the node with the smallest `dist` value from unvisited nodes as the current node, setting its visit status to true, and iterating through all adjacent nodes. If the `dist` value can be updated through a node, an update operation is performed and the result is written to the current node. The link sequence set is constructed using an attribute pairing method to extract the link number and pair the bandwidth, delay, and packet loss rate values. The operation includes calling the link attribute table, where the attributes include a bandwidth value in Mbps, a delay value in ms, and a loss value in percentage. For each link, a triplet is constructed in the format {bandwidth value, delay value, loss value}, where the bandwidth value ranges from 1 to 1000 Mbps, the delay value ranges from 1 to 500 ms, and the loss value ranges from 0 to 100%. The triplet is then bound to the link number and written into the set structure, ultimately generating a set of node link triplets.

[0051] Based on the set of node link triples, the Floyd-Warshall full-source shortest path algorithm is used to classify node numbers and merge them into the vertex set. The triples are then processed and merged into the edge set. The input parameters include an adjacency matrix with dimensions N×N and an initial value of infinity. If an edge exists, its position is assigned a weight value. The operation includes selecting an intermediate node in each iteration, updating the path distance of all node pairs sequentially, and updating the path distance through the intermediate node if the path value is less than the current path value. The update result is written into the matrix. This operation is repeated until the path of all node pairs is updated. An adjacency list storage method is used to write the correspondence between the vertex set and the edge set into the structural framework. The operation includes initializing the adjacency list to a size of N and initializing each position to an empty linked list, traversing the edge set, and for each edge, writing its two nodes and weights into the corresponding adjacency list positions. Finally, a cross-network weighted topology structure is generated.

[0052] The specific steps for generating a cross-network adaptation path set are as follows:

[0053] Based on the cross-network weighted topology, the reciprocal of the bandwidth value of each link is taken one by one, the reciprocal result is written into the corresponding link index position, and the index is matched with the node order to generate a bandwidth reciprocal index sequence.

[0054] Based on the inverse bandwidth index sequence, the latency value of each link is squared and written into the corresponding path unit, the logarithm of the packet loss rate is taken and written into the corresponding path unit, and the three types of values ​​are summed in the unit to generate a path value summation sequence.

[0055] Based on the path value summation sequence, the Dixtra algorithm is used to compare the path values ​​of the starting node and the target node, filter the corresponding path numbers, and select the path number when the difference is less than the threshold to generate a cross-network adaptation path set.

[0056] Based on a cross-network weighted topology, a reciprocal calculation method is used to take the reciprocal of the bandwidth value of each link. The operation includes reading the bandwidth value of each link in Mbps from the link attribute array, with a range of 1 to 1000 Mbps, and then using a floating-point division command to calculate 1 / bandwidth. The result is stored in double-precision floating-point format and written to the corresponding link number position in the link index table. Subsequently, a sequential correspondence between node numbers and the link index table is established, and the index order is bound to the node number sequence to finally generate the bandwidth reciprocal index sequence.

[0057] Based on the inverse bandwidth index sequence, the squaring and logarithmic operations are used to transform the link delay value and packet loss rate value. The operation includes reading the delay value of each link from the path attribute matrix one by one. The unit is ms and the range is 1 to 500ms. The exponentiation operation command is called to perform the square calculation operation of the delay value and write the result into the corresponding path unit. Then, the loss value is read. The unit is percentage and the range is 0 to 100%. The natural logarithm operation command is called to perform the log(loss value + 1) calculation operation. The addition of 1 is to prevent the log(0) error and write the result into the corresponding path unit. In each path unit, the inverse bandwidth value, the square of the delay value, and the logarithm of the loss value are summed. The summation command is accumulated and stored in float type. Finally, the path value summation sequence is generated.

[0058] Based on the path value summation sequence, Dijkstra's shortest path algorithm is used to compare the path values ​​of the starting node and the target node one by one. The operation includes initializing the array dist with a size of N and an initial value of infinity, and setting the dist value of the starting node to 0. The array visited is also initialized with a size of N and an initial value of false. The execution steps are as follows: among the unvisited nodes, select the node with the smallest dist value as the current node and set its state to true. Traverse all its adjacent nodes. If the current path value plus the edge value is less than the dist value of the adjacent node, update the dist value and write the path number into the path record table. After completing the traversal, the path value comparison result between the starting node and the target node is obtained. The path value is compared with a preset threshold, which is 0.01. If the path difference is less than the threshold, the corresponding path number is selected and written into the set. Finally, a cross-network adapted path set is generated.

[0059] Dixtra's algorithm starts from the starting node and iterates through all unvisited nodes, calculating the path cost from the starting node to each node. The path cost is the sum of the calculated path values ​​from the nodes to the target node. Each time, an unvisited node is selected based on the cost, and the path cost of the adjacent nodes is updated. This process is repeated until the paths of all nodes are determined. Finally, the algorithm outputs the path number. When the difference in path values ​​is less than a set threshold, it is selected as the adaptation path, generating a set of cross-network adaptation paths.

[0060] Dixtra's algorithm, according to the formula:

[0061]

[0062] in: Indicates path number The improved difference value, This represents the weighting coefficient of the main difference term. Indicates the starting node To the first in the path The sum of the edge weights of each node. Represents the target node To the first in the path The sum of the edge weights of each node. This indicates the number of edges contained in the starting path. This indicates the number of edges contained in the target path. Indicates the starting node To node edge weight Represents the target node To node edge weight The weighting coefficients representing the impact of congestion. Indicates path number Real-time link congestion parameters, The weighting coefficients representing the impact of historical volatility. Indicates path number Historical volatility parameters The weighting coefficients representing the impact of reliability. Indicates path number Reliability rating in cross-network environments;

[0063] Execution process: First, the starting node is calculated based on the Dixtra algorithm. The weights of all edges to the path are summed and obtained. Next, calculate the target node. The weights of all edges to the path are summed and obtained. The absolute value of the difference between the two is taken as the basic difference term and determined by the coefficient. Adjust contribution ratios and introduce path numbers. Real-time link congestion parameters The parameters are obtained by statistically analyzing bandwidth utilization and packet loss rate, and are expressed by coefficients. The effect is corrected, and then the historical volatility parameter is introduced. This parameter is obtained by assigning a path number. The variance of the difference values ​​across multiple transmissions is calculated and obtained from the coefficients. Adjust its weighting and reintroduce reliability scoring. The score is obtained by statistically analyzing the transmission success rate and average latency stability across network environments, and is calculated using coefficients. After correcting for the impact, the weighted results of the above parts are finally combined to form the improved difference value. In judgment Less than the set threshold The corresponding path number is selected and a cross-network adaptation path is generated.

[0064] The specific steps for generating a multi-protocol path mapping set are as follows:

[0065] Based on the optimal path set across the network, the source protocol routing table is parsed item by item, the instruction field is read and matched with the path number field, the field number is written into a temporary lookup sequence, and a source protocol field path lookup table is generated.

[0066] Based on the source protocol field path lookup table, the source protocol instruction field and the target protocol path number are merged item by item, and the items are sorted and integrated to form a mapping set, generating a multi-protocol path mapping set.

[0067] Based on the optimal path set across the network, a regular expression parsing method is used to parse the source protocol routing table item by item. The operation includes calling a text reading command to read the routing table entries line by line. Each line contains an instruction field and a path number field. The regular expression pattern is defined as pattern="CMD:([A-Z0-9]+),PATH:([0-9]+)". The regular expression matching command is called to match each line and extract the first group as the instruction field and the second group as the path number field. The extracted field numbers are written into a temporary reference sequence. During the execution, the temporary reference sequence is stored in the form of an array, where the index position corresponds to the parsing order. After the entire routing table is traversed, the write command is called to store the instruction field and the path number field as key-value pairs. Finally, a source protocol field path lookup table is generated.

[0068] Based on the source protocol field path lookup table, a merge sort method and a hash mapping method are used to merge the source protocol instruction fields and target protocol path numbers item by item. The operation includes establishing a hash mapping table structure with the source protocol instruction field as the key and the path number as the value. For each entry, a hash insertion command is called to complete the key-value pair storage. The target protocol path number sequence is sorted in ascending order by calling the merge sort algorithm. The sorting parameters include the sequence length and a comparison function, which compares the numerical values. After sorting, a merge command is called to match the source protocol instruction fields with the sorted target protocol path numbers item by item and merge them into entries. All entries are written to a new mapping set, and finally, a multi-protocol path mapping set is generated.

[0069] The source protocol field path lookup table consists of multiple mapping entries. Each mapping entry contains a source protocol instruction field and a path number field value. The instruction field is used to represent the control instructions in the source protocol, and the path number field value is used to represent the path identifier selected in the cross-network adaptation path set. The two types of data are arranged in a one-to-one correspondence in the lookup table to form a mapping structure set.

[0070] The specific steps for generating dynamic path switching results are as follows:

[0071] Based on a multi-protocol path mapping set, Kalman filtering is used to periodically send probe messages to link nodes, record the round-trip time of the messages and calculate the average value and write it into the latency field, count the number of lost messages and convert it into the packet loss rate and write it into the packet loss field, and generate link status monitoring results.

[0072] Based on the link status monitoring results, the corresponding link triplet values ​​in the cross-network weighted topology are replaced, the latency field and packet loss field are updated, the path values ​​are recalculated and written into the sequence to generate an updated path value sequence.

[0073] Based on the updated path value sequence, each path value is compared with the threshold set one by one. When the value exceeds the threshold, the path number is reselected and written into the multi-protocol path mapping set to generate dynamic path switching results.

[0074] Based on the optimal path set across the network, a regular expression parsing method is used to parse the source protocol routing table item by item. The operation includes calling a text reading command to read the routing table entries line by line. Each line contains an instruction field and a path number field. The regular expression pattern is defined as pattern="CMD:([A-Z0-9]+),PATH:([0-9]+)". The regular expression matching command is called to match each line and extract the first group as the instruction field and the second group as the path number field. The extracted field numbers are written into a temporary reference sequence. During the execution, the temporary reference sequence is stored in the form of an array, where the index position corresponds to the parsing order. After the entire routing table is traversed, the write command is called to store the instruction field and the path number field as key-value pairs. Finally, a source protocol field path lookup table is generated.

[0075] Based on the source protocol field path lookup table, a merge sort method and a hash mapping method are used to merge the source protocol instruction fields and target protocol path numbers item by item. The operation includes establishing a hash mapping table structure with the source protocol instruction field as the key and the path number as the value. For each entry, a hash insertion command is called to complete the key-value pair storage. The target protocol path number sequence is sorted in ascending order by calling the merge sort algorithm. The sorting parameters include the sequence length and a comparison function, which compares the numerical values. After sorting, a merge command is called to match the source protocol instruction fields with the sorted target protocol path numbers item by item and merge them into entries. All entries are written to a new mapping set, and finally, a multi-protocol path mapping set is generated.

[0076] Kalman filtering first estimates the link's latency and packet loss rate using the initial state and calculates the prediction error covariance. Then, it periodically updates the measured values ​​using probe packets, calculates the deviation between the current measured value and the predicted value, applies a weighted correction to the predicted value, and outputs the updated state estimate as the link state monitoring result. This process is iteratively updated until the link state stabilizes. Finally, the updated latency and packet loss rate values ​​are written into the latency and packet loss fields to generate the link state monitoring result.

[0077] Kalman filtering, according to the formula:

[0078]

[0079] in: This represents the estimated time delay for the k-th period. This represents the predicted time delay value for the (k-1)th period. This represents the Kalman gain in the k-th period. This represents the average round-trip time of messages in the k-th period. This represents the round-trip time jitter metric for the k-th period. This represents the packet loss rate in the k-th period. The multi-protocol mapping consistency index represents path number i. This represents the normalization factor for the probe message size in the k-th period. This represents the jitter correction weighting coefficient. This represents the packet loss suppression weight coefficient. This represents the multi-protocol consistency weighting coefficient. This represents the load size compensation weighting coefficient;

[0080] Execution process: First, a probe period is set, and multiple probe messages are sent to the link nodes within the multi-protocol path mapping set. The time difference between message transmission and reception is recorded to obtain the round-trip time series, and the mean is calculated as the observation value. Then, using the time delay prediction value from the previous cycle. Calculate the Kalman gain using the prediction error covariance and the observation noise covariance. Then, the mean deviation of the round-trip time series is calculated as a jitter metric. The packet loss rate is calculated as the ratio of the number of lost packets to the total number of packets. The balance score of path numbering under multi-protocol coverage is used as a consistency index. The ratio of the probe message size to the baseline payload size is calculated as a normalization factor. The weighting coefficients will be adjusted. , , , The time delay estimate is multiplied by jitter metric, packet loss rate, consistency index, and normalization factor, and then added to the difference between observation and prediction. This process performs multiple corrections on the time delay estimate during the Kalman iteration, ultimately yielding the time delay estimate for the current period. At the same time, combined with packet loss rate Generate link status monitoring results.

[0081] The specific steps for generating a cross-protocol unified scheduling set are as follows:

[0082] Based on the dynamic path switching results, the new path number is extracted and matched with the target protocol instruction set field. The mapping between the number and the field forms a correspondence table, resulting in the path number instruction correspondence table.

[0083] Based on the path number instruction correspondence table, the path number and instruction field entries are re-summarized, merged into a scheduling table set, and imported into the scheduling layer for unified arrangement, generating a cross-protocol unified scheduling set.

[0084] Based on the dynamic path switching results, a hash mapping method is used to extract the new path number and match it with the target protocol instruction set fields. The operation includes calling the number extraction command to read the new path number one by one from the path switching results. The number range is set to integer values ​​from 1 to N. The hash initialization command is called to establish a mapping table structure with integer keys and string values. The target protocol instruction set is traversed to read the instruction fields one by one. The instruction fields are stored in string form. The hash insertion command is called to perform the number and field pairing and insertion operation. When inserting, the key is the path number and the value is the instruction field. When a key conflict occurs, the chaining method is used to create a linked list in the same slot and append the field value. After all number and field pairs are written, the table generation command is called to format the mapping result into a two-dimensional table structure, and finally, a path number instruction correspondence table is generated.

[0085] Based on the path number instruction mapping table, a merge sort method and a table merging method are used to re-summarize the path numbers and instruction field entries. The operation includes calling the sort initialization command to set the sort key to the path number and the sorting method to ascending order, executing the merge sort process, using a comparison function to compare the size of two path numbers and arranging the entries in ascending order, calling the table merging command to merge the sorted path numbers and their corresponding instruction fields into a new set by column, and then calling the set import command to write the merged set into the scheduling layer data area. The data area uses a two-dimensional array structure to store the path number and instruction field pairs in each row. The unified sorting command is called to rearrange the entire scheduling layer set according to the path number order, and finally generate a cross-protocol unified scheduling set.

[0086] The above are merely preferred embodiments of the present invention and are not intended to limit the present invention in any other way. Any person skilled in the art may make changes or modifications to the above-disclosed technical content to create equivalent embodiments that can be applied to other fields. However, any simple modifications, equivalent changes, and modifications made to the above embodiments based on the technical essence of the present invention without departing from the scope of the present invention shall still fall within the protection scope of the present invention.

Claims

1. A multi-protocol fusion emergency communication dispatch method, characterized in that, Includes the following steps: S1: Based on a multi-protocol network environment, extract the node number of the cellular cluster satellite internet as the vertex, extract the link number, bandwidth value, latency value, packet loss rate value to generate triplet, establish the node set and triplet set, and generate a cross-network weighted topology structure. S2: Based on the cross-network weighted topology, the reciprocal of the bandwidth value, the square of the delay value, and the logarithm of the packet loss rate are taken and summed to obtain a path value sequence. The Dixtra algorithm is used to compare and filter the path with the starting target node. When the difference is less than the threshold, the path with fewer hops is selected to generate a cross-network adapted path set. S3: Based on the cross-network adaptation path set, parse the source protocol routing table to extract the instruction field and path number field, compare the path numbers and establish a corresponding relationship to generate a multi-protocol path mapping set; S4: Based on the multi-protocol path mapping set, Kalman filtering is used to send probe messages to calculate the delay and packet loss rate and update the triplet. The path value sequence is regenerated and compared with the threshold. If the threshold is exceeded, a new selection is triggered and written into the multi-protocol path mapping set to generate a dynamic path switching result. S5: Based on the dynamic path switching result, update the target protocol instruction set and corresponding path number, generate a scheduling table set and import it into the scheduling layer to obtain a cross-protocol unified scheduling set.

2. The multi-protocol fusion emergency communication dispatch method according to claim 1, characterized in that, The cross-network weighted topology includes a set of nodes, a set of links, and a triplet of link weights. The cross-network adapted path set includes path number, node order, and path weight. The multi-protocol path mapping set includes a source protocol instruction field, a target protocol path number, and a mapping table entry. The dynamic path switching result includes a new path number, a new path value, and a new node sequence. The cross-protocol unified scheduling set includes a target protocol instruction field, a path number field, and a scheduling table entry set.

3. The multi-protocol fusion emergency communication dispatch method according to claim 1, characterized in that, The specific steps for generating the cross-network weighted topology are as follows: Based on a multi-protocol network environment, the node number of the cellular cluster satellite internet is extracted and marked as the vertex number. The link number is extracted and the bandwidth value, latency value and packet loss rate value are paired and combined into triplets to generate a set of node link triplets. Based on the set of node link triples, node numbers are categorized and merged into the vertex set, triples are categorized into the edge set, a correspondence between the vertex set and the edge set is established and a structural framework is formed, generating a cross-network weighted topology structure.

4. The multi-protocol fusion emergency communication dispatch method according to claim 1, characterized in that, The specific steps for generating the cross-network adaptation path set are as follows: Based on the cross-network weighted topology, the reciprocal of the bandwidth value of each link is taken one by one, the reciprocal result is written into the corresponding link index position, and the index is matched with the node order to generate a bandwidth reciprocal index sequence. Based on the bandwidth reciprocal index sequence, the delay value of each link is squared and written into the corresponding path unit, the logarithm of the packet loss rate is taken and written into the corresponding path unit, and the three types of values ​​are summed in the unit to generate a path value summation sequence. Based on the sum of the path values, the Dixtra algorithm is used to compare the path values ​​of the starting node and the target node, filter the corresponding path numbers, and select the path number when the difference is less than the threshold to generate a cross-network adaptation path set.

5. The multi-protocol fusion emergency communication dispatch method according to claim 4, characterized in that, The Dixtra algorithm starts from the starting node and iterates through all unvisited nodes, calculating the path cost from the starting node to each node. The path cost is the sum of the path values ​​from the calculated nodes to the target node. Each time, an unvisited node is selected based on the cost, and the path cost of the adjacent nodes is updated. This process is repeated until the paths of all nodes are determined. Finally, the algorithm outputs a path number. When the difference in path values ​​is less than a set threshold, it is selected as the adaptation path, generating a cross-network adaptation path set.

6. The multi-protocol fusion emergency communication dispatch method according to claim 1, characterized in that, The specific steps for generating the multi-protocol path mapping set are as follows: Based on the cross-network optimal path set, the source protocol routing table is parsed item by item, the instruction field is read and matched with the path number field, the field number is written into a temporary lookup sequence, and a source protocol field path lookup table is generated. Based on the source protocol field path lookup table, the source protocol instruction field and the target protocol path number are merged item by item, and the items are sorted and integrated to form a mapping set, generating a multi-protocol path mapping set.

7. The multi-protocol fusion emergency communication dispatch method according to claim 6, characterized in that, The source protocol field path lookup table consists of multiple mapping entries. Each mapping entry contains a source protocol instruction field and a path number field value. The instruction field is used to represent the control instructions in the source protocol, and the path number field value is used to represent the path identifier selected in the cross-network adaptation path set. The two types of data are arranged in a one-to-one correspondence in the lookup table to form a mapping structure set.

8. The multi-protocol fusion emergency communication dispatch method according to claim 1, characterized in that, The specific steps for generating the dynamic path switching result are as follows: Based on the multi-protocol path mapping set, Kalman filtering is used to periodically send probe messages to the link nodes, record the round-trip time of the messages and calculate the average value and write it into the delay field, count the number of lost messages and convert it into the packet loss rate and write it into the packet loss field, and generate link status monitoring results. Based on the link status monitoring results, the corresponding link triplet values ​​in the cross-network weighted topology are replaced, the delay field and packet loss field are updated, the path values ​​are recalculated and written into the sequence to generate an updated path value sequence. Based on the updated path value sequence, each path value is compared with the threshold set one by one. When the value exceeds the threshold, a path number reselection operation is triggered and written into the multi-protocol path mapping set to generate a dynamic path switching result.

9. The multi-protocol fusion emergency communication dispatch method according to claim 9, characterized in that, The Kalman filter first estimates the link's latency and packet loss rate using an initial state and calculates the prediction error covariance. Then, it periodically updates the measured values ​​using probe messages, calculates the deviation between the current measured value and the predicted value, applies a weighted correction to the predicted value, and outputs the updated state estimate as the link state monitoring result. This process is iteratively updated until the link state stabilizes. Finally, the updated latency and packet loss rate values ​​are written into the latency and packet loss fields to generate the link state monitoring result.

10. The multi-protocol fusion emergency communication scheduling method according to claim 1, characterized in that, The specific steps for generating the cross-protocol unified scheduling set are as follows: Based on the dynamic path switching results, the new path number is extracted and matched with the target protocol instruction set field. The number and field are mapped to form a correspondence table, and the path number instruction correspondence table is obtained. Based on the path number instruction correspondence table, the path numbers and instruction field entries are re-summarized, merged into a scheduling table set, and imported into the scheduling layer for unified arrangement, generating a cross-protocol unified scheduling set.

Images