CN110034854B - Reliable data transmission method based on interleaving and random linear network coding - Google Patents
Reliable data transmission method based on interleaving and random linear network coding Download PDFInfo
- Publication number
- CN110034854B CN110034854B CN201811362538.1A CN201811362538A CN110034854B CN 110034854 B CN110034854 B CN 110034854B CN 201811362538 A CN201811362538 A CN 201811362538A CN 110034854 B CN110034854 B CN 110034854B
- Authority
- CN
- China
- Prior art keywords
- packet
- batch
- sending
- packets
- receiving
- 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.)
- Active
Links
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/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- 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/0056—Systems characterized by the type of code used
- H04L1/0071—Use of interleaving
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The invention belongs to the field of wireless network coding, and particularly relates to a reliable data transmission method based on interleaving and random linear network coding.
Description
Technical Field
The invention belongs to the technical field of reliable data transmission of wireless links, and particularly relates to a reliable data transmission method based on interleaving and random linear network coding. The method mainly improves the throughput of the channel at the cost of certain transmission delay and buffer capacity by means of an interleaving technology and random linear network coding.
Background
In recent years, network coding, as a novel coding technology, has become an important technology for improving network throughput and transmission reliability, and has gained extensive attention in academia and industry, and has rapidly developed. In the MORE method [1], packets are sent in a batch mode, wherein the source node continuously injects new packets generated by all packets of the batch in a random linear coding mode into the network, and as long as the sink receives enough packets with independent linearity, all packets of the batch can be successfully solved, and at this time, the sink can send an acknowledgement to the source to confirm the successful reception of the batch packets. The MORE method has the problems that a certain unnecessary redundant packet exists in the network due to certain path delay and path loss between the information source and the information sink, network resources are wasted, and network throughput is reduced.
The method of the invention adopts an interleaving mode to interleave different batch sending, and reduces unnecessary redundancy in the network at the cost of certain transmission delay and buffer capacity so as to improve the network throughput.
[1] S. Chachulski, M. Jennings, S. Katti, D. Katabi, “Trading Structure for Randomness in Wireless Opportunistic Routing,” Proc. ACM SIGCOMM’07, pp. 169-180, Oct. 2007.
Disclosure of Invention
The invention relates to a reliable data transmission method based on interleaving and random linear network coding (unless specifically stated, hereinafter referred to as the method or the method), wherein a transmitting node and a receiving node are connected through a wireless link or a path with high delay and high loss characteristics, the method improves the throughput of the wireless link through the reliable data transmission based on interleaving and random linear network coding, and the main components comprise: sender packet storage and encoding, single batch packet transmission, single batch packet reception, multi-batch packet transmission and reception in combination with interleaving.
The application scene and network environment oriented by the method are as follows: links between wireless transceiver nodes, such as wireless transmission links between satellites and ground stations, or wireless paths consisting of multiple wireless nodes, such as multi-hop paths consisting of multiple short-range wireless communication modes (e.g., WiFi), have high delay and loss characteristics.
The following describes the various components of the present invention, including: sender packet storage and encoding, single batch packet transmission, single batch packet reception, multi-batch packet transmission and reception in combination with interleaving.
1) Sender packet storage and encoding in combination with interleaving
The sending node codes the packet to be sent after arranging and storing the packet to be sent in the following mode:
the sending node reads mn packets into the memory each time to prepare for sending, wherein each row includes n, m rows, and the packet number is recorded as: 1, 2, 3, …, mn, the mn packets being denoted as one data block;
when sending, reading out column by column, i.e. grouping x, x + n, x +2n, …, x + (m-1) n as a group, also called a batch, x being an integer between 1 and n, thus each batch comprises m original data packets;
packets of different banks are sent independently, and for each transmission of a bank packet, each time a packet is sent, it is a randomly linearly coded combination of the bank packet.
Fig. 1 shows an interleaving and transmission scheme of a packet on the transmitting side.
2) Single batch packet send
For the transmission of a single batch packet, the sending node firstly sends m + epsilon packets at a higher rate, for example, selects a rate close to the capacity of a channel or a path of both the sending and the receiving parties, the specific value depends on the channel state, the m value and the n value, m + epsilon can be the minimum value that the receiving party can correctly decode the batch packet, that is, m + epsilon linearly independent packets are correctly received, the receiving party can be ensured to correctly decode all original packets of the batch, epsilon is more than or equal to 0, the specific value of epsilon depends on the actually adopted coding method, m + epsilon can also be the minimum value that the receiving party correctly decodes the batch packet and is higher than a preset probability, then, if the sending party does not receive the acknowledgement packet of the receiving party about the batch packet, the sending party enters a subsequent packet sending mode, and under the sending mode, the packets generated by the subsequent random linear combination mode of the batch are sent at a lower rate, the transmission time interval of the subsequent packet transmission should be greater than or equal to the RTT between the transceiving nodes, the RTT being Round-trip time, and the subsequent packet transmission of a batch continues in this way until an acknowledgement packet is received by the receiving party for the batch packet.
3) Single batch packet receiving method
The receiving node, after decoding a complete batch, will send an acknowledgement packet to the sending node.
4) Multi-batch packet transmitting and receiving method
For a sending node, after sending the first m + epsilon packets of a batch, the sending node can move to the next batch, when the sending node finishes sending the last batch of the current data block, the sending node can move to the sending of the next data block, when a sender receives the confirmation of a receiver about all the batches in a data block, the data block can be deleted from a sending memory, for the receiver, after receiving the packets capable of completely decoding one batch, the batch packets are decoded, and when the receiver receives all the batches in a complete data block, the data of the block can be continuously forwarded or submitted to an application layer.
Claims (4)
1. A reliable data transmission method based on interleaving and random linear network coding is characterized in that a transmitting node and a receiving node are connected through a wireless link or a path with high delay and high loss characteristics, and the throughput of the wireless link is improved through the reliable data transmission based on interleaving and random linear network coding, and the method mainly comprises the following steps: the method comprises the steps of storing and encoding a sender packet, sending a single batch packet, receiving the single batch packet and sending and receiving multiple batch packets in an interleaving mode; the sender packet storage and coding combined with the interleaving mode comprises the following steps:
the sending node codes the packet to be sent after arranging and storing the packet to be sent in the following mode:
the sending node reads mn packets into the memory each time to prepare for sending, wherein each row includes n, m rows, and the packet number is recorded as: 1, 2, 3, …, mn, the mn packets being denoted as one data block;
when sending, reading out column by column, i.e. grouping x, x + n, x +2n, …, x + (m-1) n as a group, also called a batch, x being an integer between 1 and n, thus each batch comprises m original data packets;
packets of different banks are sent independently, and for each transmission of a bank packet, each time a packet is sent, it is a randomly linearly coded combination of the bank packet.
2. The method of claim 1, wherein the single batch packet is sent as:
for the transmission of a single batch packet, the sending node firstly sends m + epsilon packets at a higher rate, for example, selects a rate close to the capacity of a channel or a path of both the sending and the receiving parties, the specific value depends on the channel state, the m value and the n value, m + epsilon can be the minimum value that the receiving party can correctly decode the batch packet, namely, m + epsilon linearly independent packets are correctly received, the receiving party is ensured to correctly decode all original packets of the batch, epsilon is more than or equal to 0, the specific value of epsilon depends on the actually adopted coding method, m + epsilon can also be the minimum value that the receiving party correctly decodes the batch packet and is higher than a preset probability, then, if the sending party does not receive the acknowledgement packet of the receiving party about the batch packet, the sending party enters a subsequent packet sending mode, and under the sending mode, the packets generated by the subsequent random linear combination mode of the batch are sent at a lower rate, the transmission time interval of the subsequent packet transmission should be greater than or equal to the RTT between the transceiving nodes, the RTT being Round-trip time, and the subsequent packet transmission of a batch continues in this way until an acknowledgement packet is received by the receiving party for the batch packet.
3. The method of claim 2, wherein the single batch packet is received as:
the receiving node, after decoding a complete batch, will send an acknowledgement packet to the sending node.
4. The reliable data transmission method based on interleaving and random linear network coding according to claim 3, wherein the multi-batch packet is sent and received as follows:
for a sending node, after sending the first m + epsilon packets of a batch, the sending node can move to the next batch, when the sending node finishes sending the last batch of the current data block, the sending node can move to the sending of the next data block, when a sender receives an acknowledgement packet of a receiver about all the batches in a data block, the data block can be deleted from a sending memory, for a receiver, after receiving the packet capable of completely decoding one batch, the batch packet is decoded, and when the receiver receives all the batches in a complete data block, the data of the block can be continuously forwarded or submitted to an application layer.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811362538.1A CN110034854B (en) | 2018-11-15 | 2018-11-15 | Reliable data transmission method based on interleaving and random linear network coding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811362538.1A CN110034854B (en) | 2018-11-15 | 2018-11-15 | Reliable data transmission method based on interleaving and random linear network coding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110034854A CN110034854A (en) | 2019-07-19 |
| CN110034854B true CN110034854B (en) | 2021-10-01 |
Family
ID=67235253
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811362538.1A Active CN110034854B (en) | 2018-11-15 | 2018-11-15 | Reliable data transmission method based on interleaving and random linear network coding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110034854B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101222297A (en) * | 2008-01-31 | 2008-07-16 | 复旦大学 | Interlaced code and network code combined data distribution method |
| WO2013060390A1 (en) * | 2011-10-28 | 2013-05-02 | Irdeto B.V. | Content stream processing |
| CN107040334A (en) * | 2015-09-30 | 2017-08-11 | 香港中文大学 | Loss for communication network restores agreement |
-
2018
- 2018-11-15 CN CN201811362538.1A patent/CN110034854B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101222297A (en) * | 2008-01-31 | 2008-07-16 | 复旦大学 | Interlaced code and network code combined data distribution method |
| WO2013060390A1 (en) * | 2011-10-28 | 2013-05-02 | Irdeto B.V. | Content stream processing |
| CN107040334A (en) * | 2015-09-30 | 2017-08-11 | 香港中文大学 | Loss for communication network restores agreement |
Non-Patent Citations (3)
| Title |
|---|
| "Robust video communication using Random Linear Network Coding with Pre-Coding and Interleaving";Chamitha de Alwis del;《2012 19th IEEE International Conference on Image Processing》;20130221;第2、2.1、2.2节 * |
| "无线传感器网络机会路由协议—MORE的优化";王晓燕;《电脑开发与应用》;20120228;摘要 * |
| "无线传感网中网络编码关键技术的研究";郁美芬;《中国优秀硕士学位论文全文数据库 信息科技辑》;20150531;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110034854A (en) | 2019-07-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9118353B2 (en) | System and method for communicating with low density parity check codes | |
| CN101573907B (en) | Relay-assisted HARQ transmission system | |
| Apavatjrut et al. | Toward increasing packet diversity for relaying LT fountain codes in wireless sensor networks | |
| CN110166188A (en) | For the system and method for the mixed automatic repeat request based on set of terminal that honeycomb integrated equipment to equipment communicates | |
| CN112600647B (en) | Multi-hop wireless network transmission method based on network coding endurance | |
| CN102684818A (en) | Data retransmission method, relay station, base station and communication system | |
| CN113055285B (en) | Self-adaptive data transmission method based on MPTCP and network coding | |
| US6560206B1 (en) | Cell based data transmission method | |
| CN102970111B (en) | Redundant-coding-based multi-channel access method for satellite network communication | |
| CN109075911A (en) | Data transmission method for uplink, data receiver method and sending device and receiving device | |
| CN110034854B (en) | Reliable data transmission method based on interleaving and random linear network coding | |
| WO2022135068A1 (en) | Hybrid automatic repeat request (harq)-based communication method and device | |
| Bhatia et al. | Review on variants of network coding in wireless ad-hoc networks | |
| Zhao et al. | Cooperative diversity using distributed turbo codes | |
| Wicaksana et al. | Spectral efficient half duplex relaying for fountain code with wireless network coding | |
| Alves et al. | Performance of type-i and type-ii hybrid arq in decode and forward relaying | |
| CN103001735A (en) | Coding and decoding method and signal processing method for relay system | |
| CN110248384B (en) | Single-hop wireless multicast packet length optimization method based on random linear network coding | |
| Decker | An adaptive type-II hybrid ARQ/FEC protocol suitable for GSM | |
| KR20100078972A (en) | A highspeed code radio wave protocal for updating a software on wireless sensor networks | |
| Shieh et al. | Network coding design for broadcast service of low cost receiver | |
| Bian et al. | Endurance Network Coding for Multi-Hop Wireless Communications | |
| Sakakibara et al. | Outage probability of random relying of MDS codeword blocks in cooperative multi-hop networks | |
| Bashun et al. | Cooperative transmission through incremental redundancy | |
| Shieh et al. | Binary Codebook Design for Broadcast System with Low Cost Receiver |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |