Approximate Optimization for Proportional Fair AP Association in Multi-rate WLANs

  • Wei Li
  • Yong Cui
  • Shengling Wang
  • Xiuzhen Cheng
Conference paper

DOI: 10.1007/978-3-642-14654-1_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6221)
Cite this paper as:
Li W., Cui Y., Wang S., Cheng X. (2010) Approximate Optimization for Proportional Fair AP Association in Multi-rate WLANs. In: Pandurangan G., Anil Kumar V.S., Ming G., Liu Y., Li Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2010. Lecture Notes in Computer Science, vol 6221. Springer, Berlin, Heidelberg

Abstract

In this study, we investigate the problem of achieving proportional fairness via Access Point (AP) association in multi-rate WLANs. This problem is formulated as a non-linear program with an objective function of maximizing the total user bandwidth utilities in the whole network. It is NP-hard, and therefore effort in this paper is made to seek approximate solutions. We propose a centralized algorithm to derive the user-AP association via relaxation. Such a relaxation may cause a large integrality gap. Therefore a compensation function is introduced to guarantee that our algorithm can achieve at least half of the optimal solution in the worst-case scenario theoretically. Extensive simulation study has been reported to validate and compare the performances of our algorithms with those of the state-of-the-art.

Keywords

AP association bandwidth allocation multi-rate WLANs proportional fairness 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Wei Li
    • 1
  • Yong Cui
    • 2
  • Shengling Wang
    • 2
  • Xiuzhen Cheng
    • 3
  1. 1.Beijing University of Posts and TelecommunicationsBeijingP.R.China
  2. 2.Tsinghua UniversityBeijingP.R.China
  3. 3.The George Washington UniversityWashingtonUSA

Personalised recommendations