By Topic

A Weighted Proportional Fair scheduling to maximize best-effort service utility in multicell network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chao Yang ; Wireless Signal Process. & Network Lab., Beijing Univ. of Posts & Telecommun., Beijing ; Wenbo Wang ; Yu Qian ; Xing Zhang

In this paper a novel Weighted Proportional Fair (WPF) scheduling algorithm is proposed. Traditional Proportional Fair (PF) algorithm cannot exploit the inherent near-far diversity given by pathloss and cannot achieve maximum best-effort service utility under multicell scenario. WPF overcomes this deficiency. The weight value and weight factor are introduced to WPF which enable WPF utilizing near-far diversity to reduce the inter-cell interference. All the asymptotic analysis and numerical results show when weight factor chooses a small value, WPF scheduling can enhance both the best-effort service utility performance and throughput performance compared to PF scheduling in multicell network.

Published in:

Personal, Indoor and Mobile Radio Communications, 2008. PIMRC 2008. IEEE 19th International Symposium on

Date of Conference:

15-18 Sept. 2008