A distributed pricing algorithm for achieving network-wide proportional fairness

Authors:
Hui Zhou;Pingyi Fan;Xiang-Gen Xia;K. B. Letaief
Affiliations:
Tsinghua National Laboratory for Information Science and Technology/ Department of Electronic Engineering, Tsinghua University, Beijing 100084, China;Tsinghua National Laboratory for Information Science and Technology/ Department of Electronic Engineering, Tsinghua University, Beijing 100084, China;Department of Electrical and Computer Engineering, University of Delaware, Newark, DE, U.S.;Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Hong Kong, China
Venue:
Wireless Communications & Mobile Computing
Year:
2012

Citing 11
Cited 0

Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
Algorithm 64: Quicksort

Communications of the ACM
Convex Optimization

Convex Optimization
Cooperative proportional fairness scheduling for wireless transmissions

Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Proportional fairness in multi-carrier system with multi-slot frames: upper bound and user multiplexing algorithms

IEEE Transactions on Wireless Communications
Double proportional fair user pairing algorithm for uplink virtual MIMO systems

IEEE Transactions on Wireless Communications
Proportional Fairness in Multi-Channel Multi-Rate Wireless Networks-Part I: The Case of Deterministic Channels with Application to AP Association Problem in Large-Scale WLAN

IEEE Transactions on Wireless Communications
Proportional Fairness in Multi-Channel Multi-Rate Wireless Networks - Part II: The Case of Time-Varying Channels with Application to OFDM Systems

IEEE Transactions on Wireless Communications
Opportunistic beamforming using dumb antennas

IEEE Transactions on Information Theory
Hard Fairness Versus Proportional Fairness in Wireless Communications: The Single-Cell Case

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proportional fairness (PF) scheduling achieves a balanced tradeoff between throughput and fairness and has attracted great attention recently. However, most previous work on PF only considers the single cell scenario. This paper focuses on the problem of achieving network-wide PF in a generalized multiple base station multiple user network. The problem is formulated as a maximization model and solved using the dual method. By decomposing the dual objective function, we get a distributed pricing based algorithm. Optimality of this algorithm is presented. Although the algorithm is derived using fixed link rate assumption, it can still apply in the presence of time-varying rates. The proposed algorithm is suitable for distributed systems in the sense that it does not need any inter base station communication at all. Simulations illustrate that the proposed distributed network-wide PF scheduling algorithm achieves almost the same performance as the centralized one. Compared with traditional local PF (LPF) scheduling, the network-wide PF scheduling achieves higher throughput, lower throughput oscillation, and greater fairness. Copyright © 2010 John Wiley & Sons, Ltd.