Dynamic route selection method, system and equipment and storage medium

Abstract

The invention discloses a dynamic route selection method, system and device and a storage medium, relates to the technical field of quantum communication, and aims to solve the problems of low efficiency and poor accuracy of communication path selection and route updating in quantum laser communication. Comprising the following steps: acquiring to-be-transmitted data and communication demand data thereof; and updating the broadcast routing table based on a DSDV algorithm to obtain a communication path. And determining a transmission path in the communication path based on the communication demand data, and evaluating the transmission path according to the communication information of the transmission path. And determining a communication path of the to-be-transmitted data according to the evaluation result, and determining a communication main path according to the real-time communication rate of the communication path. And encoding the data to be transmitted based on Manchester encoding, and sending a generated data packet to a receiving end based on the communication main path. Decoding the data packet, and verifying the decoded data based on the CRC check code; and if the verification is not qualified, recording the decoded data and the communication main path.

Description

Technical Field

[0001] This application relates to the field of quantum communication technologies, and particularly to a dynamic routing selection method, system, device, and storage medium. Background Art

[0002] In a communication network, quantum laser communication has gradually become a research hotspot due to its high transmission rate and security. Quantum laser communication utilizes characteristics such as quantum superposition and quantum entanglement, which can not only achieve efficient information transmission but also ensure data security. However, in a complex environment, especially in the case of dynamic network topologies and multiple obstacles, quantum laser communication faces problems of communication path selection and routing update. How to ensure efficient and stable data transmission has become a technical problem to be urgently solved.

[0003] Therefore, currently in quantum laser communication, the efficiency of communication path selection and routing update is low and the accuracy is poor. Summary of the Invention

[0004] The purpose of this application is to provide a dynamic routing selection method, system, device, and storage medium, aiming to solve the problems of low efficiency and poor accuracy in communication path selection and routing update in quantum laser communication.

[0005] To achieve the above purpose, this application adopts the following technical solutions:

[0006] In the first aspect, this application provides a dynamic routing selection method, including:

[0007] Obtain the data to be transmitted and the communication requirement data of the data to be transmitted;

[0008] Update the broadcast routing table based on the Destination-Sequenced Distance Vector (DSDV) algorithm, obtain the communication path based on the updated broadcast routing table, and determine the transmission path in the communication path based on the communication requirement data;

[0009] Obtain the communication information of the transmission path, evaluate the transmission path according to the communication information, and obtain an evaluation result;

[0010] Determine the communication path of the data to be transmitted according to the evaluation result, and determine the main communication path of the data to be transmitted according to the real-time communication rate of the communication path;

[0011] Encode the data to be transmitted based on Manchester coding to generate a data packet, and send the data packet to the receiving end based on the main communication path;

[0012] The receiving end is controlled to decode the data packet to obtain decoded data, and the decoded data is verified based on a Cyclic Redundancy Check (CRC) code;

[0013] If the verification of the decoded data fails, the decoded data and the main communication path are recorded.

[0014] The dynamic routing selection method provided by the embodiments of this application dynamically updates the broadcast routing table through the DSDV algorithm, can flexibly select a communication path according to the real-time network status and transmission requirements, and determines the transmission path in the communication path based on the communication requirement data. This dynamic adjustment mechanism can respond to changes in the network environment in real time, such as fluctuations in the quality of the transmission path, changes in the communication rate, and other factors affecting communication performance. Therefore, it can significantly improve the adaptability of the quantum laser communication system in complex and dynamic environments, optimize the data transmission efficiency, reduce network congestion and delay, and thus effectively improve the overall communication performance. And by evaluating the communication information of each transmission path to determine the main communication path of the data to be transmitted, factors such as the delay, bandwidth, stability, and interference of the path can be comprehensively considered, optimizing the transmission reliability while ensuring the data transmission speed. This evaluation mechanism ensures that data is always transmitted through the optimal communication path, avoiding data loss and transmission failures caused by improper path selection, and improving the robustness of the system. And when a transmission failure or path instability occurs, it can also switch to the backup path in real time to ensure that the data transmission is not interrupted. Finally, by encoding the data to be transmitted using Manchester coding, the noise interference of the signal can be effectively reduced in quantum laser communication, the anti-interference ability of the signal can be improved, and the accurate transmission of data can be guaranteed. Combining with CRC code verification for data verification can further ensure the integrity and correctness of the transmitted data. So that when it is found that the data is incomplete or an error occurs, the data and the communication path information can be recorded in time, which is convenient for subsequent fault troubleshooting and performance analysis.

[0015] In this way, this application can greatly reduce the risk of data loss or inconsistency caused by transmission errors, ensuring high reliability of data transmission. In quantum laser communication, it can improve the efficiency and accuracy of communication path selection and routing update.

[0016] In some embodiments, determining the transmission path in the communication path based on the communication requirement data includes:

[0017] Obtain the transmission length and transmission requirement rate in the communication requirement data, and obtain the valid path in the communication path based on the Shortest Path Faster Algorithm (SPFA) and the transmission length;

[0018] Obtain the transmission rate of the effective path, and determine whether the effective path is a transmission path according to the relationship between the transmission rate and the transmission demand rate.

[0019] In some embodiments, determining whether the effective path is a transmission path according to the relationship between the transmission rate and the transmission demand rate includes:

[0020] When the transmission rate is lower than the transmission demand rate, determine that the effective path is not a transmission path;

[0021] Or, when the transmission rate is higher than or equal to the transmission demand rate, determine that the effective path is a transmission path.

[0022] In some embodiments, evaluating the transmission path according to the communication information to obtain an evaluation result includes:

[0023] Obtain the communication bandwidth, communication interference intensity, and communication signal intensity in the communication information, and determine the score of the transmission path according to the communication bandwidth, communication interference intensity, and communication signal intensity through the following formula. The evaluation result includes the score of the transmission path;

[0024]

[0025] Where η is the transmission efficiency coefficient, S is the communication signal intensity, I is the communication interference intensity, B is the communication bandwidth, and R is the score of the transmission path.

[0026] In some embodiments, determining the communication path of the data to be transmitted according to the evaluation result includes:

[0027] Obtain the average score among the scores of the transmission paths, and determine the average score as the score threshold;

[0028] Determine whether the transmission path is a communication path according to the relationship between the score of the transmission path and the score threshold.

[0029] In some embodiments, determining whether the transmission path is a communication path according to the relationship between the score of the transmission path and the score threshold includes:

[0030] When the score of the transmission path is lower than or equal to the score threshold, determine that the transmission path is not a communication path;

[0031] Or, when the score of the transmission path is higher than the score threshold, determine that the transmission path is a communication path.

[0032] In some embodiments, determining the main communication path of the data to be transmitted according to the real-time communication rate of the communication path includes;

[0033] Obtain the average rate among the real-time communication rates, and determine the average rate as the rate threshold;

[0034] Determine the rate ratio between the real-time communication rate and the rate threshold, and determine the communication path corresponding to the largest rate ratio as the main communication path for the data to be transmitted.

[0035] In a second aspect, the present application provides a dynamic routing selection system, including:

[0036] A data acquisition module, configured to acquire the data to be transmitted and the communication requirement data of the data to be transmitted;

[0037] A detection module, configured to update the broadcast routing table based on the DSDV algorithm, obtain a communication path based on the updated broadcast routing table, and determine a transmission path in the communication path based on the communication requirement data. The detection module is electrically connected to the data acquisition module;

[0038] An evaluation module, configured to acquire the communication information of the transmission path, evaluate the transmission path according to the communication information, and obtain an evaluation result. The evaluation module is electrically connected to the detection module;

[0039] A central control module, configured to determine the communication path for the data to be transmitted according to the evaluation result, and determine the main communication path for the data to be transmitted according to the real-time communication rate of the communication path. The central control module is electrically connected to the evaluation module;

[0040] The central control module is further configured to encode the data to be transmitted based on Manchester coding to generate a data packet, and send the data packet to the receiving end based on the main communication path. The receiving end is configured on the data processing module;

[0041] A data processing module, configured to control the receiving end to decode the data packet to obtain decoded data, and verify the decoded data based on the CRC check code;

[0042] The data processing module is further configured to record the decoded data and the main communication path if the verification of the decoded data fails.

[0043] In a third aspect, the present application provides a dynamic routing selection device, including:

[0044] An acquisition unit, configured to acquire the data to be transmitted and the communication requirement data of the data to be transmitted;

[0045] A processing unit, configured to update the broadcast routing table based on the destination sequence distance vector (DSDV) algorithm;

[0046] The acquisition unit is further configured to acquire a communication path based on the updated broadcast routing table;

[0047] The processing unit is further configured to determine a transmission path in the communication path based on the communication requirement data;

[0048] An acquisition unit is further configured to acquire communication information of a transmission path;

[0049] An evaluation unit is configured to evaluate the transmission path according to the communication information to obtain an evaluation result;

[0050] A processing unit is further configured to determine a communication path for data to be transmitted according to the evaluation result, and determine a main communication path for the data to be transmitted according to the real-time communication rate of the communication path;

[0051] The processing unit is further configured to encode the data to be transmitted based on Manchester coding to generate a data packet;

[0052] A sending unit is configured to send the data packet to a receiving end based on the main communication path;

[0053] The processing unit is further configured to control the receiving end to decode the data packet to obtain decoded data, and verify the decoded data based on a cyclic redundancy check (CRC) code;

[0054] The processing unit is further configured to record the decoded data and the main communication path if the verification of the decoded data fails.

[0055] In a fourth aspect, the present application provides a dynamic routing selection device, including: a processor and a memory; wherein, the memory is used to store one or more programs, and the one or more programs include computer execution instructions. When the dynamic routing selection device runs, the processor executes the computer execution instructions stored in the memory, so that the dynamic routing selection device executes the dynamic routing selection method in the first aspect.

[0056] The dynamic routing selection device may be a network device or a part of a device in a network device, such as a chip system in a network device. The chip system is used to support the network device to implement the functions involved in any of the above possible implementation manners, such as functions of acquisition, processing, correction, prediction, or early warning. The chip system includes a chip and may also include other discrete devices or circuit structures.

[0057] In a fifth aspect, the present application provides a computer-readable storage medium. When the computer execution instructions stored in the computer-readable storage medium are executed by a processor of the dynamic routing selection device, the dynamic routing selection device can execute the dynamic routing selection method in the first aspect.

[0058] In a sixth aspect, the present application provides a computer program product, which includes: a computer program or instruction. When the computer program or instruction runs on a computer, the computer is enabled to execute the dynamic routing selection method in the first aspect.

[0059] It should be noted that the above computer programs or instructions can be stored in whole or in part on a computer-readable storage medium. Among them, the computer-readable storage medium can be packaged together with the processor of the dynamic routing device or separately packaged from the processor of the dynamic routing device. The embodiments of the present application do not limit this.

[0060] For the descriptions of the second aspect, the third aspect, the fourth aspect, the fifth aspect, and the sixth aspect in this application, reference can be made to the detailed description of the first aspect. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0062] Figure 1 It is a schematic structural diagram of a dynamic routing selection system provided by an embodiment of the present application;

[0063] Figure 2 It is a flowchart of a dynamic routing selection method provided by an embodiment of the present application;

[0064] Figure 3 It is a schematic structural diagram of a dynamic routing selection device provided by an embodiment of the present application;

[0065] Figure 4 It is a schematic structural diagram of a dynamic routing selection device provided by an embodiment of the present application. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0066] The following will clearly and completely describe the technical solutions in the embodiments of the present application with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments of the present application, all other embodiments obtained by those of ordinary skill in the art without creative efforts belong to the scope of protection of the present application.

[0067] In the description of the present application, it should be understood that the terms "first" and "second" are only used for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly specifying the quantity of the indicated technical features. Thus, the features defined with "first" and "second" may explicitly or implicitly include one or more of such features. In the description of the present application, unless otherwise specified, the meaning of "a plurality" is two or more.

[0068] In the embodiments of the present application, the term "comprising", "including" or any other variation thereof is intended to cover non-exclusive inclusion, such that a process, article or device comprising a series of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, article or device. Without further limitation, an element defined by the phrase "comprising a..." does not exclude the presence of additional identical elements in the process, article or device comprising such element.

[0069] In the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or explanations. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be construed as being more preferred or having more advantages than other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present relevant concepts in a specific manner.

[0070] Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although the exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure can be implemented in various forms and should not be limited by the embodiments set forth herein. On the contrary, these embodiments are provided so that the present disclosure can be more thoroughly understood and the scope of the present disclosure can be fully conveyed to those skilled in the art. It should be noted that, without conflict, the embodiments in the present application and the features in the embodiments can be combined with each other. The present application will be described in detail below with reference to the drawings and in combination with the embodiments.

[0071] Based on the problems pointed out in the background art, in a quantum laser communication system, routing methods often rely on static routing tables or simple transmission algorithms, which show poor adaptability and scalability in a dynamic network environment. Especially for the adjustment of communication paths and transmission rates that need to be updated in real time, these methods fail to fully consider the quality changes of communication paths and the fluctuations of network conditions, resulting in low communication efficiency and poor transmission reliability. Therefore, how to dynamically adjust routing according to communication requirements and network status is the key to improving the performance of quantum laser communication systems.

[0072] In view of this, there is an urgent need for a dynamic routing technology for quantum laser communication to solve the problems of lack of real-time path evaluation and transmission rate adjustment in a dynamic network environment, resulting in low communication efficiency and poor transmission reliability.

[0073] In response to this, the present application provides a dynamic routing selection method. By dynamically updating the broadcast routing table through the DSDV algorithm, it can flexibly select a communication path according to the real-time network status and transmission requirements, and determine the transmission path in the communication path based on the communication requirement data. This dynamic adjustment mechanism can respond in real time to changes in the network environment, such as fluctuations in the quality of the transmission path, changes in the communication rate, and other factors affecting communication performance. Therefore, it can significantly improve the adaptability of the quantum laser communication system in complex and dynamic environments, optimize the data transmission efficiency, reduce network congestion and latency, and thus effectively improve the overall communication performance. And by evaluating the communication information of each transmission path to determine the main communication path for the data to be transmitted, it can comprehensively consider factors such as the delay, bandwidth, stability, and interference of the path, and optimize the transmission reliability while ensuring the data transmission speed. This evaluation mechanism ensures that data is always transmitted through the optimal communication path, avoiding data loss and transmission failures caused by improper path selection, and improving the robustness of the system. And when a transmission failure or path instability occurs, it can also switch to the backup path in real time to ensure that the data transmission is not interrupted. Finally, by encoding the data to be transmitted using Manchester coding, it can effectively reduce the noise interference of the signal in quantum laser communication, improve the anti-interference ability of the signal, and ensure the accurate transmission of data. Combining CRC check codes for data verification can further ensure the integrity and correctness of the transmitted data. So that when data incompleteness or errors are found, the data and communication path information can be recorded in time for subsequent fault troubleshooting and performance analysis.

[0074] In this way, the present application can greatly reduce the risk of data loss or inconsistency caused by transmission errors, ensuring high reliability of data transmission. In quantum laser communication, it can improve the efficiency and accuracy of communication path selection and routing update.

[0075] A dynamic routing selection system provided by an embodiment of the present application, as Figure 1 shown, the dynamic routing selection system 100 includes: a data acquisition module 101, a detection module 102, an evaluation module 103, a central control module 104, and a data processing module 105.

[0076] The data acquisition module 101 is configured to acquire the data to be transmitted and the communication requirement data of the data to be transmitted.

[0077] The detection module 102 is configured to update the broadcast routing table based on the DSDV algorithm, obtain the communication path based on the updated broadcast routing table, and determine the transmission path in the communication path based on the communication requirement data. The detection module 102 is electrically connected to the data acquisition module 101.

[0078] The evaluation module 103 is configured to obtain the communication information of the transmission path, evaluate the transmission path according to the communication information, and obtain an evaluation result. The evaluation module 103 is electrically connected to the detection module 102.

[0079] The central control module 104 is configured to determine the communication path of the data to be transmitted according to the evaluation result, and determine the main communication path of the data to be transmitted according to the real-time communication rate of the communication path. The central control module 104 is electrically connected to the evaluation module 103.

[0080] The central control module 104 is further configured to encode the data to be transmitted based on Manchester coding to generate a data packet, and send the data packet to the receiving end based on the main communication path. The receiving end is configured on the data processing module 105.

[0081] The data processing module 105 is configured to control the receiving end to decode the data packet to obtain decoded data, and verify the decoded data based on the CRC check code.

[0082] The data processing module 105 is further configured to record the decoded data and the main communication path if the verification of the decoded data fails.

[0083] In some embodiments of the present application, determining the transmission path in the communication path based on the communication requirement data includes:

[0084] The data acquisition module 101 is further configured to obtain the transmission length and the transmission requirement rate in the communication requirement data, and obtain the valid path in the communication path based on the shortest path fast SPFA algorithm and the transmission length.

[0085] The data acquisition module 101 is further configured to obtain the transmission rate of the valid path.

[0086] The detection module 102 is specifically configured to determine whether the valid path is a transmission path according to the relationship between the transmission rate and the transmission requirement rate.

[0087] In some embodiments of the present application, determining whether the valid path is a transmission path according to the relationship between the transmission rate and the transmission requirement rate includes:

[0088] The detection module 102 is specifically configured to determine that the valid path is not a transmission path when the transmission rate is lower than the transmission requirement rate.

[0089] Alternatively, the detection module 102 is specifically configured to determine that the valid path is a transmission path when the transmission rate is higher than or equal to the transmission requirement rate.

[0090] In some embodiments of the present application, evaluating the transmission path according to the communication information to obtain an evaluation result includes:

[0091] The data acquisition module 101 is further configured to acquire the communication bandwidth, communication interference intensity, and communication signal intensity in the communication information.

[0092] The evaluation module 103 is specifically configured to determine the score of the transmission path according to the communication bandwidth, communication interference intensity, and communication signal intensity through the following formula (Formula 3), and the evaluation result includes the score of the transmission path.

[0093] In some embodiments of the present application, determining the communication path of the data to be transmitted according to the evaluation result includes:

[0094] The central control module 104 is specifically configured to obtain the average score among the scores of the transmission paths and determine the average score as the score threshold.

[0095] The central control module 104 is specifically configured to determine whether the transmission path is a communication path according to the relationship between the score of the transmission path and the score threshold.

[0096] In some embodiments of the present application, determining whether the transmission path is a communication path according to the relationship between the score of the transmission path and the score threshold includes:

[0097] The central control module 104 is specifically configured to determine that the transmission path is not a communication path when the score of the transmission path is lower than or equal to the score threshold.

[0098] Alternatively, the central control module 104 is specifically configured to determine that the transmission path is a communication path when the score of the transmission path is higher than the score threshold.

[0099] In some embodiments of the present application, determining the main communication path of the data to be transmitted according to the real-time communication rate of the communication path includes:

[0100] The central control module 104 is specifically configured to obtain the average rate among the real-time communication rates and determine the average rate as the rate threshold.

[0101] The central control module 104 is specifically configured to determine the rate ratio between the real-time communication rate and the rate threshold, and determine the communication path corresponding to the largest rate ratio as the main communication path of the data to be transmitted.

[0102] It should be noted that for the description of the related content involved in the dynamic routing selection system, reference can be made to the following specific description of the dynamic routing selection method.

[0103] The following will introduce in detail the dynamic routing selection method provided by the embodiments of the present application with reference to the accompanying drawings.

[0104] A dynamic routing selection method provided by an embodiment of the present application is applied to Figure 1The dynamic routing system shown. As Figure 2 shown, the dynamic routing method includes:

[0105] S201. Obtain the data to be transmitted and the communication requirement data of the data to be transmitted.

[0106] S202. Update the broadcast routing table based on the Destination-Sequenced Distance Vector (DSDV) algorithm, obtain the communication path based on the updated broadcast routing table, and determine the transmission path in the communication path based on the communication requirement data.

[0107] In some embodiments of the present application, determining the transmission path in the communication path based on the communication requirement data includes: obtaining the transmission length and the transmission requirement rate in the communication requirement data, and obtaining the valid path in the communication path based on the Shortest Path Faster Algorithm (SPFA) and the transmission length; obtaining the transmission rate of the valid path, and determining whether the valid path is the transmission path according to the relationship between the transmission rate and the transmission requirement rate.

[0108] In some embodiments of the present application, determining whether the valid path is the transmission path according to the relationship between the transmission rate and the transmission requirement rate includes: when the transmission rate is lower than the transmission requirement rate, determining that the valid path is not the transmission path; or when the transmission rate is higher than or equal to the transmission requirement rate, determining that the valid path is the transmission path.

[0109] In a possible implementation manner, obtaining the transmission length and the transmission requirement rate in the communication requirement data, and obtaining the valid path in the communication path based on the Shortest Path Faster Algorithm (SPFA) and the transmission length includes: obtaining the relationship between the path cost, the transmission length, and the transmission requirement rate of the communication path, and the relationship between the path cost, the transmission length, and the transmission requirement rate can be determined by the following formula (Formula 1).

[0110] C(i,j) = L ij × f(Rd) Formula 1

[0111] Wherein, C(i,j) represents the path cost from node i to node j, L ij represents the transmission length from node i to node j, f(Rd) represents the influence function of the transmission requirement rate on the path cost, and Rd represents the transmission requirement rate.

[0112] In a possible implementation manner, the influence function f(Rd) of the transmission requirement rate on the path cost can be determined by the following formula (Formula 2).

[0113]

[0114] Optionally, the cost mean value between the path costs of each communication path can be obtained, and whether the communication path is a valid path can be determined according to the relationship between the path cost of each communication path and the cost mean value.

[0115] Specifically, when the path cost of the communication path is lower than or equal to the cost mean value, it is determined that the communication path is not a valid path; or, when the path cost of the communication path is higher than the cost mean value, it is determined that the communication path is a valid path.

[0116] Optionally, the broadcast routing table is updated based on the DSDV algorithm, and the communication path is obtained through this algorithm. Moreover, by obtaining the transmission length and transmission demand rate in the communication demand data and combining with the SPFA algorithm for path evaluation. Thus, during the path selection process, by evaluating the transmission rate of the transmission path, it is further verified whether the path meets the communication requirements. When the transmission rate of the valid path is lower than the transmission demand rate, this path is determined to be not suitable for data transmission, avoiding the negative impact of the low-rate path on the communication performance. On the contrary, when the transmission rate is higher than or equal to the demand rate, this path is considered to meet the requirements and becomes an available transmission path. This evaluation process can ensure the reliability of path selection and improve the communication efficiency. Finally, in order to further optimize the path selection, the scheme considers the mean analysis of the path cost. The path cost of the path is jointly determined by the transmission length and the transmission demand rate, and the path cost of each path is compared with the cost mean value. If the path cost of a certain path is lower than or equal to the cost mean value, this path is considered not to be a valid path because it may have a high transmission delay or insufficient bandwidth. On the contrary, when the path cost is higher than the cost mean value, it indicates that this path may be better and has a higher transmission efficiency, so it is considered to be a valid path.

[0117] It should be noted that the core of the SPFA algorithm is to select the shortest path from the source node to the destination node during the process of continuously updating the path cost. The calculation of the path cost takes into account the requirements of the transmission length and the transmission rate, ensuring that the selected path can not only meet the transmission requirements but also has the optimal transmission cost.

[0118] Furthermore, the broadcast routing table updated based on the DSDV algorithm can dynamically reflect the path changes in the network, which helps to improve the accuracy of path selection in a complex and dynamic communication environment. By combining the communication demand data (including the transmission length and the transmission demand rate) to determine the appropriate transmission path, it can ensure that the most suitable path for the actual needs is selected, avoiding the insufficient response of the traditional static routing selection method to environmental changes, thereby enhancing the adaptability and flexibility of the quantum laser communication system in different scenarios.

[0119] Secondly, the SPFA algorithm is adopted to optimize the path selection, so as to efficiently calculate the optimal path from the source node to the destination node. During the dynamic update process, the SPFA algorithm can more precisely evaluate the advantages and disadvantages of communication paths by comprehensively considering factors such as transmission length and transmission demand rate. This not only improves the reliability of the communication system and data transmission efficiency, but also can dynamically adjust the path according to the actual transmission demand to ensure that the path selection in the communication process always meets the real-time needs of the system. Finally, through the mean analysis and evaluation of the path cost, those paths with too high cost or not meeting the communication requirements can be automatically filtered out. By comparing the path cost with the mean value, the optimal path can be selected from multiple alternative paths, thus reducing the calculation and resource waste in the path selection process while ensuring the transmission rate and communication quality.

[0120] S203. Obtain the communication information of the transmission path, and evaluate the transmission path according to the communication information to obtain an evaluation result.

[0121] In some embodiments of the present application, evaluating the transmission path according to the communication information to obtain an evaluation result includes: obtaining the communication bandwidth, communication interference intensity, and communication signal intensity in the communication information, and determining the score of the transmission path through the following formula (Formula Three) according to the communication bandwidth, communication interference intensity, and communication signal intensity. The evaluation result includes the score of the transmission path.

[0122]

[0123] Wherein, η is the transmission efficiency coefficient, S is the communication signal intensity, I is the communication interference intensity, B is the communication bandwidth, and R is the score of the transmission path.

[0124] It should be noted that the communication bandwidth, communication interference intensity, and communication signal intensity are three important factors affecting communication quality, which respectively determine the transmission speed, transmission stability, and anti-interference ability of the signal. By obtaining this information (communication bandwidth, communication interference intensity, and communication signal intensity), the actual performance of each transmission path can be comprehensively evaluated, so as to select the path with the best performance to meet the data transmission requirements.

[0125] Optionally, during the process of determining the score of the transmission path through Formula Three, the transmission efficiency coefficient η, as a key factor, combines these information (communication bandwidth, communication interference intensity, and communication signal intensity) to determine the score of the transmission path.

[0126] It should be noted that the transmission efficiency coefficient η is a weight factor used to characterize the priority in path selection, and it can be dynamically adjusted according to different communication environments or application scenarios. The communication signal strength S, the communication interference strength I, and the communication bandwidth B respectively reflect the actual communication capabilities of the paths. By introducing these parameters into Equation 3, the advantages and disadvantages of each transmission path can be quantified, avoiding reliance on single factors such as bandwidth or signal strength, thus improving the accuracy of path selection.

[0127] Moreover, the score R of the transmission path is the quantification result of the comprehensive performance of the transmission path. By comprehensively weighting factors such as communication signal strength, communication interference strength, and communication bandwidth, a score value can be assigned to each transmission path to reflect its transmission performance under specific conditions. Through this scoring mechanism, it is possible to preferentially select the transmission paths with higher scores among numerous optional transmission paths, thereby improving the data transmission efficiency, reducing the impact of interference, and enhancing the stability of the network.

[0128] In this embodiment, by comprehensively evaluating multiple key communication parameters such as communication bandwidth, communication interference strength, and communication signal strength to determine the score of the transmission path, it can accurately reflect the performance of each transmission path in actual transmission. Compared with the traditional single-dimensional evaluation method, this multi-dimensional evaluation mechanism can more comprehensively consider various factors affecting data transmission quality, improving the scientificity and accuracy of path selection. Secondly, by introducing the transmission efficiency coefficient η as a weighting factor, the priority of path selection can be dynamically adjusted according to different network conditions and transmission requirements. It can flexibly adapt to complex communication environments and changing requirements, ensuring that the optimal-performing path can always be selected under different transmission conditions, thereby effectively improving the overall transmission efficiency. Finally, the path selection method based on scoring can not only improve the reliability of data transmission but also reduce interference and delay during the communication process. By accurately scoring the transmission paths, it can automatically avoid paths with high interference, high packet loss, or low bandwidth, and preferentially select paths with good signal strength, low interference, and high bandwidth, thus optimizing the data transmission quality, improving the stability and efficiency of the network, especially in complex or unstable network environments, it can significantly improve the overall performance of the communication system.

[0129] S204. Determine the communication path for the data to be transmitted according to the evaluation result, and determine the main communication path for the data to be transmitted according to the real-time communication rate of the communication path.

[0130] In some embodiments of the present application, determining the communication path for the data to be transmitted according to the evaluation result includes: obtaining the average score among the scores of the transmission paths, and determining the average score as the score threshold; determining whether the transmission path is a communication path according to the relationship between the score of the transmission path and the score threshold.

[0131] In some embodiments of the present application, determining whether a transmission path is a communication path according to the relationship between the score of the transmission path and the score threshold includes: when the score of the transmission path is lower than or equal to the score threshold, determining that the transmission path is not a communication path; or when the score of the transmission path is higher than the score threshold, determining that the transmission path is a communication path.

[0132] In some embodiments of the present application, determining the main communication path for the data to be transmitted according to the real-time communication rate of the communication path includes: obtaining the rate average value among the real-time communication rates and determining the rate average value as the rate threshold; determining the rate ratio between the real-time communication rate and the rate threshold, and determining the communication path corresponding to the largest rate ratio as the main communication path for the data to be transmitted.

[0133] In the embodiments of the present application, the score threshold is set by calculating the score average value among the scores of all transmission paths, so as to determine whether the score of the transmission path meets the transmission requirements through the score threshold. This method can filter out the transmission paths that are not suitable for data transmission, ensuring that only the qualified transmission paths are selected as communication paths. Based on this, the optimal path can be selected according to the dynamic evaluation results, improving the stability and reliability of data transmission.

[0134] Secondly, the main communication path for the data to be transmitted is determined according to the real-time communication rate. This process first determines the rate threshold by calculating the rate average value among the real-time communication rates of all communication paths. Then, the ratio (rate ratio) of the real-time communication rate of each path (communication path) to the rate threshold is compared, and the communication path with the largest rate ratio is selected as the main communication path. In this way, it can be ensured that the selected main communication path has sufficient bandwidth and transmission capacity, and can meet the data transmission requirements to the greatest extent, optimizing the overall transmission efficiency.

[0135] Finally, through the dynamic routing selection mechanism that combines the score and the real-time communication rate, the communication path (communication path) and the main communication path can be adjusted in real time according to the network environment and data transmission requirements, flexibly coping with problems such as bandwidth fluctuations, transmission delays, and interference that may occur in the network. This routing selection method that combines the score and the real-time communication rate can not only effectively improve the utilization rate of network resources, but also flexibly adjust the routing strategy according to the actual transmission conditions, ensuring efficient and stable data transmission under different network conditions.

[0136] S205. Encode the data to be transmitted based on Manchester encoding to generate a data packet, and send the data packet to the receiving end based on the main communication path.

[0137] Optionally, the 0 and 1 of data can be represented by the change of an electrical signal within each data bit period. For example, the data bit "0" can be represented by the electrical signal jumping from a high level to a low level, while the data bit "1" is represented by the electrical signal jumping from a low level to a high level. Through Manchester coding, the electrical signal during the data transmission process has distinct change points, enabling the receiving end to more easily perform clock synchronization and data recovery. This technology can effectively improve the reliability of data transmission, especially in a high-noise environment, avoiding the bit synchronization problem in data transmission.

[0138] Optionally, the data packet generated by Manchester coding is sent to the receiving end. Each data packet contains the encoded data, ensuring that the data has a certain anti-interference ability during the transmission process. Through Manchester coding, the sending end can convert the original data into an electrical signal form with stronger clock synchronization and anti-interference ability. The format of this data packet is more adaptable to high-frequency transmission and long-distance communication in practical applications, especially suitable for the high-precision and low-latency requirements in a quantum laser communication system.

[0139] In this way, sending the data packet to the receiving end based on the main communication path ensures the optimization of the data transmission path. Through dynamic routing selection and evaluation, the system can ensure that the selected main communication path has sufficient bandwidth and low latency, thereby effectively improving the overall transmission efficiency. The combination of Manchester coding and the main communication path not only improves the transmission stability of the data but also ensures that the data is not affected by network fluctuations and interference during the entire transmission process.

[0140] In the embodiments of the present application, through Manchester coding, the electrical signals in the data transmission process have clear change points, enabling the receiving end to easily perform clock synchronization and data recovery. This coding method effectively avoids the bit synchronization problem in data transmission. Especially in a high-noise environment, it can ensure the accuracy and integrity of data. For a quantum laser communication system, this characteristic is particularly important because the noise and interference in the quantum communication environment often affect data transmission, and the use of Manchester coding significantly improves the anti-interference ability during data transmission. Secondly, based on the fact that Manchester coding can enhance the anti-interference ability of data, it can ensure the stability of data during transmission. Each data packet is processed through Manchester coding, making the electrical signals in the data transmission process have stronger anti-interference ability. In a complex communication environment, this coding format enables the data packet to maintain a high signal quality even during long-distance and high-frequency transmission, avoiding data loss or error caused by signal attenuation or interference. This feature enables the quantum laser communication system to adapt to a wider range of application scenarios and meet the requirements of high precision and low latency. Finally, the dynamic routing selection based on the main communication path ensures the optimization of the data transmission path, thereby improving the overall transmission efficiency. The system evaluates the performance of each communication path in real time, selects the best path with high bandwidth and low latency as the main communication path, and sends the encoded data packet to the receiving end through this path. The combination of this dynamic routing selection and Manchester coding not only ensures the fast transmission of data but also ensures that the data is not affected by network fluctuations and interference during transmission, greatly improving the stability and efficiency of the communication system.

[0141] S206. Control the receiving end to decode the data packet to obtain decoded data, and verify the decoded data based on the cyclic redundancy CRC check code.

[0142] S207. If the verification of the decoded data fails, record the decoded data and the main communication path.

[0143] Optionally, the receiving end decodes the received encoded data packet to obtain decoded data, and restores the encoded data packet to the original data content. The decoding process is implemented depending on the rules of the previous coding method (such as Manchester coding) to ensure that the lost or incorrect parts during transmission can be repaired.

[0144] Optionally, the decoded data after decoding provides a basis for further verification to ensure that the data obtained by the receiving end is semantically complete and accurate.

[0145] It should be noted that CRC check is a powerful error detection technology, which can detect possible bit errors during the transmission process through a specific check algorithm. Therefore, at the receiving end, the decoded data is verified through the CRC check code. If the received data does not match the expected check value, it indicates that there are transmission errors or data loss in the data. CRC check can effectively ensure the integrity and correctness of the data. For a high-precision communication method such as quantum laser communication, the use of CRC is crucial, which can greatly reduce the occurrence of bit errors and improve the reliability of communication.

[0146] Optionally, if the verification of the decompressed data fails, it is necessary to record the data and the corresponding main communication path. This mechanism helps with fault analysis and problem tracking. In the case of data verification failure, the relevant data and path information will be recorded to provide data support for subsequent error troubleshooting and optimization.

[0147] In the embodiments of this application, by relying on the Manchester coding rule, the receiving end can effectively restore the encoded data to the original data content, and this process ensures the accuracy of the transmitted data. Manchester coding can effectively avoid the problem of bit synchronization, so it can still maintain a high data recovery rate in a high-noise environment. This technology ensures that the receiving end can correctly receive and interpret the transmitted encoded data, providing a solid foundation for subsequent verification. Secondly, the CRC check code is used to verify the decoded data, ensuring the integrity and accuracy during the data transmission process. CRC check can detect and correct errors generated during the transmission process. Especially in a system such as quantum laser communication that requires high precision, CRC check is crucial. It can greatly reduce the bit error rate in data transmission, improve the reliability of the data, and ensure the quality and stability of communication. In complex environments such as high interference and long distance, CRC check provides strong guarantee for the reliability of the communication system. Finally, if the verification of the decoded data fails, the error data and its corresponding main communication path information will be recorded. This mechanism has the ability of self-diagnosis and fault troubleshooting, providing data support for subsequent optimization of the communication path and reduction of errors. This process provides valuable feedback information for network operation and maintenance personnel, enabling them to identify and solve problems in a timely manner and further optimize the communication quality.

[0148] In summary, the beneficial effects of this application are as follows: By dynamically updating the broadcast routing table using the DSDV algorithm, the communication path can be flexibly selected according to the real-time network status and transmission requirements, and the transmission path in the communication path is determined based on the communication requirement data. This dynamic adjustment mechanism can respond in real time to changes in the network environment, such as fluctuations in the quality of the transmission path, changes in the communication rate, and other factors affecting communication performance. Therefore, it can significantly improve the adaptability of the quantum laser communication system in complex and dynamic environments, optimize the data transmission efficiency, reduce network congestion and latency, and thus effectively enhance the overall communication performance. And by evaluating the communication information of each transmission path to determine the main communication path for the data to be transmitted, factors such as the delay, bandwidth, stability, and interference of the path can be comprehensively considered. While ensuring the data transmission speed, the reliability of the transmission is optimized. This evaluation mechanism ensures that the data is always transmitted through the optimal communication path, avoiding data loss and transmission failures caused by improper path selection, and enhancing the robustness of the system. And when a transmission failure or path instability occurs, it can also switch to the backup path in real time to ensure that the data transmission is not interrupted. Finally, by encoding the data to be transmitted using Manchester coding, the noise interference of the signal can be effectively reduced in quantum laser communication, the anti-interference ability of the signal can be improved, and the accurate transmission of the data can be ensured. Combining with the CRC check code for data verification can further ensure the integrity and correctness of the transmitted data. So that when it is found that the data is incomplete or an error occurs, the data and communication path information can be recorded in time for subsequent fault troubleshooting and performance analysis.

[0149] In this way, this application can greatly reduce the risk of data loss or inconsistency caused by transmission errors, ensuring high reliability of data transmission. In quantum laser communication, it can improve the efficiency and accuracy of communication path selection and routing update.

[0150] That is, by dynamically updating the broadcast routing table based on the DSDV algorithm, the communication path can be flexibly selected according to the real-time network status and transmission requirements. This dynamic adjustment mechanism can respond to changes in the network environment in real time, such as fluctuations in the quality of the transmission path, changes in the communication rate, and other factors affecting communication performance. Therefore, compared with traditional static routing methods, it can significantly improve the adaptability of the quantum laser communication system in complex and dynamic environments, optimize data transmission efficiency, reduce network congestion and latency, and thus effectively improve the overall communication performance. Secondly, by evaluating the communication information of each transmission path, factors such as path delay, bandwidth, stability, and interference can be comprehensively considered. While ensuring the data transmission speed, the reliability of the transmission is optimized. This evaluation mechanism ensures that data is always transmitted through the optimal communication path, avoiding data loss and transmission failures caused by improper path selection, and enhancing the robustness of the system. When a transmission failure or path instability occurs, it can also switch to the backup path in real time to ensure the uninterrupted data transmission. Finally, by using Manchester coding to encode the data to be transmitted, the noise interference of the signal can be effectively reduced in quantum laser communication, the anti-interference ability of the signal can be improved, and the accurate transmission of data can be ensured. Combining with the CRC (Cyclic Redundancy Check) check code for data verification can further ensure the integrity and correctness of the transmitted data. When verifying the decoded data at the receiving end, if it is found that the data is incomplete or there are errors, the data and communication path information can be recorded in time for subsequent fault troubleshooting and performance analysis. This automatic verification mechanism can greatly reduce the risk of data loss or inconsistency caused by transmission errors and ensure the high reliability of data transmission.

[0151] The above mainly introduces the solution provided by the embodiments of the present application from the perspective of methods. To implement the above functions, it includes the corresponding hardware structure and / or software module for executing each function. Those skilled in the art should easily realize that, combining the units and algorithm steps of each example described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed in the way of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present application.

[0152] Embodiments of the present application can divide the dynamic routing selection device into functional modules according to the above method examples. For example, each functional module can be divided corresponding to each function, or two or more functions can be integrated into one processing module. The above integrated modules can be implemented in the form of hardware or in the form of software functional modules. Optionally, the division of modules in the embodiments of the present application is illustrative, merely a logical function division, and there may be other division methods in actual implementation.

[0153] As Figure 3 shown, it is a schematic structural diagram of a dynamic routing selection device provided by an embodiment of the present application. Figure 3 The shown dynamic routing selection device includes: an acquisition unit 301, a processing unit 302, an evaluation unit 303, and a sending unit 304.

[0154] The acquisition unit 301 is configured to acquire data to be transmitted and communication requirement data of the data to be transmitted.

[0155] The processing unit 302 is configured to update the broadcast routing table based on the destination sequence distance vector (DSDV) algorithm.

[0156] The acquisition unit 301 is further configured to acquire a communication path based on the updated broadcast routing table.

[0157] The processing unit 302 is further configured to determine a transmission path in the communication path based on the communication requirement data.

[0158] The acquisition unit 301 is further configured to acquire communication information of the transmission path.

[0159] The evaluation unit 303 is configured to evaluate the transmission path according to the communication information to obtain an evaluation result.

[0160] The processing unit 302 is further configured to determine a communication path for the data to be transmitted according to the evaluation result, and determine a main communication path for the data to be transmitted according to the real-time communication rate of the communication path.

[0161] The processing unit 302 is further configured to encode the data to be transmitted based on Manchester coding to generate a data packet.

[0162] The sending unit 304 is configured to send the data packet to the receiving end based on the main communication path.

[0163] The processing unit 302 is further configured to control the receiving end to decode the data packet to obtain decoded data, and verify the decoded data based on a cyclic redundancy check (CRC) code.

[0164] The processing unit 302 is further configured to record the decoded data and the main communication path if the verification of the decoded data fails.

[0165] Optionally, the obtaining unit 301 is further configured to obtain the transmission length and transmission demand rate in the communication demand data.

[0166] The processing unit 302 is further configured to obtain an effective path in the communication path based on the shortest path fast SPFA algorithm and the transmission length.

[0167] The obtaining unit 301 is further configured to obtain the transmission rate of the effective path.

[0168] The processing unit 302 is further configured to determine whether the effective path is a transmission path according to the relationship between the transmission rate and the transmission demand rate.

[0169] Optionally, the processing unit 302 is specifically configured to determine that the effective path is not a transmission path when the transmission rate is lower than the transmission demand rate.

[0170] Alternatively, the processing unit 302 is specifically configured to determine that the effective path is a transmission path when the transmission rate is higher than or equal to the transmission demand rate.

[0171] Optionally, the obtaining unit 301 is further configured to obtain the communication bandwidth, communication interference intensity, and communication signal intensity in the communication information.

[0172] The processing unit 302 is further configured to determine the score of the transmission path according to the communication bandwidth, communication interference intensity, and communication signal intensity through Formula 3, and the evaluation result includes the score of the transmission path.

[0173] Optionally, the processing unit 302 is further configured to obtain the average score among the scores of the transmission paths and determine the average score as the score threshold.

[0174] The processing unit 302 is further configured to determine whether the transmission path is a communication path according to the relationship between the score of the transmission path and the score threshold.

[0175] Optionally, the processing unit 302 is specifically configured to determine that the transmission path is not a communication path when the score of the transmission path is lower than or equal to the score threshold.

[0176] Alternatively, the processing unit 302 is specifically configured to determine that the transmission path is a communication path when the score of the transmission path is higher than the score threshold.

[0177] Optionally, the processing unit 302 is further configured to obtain the average rate among the real-time communication rates and determine the average rate as the rate threshold.

[0178] The processing unit 302 is further configured to determine the rate ratio between the real-time communication rate and the rate threshold, and determine the communication path corresponding to the largest rate ratio as the main communication path for the data to be transmitted.

[0179] AsFigure 4 As shown in the figure, it is a schematic structural diagram of a dynamic routing selection device provided by an embodiment of the present application. The dynamic routing selection device includes: a processor 401, a memory 402, a communication interface 403, and a bus 404. The processor 401, the memory 402, and the communication interface 403 can be connected through the bus 404.

[0180] The processor 401 is the control center of the dynamic routing selection device, and can be a single processor or a collective term for multiple processing elements. For example, the processor 401 can be a general-purpose central processing unit (CPU), or other general-purpose processors. Among them, the general-purpose processor can be a microprocessor or any conventional processor, etc.

[0181] As an embodiment, the processor 401 can include one or more CPUs, such as Figure 4 the CPUs 0 and 1 shown in the figure.

[0182] The memory 402 can be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a magnetic disk storage medium, or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0183] In a possible implementation manner, the memory 402 can exist independently of the processor 401. The memory 402 can be connected to the processor 401 through the bus 404 for storing instructions or program code. When the processor 401 calls and executes the instructions or program code stored in the memory 402, the dynamic routing selection method provided by the following embodiments of the present application can be implemented.

[0184] In another possible implementation manner, the memory 402 can also be integrated with the processor 401.

[0185] The communication interface 403 is used for the dynamic routing selection device to be connected to other devices through a communication network, which can be an Ethernet network, a wireless access network, a wireless local area network (WLAN), etc. The communication interface 403 may include a receiving unit for receiving data and a transmitting unit for transmitting data.

[0186] The bus 404 can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, etc. This bus can be divided into an address bus, a data bus, a control bus, etc. For the sake of simplicity of representation, Figure 4 only a thick line is used to represent it in the figure, but it does not mean that there is only one bus or one type of bus.

[0187] It should be noted that Figure 4 the structure shown in the figure does not constitute a limitation on the dynamic routing selection device. Except Figure 4 for the components shown, the dynamic routing selection device may include more or fewer components than those shown in the figure, or combine some components, or have different component arrangements.

[0188] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk memories, CD-ROMs, optical memories, etc.) containing computer-usable program codes.

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

[0190] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-readable memory produce a manufacture including an instruction device that implements the functions specified in one or more of the processes and / or blocks Figure 1 in one or more of the processes and / or blocks Figure 1 specified in the flowchart.

[0191] These computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable apparatus provide steps for implementing the functions specified in one or more of the processes and / or blocks Figure 1 in one or more of the processes and / or blocks Figure 1 specified in the flowchart.

[0192] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present application and are not intended to limit them. Although the present application has been described in detail with reference to the above embodiments, those of ordinary skill in the art should understand that: modifications or equivalent substitutions can still be made to the specific embodiments of the present application, and any modifications or equivalent substitutions that do not depart from the spirit and scope of the present application should be covered by the protection scope of the claims of the present application.

[0193] The above is only the specific embodiment of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present application, and all of them should be covered by the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A dynamic routing method, characterized in that, Including: Obtain the data to be transmitted and the communication requirement data of the data to be transmitted; Update the broadcast routing table based on the Destination-Sequenced Distance-Vector (DSDV) algorithm, obtain the communication path based on the updated broadcast routing table, and determine the transmission path in the communication path based on the communication requirement data; Obtain the communication information of the transmission path, evaluate the transmission path according to the communication information, and obtain an evaluation result; Determine the communication path of the data to be transmitted according to the evaluation result, and determine the main communication path of the data to be transmitted according to the real-time communication rate of the communication path; Encode the data to be transmitted based on Manchester coding to generate a data packet, and send the data packet to the receiving end based on the main communication path; Control the receiving end to decode the data packet to obtain decoded data, and verify the decoded data based on the Cyclic Redundancy Check (CRC) code; If the verification of the decoded data fails, record the decoded data and the main communication path.

2. The dynamic routing method according to claim 1, wherein The determining the transmission path in the communication path based on the communication requirement data includes: Obtain the transmission length and transmission requirement rate in the communication requirement data, and obtain the valid path in the communication path based on the Shortest Path Faster Algorithm (SPFA) and the transmission length; Obtain the transmission rate of the valid path, and determine whether the valid path is the transmission path according to the relationship between the transmission rate and the transmission requirement rate.

3. The dynamic routing method according to claim 2, wherein The determining whether the valid path is the transmission path according to the relationship between the transmission rate and the transmission requirement rate includes: When the transmission rate is lower than the transmission requirement rate, determine that the valid path is not the transmission path; Or, when the transmission rate is higher than or equal to the transmission requirement rate, determine that the valid path is the transmission path.

4. The dynamic routing method according to claim 1, wherein The evaluating the transmission path according to the communication information to obtain an evaluation result includes: Obtain the communication bandwidth, communication interference intensity, and communication signal intensity in the communication information, and determine the score of the transmission path through the following formula according to the communication bandwidth, the communication interference intensity, and the communication signal intensity. The evaluation result includes the score of the transmission path; Where η is the transmission efficiency coefficient, S is the communication signal intensity, I is the communication interference intensity, B is the communication bandwidth, and R is the score of the transmission path.

5. The dynamic routing method according to claim 1, characterized in that The determining the communication path of the data to be transmitted according to the evaluation result includes: Obtain the average score among the scores of the transmission paths, and determine the average score as the score threshold; Determine whether the transmission path is the communication path according to the relationship between the score of the transmission path and the score threshold.

6. The dynamic routing method according to claim 5, characterized in that The determining whether the transmission path is the communication path according to the relationship between the score of the transmission path and the score threshold includes: When the score of the transmission path is lower than or equal to the score threshold, determine that the transmission path is not the communication path; Alternatively, when the score of the transmission path is higher than the score threshold, determine the transmission path as the communication path.

7. The dynamic routing method according to claim 1, wherein The determining of the communication main path of the data to be transmitted according to the real-time communication rate of the communication path includes: Obtain the rate average value among the real-time communication rates, and determine the rate average value as the rate threshold; Determine the rate ratio between the real-time communication rate and the rate threshold, and determine the communication path corresponding to the largest rate ratio as the communication main path of the data to be transmitted.

8. A dynamic routing system, characterized in that, For implementing the dynamic routing selection method according to any one of claims 1-7, including: A data acquisition module configured to acquire data to be transmitted and communication requirement data of the data to be transmitted; A detection module configured to update a broadcast routing table based on the DSDV algorithm, obtain a communication path based on the updated broadcast routing table, and determine a transmission path in the communication path based on the communication requirement data, the detection module being electrically connected to the data acquisition module; An evaluation module configured to acquire communication information of the transmission path, and evaluate the transmission path according to the communication information to obtain an evaluation result, the evaluation module being electrically connected to the detection module; A central control module configured to determine the communication path of the data to be transmitted according to the evaluation result, and determine the communication main path of the data to be transmitted according to the real-time communication rate of the communication path, the central control module being electrically connected to the evaluation module; The central control module is further configured to encode the data to be transmitted based on Manchester coding to generate a data packet, and send the data packet to a receiving end based on the communication main path, the receiving end being configured on a data processing module; The data processing module is configured to control the receiving end to decode the data packet to obtain decoded data, and verify the decoded data based on a CRC check code; The data processing module is further configured to record the decoded data and the communication main path if the verification of the decoded data is unqualified.

9. A dynamic routing device, characterized in that, Including: A processor and a memory; wherein, the memory is used to store one or more programs, the one or more programs include computer execution instructions, when the dynamic routing selection device runs, the processor executes the computer execution instructions stored in the memory, so that the dynamic routing selection device executes the dynamic routing selection method according to any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, When the computer execution instructions stored in the computer-readable storage medium are executed by the processor of the dynamic routing selection device, the dynamic routing selection device can execute the dynamic routing selection method according to any one of claims 1-7.

Images