Random linear network coding for time division duplexing
A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receiver to acknowledge (ACK) the number of degrees of freedom, if any, that are required to decode correctly the information. Provided herein is an analysis of this problem to show that there is an optimal number of coded data packets, in terms of mean completion time, to be sent before stopping to listen. This number depends on the latency, probabilities of packet erasure and ACK erasure, and the number of degrees of freedom that the receiver requires to decode the data. This scheme is optimal in terms of the mean time to complete the transmission of a fixed number of data packets. It is shown that its performance is very close to that of a full-duplex system, while transmitting a different number of coded packets can cause large degradation in performance, especially if latency is high. Also described herein is the throughput performance of the novel system and technique along with a comparison to existing half-duplex Go-back-N and Selective Repeat ARQ schemes. Numerical results, obtained for different latencies, show that the novel system and technique described herein has similar performance to the Selective Repeat in most cases and considerable performance gain when latency and packet error probability is high.
1. A method for transmitting over a long delay, half-duplex channel where a device can transmit or receive, but not both at the same time, the method comprising:
(a) for M information packets, generating N M linear coded packets;
(b) transmitting, via a transmitter, the N M linear coded packets to a receiver; and
(c) upon reception of the N M linear coded packets at the receiver, determining a remaining number of degrees of freedom needed to decode the M information packets;
(d) determining an optimal number of coded packets the transmitter will send in a next transmission based upon one or more channel characteristics and information in an acknowledgement packet; and wherein determining an optimal number of coded packets to be transmitted back-to-back before stopping to wait for an acknowledgment packet from the receiver comprises:
determining the number of degrees of freedom the receiver requires to decode the information;
determining a packet error probability value;
determining a latency value; and
determining an optimal number of coded packets to be transmitted back-to-back before stopping to wait for an acknowledgment packet from the receiver using the number of degrees of freedom, the packet error probability value and the latency value.
2. The method of claim 1 wherein (c) comprises determining in the receiver how many degrees of freedom are needed to decode the original M information packets.
3. The method of claim 2 further comprising:
(e) transmitting an acknowledgment packet from the receiver to the transmitter to convey the remaining number of degrees of freedom required at the receiver to decode all M information packets.
4. The method of claim 1 wherein (d) comprises determining the number of coded packets based upon one or more channel characteristics and information in an acknowledgement packet.
5. The method of claim 1 further comprising:
(e) transmitting an acknowledgment from the transmitter to the receiver.
6. The method of claim 5 further comprising:
(e) transmitting an acknowledgment from the receiver to the transmitter wherein the acknowledgment includes an optimal number of coded packets the transmitter should send in the next transmission.
7. The method of claim 6 wherein the optimal number of coded packets is determined based, at least in part, upon one or more of:
(i) a mean time to completion of transmission of the M information packets; or
(ii) a mean energy to completion of transmission of the M information packets.
8. The method of claim 7 wherein the optimum number of coded packets to transmit is selected to minimize an expected mean time to complete transmission of the M information packets using feedback.
9. The method of claim 8 wherein transmitting the N M linear coded packets to a receiver comprises transmitting N M linear coded packets having a fixed packet size.
10. The method of claim 1 wherein if (b) corresponds to a first transmission to the receiver, the method further comprises determining an optimal number of coded packets N M the transmitter will send in the first transmission between the transmitter and the receiver.
11. A method for transmitting over a long delay, half-duplex channel where a device can transmit or receive, but not both at the same time, the method comprising:
(a) for M information packets, generating N M linear coded packets;
(b) transmitting, via a transmitter, the N M linear coded packets to a receiver; and
(c) upon reception of the N M linear coded packets at the receiver, determining a remaining number of degrees of freedom needed to decode the M information packets;
(d) determining an optimal number of coded packets the transmitter will send in a next transmission based upon one or more channel characteristics and information in an acknowledgement packet; and
(e) using information in the acknowledgment packet to update an estimate of packet error probability.
12. The method of claim 11 wherein if (b) corresponds to a first transmission to the receiver, the method further comprises determining an optimal number of coded packets N M (corresponding to M information packets) the transmitter will send in the first transmission between the sender and the receiver.
13. A system for transmitting over a long delay, half-duplex channel where a device can transmit or receive, but not both at the same time, the system comprising:
(a) an encoder to generate N M linear coded packets, for M information packets;
(b) a transmitter for transmitting the N M linear coded packets;
(c) a receiver for receiving the N M linear coded packets transmitted by the transmitter, wherein upon reception of the N M linear coded packets at the receiver, the receiver determines a remaining number of degrees of freedom needed to decode the M information packets;
(d) a processor to determine an optimal number of coded packets the transmitter will send in a next transmission based upon one or more channel characteristics and information in an acknowledgement packet; and wherein said processor determines the number of degrees of freedom the receiver requires to decode the information, a packet error probability value, and a latency value; and
wherein said processor determines the optimal number of coded packets using the number of degrees of freedom, the packet error probability value, and the latency value.
14. The system of claim 13 wherein said receiver further comprises a DOF processor to determine how many degrees of freedom are needed to decode the original M information packets.
15. The system of claim 14 wherein said receiver transmits an acknowledgment packet from the receiver to the transmitter to convey the remaining number of degrees of freedom required at the receiver to decode all M information packets.
16. The system of claim 13 wherein said transmitter transmits an acknowledgment from the transmitter to the receiver.
17. The system of claim 16 wherein the acknowledgment from the transmitter includes an optimal number of coded packets the transmitter should send in the next transmission.
18. The system of claim 17 wherein the optimal number of coded packets is determined based, at least in part, upon one or more of:
(i) a mean time to completion of transmission of the M information packets; or
(ii) a mean energy to completion of transmission of the M information packets.
19. The system of claim 18 wherein the optimum number of coded packets to transmit is selected to minimize an expected mean time to complete transmission of the M information packets using feedback.
20. The system of claim 19 wherein the coded packets comprise N M linear coded packets having a fixed packet size.
21. A system for transmitting over a long delay, half-duplex channel where a device can transmit or receive, but not both at the same time, the system comprising:
(a) an encoder to generate N M linear coded packets for M information packets;
(b) a transmitter for transmitting the N M linear coded packets;
(c) a receiver for receiving the N M linear coded packets wherein upon reception of the N M linear coded packets at the receiver, the receiver determines a remaining number of degrees of freedom needed to decode the M information packets;
(d) a processor to determine an optimal number of coded packets the transmitter will send in a next transmission based upon one or more channel characteristics and information in an acknowledgement packet; and
(e) a processor to update an estimate of packet error probability using information in the acknowledgment packet.