A Study Of Resource Scheduling Algorithms In Wireless Network

In recent years, with the rapid development of science and technology the use of mobile devices is more and more widely. So we have higher requirements on the performance of the wireless network. Due to the shortage of bandwidth resources, the existing wireless network can’t well meet the growing demand of the bandwidth resources. So we need to study a new wireless network technology to meet the users’ increasing requirements of bandwidth resources. In cellular network the introduced relay can increase network coverage area and improve the throughput of network. In the wireless self-organized network using network coding technique can save network resources and improve network throughput. In this paper, the link scheduling and resource allocation in wireless networks are studied. The main research results are as follows:In cellular networks dynamic resource allocation algorithm is studied. According to meetting the users’ minimum demand of bandwidth resources, we build an integer programming problem. By solving the integer programming problem, we can get maximize throughput of the network. But due to the high computational complexity for solving integer programming problems, we need a low complexity algorithm to approach the integer programming problem. According to this requirement, this paper proposes a low complexity algorithm of dynamic resource allocation. This algorithm can complete the resources allocation of the system with linear algorithm complexity. The theoretical analysis proves that this algorithm can approach the optimal throughput and the effectiveness of this algorithm is verified by simulation experiments.Scheduling algorithm of cellular networks based on mobile relay is studied. In the latest 3GPP LTE-Advanced specification, the free mobile devices can act as a relay to help other mobile devices to forward data. But due to the mobility of relay, cached data in relay nodes will be unavailable with the switch of relay. And then it results in waste of bandwidth resources. This paper proposed a new scheduling algorithm. The proposed algorithm guarantees that the data sent to the relay node is not cached in the relay node. It will be immediately sent to the mobile device. So it will not lead to the packet loss of the relay node with relay switch of mobile device. By lyapunov function we prove that the proposed scheduling algorithm can obtain the optimal throughput and the superiorityof the proposed algorithm is verified by simulation experiments.Scheduling algorithm of network coding technique in the self-organizing network is studied. On the basis of traditional link scheduling algorithm based on queue length we introduce network coding technology. This paper proposes a network coding scheduling algorithm based on one cache and a network coding scheduling algorithm based on three cache. It is verified by simulation experiments that in various aspects these two proposed scheduling algorithms have better performance than traditional scheduling algorithms. Simulation results show that under different network conditions the two proposed algorithms have different advantages in the throughput performance. The network coding scheduling algorithm based on one cache can obtain a better performance when the network input rate is low. And the network coding scheduling algorithm based on three cache has better throughput performance under the high input rate of the network.