Efficient Scheduling for Multicasting Multimedia Data with Adaptive Random Liner Network Coding in Relay-aided Network

Random liner network coding (RLNC) is an efficient coding scheme to improve the performance of the wireless multicast networks. However, traditional RLNC comes with a sacrifice in service delay because if the users are not able to collect a full size of the encoding packets, the useful information can not be recovered under the wireless fading channel. This effect is more severe for transmitting the hard deadline constrained prioritized (HDCP) data due to the limited delivery time and data interdependencies. On the other hand, relay scheme provides a useful way to overcome the fading problem in wireless network. Accordingly, we propose a BS-relay competitive scheduling algorithm (BRCS) which introduced adaptive RLNC in the rely-aided wireless network to deliver the HDCP data, to overcome the problem above. BRCS fully considered the property of the multimedia data and design a scheduling scheme, in which BS and relay compete with other to choose the best encoding packet for transmission so as to maximize the network throughput for the given hard deadline. Moreover, to show the performance of BRCS, we compared with other scheduling schemes and the simulation results are provided to corroborate the effectiveness of the proposed technique.