Distributed Proportional Fair Scheduling for IEEE802.11 Wireless LANs

  • Authors:
  • Hyung-Kun Park

  • Affiliations:
  • School of Information Technology, Korea University of Technology and Education, Cheonan, South Korea

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the time varying wireless channel, opportunistic scheduling is one of the important techniques to achieving the rich diversities inherent in wireless communications. However, most existing scheduling schemes require centralized scheduling and little work has been done on developing distributed algorithms The proportional fair scheduling is one of the representative opportunistic scheduling for centralized networks. In this paper, we propose distributed proportional fair scheduling (DPFS) scheme for wireless LAN network. In the proposed DPFS scheme, each receiver estimates channel condition and calculates independently its own priority with probabilistic manner, which can reduce excessive probing overhead required to gather the channel conditions of all receivers. We evaluate the proposed DPFS using extensive simulation and simulation results show that DPFS obtains higher network throughput than conventional scheduling schemes while maintaining fairness among users.