Research On Scheduling Scheme Based On Network Coding In Wireless Network

Network coding (NC) is a new transmission paradigm. In recent years, it hasgenerated huge research interest especially in wireless communications. The mainattraction of this novel concept is that it is bandwidth efficient and achieves highthroughput gains. Through experiments, it has been found that network coding makesit possible to perform peer-to-peer live multimedia streaming with finer granularity.Network coding can be regarded as an extension of the traditional routing protocol inwhich intermediate nodes store and forward packets. The basic idea about networkcoding is that packets are intelligently mixed (or coded) together at an intermediatenode into one coded packet which is then broadcasted. This process facilitates notonly the generation of a few number of transmissions in the network but alsoinformation rich transmissions. Furthermore, with network coding, more bandwidthbecomes available for new data to be transmitted resulting in high networkthroughput.Although network coding was recently introduced in the literature, substantialamount of research has been done to enhance its performance. However, to the best ofour knowledge, there has not been any work reported in the literature which considersTransmission Control Protocol (TCP) dynamics and link quality simultaneously andcalculates weights according to effect for network coding in wireless networks. Thispaper has researched on scheduling scheme based on network coding in wirelessnetwork as follows:Firstly, this paper introduces the main theory of network coding, describes theclassification, strategy and advantage of network coding briefly, and then makes abrief introduction on modulation scheme.Secondly, this paper presents a robust and resilient network coding whichconsiders Transmission Control Protocol (TCP) dynamics and link qualitysimultaneously and calculate weights in wireless networks by employing thecross-layer design approach to determine the node sending rate, as called TCP calculating weights network coding with opportunistic scheduling.Thirdly, on this basis of above, we propose a recording path approach modifiedfrom the traditional COPE protocol to improve the network throughput by enhancingmore coding opportunities. On the top of that, we propose an adaptive waiting timescheme to control frame error rate in the acceptable range as introduced the XORoverhead. The scheme we put forward adaptively controls packet waiting time in alocal buffer to achieve a tradeoff between throughput and overhead.Finally, the experimental simulation results show that, compared with othernetwork coding, there is obvious improvement in network performance when TCPcalculating weights network coding with opportunistic scheduling is employed. Onthe basis of all above, compared with other schemes, when adaptive waiting timescheme is used in PCOPE, significant performance is achieved in terms of bandwidthutilization and throughput.