Comparative Study of QoS Scheduling Algorithms in Wireless Networks

Wireless communications helped to simplify networking by enabling multiple users to simultaneously share resources without any wiring. Wireless networks are generally unpredictable compared to wired networks. Packet scheduling can guarantee quality of service and improve transmission rate in wireless networks. Wireless packet networks rely on a range of mechanisms to provide for Quality of Service (QoS), the core of which would be scheduling algorithms. This paper compares the performance of various wireless scheduling algorithms in wireless networks. The wireless scheduling algorithms are theoretically analyzed and comparison is done between each of them in specific areas, which are felt to be important and pertaining to QoS provisioning. Each wireless network has a different packet scheduling strategy and each has their own advantage and disadvantage. The desired qualities of QoS wireless scheduling algorithms are selected for this study. The concepts of IWFQ, CIF-Q and WPS algorithms are taken for this study. We compare their properties through theoretical analysis conclude that CIF-Q achieve all the properties of wireless service including short-term and long-term fairness, short-term and long-term throughput bounds, and tight delay bounds for channel access. (Karygiannis et al,2002)