CN102025473A - Retransmission method based on intergenerational network coding in packet network - Google Patents

Retransmission method based on intergenerational network coding in packet network Download PDF

Info

Publication number
CN102025473A
CN102025473A CN2010106151454A CN201010615145A CN102025473A CN 102025473 A CN102025473 A CN 102025473A CN 2010106151454 A CN2010106151454 A CN 2010106151454A CN 201010615145 A CN201010615145 A CN 201010615145A CN 102025473 A CN102025473 A CN 102025473A
Authority
CN
China
Prior art keywords
packet
generation
node
collection
network
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
Application number
CN2010106151454A
Other languages
Chinese (zh)
Inventor
谢磊
陈惠芳
杨磊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang University ZJU
Original Assignee
Zhejiang University ZJU
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhejiang University ZJU filed Critical Zhejiang University ZJU
Priority to CN2010106151454A priority Critical patent/CN102025473A/en
Publication of CN102025473A publication Critical patent/CN102025473A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention relates to a retransmission method based on an intergenerational network coding in a packet network. The existing retransmission method has more retransmission times and high channel occupancy rate. A transmitting node of the invention divides every h source data packet into an algebraic number, and every k algebraic numbers are divided into one transmitting set; after the transmitting node transmits each transmitting set, all receiving nodes judge whether the amount of received data packets is h or not according to the order of a coding vector matrix of the packet header of all data packets, if so, the algebraic number data packet can be decoded, otherwise, packet loss happens in the data transmission process; and the receiving node which has the phenomenon of packet loss generates a set of retransmission packet coding vectors according to the coding vector of the received data packet and sends to the transmitting node through ARQ (Automatic Repeat Request). After the transmitting node transmits the data packet of one transmitting set, the retransmission coding vectors contained in all ARQ are calculated to obtain the minimum retransmission data packet. The retransmission times are reduced by utilizing the characteristics of network coding transmission and the retransmission efficiency is further improved.

Description

In the Packet Based Network based on the repeating method of network code between generation
Technical field
The invention belongs to networking technology area, relate in a kind of packet switching network that is applied to coding Network Based, to the certainty repeating method of the packet lost in the data transmission procedure.
Background technology
Along with the continuous development of information age, people's life is inseparable with communication network.Along with the arrival of 3G communication, the professional positive fast development of multi-medium data, and the Network Transmission quality requirement improves constantly, and number of users is also increasing rapidly.How influence in the face of factors such as the restriction of the poorness of bandwidth, transmitting power, hardware implementation complexity effectively utilizes existing limited Internet resources to become one of important topic of communication networks nowadays network.
The mode that traditional communication network transmits data is that storage is transmitted, and promptly only is responsible for routing forwarding except the sending node and the node the receiving node of data, and the data content is not done any processing, and intermediate node is played the part of the role of transponder.For a long time, people generally believe on intermediate node the data of transmission are processed and do not have any income.The network code theory that equals proposition in 2000 up to Ahlswede has thoroughly been overthrown this traditional view.This theory has proposed the notion of network code first and has utilized the theory of relevant entropy to prove.By network code, the maximum transfer capacity of network multicast on can realization theory.The process that network node is operated and handled transmission information just is called network code.Network code has thoroughly changed information processing and transmission manner in the communication network, is the important breakthrough of information theory research field.
In the packet switching network, transfer of data is carried out with the form of bag.Each packet comprises source data and packet header, and its middle wrapping head has comprised overall coding vector information.Usually source data packet is divided into some generations collection, in each generation, concentrates and includes h packet, and wherein h represents the max-flow of network.Usually network code only carries out within each is for collection, can reduce network code and complexity of decoding like this.Each intermediate node carries out network code to all input link packets, and upgrades the overall coding vector in the packet header.In transmission course, calculate the deadline that each is finished for the collection transmission by setting up a kind of synchronization mechanism.Packet may be owing to postpone or stop up to arrive receiving node before deadline in transmission course, and we just judge that this packet is a packet loss.In case node is judged certain packet generation packet loss, the overall coding vector of this packet and data vector all are judged to be zero when carrying out network code.
Packet might be lost in network transmission process, cause receiving node and can not recover source information, so packet loss is handled extremely important in the Network Transmission.Current processing method for packet loss mainly is that packet loss is retransmitted and two kinds of forward error corrections.The ordinary retransmission method retransmits respectively one by one to the packet that feedback request ARQ requires to retransmit, and the number of times of re-transmission is very big, and is higher to channel seizure ratio.
Summary of the invention
The minimum repeating method that the purpose of this invention is to provide a kind of coding Network Based, this method is transmitted as target with the reliable multicast of realizing taking less Internet resources and finishing data.
The inventive method comprises the steps:
Step (1) sending node sends the form of source data with packet, and each packet comprises source data vector sum packet header, and its middle wrapping head has comprised overall coding vector information.Sending node is divided into some generations collection with source data packet, and each generation concentrates and includes h source data packet, and wherein h represents the max-flow of network.Network code only carries out within each is for collection, and sending node sends out h coded data packet (generation collects) at every turn, remembers that i for the set of collection packet is
Figure 2010106151454100002DEST_PATH_IMAGE002
, wherein
Figure 2010106151454100002DEST_PATH_IMAGE004
Represent the coding vector of concentrated j coded data packet of i generation, for
Figure 2010106151454100002DEST_PATH_IMAGE006
Dimensional vector is chosen k generation collection and is constituted one and retransmit and send collection, promptly whenever sends k generation collection (send collect) and retransmits;
Each intermediate node of step (2) carries out network code to all input link packets, and upgrades the overall coding vector in the packet header.In transmission course, calculate the deadline that each is finished for the collection transmission by setting up a kind of synchronization mechanism.Packet may be owing to postpone or stop up to arrive receiving node before deadline in transmission course, and we just judge that this packet is a packet loss.In case node is judged certain packet generation packet loss, the overall coding vector of this packet and data vector all are judged to be zero when carrying out network code;
It is N that step (3) is established the receiving node number, and when source node is sending i generation when collecting source data packet, n receiving node receives that data packet recording is
Figure 2010106151454100002DEST_PATH_IMAGE008
, wherein
Figure 2010106151454100002DEST_PATH_IMAGE010
If For Order, representative is received
Figure 119774DEST_PATH_IMAGE012
The packet of individual linear independence, this moment, each receiving node was if detect
Figure 2010106151454100002DEST_PATH_IMAGE014
The time, then judge when former generation collection transmission of data packets generation packet loss, need the retransmission data packet may number to be , n receiving node generates
Figure 650243DEST_PATH_IMAGE016
Individual orthogonal vectors
Figure 2010106151454100002DEST_PATH_IMAGE018
, and
Figure 2010106151454100002DEST_PATH_IMAGE020
The linear space of opening with The linear space quadrature of opening is with this
Figure 2010106151454100002DEST_PATH_IMAGE024
Individual orthogonal vectors send to the source node requirement by ARQ and retransmit;
Step (4) source node sends after the k codes or data bag, receives that receiving node sends it back the repeat requests ARQ about all k codes or data bags.Definition
Figure 2010106151454100002DEST_PATH_IMAGE026
, introduce set
Figure 2010106151454100002DEST_PATH_IMAGE028
, wherein
Figure 2010106151454100002DEST_PATH_IMAGE030
,
Figure 870220DEST_PATH_IMAGE010
, initialization
Figure 2010106151454100002DEST_PATH_IMAGE032
Wherein
Figure 2010106151454100002DEST_PATH_IMAGE034
,
Figure 2010106151454100002DEST_PATH_IMAGE036
Be
Figure 2010106151454100002DEST_PATH_IMAGE038
Null vector,
Figure 2010106151454100002DEST_PATH_IMAGE040
Be
Figure 2010106151454100002DEST_PATH_IMAGE042
Null vector, promptly Be
Figure DEST_PATH_IMAGE046
Vector,
Figure DEST_PATH_IMAGE048
,
Figure DEST_PATH_IMAGE050
Step (5) is established
Figure DEST_PATH_IMAGE052
, all m are added 1 to t from 1 circulation carry out following operation, if
Figure DEST_PATH_IMAGE054
, then do not consider receiving node n:
(1) gets
Figure DEST_PATH_IMAGE056
, use the linear correlation criterion and obtain
Figure DEST_PATH_IMAGE058
Linear combination
Figure DEST_PATH_IMAGE060
(2) to each node n, when
Figure DEST_PATH_IMAGE062
And
Figure DEST_PATH_IMAGE064
The time, upgrade
Figure DEST_PATH_IMAGE066
:
Figure DEST_PATH_IMAGE068
；
Step (6) will generate Generate data retransmission as the overall coding vector of retransmission packet and wrap in next generation collection and retransmit, each receiving node is received retransmission packet after, by
Figure DEST_PATH_IMAGE070
Just can recover all source datas of this collection in generation.
The present invention has following beneficial effect with respect to prior art: utilize deterministic algorithm to guarantee that retransmission data packet may can make all receiving nodes can both correctly recover source data packet, and the retransmission data packet may amount is minimum, especially effect is more obvious when the packet loss of link probability is high, thereby the saving bandwidth at utmost improves network bandwidth utilance; Send the size of collection simultaneously by control, the k value promptly is set, can control decoding time-delay and the required cache size of node.
Description of drawings
Fig. 1 is every flow chart that retransmits again behind the k codes or data bag that sends.
Fig. 2 is 18 nodes that generate at random, and the receiving node number is 3, and max-flow is 4 random topology figure.
Fig. 3 is a traditional repeating method and based on the simulation result comparison diagram of performance on Fig. 2 of network code repeating method (k=4) between generation.
Embodiment
The invention will be further described below in conjunction with accompanying drawing.
Network code system: define an oriented no loop network
Figure DEST_PATH_IMAGE072
, wherein V represents the set of all nodes among the G, and E represents the set of all links among the G.The ordered pair of certain two element represents promptly have among all available V of each element among the E
Figure DEST_PATH_IMAGE074
, representing link e is a communication channel from node i to node j.Wherein node e is called the output limit of node i, the input limit of node j.For arbitrary node i definition set Out (i)={ e
Figure DEST_PATH_IMAGE076
E:e is the output limit of node i }, In (i)={ e
Figure 572302DEST_PATH_IMAGE076
E:e is the input limit of node i }, and suppose that the message capacity on every limit is 1.Definition set S} and
Figure DEST_PATH_IMAGE078
Wherein
Figure DEST_PATH_IMAGE080
And
Figure DEST_PATH_IMAGE082
And
Figure DEST_PATH_IMAGE084
, S represents source node and T represents receiving node set.If the minimal cut between source node and each receiving node is h, that is to say the communication path that has the h bar or do not overlap between source node and the arbitrary receiving node.Source node is by the each multicast h symbol of network each receiving node in the T.Definition information source information vector
Figure DEST_PATH_IMAGE086
For all
Figure DEST_PATH_IMAGE088
All there is a local code vector matrix in node, utilize in this matrix each node of coefficient to the input limit symbol carry out linear combination output to again output the limit.System's transfer matrix It is one Matrix, wherein
Figure DEST_PATH_IMAGE094
Represent the transfer ratio of link d to link e.Matrix B is a source node
Figure DEST_PATH_IMAGE096
Encoder matrix.Define overall coding vector
Figure DEST_PATH_IMAGE098
For
Figure 153849DEST_PATH_IMAGE096
Encoder matrix is corresponding to the row of link e, and then link e goes up the symbol of transmission
Figure DEST_PATH_IMAGE100
Linear correlation criterion: establish
Figure DEST_PATH_IMAGE102
, data are right
Figure DEST_PATH_IMAGE104
, and
Figure DEST_PATH_IMAGE106
, wherein
Figure DEST_PATH_IMAGE108
Then exist
Figure DEST_PATH_IMAGE110
Linear combination u satisfy
Figure DEST_PATH_IMAGE112
, wherein
Figure 228116DEST_PATH_IMAGE108
And u can be in the time
Figure DEST_PATH_IMAGE114
In find out.
Step (1) sending node sends the form of source data with packet, and each packet comprises source data vector sum packet header, and its middle wrapping head has comprised overall coding vector information.And source data packet is divided into some generations collection, and in each generation, concentrates and includes h packet, and wherein h represents the max-flow of network.Network code only carries out within each is for collection, and sending node sends out h coded data packet (generation collects) at every turn, remembers that i for the set of collection packet is
Figure 573691DEST_PATH_IMAGE002
, wherein
Figure DEST_PATH_IMAGE116
Represent the coding vector of j coded data packet, for
Figure 504738DEST_PATH_IMAGE006
Vector is chosen k generation collection and is constituted one and retransmit and send collection, promptly whenever sends k generation collection (send collect) and retransmits;
Each intermediate node of step (2) carries out network code to all input link packets, and upgrades the overall coding vector in the packet header.In transmission course, calculate the deadline that each is finished for the collection transmission by setting up a kind of synchronization mechanism.Packet may be owing to postpone or stop up to arrive receiving node before deadline in transmission course, and we just judge that this packet is a packet loss.In case node is judged certain packet generation packet loss, the overall coding vector of this packet and data vector all are judged to be zero when carrying out network code;
Step (3) is when the recipient node number is N, and when source node is sending i generation when collecting source data packet, n receiving node receives that data packet recording is
Figure 446018DEST_PATH_IMAGE008
, wherein
Figure 183030DEST_PATH_IMAGE010
If
Figure 706415DEST_PATH_IMAGE012
For Order, representative is received
Figure 315568DEST_PATH_IMAGE012
The packet of individual linear independence, this moment, each recipient node was if detect
Figure DEST_PATH_IMAGE118
The time, then judge when former generation collection transmission of data packets generation packet loss, need the retransmission data packet may number to be
Figure 279107DEST_PATH_IMAGE016
, n receiving node generates
Figure 860261DEST_PATH_IMAGE016
Individual orthogonal vectors
Figure 195428DEST_PATH_IMAGE018
, and
Figure 924349DEST_PATH_IMAGE020
The linear space of opening with
Figure 190114DEST_PATH_IMAGE022
The linear space quadrature of opening is with this
Figure 688092DEST_PATH_IMAGE024
Individual orthogonal vectors send to the source node requirement by ARQ and retransmit;
Step (4) source node sends after the k codes or data bag, receives that receiving node sends it back the repeat requests ARQ about all k codes or data bags.Definition , introduce set
Figure 348060DEST_PATH_IMAGE028
, wherein
Figure 230566DEST_PATH_IMAGE030
, , initialization
Figure 214013DEST_PATH_IMAGE032
, wherein
Figure 651948DEST_PATH_IMAGE034
,
Figure 10248DEST_PATH_IMAGE036
Be
Figure 482818DEST_PATH_IMAGE038
Null vector,
Figure 596267DEST_PATH_IMAGE040
Be
Figure 708448DEST_PATH_IMAGE042
Null vector, promptly
Figure 932756DEST_PATH_IMAGE044
Be
Figure 931936DEST_PATH_IMAGE046
Vector,
Figure 216287DEST_PATH_IMAGE048
,
Figure 628814DEST_PATH_IMAGE050
Step (5) is established
Figure 345228DEST_PATH_IMAGE052
, all m are added 1 to t from 1 circulation carry out following operation, if
Figure 526811DEST_PATH_IMAGE054
, then do not consider receiving node n:
(1) gets
Figure 654167DEST_PATH_IMAGE056
, use the linear correlation criterion and obtain
Figure 553990DEST_PATH_IMAGE058
Linear combination
Figure 120100DEST_PATH_IMAGE060
(2) to each node n, when
Figure 608720DEST_PATH_IMAGE062
And
Figure 969294DEST_PATH_IMAGE064
The time, upgrade
Figure 356413DEST_PATH_IMAGE066
:
；
Step (6) will generate
Figure 554493DEST_PATH_IMAGE060
The most overall coding vector of retransmission packet generates data retransmission and wraps in next generation collection and retransmit.After each receiving node received retransmission packet, by
Figure 39963DEST_PATH_IMAGE070
Just can recover all source datas of this collection in generation.
Be illustrated in figure 1 as the flow chart that retransmits again behind every transmission k codes or data bag, source node is divided the generation collection with source data packet, each at first judge whether this collection sends at the transmission collection of correspondence in generation when sending certain for collection, do not send then and to continue to send, begin transmission otherwise then the retransmission data packet may that generates is formed new transmission collection with source data packet when the former generation collection.Intermediate node then the link by packet loss will take place packet zero setting and carry out network code with the coded data packet of receiving and send.Receiving node retransmits the source node request data package otherwise then send ARQ when receiving that enough efficient coding packets then decipher the recovery source data.
Be illustrated in figure 2 as the multicast network of 18 nodes that generate at random, wherein the receiving node number is 3, the network heap(ed) capacity is 4, the packet loss of every link generates between 1/1000 to 1/100 at random, application is carried out emulation respectively based on the repeating method of network code between generation and traditional repeating method on network shown in Figure 2, source node all sends the packet that 1000000 generations collect at every turn, send the collection size and be made as 4, usually we weigh the performance of repeating method with the average transmission number of times of each packet, then two kinds of repeating method packet average repeat time simulation results as shown in Figure 3, as seen the repeating method based on network code between generation lacks a lot than traditional repeating method packet average repeat time, thereby can save bandwidth, improve network bandwidth utilance.

Claims (7)

  1. In the Packet Based Network based on the repeating method of network code between generation, it is characterized in that this method comprises the steps:
    Step (1) source node is divided Dai Jihou with the source data packet set and is sent for coding in collecting at each;
    Step (2) intermediate node is transmitted receiving data packet coding;
    Step (3) receiving node is according to the coded data packet generation ARQ that receives and send to source node;
    Step (4) source node is collected transmission collection interior each ARQ and extraction for collection and is retransmitted coding vector;
    Step (5) source node generates new re-transmission coding vector according to the re-transmission coding vector that extracts;
    Step (6) source node generates retransmission data packet may according to new re-transmission coding vector and sends.
  2. 2. in the Packet Based Network according to claim 1 based on the repeating method of network code between generation, it is characterized in that described step (1) is specially: sending node sends the form of source data with packet, each packet comprises source data vector sum packet header, and its middle wrapping head comprises overall coding vector information; Sending node is divided into some generations collection with source data packet, and each generation concentrates and includes h packet, and wherein h represents the max-flow of network; Network code only carries out within each is for collection, and sending node sends out h coded data packet at every turn, remembers that i for the set of collection packet is
    Figure 165801DEST_PATH_IMAGE001
    , wherein
    Figure 448883DEST_PATH_IMAGE002
    Represent the coding vector of concentrated j coded data packet of i generation, for
    Figure 832591DEST_PATH_IMAGE003
    Dimensional vector is chosen re-transmission of k generation collection formation and is sent collection, promptly whenever sends k Dai Jizai and retransmits.
  3. 3. in the Packet Based Network according to claim 1 based on the repeating method of network code between generation, it is characterized in that described step (2) is specially: each intermediate node carries out network code to all input link packets, and upgrades the overall coding vector in the packet header; When intermediate node is judged certain packet generation packet loss, then when carrying out network code, the overall coding vector and the data vector of this packet all is judged to be zero.
  4. 4. in the Packet Based Network according to claim 1 based on the repeating method of network code between generation, it is characterized in that described step (3) is specially: establishing the receiving node number is N, when source node is sending i generation when collecting source data packet, n receiving node receives that data packet recording is
    Figure 963358DEST_PATH_IMAGE004
    , wherein
    Figure 790631DEST_PATH_IMAGE005
    If For
    Figure 561458DEST_PATH_IMAGE004
    Order, representative is received
    Figure 546732DEST_PATH_IMAGE006
    The packet of individual linear independence, this moment, each receiving node was if detect
    Figure 43441DEST_PATH_IMAGE007
    The time, then judge when former generation collection transmission of data packets generation packet loss, need the retransmission data packet may number to be
    Figure 114165DEST_PATH_IMAGE008
    , n receiving node generates
    Figure 105255DEST_PATH_IMAGE008
    Individual orthogonal vectors
    Figure 645169DEST_PATH_IMAGE009
    , and
    Figure 125829DEST_PATH_IMAGE010
    The linear space of opening with The linear space quadrature of opening is with this
    Figure 213051DEST_PATH_IMAGE012
    Individual orthogonal vectors send to the source node requirement by ARQ and retransmit.
  5. 5. in the Packet Based Network according to claim 1 based on the repeating method of network code between generation, it is characterized in that described step (4) is specially: source node sends after the k codes or data bag, receives that receiving node sends it back the repeat requests ARQ about all k codes or data bags; Order
    Figure 94288DEST_PATH_IMAGE013
    , introduce set
    Figure 683532DEST_PATH_IMAGE014
    , wherein
    Figure 417264DEST_PATH_IMAGE015
    ,
    Figure 812474DEST_PATH_IMAGE005
    , initialization
    Figure 298950DEST_PATH_IMAGE016
    , wherein
    Figure 386991DEST_PATH_IMAGE017
    ,
    Figure 840975DEST_PATH_IMAGE018
    Be
    Figure 711979DEST_PATH_IMAGE019
    Null vector, Be
    Figure 328217DEST_PATH_IMAGE021
    Null vector, promptly
    Figure 754650DEST_PATH_IMAGE022
    Be
    Figure 757241DEST_PATH_IMAGE023
    Vector,
    Figure 467577DEST_PATH_IMAGE024
    ,
    Figure 631842DEST_PATH_IMAGE025
  6. 6. based on the repeating method of network code between generation, it is characterized in that described step (5) is specially in the Packet Based Network according to claim 1: order
    Figure 811151DEST_PATH_IMAGE026
    , all m are carried out following operation from 1 to t, if
    Figure 40269DEST_PATH_IMAGE027
    , then do not consider receiving node n:
    A, get
    Figure 418161DEST_PATH_IMAGE028
    , use the linear correlation criterion and obtain
    Figure 956589DEST_PATH_IMAGE029
    Linear combination
    Figure 606882DEST_PATH_IMAGE030
    B, to each node n, when
    Figure 951276DEST_PATH_IMAGE031
    And
    Figure 386937DEST_PATH_IMAGE032
    The time, upgrade
    Figure 581420DEST_PATH_IMAGE033
    :
    Figure 797638DEST_PATH_IMAGE034
    。
  7. 7. based on the repeating method of network code between generation, it is characterized in that described step (6) is specially: will generate in the Packet Based Network according to claim 1
    Figure 617826DEST_PATH_IMAGE030
    As the overall coding vector of retransmission packet next generation collection retransmit, each receiving node is received retransmission packet after, by
    Figure 970310DEST_PATH_IMAGE035
    Just can recover all source datas of this collection in generation.
CN2010106151454A 2010-12-30 2010-12-30 Retransmission method based on intergenerational network coding in packet network Pending CN102025473A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2010106151454A CN102025473A (en) 2010-12-30 2010-12-30 Retransmission method based on intergenerational network coding in packet network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2010106151454A CN102025473A (en) 2010-12-30 2010-12-30 Retransmission method based on intergenerational network coding in packet network

Publications (1)

Publication Number Publication Date
CN102025473A true CN102025473A (en) 2011-04-20

Family

ID=43866382

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2010106151454A Pending CN102025473A (en) 2010-12-30 2010-12-30 Retransmission method based on intergenerational network coding in packet network

Country Status (1)

Country Link
CN (1) CN102025473A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102970235A (en) * 2012-12-06 2013-03-13 南京邮电大学 Multicast routing method based on intra-flow and inter-flow network encoding in wireless mesh network
WO2014201928A1 (en) * 2013-06-20 2014-12-24 华为技术有限公司 Multicast retransmitting method, device and system
CN104521170A (en) * 2013-06-20 2015-04-15 华为技术有限公司 Multicast retransmitting method, device and system
CN107196991A (en) * 2017-04-06 2017-09-22 暨南大学 A kind of data-updating method of network-oriented code clustering system
CN110391879A (en) * 2019-07-15 2019-10-29 湖南大学 Loss recovery method, device and the computer equipment of data transmission network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ZHENG WANG 等: "Retransmission Strategies of the Generation-based Network Coding in Packet Networks", 《PROCEEDINGS OF THE 15TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102970235A (en) * 2012-12-06 2013-03-13 南京邮电大学 Multicast routing method based on intra-flow and inter-flow network encoding in wireless mesh network
CN102970235B (en) * 2012-12-06 2015-04-08 南京邮电大学 Multicast routing method based on intra-flow and inter-flow network encoding in wireless mesh network
WO2014201928A1 (en) * 2013-06-20 2014-12-24 华为技术有限公司 Multicast retransmitting method, device and system
CN104521170A (en) * 2013-06-20 2015-04-15 华为技术有限公司 Multicast retransmitting method, device and system
CN104521170B (en) * 2013-06-20 2018-11-30 华为技术有限公司 A kind of multicast retransmission method, equipment and system
CN107196991A (en) * 2017-04-06 2017-09-22 暨南大学 A kind of data-updating method of network-oriented code clustering system
CN110391879A (en) * 2019-07-15 2019-10-29 湖南大学 Loss recovery method, device and the computer equipment of data transmission network

Similar Documents

Publication Publication Date Title
CN102497248B (en) Data retransmission method based on network coding
CN104243096B (en) A kind of deep space multifile transmission method based on fountain codes
CN101714915B (en) Data retransmission method and system
US7710908B2 (en) Method and arrangement for coding and scheduling in a retransmission communication system
CN103312478B (en) Method and system for the data transfer in data network
CN102170332A (en) Opportunistic routing protocol data distributing method based on fountain code and network coding
CN101826937B (en) Link layer error control system suitable for next generation mobile Internet and method thereof
CN104539387B (en) A kind of hop-by-hop transmitting control method of water sound sensor network
CN102025473A (en) Retransmission method based on intergenerational network coding in packet network
CN103634083A (en) Dynamic network coded packet loss retransmission method suitable for sensor network
CN104486052A (en) Multicast retransmission method and device based on D2D cluster under high packet loss probability
CN109936424A (en) Multi-relay cooperation retransmission algorithm based on hybrid network coding
CN102208962A (en) Wireless data transmission method
CN102752184A (en) Data communication system for real-time multicast service and method thereof
CN103297197A (en) Distributed relay erasure coding method for mobile delay tolerant network
CN111064551A (en) Improved continuous cooperative retransmission algorithm based on network coding
Ali et al. Learning-based adaptive sliding-window RLNC for high bandwidth-delay product networks
CN102546096A (en) Real-time multicasting self-adaptation optimization method based on unequal error protection
Ha et al. TCP Network Coding with Enhanced Retransmission for heavy and bursty loss
CN106954242A (en) A kind of satellite distributed dynamic multi-path method for routing based on network code
Ar-Reyouchi et al. NCBP: Network coding based protocol for recovering lost packets in the Internet of Things
Malak et al. ARQ with cumulative feedback to compensate for burst errors
CN113612737A (en) Long message reliable transmission method based on grouping and retransmission mechanism
Malak et al. Throughput and delay analysis for coded ARQ
CN106254044A (en) A kind of dynamic linear combination repeating method based on multicast network coding

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: 20110420