Flexible call admission control for multiclass services in wireless LANs
International Journal of Wireless and Mobile Computing
Modelling and evaluation of the 3G mobile networks with hot-spot WLANs
International Journal of Wireless and Mobile Computing
Adaptive proportional fair scheduling based on opportunistic beamforming for MIMO systems
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A biologically inspired QoS routing algorithm for mobile ad hoc networks
International Journal of Wireless and Mobile Computing
Imperialist competitive algorithm for minimum bit error rate beamforming
International Journal of Bio-Inspired Computation
Particle swarm optimisation based Diophantine equation solver
International Journal of Bio-Inspired Computation
Evolution in ecological agent systems
International Journal of Bio-Inspired Computation
Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels
IEEE Transactions on Signal Processing
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Writing on dirty paper (Corresp.)
IEEE Transactions on Information Theory
On the achievable throughput of a multiantenna Gaussian broadcast channel
IEEE Transactions on Information Theory
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
IEEE Transactions on Information Theory
An introduction to the multi-user MIMO downlink
IEEE Communications Magazine
An overview of scheduling algorithms in MIMO-based fourth-generation wireless systems
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
The Proportional Fair Scheduling (PFS) algorithm is always exploited in multiple input multiple output systems to make a balance between maximising the system throughput and guaranteeing the data rate fairness among different users. Besides the traditional PFS, many modified PFS algorithms have also been proposed to further improve user fairness. Among these, an adaptive PFS algorithm attracts our attention. It defines a new priority number which is multiplying traditional PFS priority number by a factor. And this very factor is the ratio of instantaneous request rate over average request rate. What is different is that while the average transmission rate in traditional PFS has a fixed definition and updating strategy, the average request rate in the adaptive method may not. In this paper, we analyse the adaptive PFS algorithm under different definition and updating strategies on block-diagonal geometric mean decomposition scheme and investigate their performance.