Study of a Scheduling Algorithm Based on Simple Network Coding with High Throughput and Low Delay

For satisfying the requirements of broadband wireless access networks for high throughput and low delay, a delay sensitive scheduling algorithm based on simple network coding, DSNC, is presented. With the introduction of delivery state parameter, DSNC selectively combines retransmission packets into an innovative one by only XOR operation. Not only can DSNC reach the upper band of network throughput defined by the maximum flow-minimum cut theorem, but receivers can recover original packets immediately upon successful receptions. Compared with the general network coding, DSNC is able to effectively lower the system requirements for processor speed, memory capacity and even power consumption at mobile nodes. In addition, the scheduling scheme according to packet queue delay is capable of providing better delay performance while maintaining high network throughput. The simulation results indicate that DSNC can actually reach that throughput superior limit, and make packets experience shorter end-to-end delay and less jitter than other algorithms, which makes it applicable to broadband delay sensitive services.