JOINT FOUNTAIN CODING AND NETWORK CODING FOR LOSS-TOLERANT INFORMATION SPREADING

• US 20170230144A1
• Filed: 08/07/2015
• Published: 08/10/2017
• Est. Priority Date: 08/08/2014
• Status: Active Grant

• Current Assignee: University of Florida Research Foundation, Incorporated (State University System of Florida)
• Original Assignee: University of Florida Research Foundation, Incorporated (State University System of Florida)
• Inventors: Li, Xin, Sun, Kairan, Wu, Dapeng Oliver, Huang, Qiuyuan
• Granted Patent: US 10,116,418 B2
• Time in Patent Office: Days
• CPC Class Codes: H03M 13/154 Error and erasure correction, e.g. by using the error and erasure locator or Forney polynomial
• CPC Class Codes: H03M 13/3761 using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes
• CPC Class Codes: H04L 1/0058 Block-coded modulation
• CPC Class Codes: H04L 1/08 by repeating transmission, e.g. Verdan system H04L1/1858 and H04L1/189 take precedence

Abstract

A network system for increasing data throughput and decreasing transmission delay from a source node to a sink node via a relay node. The network system may comprise a source node configured to encode a plurality of data packets using rateless coding and transmit the plurality of data packets; at least one relay node configured to receive at least one of the plurality of data packets from the source node, and if the at least one relay node has received a sufficient quantity of the plurality of data packets, regenerate, re-encode, and relay the plurality of data packets; and a sink node configured to receive one or more of the plurality of data packets from the at least one relay node, and if the sink node has received the sufficient quantity of the plurality of data packets, regenerate and decode the plurality of data packets.

Claims

1. A network system for increasing data throughput and decreasing transmission delay from a source node to a sink node via a relay node, the network system comprising:

a source node configured to encode a plurality of data packets using rateless coding and transmit the plurality of data packets;

at least one relay node configured to;

receive at least one of the plurality of data packets from the source node, and

if the at least one relay node has received a sufficient quantity of the plurality of data packets, regenerate, re-encode, and relay the plurality of data packets; and

a sink node configured to;

receive one or more of the plurality of data packets from the at least one relay node, and

if the sink node has received the sufficient quantity of the plurality of data packets, regenerate and decode the plurality of data packets.

2. The network system of claim 1, wherein the source node is further configured to encode the plurality of data packets using fountain coding.

3. The network system of claim 2, wherein the at least one relay node is further configured to, if the at least one relay node has received the sufficient quantity of the plurality of data packets, combine multiple of the plurality of packets for retransmission.

4. The network system of claim 2, wherein the at least one relay node is further configured to, if the at least one relay node has received the sufficient quantity of the plurality of data packets, re-encode the plurality of data packets using intra-session network coding and/or cross-next-hop network coding.

5. The network system of claim 2, wherein the at least one relay node is further configured to, if the at least one relay node has received the sufficient quantity of the plurality of data packets, regenerate the plurality of data packets using local encoding vectors.

6. The network system of claim 5, wherein the at least one relay node is further configured to, if the at least one relay node has received the sufficient quantity of the plurality of data packets, regenerate a plurality of data packets of a forward flow and subsequently regenerate a plurality of data packets of a backward flow.

7. The network system of claim 20, wherein the relay node is further configured to, if the at least one relay node has received the sufficient quantity of the plurality of data packets, add a new encoding vector to a header of each of the at least one of the plurality of data packets regenerated.

8. A method for increasing data throughput and decreasing transmission delay from a source node to a sink node via a relay node, the method comprising:

receiving, from at least one source node, at least one of a plurality of data packets encoded by the at least one source node using fountain coding; and

if a sufficient quantity of the plurality of data packets are received, regenerating, re-encoding, and relaying the plurality of data packets to a sink node for regenerating and decoding of the plurality of data packets.

9. The method of claim 8, further comprising, if the sufficient quantity of the plurality of data packets are received, combining multiple of the plurality of packets for retransmission.

10. The method of claim 8, further comprising, if the sufficient quantity of the plurality of data packets are received, re-encoding the plurality of data packets using intra-session network coding and/or cross-next-hop network coding.

11. The method of claim 8, further comprising, if the sufficient quantity of the plurality of data packets are received, regenerating the plurality of data packets using local encoding vectors.

12. The method of claim 11, further comprising, if the sufficient quantity of the plurality of data packets are received, regenerating a plurality of data packets of a forward flow and subsequently regenerating a plurality of data packets of a backward flow.

13. The method of claim 80, further comprising, if the sufficient quantity of the plurality of data packets are received, adding a new encoding vector to a header of each of the at least one of the plurality of data packets regenerated.

14. At least one computer-readable storage medium encoded with executable instructions that, when executed by at least one processor, cause the at least one processor to perform a method for increasing data throughput and decreasing transmission delay from a source node to a sink node via a relay node, the method comprising:

receiving, from at least one source node, at least one of a plurality of data packets encoded by the at least one source node using fountain coding; and

if a sufficient quantity of the plurality of data packets are received, regenerating, re-encoding, and relaying the plurality of data packets to a sink node for regenerating and decoding of the plurality of data packets.

15. The at least one computer-readable storage medium of claim 14, the method further comprising, if the sufficient quantity of the plurality of data packets are received, combining multiple of the plurality of packets for retransmission.

16. The at least one computer-readable storage medium of claim 14, the method further comprising, if the sufficient quantity of the plurality of data packets are received, re-encoding the plurality of data packets using intra-session network coding and/or cross-next-hop network coding.

17. The at least one computer-readable storage medium of claim 14, the method further comprising, if the sufficient quantity of the plurality of data packets are received, regenerating the plurality of data packets using local encoding vectors.

18. The at least one computer-readable storage medium of claim 17, the method further comprising, if the sufficient quantity of the plurality of data packets are received, regenerating a plurality of data packets of a forward flow and subsequently regenerating a plurality of data packets of a backward flow.

19. The at least one computer-readable storage medium of claim 140, the method further comprising, if the sufficient quantity of the plurality of data packets are received, adding a new encoding vector to a header of each of the at least one of the plurality of data packets regenerated.