In the present paper, we propose a broadcast ARQ protocol based on the concept of index coding. In the proposed scenario, a server wishes to transmit a finite sequence of packets to multiple receivers via a broadcast channel with packet erasures until all of the receivers successfully receive all of the packets. In the retransmission phase, the server produces a coded packet as a retransmitted packet based on the side-information sent from the receivers via feedback channels. A notable feature of the proposed protocol is that the decoding process at the receiver side has low decoding complexity because only a small number of addition operations are needed in order to recover an intended packet. This feature may be preferable for reducing the power consumption of receivers. The throughput performance of the proposed protocol is close to that of the ideal FEC throughput performance when the erasure probability is less than 0.1. This implies that the proposed protocol provides almost optimal throughput performance in such a regime.

In order to minimize packet error rate in extremely dynamic vehicular networks, a novel vehicle to vehicle (V2V) mobile content transmission scheme that jointly employs random network coding and shuffling/scattering techniques is proposed in this paper. The proposed scheme consists of 3 steps: Step 1-The original mobile content data consisting of several packets is encoded to generate encoded blocks using random network coding for efficient error recovery. Step 2-The encoded blocks are shuffled for averaging the error rate among the encoded blocks. Step 3-The shuffled blocks are scattered at different vehicle locations to overcome the estimation error of optimum transmission location. Applying the proposed scheme in vehicular networks can yield error free transmission with high efficiency. Our simulation results corroborate that the proposed scheme significantly improves the packet error rate performance in high mobility environments. Thanks to the flexibility of network coding, the proposed scheme can be designed as a separate module in the physical layer of various wireless access technologies.

This paper evaluates the performance of a reliable multicast protocol for bulk-data transfer over unreliable networks via IP-multicast. Bulk-data type reliable multicast appears promising for commercial publishing and large-scale data replication. The proposed reliable multicast transport protocol (RMTP) provides high-performance due to the use of IP multicast while also providing confirmed and error free transfer by end-to-end controls. The protocol includes a multi-round selective repeat scheme dedicated for bulk-data multicast applications. This paper examines the multicast retransmission procedures in RMTP through analysis and tests on an implemented system and clarifies the basic performance behavior of the protocol. Evaluations are conducted with regard to retransmission redundancy, transfer time, and packet processing load with various error conditions and number of receivers. Against the response concentration problem seen in end-to-end communication, the backoff time algorithm is applied to the protocol; the limits it places on system scalability are clarified.