An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Analysis of a campus-wide wireless network
Proceedings of the 8th annual international conference on Mobile computing and networking
IQU: practical queue-based user association management for WLANs
Proceedings of the 12th annual international conference on Mobile computing and networking
Fairness and load balancing in wireless LANs using association control
IEEE/ACM Transactions on Networking (TON)
New insights from a fixed-point analysis of single cell IEEE 802.11 WLANs
IEEE/ACM Transactions on Networking (TON)
Available bandwidth-based association in IEEE 802.11 Wireless LANs
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Online estimation of RF interference
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
CENTAUR: realizing the full potential of centralized wlans through a hybrid data path
Proceedings of the 15th annual international conference on Mobile computing and networking
TCP performance optimization in multi-cell wireless local area networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Power Control By Geometric Programming
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
In this paper, we study the problem of determining the optimal association in multi-cell WLANs in the presence of hidden terminals and inter-AP collisions. Unlike most work in this area which deal with networks without inter-AP interference, we reveal that association control alone is not sufficient to achieve fair throughput allocation and load balancing across APs. Instead, we advocate the joint association control, rate control and contention control to improve network performance. Based on this, we formulate a cross-layer optimization problem whose objective is to allocate downlink throughput according to the proportional fairness principle. As the problem turns out to be a non-convex mixed integer programming problem, which is known to be NP-hard, we relax it into a continuous convex problem and propose a distributed algorithm to solve it. We then design a simple yet effective distributed approximation algorithm to construct an solution that fulfills the discrete integral association constraint. The output of the algorithm provides the optimal association, the maximum achievable rate for each downlink flow and each AP's optimal average backoff time. Numerical experiments and simulation results show that our algorithm converges rapidly and works effectively.