CN103067137A - Multicast retransmission method based on network codes - Google Patents
Multicast retransmission method based on network codes Download PDFInfo
- Publication number
- CN103067137A CN103067137A CN2013100154560A CN201310015456A CN103067137A CN 103067137 A CN103067137 A CN 103067137A CN 2013100154560 A CN2013100154560 A CN 2013100154560A CN 201310015456 A CN201310015456 A CN 201310015456A CN 103067137 A CN103067137 A CN 103067137A
- Authority
- CN
- China
- Prior art keywords
- packet
- coding
- column
- network
- state matrix
- 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
- 238000000034 method Methods 0.000 title claims abstract description 44
- 239000011159 matrix material Substances 0.000 claims abstract description 48
- 108091026890 Coding region Proteins 0.000 claims description 26
- 238000003491 array Methods 0.000 claims 1
- 230000005540 biological transmission Effects 0.000 description 7
- 238000004088 simulation Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000005562 fading Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 108010076504 Protein Sorting Signals Proteins 0.000 description 1
- 239000007983 Tris buffer Substances 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
Images
Landscapes
- Error Detection And Correction (AREA)
Abstract
The invention discloses a multicast retransmission method based on network codes, and mainly solves the problem that the retransmission efficiency of the prior art is not high. The multicast retransmission method based on the network codes comprises the following steps: originating nodes broadcast data packets to destination nodes, the destination nodes carry out decoding to received signals and feed back the receiving status information of the data packets to the originating nodes, the originating nodes generate an originating end packet receiving status matrix according to the feedback information and then search matching groups by processing the matrix, the originating nodes carry out network code combination to the matching groups to generate combined groups and retransmit the combined groups, and each destination node carries out decoding to the received signals to acquire the retransmitted combined groups of the codes and recovers the lost group of each node from the combined groups. The multicast retransmission method based on the network codes can effectively reduce the average retransmission times of lost groups, obviously improves retransmission efficiency, and can be used for wireless multicast or broadcast network.
Description
Technical Field
The invention belongs to the technical field of network coding. The method mainly relates to a network coding technology and a multicast retransmission method, and can be used for a wireless multicast network.
Background
In a wireless communication system, an automatic repeat request ARQ method and a forward error control FEC technique are generally adopted to ensure reliability of data transmission.
The conventional ARQ method is to feed back a reception status report to a sender after a receiver receives an error message, and to request retransmission of the message if the receiver has received an error. The conventional ARQ retransmission method has low utilization of communication channels and requires feedback channels, and the transmission speed is limited.
In 2000, Ahlswede R et al proposed the idea of network coding based on the concept of network information flow, and proved that there is more traffic through the coded network. The network coding NC is a linear or nonlinear coding mode which is adopted for input information at a network intermediate node, and can improve the network throughput, reduce the transmission times of data packets and enhance the fault tolerance and robustness of the network. In 2006, Ho et al proposed random linear network coding on the basis of NC, so that the NC technique was applied to the actual network, and subsequently Katti et al proposed an NC method applicable to wireless networks — opportunistic network coding ONC. The ONC method is a random linear network coding method applied to a wireless network, and has obvious superiority in improving wireless information transmission efficiency and throughput. In the same year, Dong Nguyen et al theoretically proves the advantages of the transmission mode based on the ONC method compared with the traditional retransmission method in the aspect of broadcast retransmission efficiency, and provides simulation results for the case of 2 receiving nodes. In 2009, zhuqi et al proposed a network coding-based wireless broadcast retransmission algorithm NCWBR for the case of multiple receiving nodes. Although the algorithm effectively reduces the average retransmission times of the information packets and improves the transmission bandwidth to a certain extent, the algorithm has the disadvantage that not all the retransmission packets are resolvable at the receiving terminal, so that the unsolvable data packets need to be retransmitted again, which limits the retransmission efficiency.
Disclosure of Invention
The invention aims to overcome the defects of the existing algorithm, and provides a multicast retransmission method based on network coding for a wireless multicast network consisting of a source node and a plurality of destination nodes, so that the defects of the existing method are overcome, the retransmission times of data packets are further reduced, and the retransmission efficiency is improved.
The technical idea for realizing the purpose of the invention is that the source node analyzes the receiving state of the information packet fed back by each destination node, combines the packets lost by the destination node through network coding, generates a new combined packet and then broadcasts and sends out the new combined packet. The destination node recovers its lost packet from the combined packet by simple network codec. The method comprises the following specific steps:
(1) source node broadcast data packet
The source node S first treats the N data packet sequences p to be transmittediAnd i belongs to {1, 2.... N }, and carrying out convolutional code coding to obtain a coding sequence ciThen to the coding sequence ciBPSK modulation is carried out to obtain a modulation sequence xiThen, multicasting the N modulation sequences to M destination nodes in N time slots, wherein each time slot broadcasts a data packet;
(2) destination node decodes and feeds back data packet receiving state information
(2.1) M destination nodes carry out convolutional code decoding on the signal sequences received by N time slots respectively, and the decoding results are stored in the packet receiving state matrixes of the respective destination nodes
j ∈ { 1.,. M }, where the subscript 1 × N denotes 1 row and N column;
(2.2) the destination node sends the respective packet receiving state matrix to the source node S through a feedback channel;
(3) the source node generates a source end packet receiving state matrix and a network coding combined packet and retransmits the same
(3.1) packet reception status matrix for all feedbacks
Generating a source end packet receiving state matrix omega with M rows and N columns at a source node SM×N；
(3.2) the source node S receives the state matrix omega by processing the source end packet according to the network coding combination principleM×NSearching a matching grouping mode to generate a coding combination grouping;
(3.3) after the source node S carries out channel coding and BPSK modulation on the newly generated coding combination packet, broadcasting the modulation sequence to each destination node;
(4) destination node decoding and recovering lost packets
(4.1) each destination node performs convolutional code decoding on the received signal to obtain a code combination packet;
(4.2) each destination node combines the decoding result of the packet and its own packet reception state matrix according to the codes
Recovering the corresponding lost packet through network coding and decoding operation, and updating the respective packet receiving state matrix
And feeding back the updated information to the source node S;
(4.3) the Source node S updates the Source end packet reception State matrix omegaM×NAnd entering a new round of retransmission until the M destination nodes successfully receive the N data packets.
Compared with the prior art, the invention has the following advantages:
when generating code combination packets, the existing ONC-based retransmission algorithm simply combines the first lost packet codes of each destination node, and when a certain combination packet contains two or more lost packets of the same destination node, the lost packets are not resolvable at the destination node, so that the lost packets must be retransmitted again; when the coding combination packet is generated, the retransmission algorithm is carried out in a mode of processing the receiving state matrix of the source end packet to find the matching packet, and the combination packet generated by the matching packet can be solved at a destination node, so that unnecessary retransmission is reduced, and the retransmission efficiency is further improved.
Drawings
FIG. 1 is a schematic diagram of a multicast network used by the present invention;
FIG. 2 is an overall flow diagram of the present invention;
FIG. 3 is a block diagram of an encoder for tail-biting convolutional codes used in the present invention;
FIG. 4 is a sub-flow diagram of the present invention for generating a coded combined packet;
fig. 5 is a comparison of retransmission performance of the present invention with existing methods.
Detailed Description
Before a specific embodiment of the present invention is given, an example of a wireless multicast network is given, as shown in fig. 1. In fig. 1, there is a source node, denoted as S, and four destination nodes, denoted as T, respectively1，T2，T3，T4. The number of the receiving nodes is recorded as M, the number of the data packets broadcasted by the source node is recorded as N, wherein N is larger than or equal to M.
Referring to fig. 2, the implementation steps of the present invention are as follows:
step 1, a source node broadcasts a data packet.
(1.1) the source node S treats the binary sequences p of the data packets to be sent, respectivelyiI e {1,2, …, N } is encoded using the tail-biting convolutional code encoder shown in FIG. 3 to obtain the encoded sequence
Wherein,
respectively outputting sequences for three encoders;
(1.2) the source node S will get the coding sequence ciPerforming BPSK modulation to obtain a modulation sequence: x is the number ofi＝2ci-1；i∈{1,...,N}；
(1.3) broadcasting the N modulated sequences over a rayleigh slow fading channel to M receiving terminals using N time slots, one data packet per time slot.
And 2, decoding and feeding back the data packet receiving state information by the destination node.
(2.1) the destination node performs convolutional code decoding on the received signal and stores the decoding result in the respective destination node grouping receiving state matrix
j ∈ {1, …, M }, if the packet PiDestination node TjIf the reception is correct, set TjOf the packet reception state matrixThe ith element of
Otherwise make
Packet PiAt node TjWhether the loss compliance parameter is qjBernoulli distribution of (q)jIndicating the receiving user TjA packet loss rate of;
(2.2) destination node receives the state matrix according to its groupingFeedback receiving state information to source nodeIf matrix
Middle element
An ACK acknowledgement signal is fed back, otherwise a NAK acknowledgement signal is fed back.
And 3, the source node generates a source end packet receiving state matrix and a network coding combined packet and retransmits the packet.
(3.1) the source node generates a source end packet receiving state matrix omega according to all the fed back packet receiving state informationM×NIf the destination terminal TjFor packet PiIf ACK signal is fed back, set to omegaM×NRow j and column i element omegajiWhen not equal to 0, otherwise, set ωji1, the following table gives an example of a source packet reception state matrix of the network shown in fig. 1;
(3.2) the source node S receives the state matrix omega by processing the source end according to the network coding combination principleM×NSearching a matching grouping mode to generate a coding combination grouping; the combination principle includes two points: firstly, the coding combination grouping can be solved at each destination node; secondly, one code combination packet should contain as many lost packets as possible; the matching packet is defined as: at the source end packet reception state matrix omegaM×NFor any row j, if the element
To sum, i.e.
Are not more than 1, and i1,i2,…，ikAll are non-0 columns, wherein k is greater than or equal to 1, then column i is called1，i2,...，ikCorresponding grouping
Is a matching packet.
By definition, a linear combination packet of matching packets is resolvable at all destination nodes.
Referring to fig. 4, the specific implementation of this step to generate the coded combined packet is as follows:
(3.2a) traversing the source packet receipt status matrix omegaM×NSearching the first non-0 column, marking the column corresponding to the first non-0 column as i, and grouping PiPutting a newly-built coding sequence, and assigning the sequence to be all 0;
(3.2b) traverse the matrix omega starting from column i +1M×NSearching for a matching packet of all packets in the current code sequence, adding the matching packet to the code sequence, and if there are multiple matching packets, selecting the matching packet at omegaM×NPutting the large-column-weight groups in the corresponding column into the coding sequence, selecting the first searched matched group to be put into the coding sequence under the condition that the column weights of the corresponding columns are equal, and continuously traversing omega from the i +1 columnM×NUp to ΩM×NWhen the matched groups of all the groups in the current coding sequence cannot be searched, the searching is finished, and the next step is carried out;
(3.2c) carrying out exclusive OR operation on all the groups in the current coding sequence to generate a code combination group, if only one group exists in the current coding sequence, the group is independently used as a code combination group, and then omega is addedM×NAll the columns corresponding to all the groups of the middle coding sequence are assigned with 0; if omegaM×NIf not, returning to step (3.2a), otherwise, ending the code combination packet generation process.
According to the steps, the source end packet receiving state matrix omega shown in the table 1 is obtainedM×NThe process of generating the combined packet is as follows:
first, the source side packet reception state shown in table 1Matrix omegaM×NThe 1 st non-0 th column, i.e. the 1 st column, searched in the search, and the corresponding grouping is P1A 1 is to P1Putting the newly-built coding sequence;
then, traverse matrix Ω from column 2M×NFinding P in current coding sequence1Matching of packets P2，P3，P4，P5Due to omegaM×NMiddle packet P2 Corresponding column 2 and packet P5The column weights of the corresponding columns 5 are all 2, and the packet P3Corresponding column 3 and packet P4The column weights of the corresponding columns 4 are all 1, P2，P5The column size of the corresponding column is large because P is searched first2Therefore, P is selected2As P1Is matched with P2Put the current coding sequence and continue traversing omegaM×NSearching for P in the current coding sequence1，P2Matching of packets, finding packet P3Continue traversing omegaM×NUntil P can no longer be searched1，P2，P3The search is finished after the matching grouping;
then, P in the current coding sequence is added1，P2，P3The packets are subjected to an XOR operation to generate a coded combined packet
Then the omega is reducedM×NMiddle P1，P2，P3 All corresponding columns 1,2, 3 are assigned 0; to this end, the source-side packet reception state matrix ΩM×NInstead of a full 0 matrix, the same method is used to generate the coded combined packet
And P5Thus, a complete network coding combining process is completed.
And (3.3) the source node S broadcasts the modulation sequence to each destination node after carrying out channel coding and BPSK modulation on the generated code combination packet.
And 4, decoding and recovering the lost packet by the destination node.
(4.1) each destination node performs convolutional code decoding on the received signal to obtain a code combination packet;
(4.2) each destination node combines the decoding result of the packet and its own packet reception state matrix according to the codes
j belongs to {1, …, M }, and performs network coding and decoding operation to recover the corresponding lost packet and update the respective packet receiving state matrix
And feeds back the update information to the source node S. For example, coding the combined packet
At the destination node T2Correct decoding according to T2Receiving state matrix of
It can be seen that in P1，P2，P3Of the three groups, only P2Is lost but passes
P can be recovered by operation2Other destination nodes recover their respective lost packets in the same manner.
(4.3) the Source node S updates the Source end packet reception State matrix omegaM×NThen, determine ΩM×NAnd whether the matrix is an all-0 matrix or not, if so, the M destination nodes successfully receive the N data packets, otherwise, a new round of network coding combination retransmission needs to be performed.
The effects of the present invention can be further illustrated by the following simulations:
1. simulation conditions
Setting parameters of tail-biting convolutional codes according to the LTE standard, wherein the generator polynomial of the codes is (133, 171, 165), and the code rate is 1/3; the channel between each target node and each source node is a Rayleigh slow fading channel, and a received signal model is that y is hx + n, wherein h and n respectively represent the fading coefficient and Gaussian white noise of the channel between the target node and the source node; the SNR is set to be =9dB, and at this time, the packet loss rate of the destination node is about 10%, and the opportunity of combining the lost packets by network coding is better.
2. Emulated content
The number of data packets to be sent is set to be 10, 20 and 50 respectively, the number of target nodes is changed from 2 to 10, the retransmission efficiency is simulated by adopting the method and the existing method respectively, the simulation result is shown in figure 5, wherein the average retransmission frequency of the ordinate is a measurement parameter of the retransmission efficiency, the average retransmission frequency is the transmission frequency required for transmitting one data packet to all terminals successfully, and T is usedRDenotes, TRIs calculated by the formula
Where N represents the number of data packet retransmissions and N represents the number of data packets transmitted.
As can be seen from fig. 5, when N is fixed and the number M of destination nodes varies from 2 to 10, the average retransmission times required by the method of the present invention is less than that of the existing method; when N takes values of 10, 20 and 50, the difference between the theoretical value and the method of the present invention and the existing method is gradually reduced, but the difference between the theoretical value and the method of the present invention is reduced more rapidly.
The comprehensive analysis can obtain: compared with the existing method, the multicast retransmission method based on network coding, which is provided by the invention aiming at a plurality of receiving nodes, has improved performance. When the number of data packets increases, the difference between the two methods and the theoretical value of the multicast retransmission strategy based on network coding gradually decreases, because the packet loss probability of the destination node used in calculating the theoretical value is a statistical probability, i.e., the probability when the value of N is large enough, and when the actual simulation is performed, the value of N is limited, so that the larger the value of N is, the closer the value of N is to the theoretical value.
Claims (8)
1. A multicast retransmission method based on network coding comprises the following steps:
(1) source node broadcast data packet
The source node S first treats the N data packet sequences p to be transmittediI is corresponding to {1,2, …, N } to carry out convolution code coding to obtain a coding sequence ciThen to the coding sequence ciBPSK modulation is carried out to obtain a modulation sequence xiThen, multicasting the N modulation sequences to M destination nodes in N time slots, wherein each time slot broadcasts a packet;
(2) destination node decodes and feeds back data packet receiving state information
(2.1) M destination nodes carry out convolutional code decoding on the information sequences received by N time slots respectively, and the decoding results are stored in the packet receiving state matrixes of the respective destination nodes
j ∈ {1, …, M }, where the subscript 1 × N denotes 1 row and N column;
(2.2) the destination node sends the respective packet receiving state information to the source node S through a feedback channel;
(3) the source node generates a source end packet receiving state matrix and a network coding combined packet and retransmits the same
(3.1) the source node S generates a source end packet receiving state matrix omega with M rows and N columns according to all the fed back packet receiving state informationM×N；
(3.2) the source node S receives the state matrix omega by processing the source end packet according to the network coding combination principleM×NSearching a matching grouping mode to generate a coding combination grouping;
(3.3) after the source node S carries out channel coding and BPSK modulation on the newly generated coding combination packet, broadcasting the modulation sequence to each destination node;
(4) destination node decoding and recovering lost packets
(4.1) each destination node performs convolutional code decoding on the received signal to obtain a code combination packet;
(4.2) each destination node combines the decoding result of the packet and its own packet reception state matrix according to the codes
Recovering the corresponding lost packet through network coding and decoding operation, and updating the respective packet receiving state matrix
And feeding back the updated information to the source node S;
(4.3) Source node S update SourceEnd packet reception state matrix omegaM×NAnd entering a new round of retransmission until the M destination nodes successfully receive the N data packets.
2. The multicast retransmission method based on network coding according to claim 1, wherein the convolutional code coding in step (1) adopts tail-biting convolutional code in LTE standard, and the generator polynomial of the code is (133, 171, 165) and the code rate is 1/3.
3. The network coding-based multicast retransmission method according to claim 1, wherein said pair coding sequence c of step (1)iPerforming BPSK modulation according to the following formula:
xi＝2ci-1,i∈{1，2，…，N}
where N is the number of data packets to be transmitted, ciIs a data packet P to be broadcastiBinary sequence p ofiCoding sequence of (a), xiIs a coding sequence ciAnd carrying out BPSK modulation to obtain a modulation sequence.
4. The network coding-based multicast retransmission method according to claim 1, wherein said step (3.1) of generating a source end packet receiving state matrix Ω of M rows and N columns at the source node SM×NGenerated as follows:
the source node S establishes a source end packet receiving state matrix omega according to the packet receiving state information fed back by the destination nodeM×NIf a data packet PiAt the destination node TjIf it is correctly received, let the source end packet receive state matrix omegaM×NRow j and column i element omegajiIf P is equal to 0, otherwiseiAt TjIf it is lost, let ω beji＝1；
Packet PiAt the destination node TjWhether the loss compliance parameter is qjBernoulli distribution of (q)jRepresents a destination node TjThe packet loss rate of.
5. The multicast retransmission method based on network coding according to claim 1, wherein the network coding combining rule of step (3.2) includes the following two points:
firstly, the coding combination grouping can be solved at each destination node;
the second is that one coded combined packet should contain as many lost packets as possible.
6. The multicast retransmission method based on network coding according to claim 1, wherein the step (3.2) is performed by processing a source end packet reception state matrix ΩM×NSearching a matching grouping mode to generate a new code combination grouping, and performing the following steps:
(3.2a) traversing the source packet receipt status matrix omegaM×NSearching the first non-0 column, marking the column of the column as i, and grouping P corresponding to the columniPutting a newly-built coding sequence, and assigning the sequence to be all 0;
(3.2b) traverse the matrix omega starting from column i +1M×NSearching for matching packets of all packets in the current coding sequence, adding the matching packets to the coding sequence, and if a plurality of matching packets exist, selecting a matching packet in a source end packet receiving state matrix omegaM×NThe packet with the maximum column weight in the corresponding column is put into the coding sequence, under the condition that the column weights of the corresponding columns are equal, the matching packet searched firstly is selected to be put into the coding sequence, and the source end packet receiving state matrix omega is continuously traversed from the i +1 columnM×NUntil the matched groups of all the groups in the current coding sequence can not be searched any more, ending the search and carrying out the next step;
(3.2c) carrying out exclusive OR operation on all the packets in the current coding sequence to generate a coding combination packet, if only one packet exists in the current coding sequence, taking the packet as a coding combination packet, and then receiving the state matrix omega of the source end packetM×NAll the columns corresponding to all the groups of the middle coding sequence are assigned with 0; if omegaM×NIf not all 0 arrays, return to step (3.2a)Otherwise, the code combining packet generation process ends.
7. The network coding based multicast retransmission method according to claim 1, wherein the matching packet of step (3.2) is defined as follows:
at the source end packet reception state matrix omegaM×NFor any row j, if the elementTo sum, i.e.
Are not more than 1, and i1，i2,…，ikAll are non-0 columns, wherein k is greater than or equal to 1, then column i is called1，i2,…，ikCorresponding groupingIs a matching packet.
8. The network coding based multicast retransmission method according to claim 1, wherein the network coding decoding operation of step (4.2) is an exclusive-or operation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013100154560A CN103067137A (en) | 2013-01-16 | 2013-01-16 | Multicast retransmission method based on network codes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013100154560A CN103067137A (en) | 2013-01-16 | 2013-01-16 | Multicast retransmission method based on network codes |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103067137A true CN103067137A (en) | 2013-04-24 |
Family
ID=48109612
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2013100154560A Pending CN103067137A (en) | 2013-01-16 | 2013-01-16 | Multicast retransmission method based on network codes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103067137A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104219032A (en) * | 2014-08-19 | 2014-12-17 | 北京邮电大学 | Minimum packet loss retransmission method in multicast scene in wireless local area network |
| CN104486052A (en) * | 2014-12-30 | 2015-04-01 | 厦门大学 | Multicast retransmission method and device based on D2D cluster under high packet loss probability |
| CN104539546A (en) * | 2015-01-19 | 2015-04-22 | 中国人民解放军国防科学技术大学 | GEO satellite network BGP routing multicast transmission method based on network encoding |
| CN104602196A (en) * | 2013-10-30 | 2015-05-06 | 株式会社理光 | Multicast communication method, multicast transmission apparatus, and multicast reception apparatus |
| WO2015109500A1 (en) * | 2014-01-23 | 2015-07-30 | 华为技术有限公司 | Data transmission method and apparatus |
| CN106254044A (en) * | 2016-09-14 | 2016-12-21 | 西北工业大学 | A kind of dynamic linear combination repeating method based on multicast network coding |
| CN107026714A (en) * | 2017-03-23 | 2017-08-08 | 西安电子科技大学 | The user collaboration method encoded in wireless multicast based on hybrid network |
| CN107342874A (en) * | 2016-04-29 | 2017-11-10 | 阿姆有限公司 | Feedback mechanism for multicast protocol |
| CN110268786A (en) * | 2017-02-07 | 2019-09-20 | 三星电子株式会社 | The method and apparatus of control and data information are sent in radio honeycomb communication system |
| WO2022213950A1 (en) * | 2021-04-06 | 2022-10-13 | 华为技术有限公司 | Data transmission method, apparatus, and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101394299A (en) * | 2008-10-13 | 2009-03-25 | 北京邮电大学 | Application of network encoding and constellation overlapped encoding combination in mobile communication |
| CN101714915A (en) * | 2009-11-02 | 2010-05-26 | 清华大学 | Data retransmission method and system |
| CN102497248A (en) * | 2011-11-30 | 2012-06-13 | 电子科技大学 | Data retransmission method based on network coding |
| CN102594529A (en) * | 2012-03-16 | 2012-07-18 | 哈尔滨工业大学深圳研究生院 | Transmitting terminal radio retransmission method and system based on network code |
-
2013
- 2013-01-16 CN CN2013100154560A patent/CN103067137A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101394299A (en) * | 2008-10-13 | 2009-03-25 | 北京邮电大学 | Application of network encoding and constellation overlapped encoding combination in mobile communication |
| CN101714915A (en) * | 2009-11-02 | 2010-05-26 | 清华大学 | Data retransmission method and system |
| CN102497248A (en) * | 2011-11-30 | 2012-06-13 | 电子科技大学 | Data retransmission method based on network coding |
| CN102594529A (en) * | 2012-03-16 | 2012-07-18 | 哈尔滨工业大学深圳研究生院 | Transmitting terminal radio retransmission method and system based on network code |
Non-Patent Citations (2)
| Title |
|---|
| 吕振兴等: "基于网络编码的III型HARQ无线广播跨层设计", 《电子与信息学报》 * |
| 肖潇: "基于网络编码的无线传输技术研究", 《中国优秀博士学位论文全文数据库 信息科技辑 2010年》 * |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104602196A (en) * | 2013-10-30 | 2015-05-06 | 株式会社理光 | Multicast communication method, multicast transmission apparatus, and multicast reception apparatus |
| CN104602196B (en) * | 2013-10-30 | 2018-02-09 | 株式会社理光 | Multi-broadcast communication method, multicast send equipment, multicast reception equipment |
| WO2015109500A1 (en) * | 2014-01-23 | 2015-07-30 | 华为技术有限公司 | Data transmission method and apparatus |
| CN105103491A (en) * | 2014-01-23 | 2015-11-25 | 华为技术有限公司 | Data transmission method and apparatus |
| CN104219032A (en) * | 2014-08-19 | 2014-12-17 | 北京邮电大学 | Minimum packet loss retransmission method in multicast scene in wireless local area network |
| CN104219032B (en) * | 2014-08-19 | 2017-12-29 | 北京邮电大学 | Minimum packet loss repeating method in multicast scene in WLAN |
| CN104486052A (en) * | 2014-12-30 | 2015-04-01 | 厦门大学 | Multicast retransmission method and device based on D2D cluster under high packet loss probability |
| CN104539546A (en) * | 2015-01-19 | 2015-04-22 | 中国人民解放军国防科学技术大学 | GEO satellite network BGP routing multicast transmission method based on network encoding |
| CN107342874A (en) * | 2016-04-29 | 2017-11-10 | 阿姆有限公司 | Feedback mechanism for multicast protocol |
| CN107342874B (en) * | 2016-04-29 | 2021-05-28 | 阿姆有限公司 | Feedback mechanism for multicast protocols |
| CN106254044A (en) * | 2016-09-14 | 2016-12-21 | 西北工业大学 | A kind of dynamic linear combination repeating method based on multicast network coding |
| CN110268786A (en) * | 2017-02-07 | 2019-09-20 | 三星电子株式会社 | The method and apparatus of control and data information are sent in radio honeycomb communication system |
| CN110268786B (en) * | 2017-02-07 | 2023-05-12 | 三星电子株式会社 | Method and apparatus for transmitting control and data information in a wireless cellular communication system |
| US11924849B2 (en) | 2017-02-07 | 2024-03-05 | Samsung Electronics Co., Ltd | Method and apparatus for transmitting control and data information in wireless cellular communication system |
| CN107026714A (en) * | 2017-03-23 | 2017-08-08 | 西安电子科技大学 | The user collaboration method encoded in wireless multicast based on hybrid network |
| CN107026714B (en) * | 2017-03-23 | 2019-10-25 | 西安电子科技大学 | User collaboration method based on hybrid network coding in wireless multicast |
| WO2022213950A1 (en) * | 2021-04-06 | 2022-10-13 | 华为技术有限公司 | Data transmission method, apparatus, and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103067137A (en) | Multicast retransmission method based on network codes | |
| US10084569B2 (en) | Data sending method and apparatus | |
| CN102355341B (en) | Network coding method of hybrid automatic request retransmission for long-term evolution system | |
| CN101667904B (en) | All-in-one feedback retransmission method based on fountain codes | |
| CN101938334B (en) | Adaptive error control method combining random network coding and automatic repeat request | |
| CN101567755B (en) | Network coding method based on fountain codes | |
| CN101895376B (en) | Transmission method for realizing data broadcasting in multi-hop wireless network | |
| JP2015149786A (en) | Communication method using parity packets, communication devices and repeaters | |
| Malak et al. | Tiny codes for guaranteeable delay | |
| CN101714915A (en) | Data retransmission method and system | |
| JP5989346B2 (en) | Data retransmission method and apparatus | |
| RU2461970C2 (en) | Method and apparatus for receiving data | |
| CN102957511B (en) | Adaptive deceleration method of data transmission | |
| CN101183875A (en) | Velocity matching method for limited longness circulation caching of Turbo code | |
| CN112600647B (en) | Multi-hop wireless network transmission method based on network coding endurance | |
| CN102013951A (en) | Wireless communication network coding method using fountain codes | |
| CN102724021A (en) | Collaborative transmission method based on distributed interweaved and group encoding | |
| CN102833051A (en) | Fountain coding broadcast method based on feedback | |
| CN102202264B (en) | Wireless cooperation relay network reliable multicast transmission method and system | |
| CN105634671A (en) | Communication method based on fountain codes and physical layer network coding | |
| CN101420291A (en) | Combined decoding method for network and channel code in relay system | |
| CN104852788A (en) | Data broadcast ARQ method based on maximum-minimum network encoding | |
| Li et al. | N-in-1 retransmission with network coding | |
| CN113438055B (en) | Convolutional network coding transmission method based on unequal redundancy insertion | |
| Malak et al. | Throughput and delay analysis for coded ARQ |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130424 |