Multiple-antenna wireless systems, also known as multiple-input multiple-output (MIMO) cellular networks, can improve the capacity and reliability of communications. To realize these advantages, a packet scheduler should effectively allocate radio resources to users in a fair way. The previously proposed MIMO schedulers have problems such as ignoring traffic arrival process or complexity. We propose a load adaptive multi-output fair queueing (LA-MO-FQ) scheduler, which is based on a fair queueing algorithm with mechanisms for rate selection, compensation of lagging users, and virtual time system. Since some of the scheduler's system parameters are sensitive to the traffic load, it dynamically adjusts them in a way with low complexity so the system performs better. Intensive simulation studies considering the mobility of users and the traffic arrival demonstrate the good performance of LA-MO-FQ. Furthermore, we also propose in this paper some formulae for the time and service fairness comparisons of MIMO schedulers and we use them for comparison with some famous existing schedulers.

The recent Internet needs a network structure and traffic engineering that can support various applications requiring differentiated traffic processing and a high quality of service. The extension of the Internet from wired to wireless systems that generate location-dependent and burst errors has made the support of good services more difficult with existing packet scheduling algorithms. Accordingly, this paper proposes a wireless differentiated service packet scheduling (WDSPS) algorithm that can provide reliable and fair services in differentiated wireless internet service networks. As such, the proposed scheduling algorithm solves the HOL blocking problem within a class packet queue that occurs in a wireless network, supports differentiated services for each class defined in a differentiated service network, and facilitates gradual and efficient service compensation not only among classes but also among flows within a class, thereby preventing a monopoly by one class or one flow. Simulations confirmed that the proposed WDSPS scheduling algorithm could provide the required QoS differentiation between classes and enhanced the service throughput under various wireless network conditions.

Multiuser diversity, identified by recent information theoretic results, is a form of diversity inherent in a wireless network. The diversity gain is obtained from independent time-varying fading channels across different users. The main practical issue in multiuser diversity is lack of Quality of Service (QoS) guarantees. This study proposes a wireless scheduling algorithm named MUDSEQ for downlink channels exploiting multiuser diversity under explicit QoS constraints. The numerical results demonstrate that the novel algorithm can yield non-negligible diversity gain even under tight QoS constraints and little scattering or slow fading environments. Additionally, a system framework for dynamic resource allocation based on the proposed algorithm is developed.

This paper proposes a wireless scheduling algorithm that can provide the Internet with delay proportional differentiated services in wireless networks. When considering wireless network environments that include burst and location-dependent channel errors, the proposed WDPS (Wireless Delay Proportional Service) scheduling algorithm can adaptively serve packets in class queues based on the delivered delay performance for each class. The significant characteristics of the WDPS scheduler include support for a fair relative delay service, the provision of graceful throughput and delay compensations, and the avoidance of class queue-blocking problems. Simulations show that the proposed algorithm can achieve the desirable properties for providing delay proportional services in wireless networks.