Research On The Scheduling Algorithms For Delay-throughput Optimization In WLAN

The wireless network becomes more normal, and many applications withdeadline in the mobile user also increased a lot, such as stream multimedia.Although more network bandwidth is needed, but the wireless networkbandwidth can’t be increased unlimited like the wired network through increasedmedia to increase the bandwidth and can’t unlimited increase the send energy, sowireless network bandwidth has a upper bound. Since we can’t increase the upperbound, then only make full use of network resources.The main job is to give a schedule algorithm make traffic optimization anddelay optimal scheduling in the WLAN. This paper gives three schedulingalgorithms:1. Consider the arrival process in network capacity has multiplefeasible schedule, the maximum weight for any arrival process in networkcapacity can find a feasible scheduling. In this paper is to modify the maximumweight algorithm that make the schedule have less delay;2give a schedulingalgorithm with delay limit, the this paper proves this scheduling algorithmcan meet the network capacity with delay constrainted optimization;3above twoalgorithms are within the network capability give scheduling algorithm, if thearrival process out of network capacity, give a algorithm combination ofcongestion control and optimal scheduling, we prove that in the interests of allusers to find such a function maximization problem is a subset of NP problems,and then gives a greedy approximation algorithm and prove that theapproximation ratio of the algorithm, and then gives an optimal schedulingalgorithm by previous study. In this paper, the algorithms use theoretical andexperimental methods to prove the validity of the algorithm, the experimentalresults match the theoretical results.