ChinaCom2008-Wireless Communications and Networking Symposium

Research Article

A New Weighted Proportional Fair Scheduling Algorithm for SDMA/OFDMA Systems

  • @INPROCEEDINGS{10.1109/CHINACOM.2008.4685083,
        author={Wei Huang and Kai Sun and Tan  Bo},
        title={A New Weighted Proportional Fair Scheduling Algorithm for SDMA/OFDMA Systems},
        proceedings={ChinaCom2008-Wireless Communications and Networking Symposium},
        publisher={IEEE},
        proceedings_a={CHINACOM2008-WCN},
        year={2008},
        month={11},
        keywords={},
        doi={10.1109/CHINACOM.2008.4685083}
    }
    
  • Wei Huang
    Kai Sun
    Tan Bo
    Year: 2008
    A New Weighted Proportional Fair Scheduling Algorithm for SDMA/OFDMA Systems
    CHINACOM2008-WCN
    IEEE
    DOI: 10.1109/CHINACOM.2008.4685083
Wei Huang1,*, Kai Sun2,*, Tan Bo3
  • 1: College of Electronic Information Engineering, Inner Mongolia University, Hohhot 010021, P. R. China
  • 2: College of Electronic Information Engineering, Inner Mongolia University, Hohhot 010021, P. R. China;School of Telecommunications Engineering, Beijing University of Posts and Telecommunications Beijing, China
  • 3: School of Telecommunications Engineering, Beijing University of Posts and Telecommunications Beijing, China
*Contact email: ppmhwsak@gmail.com, sunkai1501@gmail.com

Abstract

A new and efficient radio resource allocation and scheduling algorithm for SDMA/OFDMA systems with downlink zero-forcing beamforming is proposed to support the diverse quality of service (QoS) requirements of heterogeneous services. In particular, a unified urgent weight is given by taking into account QoS requirements (i.e., delay deadline, minimum data rate), queue length and user fairness. The subcarrier is dynamically allocated to the user with the highest priority. Then the remaining users on the same carrier are selected based on the semi-orthogonal user selection scheme. Finally, allocating the transmit power with a greedy method to the spatial subchannels is implemented. The goal of the algorithm is to maximize the system throughput by fully exploiting multiuser diversity gain in space, time, and frequency domain while guaranteeing the QoS for real time (NT) services with delay deadline requirement and non-real time (NRT) services with minimum data rate requirement.