Opportunistic Schedulings for Random Linear Network Coding in Time Varying Channels

Abstract

Opportunistic scheduling schemes based on random linear network coding (RLNC) are proposed in this letter. The schemes are developed taking into consideration channel state information and acknowledgement information in time varying channels. We derived an overall success probability and a total symbol length (or a total transmission delay) to evaluate conventional RLNC and proposed RLNC schemes. Numerical results showed that the proposed RLNC schemes offer significant advantages over the conventional RLNC scheme in various environments.