Data transmission method and system based on digital communication

Abstract

The invention provides a data transmission method and system based on digital communication, and relates to the technical field of data transmission, the method comprises the following steps: a sending end packages to-be-transmitted data to form a data packet, and the sending end carries out format conversion and coding on the data packet; an intermediate node and a transmission link are selected according to a network topology structure, the performance of the intermediate node and the score of the transmission link, and the transmitting end transmits the data subjected to format conversion and coding to a receiving end through the intermediate node through the transmission link; the receiving end decodes and verifies the data packet after receiving the data packet, and stores and backs up the received data packet and the decoded and verified data packet; if verification fails, the receiving end requests the sending end to resend the data packet; by comprehensively considering the aspects of data encapsulation, format conversion, coding mode, routing selection, link optimization, data verification, retransmission mechanism and the like, 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 in particular 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 in various fields has become increasingly prominent. Whether it is Internet applications, communication between IoT devices, or data interaction within an enterprise, efficient and reliable data transmission methods are required. However, in the existing digital communication field, the selection and implementation of data transmission methods are crucial to ensure data integrity, security, and efficiency. However, traditional data transmission methods often have certain limitations when facing 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 terms of data encapsulation and format conversion, and it is difficult to adapt to the differences in different transmission requirements and transmission environments. For example, the structure of the data packet may be too simple or too complex, resulting in problems such as low transmission efficiency or data loss. In addition, traditional encoding methods may not fully guarantee the security of data, making the data vulnerable to attack or tampering during transmission.

[0004] On the other hand, traditional data transmission methods also have shortcomings in route selection and link optimization; traditional routing algorithms often ignore the performance of intermediate nodes and the actual quality of transmission links, resulting in suboptimal selection of data transmission paths, which in turn affects data transmission speed and stability, especially in complex network environments. Factors such as the load of intermediate nodes, packet loss rate, and network congestion may have a significant impact on data transmission.

[0005] In addition, traditional data transmission methods also have certain defects in data verification and retransmission mechanisms. Traditional verification methods may not accurately detect errors or tampering of data during transmission, while traditional retransmission mechanisms may be too simple or complex, resulting in low data transmission efficiency or waste of resources. 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, encoding method, routing selection, link optimization, data verification and retransmission mechanism to ensure that data can be transmitted stably and efficiently in a complex and changeable network environment.

[0007] The purpose of this application is achieved by the following technical solutions:

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

[0009] S1. The transmitting end encapsulates the data to be transmitted to form a data packet and marks the data transmission priority; the transmitting 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 the intermediate nodes and the transmission link score, an intermediate node and a transmission link are selected. Through the transmission link, the transmitting end sends the format-converted and encoded data 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;

[0011] S3. The receiving end decodes and verifies the data packet after receiving it, and stores and backs up the received data packet and the decoded and verified data packet; if the verification fails, the receiving end requests the sending end to resend the data packet.

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

[0013] The data encapsulation module 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;

[0014] The data transmission module is used to select an intermediate node and a transmission link according to the network topology, the performance of the intermediate node and the transmission link score. Through the transmission link, the transmitting end sends the format-converted and encoded data 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;

[0015] The decoding and verification module 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 decoded and verified data packet; if the verification fails, the receiving end requests the sending end to resend the data packet.

[0016] In a third aspect, the present application also provides an electronic device, comprising a memory, a processor, and a computer program stored in and executable on the memory, wherein the processor executes the program to implement any of the data transmission methods based on digital communication described in the present application.

[0017] The beneficial effects of the present invention include: the transmitting end pre-processes and encapsulates the data to be transmitted to form a data packet, and marks the data transmission priority, which helps to allocate resources according to the priority during the data transmission process and ensure the priority transmission of important data. By comprehensively considering the network topology, the performance of the intermediate node and the transmission link score, the optimal intermediate node and transmission link are selected, which can minimize the delay and packet loss rate of data transmission and improve the reliability and efficiency of data transmission; the receiving end decodes and verifies after receiving the data packet, and stores and backs up the decoded and verified data, which helps to ensure the integrity and reliability of the data and provide data recovery capabilities. The intermediate node verifies the received data packet and requests the transmitting end to resend the data packet when necessary. In addition, the fault tolerance and reliability of data transmission are improved through the cache mechanism; the queue length, packet loss rate and delay rate of the intermediate node and the receiving end are monitored in real time, and it is determined whether the sending frequency of the sending end needs to be reduced 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 node or the receiving end and the data priority, packet loss rate, delay rate and data bandwidth occupancy of multiple transmitting ends, the sending frequency is dynamically adjusted, which helps to balance the network load and optimize the data transmission performance. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] Figure 1 It is a schematic diagram of a data transmission method based on digital communication provided in an embodiment of the present application. DETAILED DESCRIPTION

[0019] Below, the present application is further described in conjunction with the accompanying drawings and specific implementation methods. It should be noted that, under the premise of no conflict, the various embodiments or technical features described below can be arbitrarily combined to form a new embodiment.

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

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

[0022] S2. According to the network topology, the performance of the intermediate nodes and the transmission link score, an intermediate node and a transmission link are selected. Through the transmission link, the transmitting end sends the format-converted and encoded data 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;

[0023] S3. The receiving end decodes and verifies the data packet after receiving it, and stores and backs up the received data packet and the decoded and verified data packet; if the verification fails, the receiving end requests the sending end to resend the data packet.

[0024] The working principle of the above technical solution is as follows: the sender 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 data transmission priority and other tags. The sender converts the format of the encapsulated data packet to meet the transmission requirements. This may include converting the data into a format suitable for a specific transmission medium, or adjusting the length and structure of the data packet. Then, the sender encodes the data packet to improve the reliability and efficiency of data transmission. The encoding process includes operations such as data compression, encryption, and adding checksums.

[0025] According to the network topology, the performance of the intermediate nodes and the transmission link score, the sender selects the 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 by the sender to transmit the data packet to the intermediate node, and the second link is used by the intermediate node to transmit the data packet to the receiver. The routing algorithm will comprehensively consider multiple factors, such as the link bandwidth, delay, packet loss rate, etc., to select the optimal transmission path.

[0026] The sender transmits the format-converted and encoded data packets to the selected intermediate node via the first link. After receiving the data packets, the intermediate node will temporarily store and forward them. The data packets are transmitted from the intermediate node to the receiver via the second link.

[0027] After receiving the data packet, the receiving end first decodes it. The decoding process is the opposite of the encoding process at the sending end, including data decompression, decryption, and checksum removal. The receiving end verifies the decoded data packet to check whether any error occurred during the transmission of the data packet. The verification process may include operations such as comparing checksums and verifying data integrity. If the verification is successful, the receiving end stores and backs up the data packet; if the verification fails, the receiving end sends a retransmission request to the sending end, requesting the sending end to resend the data packet.

[0028] In summary, this data transmission method based on digital communication achieves reliable data transmission and efficient use 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 actual conditions, thereby improving the reliability and efficiency of data transmission.

[0029] The effect of the above technical solution is: by encapsulating the data to be transmitted into a data packet and marking the data transmission priority, it can ensure that the key data is given priority during the transmission process, thereby improving the reliability and timeliness of data transmission. Format conversion and encoding of the data packet can adapt it 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 the intermediate node and the transmission link score, the optimal intermediate node and transmission link are selected for data transmission, which can make full use of network resources, avoid network congestion and transmission bottlenecks, and improve transmission efficiency. The transmission link is divided into a first link and a second link, which are used for data transmission from the sender to the intermediate node and from the intermediate node to the receiving end, respectively, to achieve flexible configuration and optimization of the link, and further improve the utilization rate of network resources and transmission efficiency. After receiving the data packet, the receiving end decodes and verifies it, which can ensure the integrity and accuracy of the data, timely discover and correct errors in the transmission process, and enhance the security of the data. If the verification fails, the receiving end requests the sending end to resend the data packet. This retransmission mechanism can further ensure the reliable transmission of data and avoid the impact of data loss or damage on the business. The receiving end stores and backs up the received data packets and decoded and verified data, which can facilitate subsequent data management and use, and also help in data recovery and the implementation of disaster recovery plans.

[0030] In some embodiments, the S1 includes:

[0031] Preprocessing the data to be transmitted, wherein the preprocessing includes dividing the data to be transmitted into multiple data segments, performing preliminary detection and / or compression of the data;

[0032] Creating data packets for the segmented data and setting transmission priorities, the data packets including original data, message description, unique identification mark, marking information, data length and check code;

[0033] Different levels of encryption are set according to the marking information; the marking information includes sensitive information and non-sensitive information.

[0034] The principle and effect of the above technical solution are as follows: dividing the data to be transmitted into multiple data segments helps to optimize the efficiency of data transmission and processing, while reducing the risk of data loss or damage. After data segmentation, a preliminary test is performed to identify and remove errors, redundant or invalid information in the data to ensure the quality of data for subsequent transmission and processing. The segmented data is compressed to reduce the volume and transmission time of the data and save storage space. The compression algorithm can be selected according to the characteristics of the data and the transmission requirements. A data packet is created for each segmented data segment, and the data packet contains not only the original data but also additional information such as a message description, a unique identification mark, marking information, data length, and a check code. 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, which is convenient for tracking and identification during transmission and reception; the marking 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 check the data packet at the receiving end to detect whether an error occurs during data transmission. According to the sensitive information and insensitive information in the marking information, different levels of encryption settings are set for the data packet. For sensitive information, a stronger encryption algorithm and a higher key length are used for encryption to ensure the security and privacy of data during transmission. For non-sensitive information, a weaker encryption algorithm or no encryption can be used to save computing resources and improve transmission efficiency.

[0035] In some embodiments, the S2 includes:

[0036] According to the network topology, 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, calculating the transmission link length of each path from the sending end to the receiving end through the intermediate node according to the first link length and each second link length;

[0038] Obtaining a first score of the intermediate node according to the transmission link length of each path of each intermediate node;

[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 data currently to be transmitted by the sender; and other nodes are selected as candidate nodes in descending order of the total score; wherein the performance score of the intermediate node is obtained by the current load, the packet loss rate in the statistical time period, the network congestion, the energy consumption of the node and the reliability of the node;

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

[0041]

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

[0043] According to the intermediate node selected for the data to be transmitted and the lengths of the multiple first links and the second links corresponding to the node; determining the first factor of the first link and the first factor of the second link; wherein the first factor is obtained by normalizing the transmission link length;

[0044] A preferred first link is obtained according to the first factor of the first link and the score of the first link; a preferred second link is obtained according to the first factor of the second link and the score of the second link; wherein the score of the first link and the score of the second link are both determined by their packet loss rate and delay rate.

[0045] The working principle of the above technical solution is: according to the network topology, the system first calculates the first link length from the sending end to each intermediate node (that is, the length of each link from the sending end to the intermediate node), and the second link length from the intermediate node to the receiving end (that is, the length of each link from the intermediate node to the receiving end).

[0046] For each intermediate node, the transmission link lengths of all possible paths from the transmitter to the receiver through the intermediate node are calculated based on the corresponding multiple first link lengths and second link lengths, which helps to evaluate the transmission efficiency and cost of different paths.

[0047] According to the transmission link length of each path of each intermediate node, the first score of the intermediate node is calculated, which is usually related to the physical length of the link. At the same time, the performance score of the intermediate node (including current load, packet loss rate in the statistical time period, network congestion, node energy consumption and node reliability) is used to comprehensively evaluate the quality of the intermediate node.

[0048] Specifically, the total score of the intermediate node is calculated through a complex formula, which 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 score within the time range by means of points.

[0049] According to the total score of the intermediate nodes, the intermediate node with the highest total score is selected as the preferred node for transmitting the data currently to be transmitted by the sender. At the same time, other nodes are selected as candidate nodes in descending order of total score.

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

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

[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: by accurately calculating the score of each intermediate node and its corresponding link, selecting the intermediate node with the highest total score and the optimal transmission link, the delay 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 the intermediate nodes (such as load, packet loss rate, network congestion, energy consumption and reliability) and the characteristics of the link (such as length, packet loss rate, delay rate, etc.), which can ensure that network resources are used in the most reasonable way and avoid network congestion and resource waste. By selecting intermediate nodes and links with high performance scores and strong reliability, the risk of failure or interruption during data transmission can be greatly reduced, and the reliability and stability of data transmission can be enhanced. 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, the method can quickly adjust the transmission strategy, select the optimal transmission path, and 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 reducing the cost of data transmission. This is particularly important for scenarios where large amounts of data need to be transmitted for a long time. This method is not only suitable for 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 the scoring parameters and algorithms.

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

[0055] In some embodiments, obtaining a first score of the intermediate node according to the transmission link length of each path of each intermediate node comprises:

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

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

[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 median value of the j-th node, min(Pjm1) is the minimum value of the median values ​​of multiple nodes; min(Pjm1)min(Pjm1) is the maximum value of the median values ​​of multiple nodes; LEja is the average of multiple transmission paths of the j-th node, 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: for each intermediate node (for example, the j-th node), first calculate the average value (LEja) and minimum value (LEjmin) of the length of all transmission paths passing through the 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 median value (Pjm1) of each node is calculated by a weighted formula, which combines the average and minimum values ​​of the path length and allows the weight coefficients (w1 and w2) to adjust their influence on the median value. The selection of 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 median value is within a reasonable range. After having the median value, a first score (Pj1) is calculated for each node. This score is obtained by comparing the median value (Pjm1) with a standardized range. Specifically, the median value is subtracted from the minimum value of the median values ​​of all nodes (min(Pjm1)), and then divided by (the maximum value of the median values ​​of all nodes (max(Pjm1)) minus the minimum value (min(Pjm1))), and finally subtracted from 1.

[0063] The formula is: Pj1=1-((Pjm1-min(Pjm1)) / (max(Pjm1)-min(Pjm1))), which 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, thereby 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, which can be used in subsequent decision-making processes, such as selecting preferred nodes and alternative nodes. This score can serve as an important reference in network routing optimization, data transmission strategy formulation, etc.

[0065] In summary, the working principle is to calculate the mean and minimum value of the transmission path length of the intermediate nodes and combine the weight coefficient to assign a first score to each node. This scoring system can accurately reflect the link length efficiency of the node when transmitting data, providing strong support for network optimization and decision-making.

[0066] In some embodiments, the S2 further includes:

[0067] The format-converted and encoded data is sent to the intermediate node via the first link; the sending end copies each sent data packet to its internal first buffer area for backup;

[0068] The intermediate node verifies the data packets received from the sender, and stores the verified data packets in its own second buffer area;

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

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

[0071] In order to ensure the reliability of data and prevent data loss due to network failure 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 sender copies each sent data packet to its internal first buffer area for backup.

[0072] After receiving the data packet sent by the sender, the intermediate node first verifies it. The verification process includes checking the integrity of the data packet, verifying the correctness of the data, etc. Commonly used verification algorithms include parity check, cyclic redundancy check (CRC), etc. These algorithms can effectively detect errors in the data transmission process and ensure the accuracy of the data. In order to ensure the reliable storage of data in the intermediate node so that it can be quickly provided to the receiving end when needed, after verification, the verified data packet is stored in the second buffer area of ​​the intermediate node. The intermediate node sends the received data packet to the receiving end through the second link. This step is the last stage of data transmission, which ensures that the data from the sender to the intermediate node finally reaches the receiving end. After receiving the data packet, the receiving end can further process and parse it to restore the original data. At the same time, the receiving end can also verify and verify the received data to ensure the accuracy and integrity of the data.

[0073] S2 in this embodiment improves the reliability and stability of data transmission by introducing the design of intermediate nodes and buffer areas, and ensures the accuracy and integrity of data through steps such as format conversion, encoding processing, and data packet verification.

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

[0075] If the verification fails, the sender is requested to resend the data packet through an adaptive retransmission time interval;

[0076] The retransmission interval is:

[0077]

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

[0079] If the data packet of the node still fails to be verified after exceeding the preset number of retransmissions, a first warning is sent;

[0080] If the verification success rate of the intermediate node data packets is less than the first threshold value during the statistical period, a second warning is sent.

[0081] The working principle of the above technical solution is: the intermediate node receives the data packet from the sender and immediately verifies it, and 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 packet verification fails, the intermediate node will take the following actions:

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

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

[0085] The intermediate node will record the number of retransmissions of each data packet. If a data packet still fails to be verified after exceeding the preset number of retransmissions, 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] In a statistical period, the intermediate node will calculate the verification success rate of its data packets. If the verification success rate is lower than a preset first threshold, the intermediate node will send a second warning signal, indicating that the network status of the 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 transmission paths, etc., to improve network conditions or ensure reliable data transmission.

[0088] The effect of the above technical solution is: by introducing an adaptive retransmission time interval, the mechanism can dynamically adjust the time interval of retransmission requests 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 packet verification fails, the intermediate node will request the sender to resend the packet, ensuring the integrity and accuracy of the data during transmission and improving the reliability of data transmission. The formula for the adaptive retransmission time interval takes into account multiple network performance indicators (such as packet loss rate, delay rate, and load), which enables the intermediate node to more accurately evaluate the current network status and make reasonable decisions accordingly. By dynamically adjusting the retransmission time interval, it is possible to avoid sending retransmission requests frequently when the network condition is poor, thereby reducing the network burden and optimizing network performance.

[0090] When a data packet still fails to verify after exceeding the preset number of retransmissions, the intermediate node will send a first warning signal, which helps to promptly discover and deal with potential network problems and prevent the problem from further deteriorating. At the same time, by monitoring the verification success rate of the data packet and setting the second warning threshold, the instability or abnormality of the network status can be detected 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 retransmissions and the warning threshold, the mechanism can maximize the efficiency of resource utilization while ensuring the reliability of data transmission.

[0091] The adaptive retransmission time interval formula in this mechanism takes into account multiple factors that affect network performance, which makes it adaptable to various complex network environments. Whether it is a network environment with high latency, 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 data 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 comprises:

[0094] Monitor the queue length, packet loss rate and delay rate of the intermediate nodes and the receiving end in real time; determine whether to reduce the sending frequency of the sending end based on 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 based on the data priority, packet loss rate, delay rate and data bandwidth occupancy of multiple transmitting ends corresponding to the intermediate node or the receiving end, determine the priority order of the transmitting end that needs to reduce the sending frequency, and poll and send the instruction to the corresponding transmitting end according to the priority order.

[0096] The working principle and effect of the above technical solution are: continuously monitoring various performance indicators of intermediate nodes and receiving ends, 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] The preset threshold is used to determine whether the performance indicators of the intermediate nodes and the receiving end are beyond the normal range. The threshold is set based on the performance indicators and transmission requirements of the network design to ensure the stable operation of the network and the reliable transmission of data.

[0098] When the queue length, packet loss rate, and delay rate of an intermediate node or receiving end 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, the priority of the transmitters that need to reduce the transmission frequency is determined based on the data priority, packet loss rate, delay rate and bandwidth usage of multiple transmitters. This decision-making process takes into account the importance of data, network congestion and resource usage, aiming to achieve reasonable resource allocation and optimized network operation.

[0100] According to the determined priority, polling sends instructions to reduce the transmission frequency to the corresponding transmitter. This step is achieved through fine control and scheduling of network traffic, aiming to gradually alleviate network congestion while ensuring priority transmission of important data.

[0101] During the transmission frequency adjustment process, the network performance indicators are continuously monitored and dynamically adjusted according to the actual situation. If the network condition improves, the transmission frequency is adjusted accordingly to improve the transmission efficiency of the network. At the same time, feedback information is received from the transmitter to understand the transmitter's execution of instructions and the real-time status of the network, so as to make more precise adjustments and optimizations.

[0102] This mechanism monitors the performance indicators of intermediate nodes and receivers in real time, and judges the current congestion status of the network based on these indicators, thereby dynamically adjusting the transmission frequency of the transmitter. This mechanism comprehensively considers the priority of data, the degree of network congestion and the occupancy of resources, aiming to achieve reasonable allocation of resources and optimized operation of the network. By dynamically adjusting the transmission frequency and finely controlling network traffic, this mechanism can effectively alleviate network congestion, improve data transmission efficiency and network stability.

[0103] In some embodiments, determining the priority order of the transmitting end that needs to reduce the transmission frequency according to the data priority, packet loss rate, delay rate and bandwidth occupancy of the multiple transmitting ends corresponding to the intermediate node or the receiving end includes:

[0104] Firstly sort the data from low to high according to the data priority of the transmitting end;

[0105] In the same first ranking, a comprehensive score of the transmitting end is obtained according to the packet loss rate, delay rate and bandwidth occupancy of the transmitting end; a second ranking is performed according to the comprehensive score; and a priority order of the transmitting ends in each first ranking is determined according to the second ranking;

[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 sender, SZC i is the score of the i-th sender based on the current data; SZH iis the score of the ith sender based on historical data within time t; Li is the current packet loss rate of the ith sender; Di is the current delay rate of the ith sender; Bi is the bandwidth occupied by the current data of the ith 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 time t; The average delay rate of the i-th sender within time t; is the delay packet loss rate of multiple senders within time t; The average bandwidth occupied by the i-th transmitter within time t; is the bandwidth occupancy of multiple transmitters within time t; a1 and a2 are the second weight coefficients, and y1, y2, and y3 are the third weight coefficients.

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

[0112] For each transmitter, a score based on current data is calculated using specific weight coefficients (b1, b2, b3) according to its current packet loss rate, current delay rate, and current bandwidth occupancy. This score reflects the current network performance and resource occupancy of the transmitter.

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

[0114] The score based on current data and the score based on historical data are combined and weighted summed using the first weight coefficient (a1, a2) to obtain the comprehensive score of the transmitter. This comprehensive score takes into account the current performance and long-term performance of the transmitter, providing a basis for subsequent sorting.

[0115] Sort by data priority of the transmitter. Data priority can be determined based on the urgency, importance or other relevant factors of the data. In this step, the transmitters are preliminarily sorted in order from low to high data priority.

[0116] Within the same data priority group, transmitters are sorted according to their comprehensive scores, and transmitters with lower comprehensive scores will be considered as those that need to reduce their transmission frequency first.

[0117] Combining the results of the first sorting and the second sorting, the priority order of each transmitter when reducing the transmission frequency can be determined. This order will guide the system on how to gradually adjust the transmission frequency of each transmitter to alleviate network congestion and optimize resource allocation.

[0118] According to the determined priority, the corresponding transmitter is sent a command to reduce the transmission frequency. At the same time, the network status is continuously monitored and feedback information from the transmitter is received to dynamically adjust and optimize according to the actual situation.

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

[0120] The present application provides a data transmission system based on digital communication, the system comprising:

[0121] The data encapsulation module 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] The data transmission module is used to select an intermediate node and a transmission link according to the network topology, the performance of the intermediate node and the transmission link score. Through the transmission link, the transmitting end sends the format-converted and encoded data 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] The decoding and verification module 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 decoded and verified data packet; if the verification fails, the receiving end requests the sending end to resend the data packet.

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

[0125] A preprocessing unit, used for preprocessing the data to be transmitted, wherein the preprocessing includes dividing the data to be transmitted into multiple data segments, performing preliminary detection and / or compression of the data;

[0126] A data packet creation unit, used to create data packets for the segmented data and set transmission priorities, wherein the data packets include original data, message description, unique identification mark, marking information, data length and check code;

[0127] The encryption unit is used to set different levels of encryption according to the marking information; the marking information includes sensitive information and non-sensitive information.

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

[0129] A link length acquisition unit, used to obtain a plurality of first link lengths and second link lengths according to a network topology structure; the first link length is the length of each link from a sending end to an intermediate node; the second link length is the length of each link from an intermediate node to a receiving end;

[0130] A total length acquisition unit, configured to calculate, for each intermediate node, the transmission link length of each path from the transmitting end to the receiving end passing through the intermediate node according to the first link length and each second link length;

[0131] A node first scoring unit, which obtains a first score of the intermediate node according to the transmission link length of each path of each intermediate node;

[0132] A node selection unit is used to 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 data to be transmitted by the sender; and select other nodes as candidate nodes in descending order of the total score; wherein the performance score of the intermediate node is obtained by the current load, the packet loss rate in the statistical time period, the network congestion, the energy consumption of the node and the reliability of the node;

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

[0134]

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

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

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

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

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

[0140] According to the mean and minimum values, the first score of the node is obtained:

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

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

[0143] Among them, Pj1 is the first score of the j-th node, Pjm1 is the median value of the j-th node, min(Pjm1) is the minimum value of the median values ​​of multiple nodes; min(Pjm1)min(Pjm1) is the maximum value of the median values ​​of multiple nodes; LEja is the average of multiple transmission paths of the j-th node, 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 used to send the format-converted and encoded data to the intermediate node through the first link; the sending end copies each sent data packet to the first buffer area inside it for backup;

[0146] A first verification unit, used for the intermediate node to verify the data packets received from the sending end, and store the verified data packets in its own second buffer area;

[0147] The second transmission unit is used for the intermediate node to send the received data packet to the receiving end through the second link.

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

[0149] The resending subunit is used to request the sending end to resend the data packet through an adaptive retransmission time interval if the verification fails;

[0150] The retransmission interval is:

[0151]

[0152] Among them, T r is the retransmission time interval, C1C2, C3, C4 are adjustment factor coefficients, all in the range of (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 t time; Dj(t) is the delay rate of the jth intermediate node within t time; Fj(t) is the load of the jth node within t time; is the mean value of the historical packet loss rate of the jth node; T0 is the basic retransmission time interval; Dj(t), The range is (0,1);

[0153] A first warning unit, configured to send a first warning if the data packet of the node still fails to be verified after exceeding a preset number of retransmissions;

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

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

[0156] The real-time detection module is used to monitor the queue length, packet loss rate and delay rate of the intermediate nodes and the receiving end in real time; and determine whether to reduce the sending frequency of the sending end according to the monitoring results;

[0157] The polling module is used to determine the priority of the transmitting end that needs to reduce the sending frequency according to the data priority, packet loss rate, delay rate and data bandwidth occupancy of multiple transmitting ends corresponding to the intermediate node or the receiving end, and poll and send the instruction to the corresponding transmitting end according to the priority order 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.

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

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

[0160] A second sorting unit is used to obtain a comprehensive score of the transmitting end according to the packet loss rate, delay rate and bandwidth occupancy of the transmitting end in the same first sorting; perform a second sorting according to the comprehensive score; and determine the priority order of the transmitting ends in the first sorting according to the second sorting;

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

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

[0163]

[0164]

[0165] Among them, SZ i is the comprehensive score of the i-th sender, SZC i is the score of the i-th sender based on the current data; SZH i is the score of the ith sender based on historical data within time t; Li is the current packet loss rate of the ith sender; Di is the current delay rate of the ith sender; Bi is the bandwidth occupied by the current data of the ith 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 time t; The average delay rate of the i-th sender within time t; is the delay packet loss rate of multiple senders within time t; The average bandwidth occupied by the i-th transmitter within time t; is the bandwidth occupancy of multiple transmitters within time t; a1 and a2 are the second weight coefficients, and y1, y2, and y3 are the 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 comprises: S1. The transmitting end encapsulates the data to be transmitted to form a data packet and marks the data transmission priority; the transmitting end performs format conversion and encoding on the data packet to meet the transmission requirements; S2. According to the network topology, the performance of the intermediate nodes and the transmission link score, an intermediate node and a transmission link are selected. Through the transmission link, the transmitting end sends the format-converted and encoded data 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; S3. The receiving end decodes and verifies the data packet after receiving it, and stores and backs up the received data packet and the decoded and verified data packet; if the verification fails, the receiving end requests the sending end to resend the data packet.

2. The data transmission method according to claim 1, characterized in that: The S1 includes: Preprocessing the data to be transmitted, wherein the preprocessing includes dividing the data to be transmitted into multiple data segments, performing preliminary detection and / or compression of the data; Creating data packets for the segmented data and setting transmission priorities, the data packets including original data, message description, unique identification mark, marking information, data length and check code; Different levels of encryption are set according to the marking information; the marking information includes sensitive information and non-sensitive information.

3. The data transmission method according to claim 1, characterized in that: The S2 includes: According to the network topology, 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; For each intermediate node, calculating the transmission link length of each path from the sending end to the receiving end through the intermediate node according to the first link length and each second link length; Obtaining a first score of the intermediate node according to the transmission link length of each path of each intermediate node; 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 data to be transmitted by the sender; and other nodes are selected as candidate nodes in descending order of the total score; According to the intermediate node selected for the data to be transmitted and the lengths of the multiple first links and the lengths of the second links corresponding to the node; determining the first factor of the first link and the first factor of the second link; According to the first factor of the first link and the score of the first link, a preferred first link is obtained; according to the first factor of the second link and the score of the second link, a preferred second link is obtained; wherein the score of the first link and the score of the second link are both determined by their packet loss rate and delay rate.

4. The data transmission method according to claim 3, characterized in that: The step of obtaining a first score of the intermediate node according to the transmission link length of each path of each intermediate node comprises: For one of the intermediate nodes, obtain the average and minimum lengths of multiple transmission paths passing through the node; According to the mean and minimum values, the first score of the node is obtained: 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 j-th node, min(Pjm1) is the minimum value of the median values ​​of multiple nodes; min(Pjm1)min(Pjm1) is the maximum value of the median values ​​of multiple nodes; LEja is the average of multiple transmission paths of the j-th node, LEjmin is the minimum value of multiple transmission paths of the j-th node; w1 and w2 are the first weight coefficients.

5. The data transmission method according to claim 3, characterized in that: The S2 further includes: The format-converted and encoded data is sent to the intermediate node via the first link; the sending end copies each sent data packet to its internal first buffer area for backup; The intermediate node verifies the data packets received from the sender, and stores the verified data packets in its own second buffer area; The intermediate node sends the received data packet to the receiving end through the second link.

6. The data transmission method according to claim 5, characterized in that: The intermediate node verifies the received data packet sent by the sending end; including: If the verification fails, the sender is requested to resend the data packet through an adaptive retransmission time interval; If the data packet of the node still fails to be verified after exceeding the preset number of retransmissions, a first warning is sent; If the verification success rate of the intermediate node data packets is less than the first threshold value during the statistical period, a second warning is sent.

7. The data transmission method according to claim 1, characterized in that: The method further comprises: Monitor the queue length, packet loss rate and delay rate of the intermediate nodes and the receiving end in real time; determine whether to reduce the sending frequency of the sending end based on 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 based on the data priority, packet loss rate, delay rate and data bandwidth occupancy of multiple transmitting ends corresponding to the intermediate node or the receiving end, determine the priority order of the transmitting end that needs to reduce the sending frequency, and poll and send the instruction to the corresponding transmitting end according to the priority order.

8. The data transmission method according to claim 7, characterized in that: The step of determining the priority order of the transmitting end whose transmission frequency needs to be reduced according to the data priority, packet loss rate, delay rate and data bandwidth occupation of the plurality of transmitting ends corresponding to the intermediate node or the receiving end includes: Firstly sort the data from low to high according to the data priority of the transmitting end; In the same first ranking, a comprehensive score of the transmitting end is obtained according to the packet loss rate, delay rate and bandwidth occupancy of the transmitting end; a second ranking is performed according to the comprehensive score; and a priority order of the transmitting ends in each first ranking is determined according to the second ranking; Among them, the comprehensive score of the transmitter is obtained by the following formula: SZ i =a1×SZC i +a2×SZH i Among them, SZ i is the comprehensive score of the i-th sender, SZC i is the score of the i-th sender based on the current data; SZH i is the score of the ith sender based on historical data within time t; Li is the current packet loss rate of the ith sender; Di is the current delay rate of the ith sender; Bi is the bandwidth occupied by the current data of the ith 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 time t; The average delay rate of the i-th sender within time t; is the delay packet loss rate of multiple senders within time t; The average bandwidth occupied by the i-th transmitter within time t; is the bandwidth occupancy of multiple transmitters within time t; a1 and a2 are the second weight coefficients, and y1, y2, and y3 are the third weight coefficients.

9. A data transmission system based on digital communication, characterized in that: The system comprises: The data encapsulation module 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; The data transmission module is used to select an intermediate node and a transmission link according to the network topology, the performance of the intermediate node and the transmission link score. Through the transmission link, the transmitting end sends the format-converted and encoded data 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; The decoding and verification module 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 decoded and verified data packet; if the verification fails, the receiving end requests the sending end to resend the data packet.

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

Images