A data transmission method and system based on digital communication

Abstract

The present invention provides a data transmission method and system based on digital communication, which relates to the technical field of data transmission. The method includes: the sending end encapsulates the data to be transmitted to form a data packet, and the sending end performs format conversion and encoding on the data packet; according to the network topology structure, the performance of intermediate nodes, and the transmission link score, intermediate nodes and a transmission link are selected. Through the transmission link, the sending end sends the data after format conversion and encoding to the receiving end through the intermediate nodes; after receiving the data packet, the receiving end decodes and verifies it, and stores and backs up the received data packet and the data after decoding and verification; if the verification fails, the receiving end requests the sending end to retransmit the data packet; by comprehensively considering aspects such as data encapsulation, format conversion, encoding method, routing selection, link optimization, data verification, and retransmission mechanism, it is ensured that data can be stably and efficiently transmitted in a complex and changeable network environment.

Description

Technical Field

[0001] The present application relates to the technical field of data transmission, and particularly to a data transmission method and system based on digital communication. Background Art

[0002] With the rapid development of information technology, the importance of data transmission has become increasingly prominent in various fields. Whether it is communication between Internet applications, Internet of Things devices, or data interaction within an enterprise, etc., efficient and reliable data transmission methods are required. However, in the existing field of digital communication, the selection and implementation of data transmission methods are crucial for ensuring data integrity, security, and efficiency. However, traditional data transmission methods often have certain limitations when faced with complex and changing network environments and diverse data transmission requirements.

[0003] On the one hand, traditional data transmission methods may not be flexible enough in data encapsulation and format conversion, and it is difficult to adapt to differences in different transmission requirements and transmission environments. For example, the structure of data packets may be too simple or complex, resulting in problems such as low transmission efficiency or data loss. In addition, traditional coding methods may not fully guarantee data security, making the data vulnerable to attacks or tampering during transmission.

[0004] On the other hand, traditional data transmission methods also have deficiencies in routing selection and link optimization; traditional routing algorithms often ignore the performance of intermediate nodes and the actual quality of transmission links, resulting in sub - optimal selection of data transmission paths, thereby affecting the transmission speed and stability of data. Especially in complex network environments, factors such as the load of intermediate nodes, packet loss rate, and network congestion can all have an important impact on data transmission.

[0005] In addition, traditional data transmission methods also have certain defects in data verification and re - transmission mechanisms. Traditional verification methods may not accurately detect errors or tampering in data during transmission, while traditional re - transmission mechanisms may be too simple or complex, resulting in low data transmission efficiency or resource waste. Summary of the Invention

[0006] Based on the above problems, the present application provides a data transmission method and system based on digital communication, which comprehensively considers multiple aspects such as data encapsulation, format conversion, coding method, routing selection, link optimization, data verification, and re - transmission mechanism to ensure stable and efficient data transmission in complex and changing network environments.

[0007] The object of the present application is achieved by the following technical solutions:

[0008] In the first aspect, the present application provides a data transmission method based on digital communication, including:

[0009] S1. The sending end encapsulates the data to be transmitted to form a data packet and marks the data transmission priority; the sending end performs format conversion and encoding on the data packet to meet the transmission requirements;

[0010] S2. According to the network topology, the performance of intermediate nodes, and the transmission link score, select intermediate nodes and a transmission link. Through the transmission link, the sending end sends the data after format conversion and encoding to the receiving end through the intermediate nodes; the transmission link includes a first link and a second link; the first link is used for the sending end to transmit the data packet to the intermediate node, and the second link is used for the intermediate node to transmit the data to the receiving end;

[0011] S3. After receiving the data packet, the receiving end decodes and verifies it, and stores and backs up the received data packet and the data after decoding and verification; if the verification fails, the receiving end requests the sending end to retransmit the data packet.

[0012] In a second aspect, the present application further provides a data transmission system based on digital communication, and the system includes:

[0013] A data encapsulation module, which is used for the sending end to encapsulate the data to be transmitted to form a data packet and mark the data transmission priority; the sending end performs format conversion and encoding on the data packet to meet the transmission requirements;

[0014] A data transmission module, which is used to select intermediate nodes and a transmission link according to the network topology, the performance of intermediate nodes, and the transmission link score. Through the transmission link, the sending end sends the data after format conversion and encoding to the receiving end through the intermediate nodes; the transmission link includes a first link and a second link; the first link is used for the sending end to transmit the data packet to the intermediate node, and the second link is used for the intermediate node to transmit the data to the receiving end;

[0015] A decoding and verification module, which is used for the receiving end to decode and verify the data packet after receiving it, and store and back up the received data packet and the data after decoding and verification; if the verification fails, the receiving end requests the sending end to retransmit the data packet.

[0016] In a third aspect, the present application further provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the memory. The processor executes the program to implement any one of the data transmission methods based on digital communication provided by the present application.

[0017] The beneficial effects of the present invention include: The sending end preprocesses and encapsulates the data to be transmitted to form data packets, and marks the data transmission priority, which helps to allocate resources according to the priority during data transmission and ensure the priority transmission of important data. By comprehensively considering the network topology, the performance of intermediate nodes, and the transmission link score, the optimal intermediate nodes and transmission links are selected, which can minimize the data transmission delay and packet loss rate, and improve the reliability and efficiency of data transmission; The receiving end decodes and verifies the data packets after receiving them, and stores and backs up the decoded and verified data, which helps to ensure the integrity and reliability of the data and provides the ability to recover data. The intermediate nodes verify the received data packets and request the sending end to retransmit the data packets when necessary. In addition, the cache mechanism is used to improve the fault tolerance and reliability of data transmission; The queue lengths, packet loss rates, and delay rates of the intermediate nodes and the receiving end are monitored in real time, and it is determined whether to reduce the sending frequency of the sending end according to the monitoring results, which helps to prevent network congestion and data loss and ensure the stability of data transmission. According to the status of the intermediate nodes or the receiving end, as well as the data priorities, packet loss rates, delay rates, and data bandwidth occupancy of multiple sending ends, the sending frequency is dynamically adjusted, which helps to balance the network load and optimize the data transmission performance. Description of the Drawings

[0018] Figure 1 is a schematic diagram of a data transmission method based on digital communication provided by an embodiment of the present application. Detailed Embodiments

[0019] Next, in combination with the drawings and specific embodiments, the present application will be further described. It should be noted that, on the premise of no conflict, the following-described embodiments or technical features can be arbitrarily combined to form new embodiments.

[0020] The present application provides a data transmission method based on digital communication, and the method includes:

[0021] S1. The sending end encapsulates the data to be transmitted to form data packets, and marks the data transmission priority; the sending end performs format conversion and encoding on the data packets to meet the transmission requirements;

[0022] S2. According to the network topology, the performance of intermediate nodes, and the transmission link score, intermediate nodes and transmission links are selected. Through the transmission link, the sending end transmits the data after format conversion and encoding to the receiving end through the intermediate nodes; the transmission link includes a first link and a second link; the first link is used for the sending end to transmit the data packets to the intermediate nodes, and the second link is used for the intermediate nodes to transmit the data to the receiving end;

[0023] S3. After receiving the data packet, the receiving end decodes and verifies it, stores and backs up the received data packet and the data after decoding and verification; if the verification fails, the receiving end requests the sending end to retransmit the data packet.

[0024] The working principle of the above technical solution is as follows: The sending end first encapsulates the original data to be transmitted and organizes it into the form of data packets. Each data packet contains the data itself and control information related to data transmission, such as marks of data transmission priority, etc. The sending end performs format conversion on the encapsulated data packets to meet the transmission requirements. This may include converting the data into a format suitable for a specific transmission medium, or adjusting the length, structure, etc. of the data packets. Then, the sending end encodes the data packets to improve the reliability and efficiency of data transmission. The encoding process includes operations such as data compression, encryption, adding check codes, etc.

[0025] According to the network topology, the performance of intermediate nodes, and the transmission link score, the sending end selects appropriate intermediate nodes and transmission links for data transmission. The transmission links are divided into the first link and the second link. The first link is used for the sending end to transmit the data packet to the intermediate node, and the second link is used for the intermediate node to transmit the data packet to the receiving end. The routing selection algorithm comprehensively considers various factors, such as the bandwidth, delay, packet loss rate, etc. of the link, to select the optimal transmission path.

[0026] The sending end transmits the format-converted and encoded data packets to the selected intermediate node through the first link. After receiving the data packet, the intermediate node performs temporary storage and forwarding operations on it. The data packet is transmitted from the intermediate node to the receiving end through the second link.

[0027] After receiving the data packet, the receiving end first performs a decoding operation. The decoding process is the opposite of the encoding process at the sending end, including operations such as data decompression, decryption, removing check codes, etc. The receiving end verifies the decoded data packet to check whether an error has occurred during the transmission of the data packet. The verification process may include comparing check codes, verifying data integrity, etc. If the verification is successful, the receiving end stores and backs up the data packet; if the verification fails, the receiving end will send a retransmission request to the sending end, requesting the sending end to retransmit the data packet.

[0028] In summary, the data transmission method based on digital communication realizes reliable data transmission and efficient utilization through steps such as data encapsulation and encoding, routing selection and data transmission, and data decoding and verification. This method fully considers factors such as network topology, intermediate node performance, and transmission link score during the data transmission process, and can select the optimal transmission path and strategy according to the actual situation, thereby improving the reliability and efficiency of data transmission.

[0029] The effects of the above technical solution are as follows: By encapsulating the data to be transmitted into data packets and marking the data transmission priority, it can ensure that critical data is preferentially processed during transmission, thereby improving the reliability and timeliness of data transmission. Performing format conversion and encoding on the data packets can make them adapt to different transmission media and protocol requirements, reduce transmission failures caused by format incompatibility or encoding errors, and further improve the stability of data transmission. According to the network topology, the performance of intermediate nodes, and the transmission link score, selecting the optimal intermediate nodes and transmission links for data transmission can make full use of network resources, avoid network congestion and transmission bottlenecks, and improve transmission efficiency. Dividing the transmission link into a first link and a second link, which are respectively used for data transmission from the sending end to the intermediate node and from the intermediate node to the receiving end, can achieve flexible configuration and optimization of the link, and further improve the utilization rate of network resources and transmission efficiency. After receiving the data packets, the receiving end decodes and verifies them, which can ensure the integrity and accuracy of the data, promptly detect and correct errors during transmission, and enhance data security. If the verification fails, the receiving end requests the sending end to retransmit the data packets, and this retransmission mechanism can further ensure the reliable transmission of data and avoid the impact on services caused by data loss or damage. The receiving end stores and backs up the received data packets and the data after decoding and verification, which can facilitate subsequent data management and use, and also contribute to the implementation of data recovery and disaster recovery plans.

[0030] In some embodiments, S1 includes:

[0031] Preprocess the data to be transmitted, and the preprocessing includes splitting the data to be transmitted into multiple data segments, preliminary data detection, and / or compression;

[0032] Create data packets for the split data respectively and set the transmission priority. The data packets include original data, message description, unique identification mark, tagging information, data length, and check code;

[0033] Perform different levels of encryption settings according to the tagging information; where the tagging information includes sensitive information and non-sensitive information.

[0034] The principles and effects of the above technical solution are as follows: The data to be transmitted is segmented into multiple data segments, which helps to optimize the data transmission and processing efficiency and reduce the risk of data loss or corruption. After data segmentation, preliminary detection is performed to identify and remove errors, redundancies, or invalid information in the data to ensure the quality of the data for subsequent transmission and processing. The segmented data is compressed to reduce the data volume and transmission time and save storage space at the same time. The compression algorithm can be selected according to the characteristics of the data and the transmission requirements. Data packets are created for each segmented data segment. In addition to the original data, the data packets also contain additional information such as message descriptions, unique identification marks, tagging information, data lengths, and check codes. The message description is used to describe the content and format of the data packet; the unique identification mark is used to identify the uniqueness of the data packet, facilitating tracking and identification during transmission and reception; the tagging information is used to identify the sensitivity of the data; the data length is used to indicate the length of the data in the data packet; the check code is used to verify the data packet at the receiving end to detect whether errors occur during data transmission. According to the sensitive and non-sensitive information in the tagging information, different levels of encryption settings are made for the data packets. For sensitive information, stronger encryption algorithms and higher key lengths are used for encryption to ensure the security and privacy of the data during transmission. For non-sensitive information, weaker encryption algorithms can be used or no encryption is performed to save computing resources and improve transmission efficiency.

[0035] In some embodiments, S2 includes:

[0036] According to the network topology structure, a plurality of first link lengths and second link lengths are obtained; the first link length is the length of each link from the sending end to the intermediate node; the second link length is the length of each link from the intermediate node to the receiving end;

[0037] For each intermediate node, according to the first link length and each second link length, the transmission link lengths of each path from the sending end to the receiving end passing through the intermediate node are calculated;

[0038] According to the transmission link lengths of each path of each intermediate node, a first score of the intermediate node is obtained;

[0039] According to the first score of the intermediate node and the performance score of the intermediate node, the total score of each intermediate node is obtained; the intermediate node with the highest total score is selected as the preferred node for transmitting the currently to-be-transmitted data of the sending end; in the order from the highest total score to the lowest, the other nodes are sequentially used as alternative nodes; wherein, the performance score of the intermediate node is obtained through the current load, the packet loss rate within the statistical time period, the network congestion situation, the energy consumption of the node, and the reliability of the node;

[0040] Specifically, the total score of the intermediate node is obtained through the following formula:

[0041]

[0042] Among them, Pj is the total score of the j-th intermediate node within time t, and Pj1 is the first score of the j-th intermediate node. is the relative score of the reliability of the j-th intermediate node under different loads; Cj(t) is the network congestion score of the j-th intermediate node within time t, and Ej(t) is the energy consumption score of the j-th intermediate node within time t; α and β are constants; Rj(t) is the reliability score of the j-th intermediate node within time t; Fj(t) is the load of the j-th intermediate node within time t; Lj(t) is the packet loss rate of the j-th intermediate node within time t; among them, Cj(t), Ej(t), Fj(t), Rj(t), and Lj(t) are all values after normalization processing, and the range is (0, 1);

[0043] The intermediate node selected according to the data to be transmitted, and the lengths of multiple first links and the second link corresponding to this node; determine the first factor of the first link and the first factor of the second link; among them, the first factor is obtained by normalizing the transmission link length.

[0044] According to the first factor of the first link and the score of the first link, obtain the preferred first link; according to the first factor of the second link and the score of the second link, obtain the preferred second link; among them, the scores of the first link and the second link are both determined by their packet loss rate and delay rate.

[0045] The working principle of the above technical solution is as follows: According to the network topology, the system first calculates the lengths of the first links from the sending end to each intermediate node (i.e., the lengths of the links from the sending end to the intermediate nodes), and the lengths of the second links from the intermediate nodes to the receiving end (i.e., the lengths of the links from the intermediate nodes to the receiving end).

[0046] For each intermediate node, according to the lengths of the corresponding multiple first links and second links, calculate the transmission link lengths of all possible paths from the sending end to the receiving end passing through this intermediate node, which helps to evaluate the transmission efficiency and cost of different paths.

[0047] According to the transmission link lengths of each path of each intermediate node, calculate the first score of the intermediate node, which is usually related to the physical length of the link. At the same time, comprehensively evaluate the advantages and disadvantages of the intermediate node according to the performance scores of the intermediate node (including factors such as the current load, packet loss rate within the statistical time period, network congestion situation, energy consumption of the node, and reliability of the node).

[0048] Specifically, the total score of the intermediate node is calculated through a complex formula that takes into account multiple factors such as the first score of the intermediate node, the relative reliability score, the network congestion score, the energy consumption score, etc., and accumulates the scores within the time range through integration.

[0049] Based on the total score of the intermediate node, the intermediate node with the highest total score is selected as the preferred node for transmitting the data currently to be transmitted by the sending end. At the same time, in the order from the highest total score to the lowest, other nodes are successively used as alternative nodes.

[0050] After determining the intermediate node, according to the corresponding multiple first link lengths and second link lengths of this node, the respective first factors are determined (which may be related to factors such as the physical characteristics of the link and the transmission efficiency).

[0051] Based on the first factor of the first link and the score of the first link, the preferred first link based on this intermediate node is selected. Similarly, based on the first factor of the second link and the score of the second link, the preferred second link based on this intermediate node is selected. For example, the packet loss rate and delay rate of each first link or each second link can be weighted and averaged respectively to obtain the scores of each first link or each second link, and through each first factor and the scores of each first link or each second link, the comprehensive scores of each first link or each second link are obtained, and the preferred first link and second link are obtained according to the comprehensive scores.

[0052] The data of the sending end is transmitted to the receiving end through the selected preferred node, the preferred first link and the second link.

[0053] The working principle of the above technical solution is as follows: By accurately calculating the scores of each intermediate node and its corresponding link, and selecting the intermediate node with the highest total score and the optimal transmission link, the latency and packet loss rate of data transmission can be significantly reduced, thereby improving the overall efficiency of data transmission. This method comprehensively considers the performance of intermediate nodes (such as load, packet loss rate, network congestion, energy consumption, and reliability) and the characteristics of links (such as length, packet loss rate, latency rate, etc.), and can ensure the most reasonable utilization of network resources, avoiding network congestion and resource waste. By selecting intermediate nodes and links with high performance scores and strong reliability, the risk of failures or interruptions during data transmission can be greatly reduced, enhancing the reliability and stability of data transmission. The score calculation in this method is dynamic and can reflect the changes in network topology, intermediate node performance, and link characteristics in real time. Therefore, when the network condition changes, this method can quickly adjust the transmission strategy and select the optimal transmission path to ensure the continuity and stability of data transmission. By optimizing the selection of transmission links and intermediate nodes, unnecessary transmission overhead and energy consumption can be reduced, thereby lowering the cost of data transmission. This is particularly important for scenarios that require long-term transmission of a large amount of data. This method is not only applicable to the current network environment but can also easily adapt to future network expansion and changes. As the network scale expands and technology advances, this method can adapt to new transmission requirements and environments by adjusting score parameters and algorithms.

[0054] In summary, in the S2 stage, by comprehensively considering multiple factors such as network topology, intermediate node performance, and link characteristics, the best intermediate node and transmission link are selected, achieving significant improvements in aspects such as data transmission efficiency, reliability, stability, and cost.

[0055] In some embodiments, obtaining the first score of an intermediate node according to the lengths of the transmission links of each path of each intermediate node includes:

[0056] For one of the intermediate nodes, obtain the mean and minimum values of the lengths of multiple transmission paths passing through this node;

[0057] According to the mean and minimum values, obtain the first score of this node:

[0058] Pj1 = 1 - (Pjm1 - min(Pjm1)) / ((max(Pjm1) - min(Pjm1))

[0059] Pjm1 = w1 * LEja + w2 * LEjmin

[0060] Among them, Pj1 is the first score of the j-th node, Pjm1 is the intermediate value of the j-th node, min(Pjm1) is the minimum value of the intermediate values of multiple nodes; min(Pjm1)min(Pjm1) is the maximum value of the intermediate values of multiple nodes; LEja is the average value of multiple transmission paths of the j-th node, and LEjmin is the minimum value of multiple transmission paths of the j-th node; w1 and w2 are the first weight coefficients.

[0061] The working principle of the above technical solution is as follows: For each intermediate node (such as the j-th node), first calculate the average value (LEja) and the minimum value (LEjmin) of the lengths of all transmission paths passing through this node. These values provide important information about the network topology around the node, especially about the efficiency of the node as a transmission relay point.

[0062] The intermediate value (Pjm1) of each node is calculated through a weighted formula. The formula combines the average value and the minimum value of the path length and allows the influence degree of them on the intermediate value to be adjusted through the weight coefficients (w1 and w2). The selection of the weight coefficients (w1, w2) should be based on network characteristics and transmission requirements to ensure that the scoring system can accurately reflect the actual situation. Specifically, the calculation formula of Pjm1 is: Pjm1 = w1LEja + w2LEjmin. Here, w1 and w2 are the first weight coefficients, and their sum is equal to 1 (i.e., w1 + w2 = 1) to ensure that the intermediate value is within a reasonable range. After obtaining the intermediate value, a first score (Pj1) is calculated for each node. This score is obtained by comparing the intermediate value (Pjm1) with a standardized range. Specifically, subtract the minimum value (min(Pjm1)) of the intermediate values of all nodes from the intermediate value, then divide by (the maximum value (max(Pjm1)) of the intermediate values of all nodes minus the minimum value (min(Pjm1))), and finally subtract this result from 1.

[0063] The formula is: Pj1 = 1 - ((Pjm1 - min(Pjm1)) / (max(Pjm1) - min(Pjm1))). The formula ensures that the score is between 0 and 1, where a higher score indicates that the node has a shorter average path length and a smaller minimum path length, thus improving the efficiency and reliability of data transmission.

[0064] The first score (Pj1) provides a quantitative performance indicator for each intermediate node in the network. This indicator can be used in subsequent decision-making processes, such as selecting preferred nodes and alternative nodes. In aspects such as network routing optimization and data transmission strategy formulation, this score can be used as an important reference basis.

[0065] In summary, the working principle described above assigns a first score to each node by calculating the mean and minimum values of the transmission path lengths of the intermediate nodes and combining the weight coefficients. This scoring system can accurately reflect the link length efficiency of the nodes when transmitting data, providing strong support for network optimization and decision-making.

[0066] In some embodiments, S2 further includes:

[0067] Send the data after format conversion and encoding to the intermediate node through the first link; the sending end copies each sent data packet to the first buffer inside it for backup;

[0068] The intermediate node checks the data packets received from the sending end and stores the data packets that pass the verification in its second buffer;

[0069] The intermediate node sends the received data packets to the receiving end through the second link.

[0070] The working principle and effects of the above technical solution are as follows: At the sending end, the original data is first processed through format conversion and encoding to ensure the accuracy and integrity of the data during transmission. This step includes data compression, encryption, and conversion to a suitable format for transmission, etc.

[0071] To ensure the reliability of the data and prevent data loss caused by network failures or other reasons during transmission, the data after format conversion and encoding is packaged into data packets and sent to the intermediate node through the first link. At the same time, the sending end copies each sent data packet to the first buffer inside it for backup.

[0072] After receiving the data packets sent by the sending end, the intermediate node first checks them. The checking process includes checking the integrity of the data packets and verifying the correctness of the data. Commonly used checking algorithms include parity checking, cyclic redundancy code checking (CRC), etc. These algorithms can effectively detect errors during data transmission and ensure the accuracy of the data. To ensure the reliable storage of the data at the intermediate node so that it can be quickly provided to the receiving end when needed, after verification, the data packets that pass the verification are stored in the second buffer of the intermediate node. The intermediate node sends the received data packets to the receiving end through the second link. This step is the final stage of data transmission, ensuring that the data finally reaches the receiving end from the sending end through the intermediate node. After receiving the data packets, the receiving end can further process and parse them to recover the original data. At the same time, the receiving end can also check and verify the received data to ensure the accuracy and integrity of the data.

[0073] In this embodiment, S2 improves the reliability and stability of data transmission by introducing the design of intermediate nodes and buffer areas. At the same time, through steps such as format conversion, coding processing, and packet verification, the accuracy and integrity of data are ensured.

[0074] In some embodiments, the intermediate node verifies the data packets sent by the sending end; including:

[0075] If the verification fails, request the sending end to resend the data packet through the adaptive retransmission time interval;

[0076] Among them, the retransmission time interval is:

[0077]

[0078] Among them, T r is the retransmission time interval; C1, C2, C3, C4 are adjustment factor coefficients, and their ranges are all (0, 1); g is the sensitivity coefficient, which is used to control the positive and negative effects of the dynamic response speed; ∈ is a small constant, 0 < ∈ < 0.1; Lj(t) is the packet loss rate of the jth node within time t; Dj(t) is the delay rate of the jth intermediate node within time t; Fj(t) is the load of the jth node within time t; is the mean value of the historical packet loss rate of the jth node; T0 is the basic retransmission time interval; Dj(t), The ranges are all (0, 1);

[0079] If the data packet of this node still fails verification after exceeding the preset retransmission times, then send the first warning;

[0080] If the verification success rate of the intermediate node data packets is less than the first threshold within the statistical period; then send the second warning.

[0081] The working principle of the above technical solution is: The intermediate node receives the data packet from the sending end and immediately verifies it. The verification process may include data integrity check, error detection, etc. If the data packet verification is successful, the intermediate node stores the data packet in its buffer area and prepares to forward it to the receiving end through the second link.

[0082] If the data packet verification fails, the intermediate node will take the following measures:

[0083] 1) Calculate the retransmission time interval: The intermediate node calculates the retransmission time interval according to the given formula. This formula takes into account multiple factors, including the current packet loss rate, delay rate, load, mean value of the historical packet loss rate, and basic retransmission time interval of the node. By adjusting the factor coefficients and sensitivity coefficient, the retransmission time interval can be flexibly controlled to adapt to different network conditions.

[0084] 2) Request for retransmission: After calculating the retransmission time interval at the intermediate node, the intermediate node waits for this period of time and then sends a retransmission request to the sender, requesting the sender to retransmit the data packet that failed the previous verification.

[0085] The intermediate node will record the retransmission times of each data packet. If a certain data packet still fails the verification after exceeding the preset number of retransmission times, the intermediate node will send a first warning signal, indicating that there may be serious problems with the data packet or the network condition is extremely poor.

[0086] Within a statistical period, the intermediate node will calculate the verification success rate of its data packets. If the verification success rate is lower than the preset first threshold, the intermediate node will send a second warning signal, indicating that the network condition of this node may be unstable or there are other problems.

[0087] After sending the warning signal, the intermediate node may take further measures, such as suspending data transmission, switching the transmission path, etc., to improve the network condition or ensure the reliable transmission of data.

[0088] The effects of the above technical solutions are as follows: By introducing an adaptive retransmission time interval, this mechanism can dynamically adjust the time interval of the retransmission request according to the current network conditions (such as packet loss rate, delay rate, and load), thereby effectively reducing data transmission errors caused by network instability.

[0089] When the data packet fails the verification, the intermediate node will request the sender to retransmit the data packet, ensuring the integrity and accuracy of the data during the transmission process and improving the reliability of data transmission. Multiple network performance indicators (such as packet loss rate, delay rate, and load) are considered in the formula of the adaptive retransmission time interval, which enables the intermediate node to more accurately evaluate the current network condition and make reasonable decisions accordingly. By dynamically adjusting the retransmission time interval, it is possible to avoid frequently sending retransmission requests when the network condition is poor, thereby reducing the network burden and optimizing the network performance.

[0090] When a certain data packet still fails the verification after exceeding the preset number of retransmission times, the intermediate node will send a first warning signal, which helps to promptly detect and handle potential network problems and prevent the problems from deteriorating further. At the same time, by monitoring the verification success rate of the data packets and setting a second warning threshold, it is possible to detect the instability or abnormality of the network condition within the statistical period, thereby triggering the warning mechanism and enhancing the robustness of the system. The introduction of the adaptive retransmission time interval avoids unnecessary retransmission requests, thereby reducing the waste of network resources. By reasonably setting the number of retransmission times and the warning threshold, this mechanism can maximize the utilization efficiency of resources while ensuring the reliability of data transmission.

[0091] The adaptive retransmission time interval formula in this mechanism takes into account multiple factors affecting network performance, enabling it to adapt to various complex network environments. Whether it is a network environment with high latency and high packet loss rate, or a network environment with heavy load, this mechanism can ensure reliable data transmission by dynamically adjusting the retransmission time interval.

[0092] In summary, the intermediate node packet verification and retransmission mechanism improves data transmission reliability, optimizes network performance, enhances system robustness, improves resource utilization efficiency, and supports complex network environments.

[0093] In some embodiments, the method further includes:

[0094] Real-time monitoring of the queue lengths, packet loss rates, and delay rates of the intermediate node and the receiving end; determining whether to reduce the sending frequency of the sending end according to the monitoring results;

[0095] If the queue length, packet loss rate, and delay rate of the intermediate node all exceed their preset thresholds; or the queue length, packet loss rate, and delay rate of the receiving end all exceed their preset thresholds; then determine the priority order of the sending ends that need to reduce the sending frequency according to the data priorities, packet loss rates, delay rates, and broadband occupancy of the data of the multiple sending ends corresponding to the intermediate node or the receiving end, and poll and send this instruction to the corresponding sending ends in this priority order.

[0096] The working principle and effect of the above technical solution are: continuously monitoring various performance indicators of the intermediate node and the receiving end, including queue length, packet loss rate, and delay rate. These indicators can intuitively reflect the current congestion status and transmission efficiency of the network.

[0097] Judge whether the performance indicators of the intermediate node and the receiving end exceed the normal range according to the preset thresholds. The thresholds are set based on the performance indicators and transmission requirements of the network design, aiming to ensure the stable operation of the network and reliable data transmission.

[0098] When the queue length, packet loss rate, and delay rate of the intermediate node or the receiving end all exceed their preset thresholds, the system will consider that the network is currently in a congested state and measures need to be taken to reduce the network load.

[0099] In this case, determine the priority order of the sending ends that need to reduce the sending frequency according to the data priorities, packet loss rates, delay rates, and broadband occupancy of the data of the multiple sending ends. This decision-making process comprehensively considers the importance of the data, the congestion degree of the network, and the resource occupancy situation, aiming to achieve reasonable resource allocation and optimized operation of the network.

[0100] Poll and send instructions to reduce the sending frequency to the corresponding transmitters according to the determined priority order. This step is achieved through fine control and scheduling of network traffic, aiming to gradually relieve network congestion while ensuring the priority transmission of important data.

[0101] During the process of adjusting the sending frequency, continuously monitor the network performance metrics and make dynamic adjustments according to the actual situation. If the network condition improves, adjust the sending frequency accordingly to improve the network transmission efficiency. At the same time, receive feedback information from the transmitters to understand the execution situation of the instructions at the transmitters and the real-time network condition, so as to make more accurate adjustments and optimizations.

[0102] This mechanism realizes the dynamic adjustment of the sending frequency of the transmitters by real-time monitoring of the performance metrics of the intermediate nodes and the receivers, and judging the current congestion situation of the network according to these metrics. This mechanism comprehensively considers the data priority, network congestion degree and resource occupancy situation, aiming to achieve reasonable resource allocation and optimized operation of the network. By dynamically adjusting the sending frequency and finely controlling the network traffic, this mechanism can effectively relieve network congestion and improve the data transmission efficiency and network stability.

[0103] In some embodiments, determining the priority order of the transmitters that need to reduce the sending frequency according to the data priority, packet loss rate, latency rate and broadband occupancy of the data corresponding to the intermediate nodes or receivers includes:

[0104] Perform a first sorting according to the data priority of the transmitters from low to high;

[0105] In the same first sorting, obtain the comprehensive score of the transmitters according to the packet loss rate, latency rate and broadband occupancy of the data of the transmitters; perform a second sorting according to the comprehensive score; determine the priority order of the transmitters in each first sorting according to the second sorting;

[0106] Among them, the comprehensive score of the transmitter is obtained by the following formula:

[0107] SZ i =a1×SZC i +a2×SZH i

[0108]

[0109]

[0110] Among them, SZ i is the comprehensive score of the i-th transmitter, SZC i is the score of the i-th transmitter based on the current data; SZH iis the score of the i-th sender based on historical data within time t; Li is the current packet loss rate of the i-th sender; Di is the current latency rate of the i-th sender; Bi is the broadband occupancy of the current data of the i-th sender; is the average packet loss rate of the i-th sender within time t; is the average packet loss rate of multiple senders within time t; The average latency rate of the i-th sender within time t; is the latency packet loss rate of multiple senders within time t; The average latency broadband occupancy of the i-th sender within time t; is the broadband occupancy of multiple senders within time t; a1 and a2 are both the second weight coefficients, and y1, y2, and y3 are all the third weight coefficients.

[0111] The working principle and effect of the above technical solution are as follows: First, collect relevant data of each transmitter, including the current packet loss rate (Li), the current latency rate (Di), and the broadband occupancy of the current data (Bi). At the same time, record the average values of these data within a period of time (t), that is, the average packet loss rate (Li(t)), the average latency rate (Di(t)), and the average broadband occupancy (Bi(t)).

[0112] For each transmitter, based on its current packet loss rate, current latency rate, and current broadband occupancy, use specific weight coefficients (b1, b2, b3) to calculate a score based on the current data, which reflects the current network performance and resource occupancy of the transmitter.

[0113] In addition to the current data, the average performance of the transmitter within the past period of time (t), that is, the average packet loss rate, the average latency rate, and the average broadband occupancy, will also be considered. Using another set of weight coefficients (y1, y2, y3), the system can calculate a score based on historical data, which provides an overview of the long-term performance of the transmitter.

[0114] Combine the score based on the current data and the score based on the historical data, and use the first weight coefficients (a1, a2) for weighted summation to obtain the comprehensive score of the transmitter. This comprehensive score comprehensively considers the current performance and long-term performance of the transmitter, providing a basis for subsequent sorting.

[0115] Sort according to the data priority of the transmitter. The data priority can be determined according to the urgency, importance, or other relevant factors of the data. In this step, the transmitters are initially sorted in ascending order of data priority.

[0116] Within the same data priority grouping, sort according to the comprehensive score of the transmitting end. The transmitting end with a lower comprehensive score will be regarded as the object that needs to reduce the transmission frequency with priority.

[0117] Combining the results of the first sorting and the second sorting, the priority order of each transmitting end when reducing the transmission frequency can be determined. This order will guide how the system gradually adjusts the transmission frequencies of each transmitting end to relieve network congestion and optimize resource allocation.

[0118] According to the determined priority order, send an instruction to reduce the transmission frequency to the corresponding transmitting end. At the same time, continuously monitor the network condition and receive feedback information from the transmitting end to perform dynamic adjustment and optimization according to the actual situation.

[0119] This mechanism determines a reasonable priority order to reduce the transmission frequency by comprehensively considering the data priority, current performance, long-term performance, and resource occupancy of the transmitting end. This mechanism helps to relieve network congestion, optimize resource allocation, and improve data transmission efficiency. Through continuous monitoring and dynamic adjustment, the system can ensure the stable operation of the network and the reliable transmission of data.

[0120] An embodiment of the present application provides a data transmission system based on digital communication, and the system includes:

[0121] A data encapsulation module, which is used for the transmitting end to encapsulate the data to be transmitted to form a data packet and mark the data transmission priority; the transmitting end performs format conversion and encoding on the data packet to meet the transmission requirements;

[0122] A data transmission module, which is used for selecting intermediate nodes and transmission links according to the network topology structure, the performance of intermediate nodes, and the transmission link score. Through the transmission link, the transmitting end sends the data after format conversion and encoding to the receiving end through the intermediate node; the transmission link includes a first link and a second link; the first link is used for the transmitting end to transmit the data packet to the intermediate node, and the second link is used for the intermediate node to transmit the data to the receiving end;

[0123] A decoding and verification module, which is used for the receiving end to decode and verify the data packet after receiving it, and store and back up the received data packet and the data after decoding and verification; if the verification fails, the receiving end requests the transmitting end to retransmit the data packet.

[0124] In some embodiments, the data encapsulation module includes:

[0125] A preprocessing unit, which is used for preprocessing the data to be transmitted, and the preprocessing includes splitting the data to be transmitted into multiple data segments, preliminary data detection, and / or compression;

[0126] A data packet creation unit for creating data packets for the segmented data respectively and setting transmission priorities, where the data packets include original data, message descriptions, unique identification marks, tagging information, data lengths, and check codes;

[0127] An encryption unit for performing different levels of encryption settings according to the tagging information; where the tagging information includes sensitive information and non-sensitive information.

[0128] In some embodiments, the data transmission module includes:

[0129] A link length acquisition unit for obtaining a plurality of first link lengths and second link lengths according to the network topology; the first link length is the length of each link from the sender to the intermediate node; the second link length is the length of each link from the intermediate node to the receiver;

[0130] A total length acquisition unit for, for each intermediate node, calculating the transmission link lengths of each path from the sender to the receiver passing through the intermediate node according to the first link length and each second link length;

[0131] A node first scoring unit for obtaining a first score of the intermediate node according to the transmission link lengths of each path of each intermediate node;

[0132] A node selection unit for obtaining the total score of each intermediate node according to the first score of the intermediate node and the performance score of the intermediate node; selecting the intermediate node with the highest total score as the preferred node for transmitting the currently to-be-transmitted data of the sender; sequentially taking other nodes as alternative nodes in the order from the highest total score to the lowest; where the performance score of the intermediate node is obtained through the current load, packet loss rate within a statistical time period, network congestion situation, energy consumption of the node, and reliability of the node;

[0133] Specifically, the total score of the intermediate node is obtained through the following formula:

[0134]

[0135] where Pj is the total score of the j-th intermediate node within time t, and Pj1 is the first score of the j-th intermediate node, is the relative score of the reliability of the j-th intermediate node under different loads; Cj(t) is the network congestion score of the j-th intermediate node within time t, and Ej(t) is the energy consumption score of the j-th intermediate node within time t; α and β are constants; Rj(t) is the reliability score of the j-th intermediate node within time t; Fj(t) is the load of the j-th intermediate node within time t; Lj(t) is the packet loss rate of the j-th intermediate node within time t; among them, Cj(t), Ej(t), Fj(t), Rj(t), and Lj(t) are all values after normalization processing, and the range is (0, 1);

[0136] The first factor acquisition unit is used to determine the first factor of the first link and the first factor of the second link according to the intermediate node selected for the data to be transmitted and the lengths of the corresponding multiple first link lengths and the second link; wherein, the first factor is obtained by normalizing the transmission link length;

[0137] The link selection unit is used to obtain the preferred first link according to the first factor of the first link and the score of the first link; obtain the preferred second link according to the first factor of the second link and the score of the second link; wherein, the scores of the first link and the second link are both determined by their packet loss rates and delay rates.

[0138] In some embodiments, the obtaining of the first score of the intermediate node according to the transmission link lengths of each path of each intermediate node includes:

[0139] For one of the intermediate nodes, obtain the mean value and the minimum value of the lengths of multiple transmission paths passing through this node;

[0140] According to the mean value and the minimum value, obtain the first score of this node:

[0141] Pj1 = 1 - (Pjm1 - min(Pjm1)) / ((max(Pjm1) - min(Pjm1))

[0142] Pjm1 = w1 * LEja + w2 * LEjmin

[0143] Wherein, Pj1 is the first score of the j-th node, Pjm1 is the intermediate value of the j-th node, min(Pjm1) is the minimum value of the intermediate values of multiple nodes; min(Pjm1)min(Pjm1) is the maximum value of the intermediate values of multiple nodes; LEja is the mean value of multiple transmission paths of the j-th node, and LEjmin is the minimum value of multiple transmission paths of the j-th node; w1 and w2 are the first weight coefficients.

[0144] In some embodiments, the data transmission module further includes:

[0145] The first transmission unit is configured to send the data after format conversion and encoding to an intermediate node via a first link; the sending end copies each sent data packet to a first buffer inside it for backup;

[0146] The first verification unit is configured to verify the data packets received from the sending end by the intermediate node and store the verified data packets in a second buffer of its own;

[0147] The second transmission unit is configured to send the received data packets to the receiving end by the intermediate node via a second link.

[0148] In some embodiments, the first verification unit includes:

[0149] A retransmission subunit, configured to request the sending end to re - send the data packet via an adaptive re - transmission time interval if the verification fails;

[0150] Wherein, the re - transmission time interval is:

[0151]

[0152] Wherein, T r is the re - transmission time interval, C1, C2, C3, C4 are adjustment factor coefficients, and their ranges are all (0, 1); g is a sensitivity coefficient, used to control the positive and negative impacts of the dynamic response speed; ∈ is a small constant, 0 < ∈ < 0.1; Lj(t) is the packet loss rate of the j - th node within time t; Dj(t) is the delay rate of the j - th intermediate node within time t; Fj(t) is the load of the j - th node within time t; is the mean value of the historical packet loss rate of the j - th node; T0 is the basic re - transmission time interval; Dj(t), and their ranges are all (0, 1);

[0153] The first warning unit is configured to send a first warning if the data packet of this node still fails the verification after exceeding the preset number of re - transmissions;

[0154] The second warning unit is configured to send a second warning if the verification success rate of the data packets of the intermediate node is less than a first threshold within a statistical period.

[0155] In some embodiments, the system further includes:

[0156] A real - time detection module, configured to monitor the queue lengths, packet loss rates, and delay rates of the intermediate node and the receiving end in real time; determine whether to reduce the sending frequency of the sending end according to the monitoring results;

[0157] A polling module, configured to, if the queue length, packet loss rate, and latency rate of an intermediate node all exceed their preset thresholds; or the queue length, packet loss rate, and latency rate of a receiving end all exceed their preset thresholds; then determine the priority order of the transmitters that need to reduce their transmission frequencies according to the data priorities, packet loss rates, latency rates, and broadband occupancy of the data of multiple transmitters corresponding to the intermediate node or the receiving end, and poll and send the instruction to the corresponding transmitter in this priority order.

[0158] In some embodiments, the polling module includes:

[0159] A first sorting unit, configured to perform a first sorting according to the data priorities of the transmitters from low to high;

[0160] A second sorting unit, configured to, in the same first sorting, obtain a comprehensive score of the transmitter according to the packet loss rate, latency rate, and broadband occupancy of the data of the transmitter; perform a second sorting according to the comprehensive score; and determine the priority order of the transmitters in each first sorting according to the second sorting;

[0161] Wherein, the comprehensive score of the transmitter is obtained through the following formula:

[0162] SZ i = a1×SZC i + a2×SZH i

[0163]

[0164]

[0165] Wherein, SZ i is the comprehensive score of the i-th transmitter, SZC i is the score of the i-th transmitter based on the current data; SZH i is the score of the i-th transmitter based on the historical data within t time; Li is the current packet loss rate of the i-th transmitter; Di is the current latency rate of the i-th transmitter; Bi is the broadband occupancy of the current data of the i-th transmitter; is the average packet loss rate of the i-th transmitter within t time; is the average packet loss rate of multiple transmitters within t time; the average latency rate of the i-th transmitter within t time; is the latency packet loss rate of multiple transmitters within t time; the average latency broadband occupancy of the i-th transmitter within t time; is the broadband occupancy of multiple transmitters within t time; a1 and a2 are both second weight coefficients, and y1, y2, and y3 are all third weight coefficients.

[0166] The working principle and effect of the above technical solution are the same as those in the method embodiment of the present application, and will not be described in detail here. The present application also provides an electronic device, wherein the electronic device includes a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the steps of any method described in the present application are implemented.

[0167] This application is explained from the perspectives of purpose of use, effectiveness, progress and novelty, and has met the functional enhancement and usage requirements emphasized by the Patent Law. The above description and drawings of this application are only the preferred embodiments of this application, and are not intended to limit this application. Therefore, all structures, devices, features, etc. that are similar or identical to this application, that is, all equivalent replacements or modifications made in accordance with the scope of the patent application of this application, should fall within the scope of protection of the patent application of this application.

Claims

1. A data transmission method based on digital communication, characterized in that, The method includes: S1. The sending end encapsulates the data to be transmitted to form a data packet and marks the data transmission priority; the sending end performs format conversion and encoding on the data packet to meet the transmission requirements; S2. According to the network topology structure, the performance of intermediate nodes, and the transmission link score, select intermediate nodes and transmission links. Through the transmission link, the sending end sends the data after format conversion and encoding to the receiving end via the intermediate nodes; the transmission link includes a first link and a second link; the first link is used for the sending end to transmit the data packet to the intermediate node, and the second link is used for the intermediate node to transmit the data to the receiving end; S3. After receiving the data packet, the receiving end decodes and verifies it, and stores and backs up the received data packet and the data after decoding and verification; if the verification fails, the receiving end requests the sending end to re-transmit the data packet; The S2 includes: Obtain multiple first link lengths and second link lengths according to the network topology structure; the first link length is the length of each link from the sending end to the intermediate node; the second link length is the length of each link from the intermediate node to the receiving end; For each intermediate node, calculate the transmission link lengths of each path from the sending end to the receiving end passing through this intermediate node according to the first link length and each second link length; Obtain the first score of the intermediate node according to the transmission link lengths of each path of each intermediate node; Obtain the total score of each intermediate node according to the first score of the intermediate node and the performance score of the intermediate node; select the intermediate node with the highest total score as the preferred node for transmitting the current data to be transmitted by the sending end; in the order from high to low of the total score, sequentially use other nodes as alternative nodes; According to the intermediate node selected for the data to be transmitted, and the corresponding multiple first link lengths and second link lengths of this node; determine the first factor of the first link and the first factor of the second link; Obtain the preferred first link according to the first factor of the first link and the score of the first link; obtain the preferred second link according to the first factor of the second link and the score of the second link; wherein, the scores of the first link and the second link are both determined by their packet loss rate and delay rate; The obtaining the first score of the intermediate node according to the transmission link lengths of each path of each intermediate node; includes: For one of the intermediate nodes, obtain the mean value and the minimum value of the lengths of multiple transmission paths passing through this node; Obtain the first score of this node according to the mean value and the minimum value: Pj1 = 1 - (Pjm1 - min(Pjm1)) / ((max(Pjm1) - min(Pjm1)); Pjm1 = w1 * LEja + w2 * LEjmin; Wherein, Pj1 is the first score of the j-th node, Pjm1 is the median of the lengths of multiple transmission paths of the j-th node, and min(Pjm1) is the minimum value of the medians of the lengths of multiple transmission paths of multiple nodes; max(Pm1) is the maximum value of the medians of the lengths of multiple transmission paths of multiple nodes; LEja is the average value of the lengths of multiple transmission paths of the j-th node, and LEjmin is the minimum value of the lengths of multiple transmission paths of the j-th node; w1 and w2 are the first weight coefficients.

2. The data transmission method according to claim 1, wherein The S1 includes: Preprocess the data to be transmitted, and the preprocessing includes splitting the data to be transmitted into multiple data segments, preliminary data detection, and / or compression; Create data packets for the split data respectively and set transmission priorities, and the data packets include original data, message description, unique identification mark, tagging information, data length, and check code; Perform encryption settings at different levels according to the tagging information; wherein the tagging information includes sensitive information and insensitive information.

3. The data transmission method according to claim 1, wherein The S2 further includes: Send the data after format conversion and encoding to the intermediate node through the first link; the sending end copies each sent data packet to the first buffer inside it for backup; The intermediate node checks the data packets received from the sending end and stores the data packets that pass the verification in its second buffer; The intermediate node sends the received data packets to the receiving end through the second link.

4. The data transmission method according to claim 3, wherein The intermediate node checks the data packets received from the sending end; it includes: If the check fails, request the sending end to resend the data packet through the adaptive retransmission time interval; If after exceeding the preset number of retransmission times, the data packet of this node still fails the check, then send a first warning; If within the statistical period, the check success rate of the data packets of the intermediate node is less than the first threshold; then send a second warning.

5. The data transmission method according to claim 1, wherein The method further includes: Real-time monitor the queue lengths, packet loss rates, and delay rates of the intermediate node and the receiving end; determine whether to reduce the sending frequency of the sending end according to the monitoring results; If the queue length, packet loss rate, and delay rate of the intermediate node all exceed their preset thresholds; or the queue length, packet loss rate, and delay rate of the receiving end all exceed their preset thresholds; then determine the priority order of the sending ends that need to reduce the sending frequency according to the data priorities, packet loss rates, delay rates, and broadband occupancy of the data of the multiple sending ends corresponding to the intermediate node or the receiving end, and poll and send instructions to the corresponding sending ends in this priority order.

6. The data transmission method according to claim 5, characterized in that The determining the priority order of the sending ends that need to reduce the sending frequency according to the data priorities, packet loss rates, delay rates, and broadband occupancy of the multiple sending ends corresponding to the intermediate node or the receiving end includes: Perform a first sorting according to the data priorities of the sending ends from low to high; In the same first sorting, obtain the comprehensive scores of the sending ends according to the packet loss rates, delay rates, and broadband occupancy of the data of the sending ends; perform a second sorting according to the comprehensive scores; determine the priority order of the sending ends in each first sorting according to the second sorting; Wherein, the comprehensive score of the sending end is obtained through the following formula: ； ； ； Among them, is the comprehensive score of the i-th sender, is the score of the i-th sender based on the current data; is the score of the i-th sender based on the historical data within t time; Li is the current packet loss rate of the i-th sender; Di is the current delay rate of the i-th sender; Bi is the broadband occupancy of the current data of the i-th sender; is the average packet loss rate of the i-th sender within t time; is the average packet loss rate of multiple senders within t time; The average delay rate of the i-th sender within t time; is the average delay rate of multiple senders within t time; The average broadband occupancy of the i-th sender within t time; is the broadband occupancy of multiple senders within t time; a1 and a2 are both the second weight coefficients, and y1, y2, and y3 are all the third weight coefficients.

7. A data transmission system based on digital communication, characterized in that, The system includes: A data encapsulation module, which is used for the sending end to encapsulate the data to be transmitted, form data packets, and mark the data transmission priority; the sending end performs format conversion and encoding on the data packets to meet the transmission requirements; A data transmission module, which is used for selecting intermediate nodes and transmission links according to the network topology structure, the performance of intermediate nodes, and the transmission link scores. Through the transmission link, the sending end sends the data after format conversion and encoding to the receiving end through the intermediate nodes; the transmission link includes a first link and a second link; the first link is used for the sending end to transmit data packets to the intermediate nodes, and the second link is used for the intermediate nodes to transmit data to the receiving end; A decoding and verification module, which is used for the receiving end to decode and verify the data packets after receiving them, and store and back up the received data packets and the data after decoding and verification; if the verification fails, the receiving end requests the sending end to retransmit the data packets; The data transmission module includes: Obtaining a plurality of first link lengths and second link lengths according to the network topology structure; the first link length is the length of each link from the sending end to the intermediate nodes; the second link length is the length of each link from the intermediate nodes to the receiving end; For each intermediate node, calculating the transmission link lengths of each path from the sending end to the receiving end passing through the intermediate node according to the first link length and each second link length; Obtaining the first score of the intermediate node according to the transmission link lengths of each path of each intermediate node; Obtaining the total score of each intermediate node according to the first score of the intermediate node and the performance score of the intermediate node; selecting the intermediate node with the highest total score as the preferred node for transmitting the current data to be transmitted by the sending end; in the order from high to low of the total scores, taking the other nodes as alternative nodes in turn; According to the intermediate node selected for the data to be transmitted, and the corresponding plurality of first link lengths and second link lengths of the node; determining the first factor of the first link and the first factor of the second link; Obtaining the preferred first link according to the first factor of the first link and the score of the first link; obtaining the preferred second link according to the first factor of the second link and the score of the second link; wherein, the scores of the first link and the second link are both determined by their packet loss rates and delay rates; The obtaining the first score of the intermediate node according to the transmission link lengths of each path of each intermediate node; includes: For one of the intermediate nodes, obtaining the mean value and the minimum value of the lengths of multiple transmission paths passing through the node; Obtaining the first score of the node according to the mean value and the minimum value: Pj1 = 1 - (Pjm1 - min(Pjm1)) / ((max(Pjm1) - min(Pjm1)); Pjm1 = w1 * LEja + w2 * LEjmin; Among them, Pj1 is the first score of the j-th node, Pjm1 is the median value of the lengths of multiple transmission paths of the j-th node, min(Pjm1) is the minimum value of the median values of the lengths of multiple transmission paths of multiple nodes; max(Pm1) is the maximum value of the median values of the lengths of multiple transmission paths of multiple nodes; LEja is the average value of the lengths of multiple transmission paths of the j-th node, and LEjmin is the minimum value of the lengths of multiple transmission paths of the j-th node; w1 and w2 are the first weight coefficients.

8. An electronic device, characterized in that, It includes a memory, a processor, and a computer program stored on the memory and executable on the memory. The processor executes the program to implement a data transmission method based on digital communication as described in any one of claims 1-6.

Images