Analysis of adaptive proportional fair scheduling method on BD-GMD scheme for MIMO systems Online publication date: Sun, 11-Jan-2015
by Gang Su; Yun-Xiang Liu; Li Tan; Hong-Yi Zhao
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 5, No. 4, 2012
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook