CN112019304A - End-to-end real-time reliable transmission method based on network coding - Google Patents
End-to-end real-time reliable transmission method based on network coding Download PDFInfo
- Publication number
- CN112019304A CN112019304A CN202010930390.8A CN202010930390A CN112019304A CN 112019304 A CN112019304 A CN 112019304A CN 202010930390 A CN202010930390 A CN 202010930390A CN 112019304 A CN112019304 A CN 112019304A
- Authority
- CN
- China
- Prior art keywords
- coding
- packet
- matrix
- network
- transmission
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 61
- 238000000034 method Methods 0.000 title claims abstract description 45
- 239000011159 matrix material Substances 0.000 claims abstract description 60
- 230000008569 process Effects 0.000 claims abstract description 11
- 238000012545 processing Methods 0.000 claims abstract description 10
- 239000000872 buffer Substances 0.000 claims description 10
- 238000000354 decomposition reaction Methods 0.000 claims description 9
- 238000004458 analytical method Methods 0.000 claims description 3
- 230000008030 elimination Effects 0.000 claims description 3
- 238000003379 elimination reaction Methods 0.000 claims description 3
- 230000007480 spreading Effects 0.000 claims description 2
- 238000004364 calculation method Methods 0.000 abstract description 2
- 238000005516 engineering process Methods 0.000 description 9
- 238000004891 communication Methods 0.000 description 6
- 239000013598 vector Substances 0.000 description 5
- 230000008901 benefit Effects 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 4
- 238000007726 management method Methods 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000008713 feedback mechanism Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0033—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the transmitter
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0036—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the receiver
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0076—Distributed coding, e.g. network coding, involving channel coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0289—Congestion control
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses an end-to-end real-time reliable transmission method based on network coding, which mainly solves the problems of network congestion, data transmission time extension, poor reliability and the like caused by node link instability, channel interference and the like in end-to-end network transmission. The method provided by the invention comprises the following steps: the method comprises four key contents of a sending end coding method, a receiving end decoding method, an end-to-end flow control method based on network coding and real-time data transmission based on the network coding. The invention designs a coding matrix at first, and codes on the basis of ensuring the linearity independence between coding packets; secondly, in the decoding process of the receiving end, a rapid parallel decoding scheme is designed, so that the calculation pressure of the receiving end is reduced; because the link is unstable and causes the problem of packet loss, the transmission can cause congestion, and the invention improves the performance on the basis of the traditional congestion control; finally, the invention designs a network coding data transmission method based on the streaming processing based on the method, and solves the contradiction between the network coding and the batch processing based on the data packet.
Description
Technical Field
The invention relates to the field of real-time transmission in a wireless lossy network, in particular to an end-to-end real-time reliable transmission method based on network coding.
Background
With the development of 5G, 6G and other communication technologies, the requirements for high reliability and low delay in wireless communication networks are becoming more and more obvious. In a wireless network, factors such as environmental interference, node movement, attenuation and the like can cause the problems of error codes and loss of transmission data; when the receiving and transmitting rate of the node exceeds the network capacity, congestion is caused, and a serious delay problem and even network breakdown are caused. Therefore, a reliable transmission method with network congestion control and low delay is needed, and the redundant control overhead of the network is reduced as much as possible.
The introduction of the network coding technology can improve the network throughput, and particularly for the process of recovering the lost data packet, the network coding can reduce the overhead and simultaneously carry out quick retransmission. For end-to-end transport channels, stream-based data transmission is a fundamental advantage. But the real-time requirement is high, the coding and decoding operations of the nodes are still complex problems, and the traditional random linear network coding technology has the defects that the decoding speed is low, and N source data packets can be decoded only after receiving all N coded packets; at the same time, the user can select the desired position,
the invention changes the network coding technology on the basis of the traditional transmission protocol mechanism, deploys the network coding technology in the end-to-end data transmission based on the flow, solves the contradiction and realizes the end-to-end real-time reliable transmission with congestion control.
Disclosure of Invention
The technical problem to be solved by the invention is to provide an end-to-end real-time reliable transmission method based on network coding aiming at the defects involved in the background technology, the method carries out interaction based on confirmed flow control, utilizes perception RTT to carry out congestion control, nodes in a lossy communication network can carry out rapid coding and decoding operations, and end-to-end low-delay high-reliability transmission is provided.
The invention adopts the following technical scheme for solving the technical problems:
an end-to-end real-time reliable transmission method based on network coding, the real-time coding strategy of a source end is as follows: and when the source node needs to send a data packet, grouping the data. The basis for the grouping is the emergency-secret (P-S) weight of the data. The P-S weight reflects the importance of the packet (which may contain information that is not desired to be intercepted) and the timeliness of the packet (which may fail in a short time or may not arrive on time causing a significant loss to the network). Coding matrix thereof
The following were used:
Setting each packet to be coded to have coding matrixWherein the column number is denoted as PIndexThen there are
Here, a and b are adjustable parameters, which respectively represent the importance degrees of the encoding node to the packet emergency secret, and generally, the two are considered to be equally important, that is, a is 1/4, and b is 1/4. If P appearsIndexFinding the most recent P according to the Hash algorithm of linear detectionIndexBy like serial number, i.e. finding P in turnIndex+1，PIndex+2… until an available column sequence number location is found.
N with the proposed coding scheme1Coding each data packet, wherein the data processing flow of a source coding layer is as follows:
step 1: calculating the number k of data packets needing redundancy coding as aL + b/R, the number of columns of the coding matrix can be determined as n2＝n1+k；
Step 2: generating n1*n2Fast coding matrix of
And step 3: setting the matrix to be coded as D, determining n1Position of column vector packet in D
And 4, step 4: obtaining a final coding matrix through the coding matrix generated in the step 2
And 5: setting N to 0, waiting for a transmission packet of a transport layer
a. If the control packet is used for connection management, transmitting the control packet to a control layer and returning to a waiting state;
b. if the packet is not in the coding window, adding the packet to the coding window, and setting N to N + k (k is a redundancy factor);
c. repeating for N times
Step 6: generating a coding combination in a coding window according to the coding matrix D', adding a network coding head and a coefficient in the coding window, and sending a coding packet to a transmission layer;
and 7: and waiting for the return state of the receiving end, and removing the coded packet from the coding buffer area after receiving the confirmation information of the coded packet.
To decode the original packet, the correlation definition is introduced:
definition 1 (see package already): if a node has enough information to compute a linear combination pk+ q wherein
And alpha for all l > kl∈FqThen it is determined that the node has seen the packet pk。
Definition 2 (node knowledge): is a linear combination and aggregation of all original packets, based on the information that has been received. These coefficient vectors from the linear combination of vector spaces are called knowledge spaces of nodes.
Definition 3 (witness): if a node finds a packet pkIt also knows p accuratelykA linear combination of + q, then q itself is linearly combined by unseen packets. Ensuring that the linear combination of the above premises is known as pkThe witness of (1).
An end-to-end real-time reliable transmission method based on network coding, the feedback mechanism of the receiving end is: upon receiving the linear combination, the receiver finds out which packet (if any) was newly found due to the new arrival and acknowledges the packet. If the packet is visible, the receiver will Acknowledge (ACK) that the packet was received, even if the receiver is not able to decode it at this time. Meanwhile, the receiving end confirms (ACK) the visible data packet and sends the visible data packet to the source end, so that end-to-end real-time coding transmission is realized. Meanwhile, even if the coded packet transmitted at this time is lost, the receiving end does not immediately return a loss Acknowledgement (ACK) to cause transmission waiting. End-to-end reliable transmission is achieved because the next successful reception will also result in the next unseen packet being seen and acknowledged.
An end-to-end real-time reliable transmission method based on network coding, the real-time decoding strategy of the receiving end is: the coefficient matrix is decomposed into a product of a lower triangular matrix and an upper triangular matrix, the original Gaussian solution of a square matrix is decomposed into Gaussian solutions of two triangular matrices, the Gaussian solution speed of the triangle is higher than that of the square matrix, and the transmission real-time performance is guaranteed. The original matrix is denoted by Φ, and Φ is also decomposed into k × k matrices. Since Φ is L · U, Φ is first calculated11Should have
Φ11＝L11·U11
Due to L11And U11Simultaneously, a lower triangular matrix and an upper triangular matrix are also used, and L is solved through the formula11And U11The process of (A) is actually a LU decomposition process, but the scale is 1/k of the original2Thus L is11And U11Can be solved quickly.
Then calculate U12，U13And U14Wherein
Φ12＝L11·U12
Φ13＝L11·U13
Φ14＝L11·U14
Due to L11Is an upper triangular matrix, phi12，Φ13And phi14Is a known coding matrix, therefore U12，U13And U14Can be calculated very quickly and then needs to solve for L21、L31And L41The same method of multiplication by submatrices can be found
Φ21＝L21·U11
Φ31＝L31·U11
Φ41＝L41·U11
Likewise, due to U11Is an upper triangular matrix, L21、L31And L41Can be solved quickly, but in this case a U needs to be transmitted11 Matrix size 1/2k of original coding matrix2. While the whole process can be performed concurrently.
Decoding the received packet by using the proposed decoding scheme, wherein the data processing flow of a decoding layer of a receiving end is as follows:
step 1: and a waiting state, wherein the data packet is received, if the data packet is a control packet of the connection management, the control packet is transmitted to the control layer, the waiting state is returned, and otherwise, the waiting state is ignored.
Step 2: receiving the encoded packet from the source
a. Removing the network encoding head and acquiring an encoding coefficient matrix;
b. adding the coding vector as a new row to the existing coding coefficient matrix, executing the decoding method, performing LU decomposition on the coefficient matrix, and updating the visible packet by using the dummy;
c. and adding a load to a decoding buffer area, and operating a corresponding LU decomposition elimination method. If a packet is decoded in the process, passing it to the receiving end source data buffer and removing the packet from the decode buffer;
d. a new acknowledgement response packet (ACK) is generated with a sequence number equal to the remaining first unseen packet sequence number.
And step 3: and ending transmission until all source data packets are decoded.
Setting a sliding window mechanism:
round Trip Time (RTT) is the time interval from the source end receiving the first acknowledgement packet (ACK) to the last acknowledgement packet (ACK) of the sink end. And uses the RTT size to control the difference between the expected transmission rate and the actual transmission rate. When congestion occurs, the buffer starts to fill up and the RTT starts to rise, which is used as a congestion signal. This signal is used to adjust the congestion window and thus the rate.
Compared with the prior art, the invention adopting the technical scheme has the following technical effects:
1. the invention establishes an end-to-end real-time reliable transmission method based on a network coding technology, which solves the contradiction between the batch processing-based network coding and the end-to-end stream-based real-time transmission.
2. The invention utilizes a new coding matrix to realize an end-to-end rapid coding technology, and uses the property of a Van der Waals matrix
The linear independence of the data packets is ensured under the condition that the matrix is linearly coded.
3. The invention defines the concept of the packet found, the receiving end can process the coding packet in real time, even if the source packet can not be decoded, the buffer area management is carried out, and the real-time property of transmission is ensured.
4. The invention controls the congestion window of end-to-end transmission by calculating the Round Trip Time (RTT), realizes the real-time transmission with flow control, improves the throughput of data transmission and ensures the end-to-end reliable transmission.
Drawings
FIG. 1 is an end-to-end real-time reliable transport framework based on network coding according to the present invention;
FIG. 2 is a schematic diagram of end-to-end transmission random loss of the present invention;
FIG. 3 is a diagram of the network coding based end-to-end transport congestion control of the present invention
Fig. 4 is a source packet processing flow of the present invention;
FIG. 5 is a flow chart of the present invention for receiving end packet processing;
FIG. 6 is a recursive process in LU decomposition of the present invention.
Detailed Description
The technical scheme of the invention is further explained in detail by combining the attached drawings:
1) as shown in fig. 1, compared with the general end-to-end transmission framework, the reliable transmission based on network coding adds a network coding layer between a transmission layer and a control layer, which respectively correspond to a coding layer and a decoding layer. The method has the advantages that the deployment of the method can be realized by slightly modifying the existing transmission framework, and the method has good compatibility.
As shown in fig. 2, upon receiving the linear combination, the receiving module first parses out the encoded coefficients and then adds the coefficients to the base matrix of the knowledge space. Then, the decoding scheme described above, i.e., LU elimination, is used to find the most recently visible packet so that this packet can be responded to. The receiving module also maintains a buffer for packets that are not decoded. Once the packets are decoded, the decoding layer at the receiving end passes them to the transport layer. When there is a coded packet that is lost during transmission, the receiver does not send an acknowledgment loss packet (ack (p)) to the source due to the loss, which has the advantage of preventing random losses from being interpreted as congestion.
For convenience in explaining how the present invention performs congestion control, the following discussion is presented in terms of TCP-Vegas. TCP-Vegas uses an active approach to congestion control by inferring the size of the network buffers before they start dropping packets. The key to this algorithm is to estimate the Round Trip Time (RTT) and use this information to find the difference between the expected transmission rate and the actual transmission rate. As congestion occurs, the buffer begins to fill up and the RTT begins to rise, which is used as a congestion signal. This signal is used to adjust the congestion window and thus the rate.
To correctly use TCP-Vegas in this setup, we need to ensure that it uses the effective RTT of the degrees of freedom, including the virtual queuing delay. In other words, the RTT should be measured from the moment a packet is first sent from the source end to the moment the ACK returns that the packet has been seen. The TCP sender records the transmission time of each packet using the default RTT measurement mechanism of TCP-Vegas. When the ACK arrives, it is matched with the corresponding transmission timestamp to calculate the RTT.
2) As shown in fig. 3, the network coding-based end-to-end transmission congestion control transmits coded data packets in a congestion window. Even if the receiver cannot decode the encoded packet, the receiver will consider the packet as received and return an Acknowledgement (ACK) when the encoded packet is visible. When the number of lost packets is smaller than the preset window size (W), the link loss is covered; but when the number exceeds this value, the penalty will not be masked and the latency will time out.
3) Setting mechanism of the coding window (W): the coding window can mask the loss on the end-to-end path, which the network coded based transmission wishes to correct without relying on ACKs. Consider the case where W is 1, each data packet is sent repeatedly, such repetition being useful only for the loss of one packet. If W is 3, each encoding is useful for recovering any of the three source packets involved. Ideally, the resulting encoded packet should be able to correct for any packet loss that has not yet been acknowledged. For this reason, it is better to need W to be larger, but a disadvantage of selecting a large W value is that congestion is caused. The restriction on W means that the encoded packet can only be used to recover W packets that have been mixed to form the encoded packet. If there are consecutive losses, resulting in the receiving end not receiving a linear combination involving a particular original data packet, that data packet will show up as a transmission loss.
4) As shown in fig. 4, a source-end data packet processing flow is shown, for an encoding scheme, most of encoding strategies of network encoding algorithms at present are established on the basis of random linear network encoding, and for the random linear encoding, the greatest disadvantage is that the linear independence of a data packet cannot be ensured. So that the source node has to send out many more encoded packets than the source packet to ensure that the destination node can successfully decode the source packet. Such packets greatly burden the network, causing significant redundancy and energy consumption for forwarding useless packets. Deterministic network coding is to encode a data packet by using a determined matrix so as to realize tasks of ensuring the linear independence and encryption of the data packet or energy control and the like. This problem is well solved by using the proper deterministic coding.
According to the characteristics of the vandermonde matrix, any column is linearly independent. Therefore, linear encoding using the vandermonde matrix must not result in linearly dependent code packets. If the linear coding is performed by using the spreading matrix of the vandermonde matrix, the formula is shown.
Wherein f is1，f2，…，
Is n different from 0 and unequal2An integer number. Since the source node only sends n1A data packet, so that the destination node only needs to receive n1All source packets can be decoded from the linearly independent coded packets. And for extended matrix of vandermonde matrix
To the extent that any n thereof1The order sub-matrices are all a new vandermonde matrix F'. Since the code packet obtained by linearly encoding the column vector group of F' is necessarily linearly independent, the linear independence of the code packet can be ensured by performing linear encoding using the vandermonde expansion matrix.
Due to the requirement of end-to-end streaming based, the source data packets have time sequence, so the data packets are sorted and grouped, and the coding matrix is coded
Modified into
Due to the coding matrix
Is n1*n2(n2>n1) Matrix of order, specifying n2＝n1The size of the + k, k value is the number of packets that need to be redundantly encoded in order to increase the delivery rate of the packets, and therefore the size of the k value should be related to the network conditions. In this chapter, the network condition only considers the packet loss rate and the communication radius of the node. The packet loss rate of data communication among nodes in the network is set to be L, and the average communication radius of the nodes in the network is set to be R (unit: meter). ThatHow to have
Where a and b are adjustable parameters, a is set to 50, and b is set to 400.
(3) As shown in fig. 5, which is a receiving-end packet processing flow, for the decoding scheme, the matrix is subdivided based on the above further analysis, but the data is not changed. As shown in fig. 5, we can have the principle of multiplication of sub-matrices
Φ′22＝L′21·U′12+L′22·U′22
Wherein phi'22，L′21，U′12Are all known, therefore solve for L'22，U′22The process of (2) becomes an LU decomposition problem of recursive solution, and the solution also generates data transmission with the size of 3(k-1)/k of the original coding matrix2The scale of the problem is that of the original problem (k-1)2/k2. Likewise, we first solve for L at the top left22，U22Due to the fact that
Φ22＝L21·U12+L22·U22
This is a small-scale LU decomposition problem, so we can quickly solve L on the node22，U22The next solving process is the same as before, a smaller-scale LU decomposition problem than the previous one is obtained, and the same method is used to solve the remaining recursive LU decomposition tasks, so that all matrix partitions can be solved.
The invention creates the following main protection technical points:
(1) the method is suitable for end-to-end real-time reliable transmission.
(2) The source end adopts a network coding method, which ensures the independence between coding packets and reduces the redundancy so as to reduce the network transmission burden.
(3) The decoding method of the receiving end obviously improves the decoding speed of the receiving end and ensures the real-time property of transmission.
(4) The calculation mode of RTT controls the size of the congestion window by calculating the size of RTT, thereby ensuring the flow control of network transmission and providing reliable transmission.
The invention is suitable for real-time reliable transmission in an end-to-end lossy network, flow control can be carried out by utilizing the scheme, the data delivery rate is improved by introducing a network coding technology, the data transmission throughput is increased, and meanwhile, the real-time property of transmission is ensured.
It will be understood by those skilled in the art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the prior art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
The above-mentioned embodiments, objects, technical solutions and advantages of the present invention are further described in detail, it should be understood that the above-mentioned embodiments are only illustrative of the present invention and are not intended to limit the present invention, and any modifications, equivalents, improvements and the like made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (7)
1. An end-to-end real-time reliable transmission method based on network coding is characterized in that a coding matrix adopted by a source end is as follows:
wherein the front n1The column subarrays being an upper triangular matrix, n1Column to nth2Column (again containing the n-th column1Column) is a vandermonde spreading matrix, each of which data to be encodedThe column number wrapped in the strip coding matrix is marked as PIndex。
2. The method of claim 1, wherein the source data packet processing flow is as shown in fig. 2, and the data packet encoded by the method of claim 1 is sent, and the size of the congestion window is adjusted according to the RTT of the receiving end returning the acknowledgement packet, so as to implement congestion control.
3. A method as claimed in claim 2, characterised in that as congestion occurs, the buffer begins to fill up and the RTT begins to rise, the RTT signal being used to adjust the congestion window and hence the rate at which packets are sent.
4. As in claim 1, after the receiving end receives the data packet, its operation is as shown in fig. 3, the receiving module first parses the coding coefficients from the coding packet header and then adds the coefficients to the basic matrix of the knowledge space. And finding out the latest visible data packet by using a elimination method.
5. As described in claim 4, the receiving end performs visibility analysis on the encoded packet, and if the packet is visible, the receiver will Acknowledge (ACK) that the packet was received even though the receiver is not able to decode it at that time.
6. The decoding method at the receiving end as claimed in claim 4, wherein the coefficient matrix is decomposed into a product of a lower triangular matrix and an upper triangular matrix, and the original gaussian solution of one square matrix is decomposed into a gaussian solution of two triangular matrices. The original matrix is denoted by Φ, and Φ is also decomposed into k × k matrices. Since Φ is L · U, Φ is first calculated11。
7. Further analysis, as described in claim 4, the matrix is repartitioned without changing the data. As shown in fig. 5, we can have the principle of multiplication of sub-matrices
Φ′22＝L′21·U′12+L′22·U′22
Wherein phi'22，L′21，U′12Are all known, therefore solve for L'22，U′22The process of (2) becomes an LU decomposition problem of recursive solution, and the solution also generates data transmission with the size of 3(k-1)/k of the original coding matrix2The scale of the problem is that of the original problem (k-1)2/k2。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010930390.8A CN112019304A (en) | 2020-09-24 | 2020-09-24 | End-to-end real-time reliable transmission method based on network coding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010930390.8A CN112019304A (en) | 2020-09-24 | 2020-09-24 | End-to-end real-time reliable transmission method based on network coding |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112019304A true CN112019304A (en) | 2020-12-01 |
Family
ID=73517048
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010930390.8A Pending CN112019304A (en) | 2020-09-24 | 2020-09-24 | End-to-end real-time reliable transmission method based on network coding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112019304A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114615014A (en) * | 2022-01-29 | 2022-06-10 | 北京航空航天大学 | Data transmission method and system for multilayer distributed network |
| CN115378548A (en) * | 2022-08-17 | 2022-11-22 | 中国人民解放军63892部队 | Connectionless-oriented binary superposition determined linear network coding transmission method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100257427A1 (en) * | 2007-12-07 | 2010-10-07 | Zte Corporation | Coding method, coding device, decoding method and decoding device for low density generator matrix code |
| US8130776B1 (en) * | 2009-08-28 | 2012-03-06 | Massachusetts Institute Of Technology | Method and apparatus providing network coding based flow control |
| EP3054602A1 (en) * | 2015-02-09 | 2016-08-10 | Thomson Licensing | Product-matrix regenerating codes |
| CN107547436A (en) * | 2017-07-19 | 2018-01-05 | 西南交通大学 | The coding and decoding method of transmission control protocol based on network code |
| CN107947903A (en) * | 2017-12-06 | 2018-04-20 | 南京理工大学 | WVEFC fast encoding methods based on flight ad hoc network |
-
2020
- 2020-09-24 CN CN202010930390.8A patent/CN112019304A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100257427A1 (en) * | 2007-12-07 | 2010-10-07 | Zte Corporation | Coding method, coding device, decoding method and decoding device for low density generator matrix code |
| US8130776B1 (en) * | 2009-08-28 | 2012-03-06 | Massachusetts Institute Of Technology | Method and apparatus providing network coding based flow control |
| EP3054602A1 (en) * | 2015-02-09 | 2016-08-10 | Thomson Licensing | Product-matrix regenerating codes |
| CN107547436A (en) * | 2017-07-19 | 2018-01-05 | 西南交通大学 | The coding and decoding method of transmission control protocol based on network code |
| CN107947903A (en) * | 2017-12-06 | 2018-04-20 | 南京理工大学 | WVEFC fast encoding methods based on flight ad hoc network |
Non-Patent Citations (1)
| Title |
|---|
| 徐光宪等: "基于网络编码的确定性逐层构造算法", 《计算机应用》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114615014A (en) * | 2022-01-29 | 2022-06-10 | 北京航空航天大学 | Data transmission method and system for multilayer distributed network |
| CN115378548A (en) * | 2022-08-17 | 2022-11-22 | 中国人民解放军63892部队 | Connectionless-oriented binary superposition determined linear network coding transmission method |
| CN115378548B (en) * | 2022-08-17 | 2024-06-11 | 中国人民解放军63892部队 | Connectionless-oriented binary superposition determination linear network code transmission method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8130776B1 (en) | Method and apparatus providing network coding based flow control | |
| KR102051504B1 (en) | Method and apparatus for transmitting and receiving data packets in a wireless communication system | |
| US11424861B2 (en) | System and technique for sliding window network coding-based packet generation | |
| KR20030064867A (en) | Method for multimedia communication over packet channels | |
| EP2719103B1 (en) | Adaptive generation of correction data units | |
| JP2016502794A (en) | Method and apparatus for improving the performance of TCP and other network protocols in a communication network | |
| JP2005198191A (en) | Transmission apparatus, transmission control program, and transmission method | |
| US10756843B2 (en) | Low-delay packet erasure coding | |
| CN105450357A (en) | Adjustment method of encoding parameters, adjustment device of encoding parameters, processing method of feedback information and processing device of feedback information | |
| CN103580773A (en) | Method and device for transmitting data frame | |
| CN112751644B (en) | Data transmission method, device and system and electronic equipment | |
| US10034023B1 (en) | Extended protection of digital video streams | |
| CN112019304A (en) | End-to-end real-time reliable transmission method based on network coding | |
| CN113541856A (en) | Data recovery method and device | |
| US8942084B2 (en) | Method of reducing retransmission of data frame and receiving node therefor | |
| KR20060112287A (en) | Method and apparatus for acknowledging bitwise data chunk in wireline and wireless communication system | |
| KR20040071765A (en) | Unequal error protection using forward error correction based on Reed-Solomon codes | |
| US20020027911A1 (en) | Method and apparatus for protecting against packet losses in packet-oriented data transmission | |
| JP5600774B1 (en) | Data transmission apparatus and method | |
| Ayanoğlu et al. | Performance improvement in broadband networks using forward error correction for lost packet recovery | |
| JP2003087225A (en) | Method for transferring data, data transfer system, terminal, data transfer program, and recording medium | |
| Chilamkurti et al. | Concurrent multipath transmission with forward error correction mechanism to overcome burst packet losses for delay-sensitive video streaming in wireless home networks | |
| Sun et al. | TCP-FNC: a novel TCP with network coding for wireless networks | |
| WO2022105753A1 (en) | Network data encoding transmission method and apparatus | |
| CN114666013A (en) | Product package sending method of low-information-freshness Internet of things state updating system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20201201 |
|
| WD01 | Invention patent application deemed withdrawn after publication |