J4

• Original Articles • Previous Articles     Next Articles

Cooperative game theoretic bandwidth sharing scheme for proportional fairness in WLAN

ZHANG Guo-peng;ZHANG Hai-lin;ZHAO Li-qiang
  

  1. (State Key Lab. of Integrated Service Networks, Xidian Univ., Xi’an 710071, China)
  • Received:2007-12-01 Revised:1900-01-01 Online:2009-02-20 Published:2009-02-10
  • Contact: ZHANG Guo-peng E-mail:brahms_zgp@163.com

Abstract: To ensure proportional fairness (i.e., the system bandwidth is shared among the user flows according to their weights) in the IEEE 802.11 wireless LANs, a cooperative game theoretic bandwidth sharing scheme, called PF-DCF, is proposed. By setting the throughput based utility function, the bandwidth sharing procedure is modeled as a cooperative game. In the game, the user flows intend to maximize their utilities under the premise that the system utility is maximized. According to the Nash bargaining solution(NBS) of the game, i.e., the user stations’ optimal packet transmission probabilities to acquire proportional fairness, a bandwidth sharing scheme (PF-DCF) is developed. Simulation results indicate that when using PF-DCF in the ad hoc mode, the user flows can fairly share the system bandwidth by broadcasting their weights information and adjust the backoff parameter (CWmin) to the NBS. In addition, by comparison with 802.11e EDCA, PF-DCF can effectively utilize the channel resource.

Key words: wireless LAN, proportional fairness, IEEE 802.11, cooperative game, Nash bargaining solution

CLC Number: 

  • TN915.04