TY - GEN
T1 - Cross layer association control for throughput optimization in wireless LANs with inter-AP interference
AU - Hung, Ka Lok
AU - Bensaou, Brahim
AU - Li, Rui
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
KW - ap association
KW - contention resolution
KW - hidden terminals
KW - mathematical programming
KW - rate control
UR - https://openalex.org/W2014029389
UR - https://www.scopus.com/pages/publications/78650206902
U2 - 10.1145/1868521.1868556
DO - 10.1145/1868521.1868556
M3 - Conference Paper published in a book
SN - 9781450302746
T3 - MSWiM'10 - Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems
SP - 210
EP - 217
BT - MSWiM'10 - Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems
T2 - 13th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2010
Y2 - 17 October 2010 through 21 October 2010
ER -