Error Rate Based – Dynamic Weighted Fair Queuing In Wireless Network

• Main Authors: Mao-Sheng Lin, 林茂盛
• Other Authors: Wen-Shyong Hsieh
• Format: Others
• Language: en_US
• Published: 2003
• Online Access: http://ndltd.ncl.edu.tw/handle/40851688172299546676

碩士 === 國立中山大學 === 資訊工程學系研究所 === 91 === In wired network, there are many researches about scheduling algorithm. As for wireless network, the scheduling algorithm is not maturer than wired network. And there are some following characteristics of wireless network that we can not make use of wired scheduling algorithm directly:(1)Less bandwidth in wireless network;(2)Location dependent errors;(3)Higher error rate and bursty error. So when we design the wireless scheduling algorithm, there are some important issues we should take into account： (1)Fairness ; (2)QOS ; (3)Whether the overall throughput rises or not; (4)Whether the bandwidth is best utilized or not In this paper, we introduce the wired and wireless scheduling algorithm separately and discuss the advantage and disadvantage of these methods first. And we propose a scheduling algorithm which is based on WFQ [1] and dynamically adjusts weights according to the error rate of each flow. In this method, the base station will allocate the bandwidth by calculating the weight of mobile hosts and the proportion of error rates to the whole body. And during the process of adjusting, we will prevent the weight of a certain channel from increasing or decreasing excessively which might lead to unfair phenomenon. Under this adjustment, we will raise the whole throughput and maintain the fairness of all users.