Approximate optimization for proportional fair AP association in multi-rate WLANs

Authors:
Wei Li;Yong Cui;Shengling Wang;Xiuzhen Cheng
Affiliations:
Beijing University of Posts and Telecommunications, Beijing, P.R.China;Tsinghua University, Beijing, P.R.China;Tsinghua University, Beijing, P.R.China;The George Washington University, Washington, DC
Venue:
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Year:
2010

Citing 8
Cited 1

Data networks

Data networks
An approximation algorithm for the generalized assignment problem

Mathematical Programming: Series A and B
CDMA: principles of spread spectrum communication

CDMA: principles of spread spectrum communication
Convex programming for scheduling unrelated parallel machines

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Time-based fairness improves performance in multi-rate WLANs

ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Fairness and load balancing in wireless LANs using association control

IEEE/ACM Transactions on Networking (TON)
An optimal station association policy for multi-rate ieee 802.11 wireless lans

Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Frequency-aware rate adaptation and MAC protocols

Proceedings of the 15th annual international conference on Mobile computing and networking

BEST-AP: Non-intrusive estimation of available bandwidth and its application for dynamic access point selection

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

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.