Skip to Main Content
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.