Throughput Optimization via Association Control in Wireless LANs

Tang, Heyi; Liu, Yang; Jiang, Dong; Ou, Zhonghong; Cui, Yong; Wu, Jianping

doi:10.1007/s11036-015-0650-z

Cited by 18 publications

(31 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, there also exist proposals that aim to improve the association based on the RSSI value in a distributed way. Some papers also propose both approaches [17,19].…”

Section: Classification Of the Proposed Solutionsmentioning

confidence: 99%

“…In [19] an association control algorithm is proposed to optimize the throughput in wireless LANs. The solution achieves load balancing between APs while considering users traffic demand.…”

Section: Description Of the Proposed Solutionsmentioning

confidence: 99%

“…In this paper, we are interested in centralized association solutions based on explicit optimization models. Most of the optimization models, proposed for this problem, assume a time-based fairness between the APs and the stations [15,16,17,19]. This approach does not correspond to most of the APs implementation which use FIFO queues rather than complex scheduling (necessary for time share).…”

Section: Contributionsmentioning

confidence: 99%

“…Most of the studies that deal with optimization of Wi-Fi associations, and that have been presented in Section 2 [15,17,16,19], use approximation algorithms based on relaxation to a non-linear convex program. It allows them to apply the rounding process proposed by Shmoys and Tardos for the generalized assignment problem [36], to provide binary values of the association variable x ij .…”

Section: Optimization Problem Solvingmentioning

confidence: 99%

“…Instead, the controller can distribute stations among APs in a centralized manner to optimize a given objective function, like, for instance, maximizing the global throughput of the network. The centralized association problem has been already addressed in [14,15,16,17,18,19]. Most of these optimization models assume a time-based fairness between the APs and the stations [15,16,17,19], i.e.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Association optimization based on access fairness for Wi-Fi networks

2018

View full text Add to dashboard Cite

Densification of Wi-Fi networks has led to the possibility for a wireless station to choose between several access points (APs), improving coverage, wireless link quality and mobility. But densification of APs may generate interference, contention and decrease the global throughput as these APs have to share a limited number of channels. The recent trend in which Wi-Fi networks are managed in a centralized way offers the opportunity to alleviate this problem through a global optimization of the resource usage. In particular, optimizing the association step between APs and stations can increase the overall throughput and fairness between stations. In this paper, we propose an original solution to this optimization problem based on two contributions. First, we propose a mathematical model to evaluate and forecast the throughput obtainable for each station for a given association. The best association is then defined as the one that maximizes a logarithmic utility function using the stations' throughputs predicted by the model. The use of a logarithmic utility function allows to achieve a good trade-off between overall throughput and fairness. A heuristic based on a local search algorithm is used to propose approximate solutions to this optimization problem. It relies on a suitable neighborhood structure between associations. This approach has the benefit to be tuned according to the CPU and time constraints of the WLAN controller. A comparison between different heuristic versions and the optimum solution shows that the proposed heuristic offers solutions very close to the optimum with a significant gain of time. We also evaluated our solution with the simulator NS-3 on a large set of scenarios and configurations. It empirically demonstrates that our proposal improves the overall throughput and the fairness of the network.

show abstract

“…However, there also exist proposals that aim to improve the association based on the RSSI value in a distributed way. Some papers also propose both approaches [17,19].…”

Section: Classification Of the Proposed Solutionsmentioning

confidence: 99%

“…In [19] an association control algorithm is proposed to optimize the throughput in wireless LANs. The solution achieves load balancing between APs while considering users traffic demand.…”

Section: Description Of the Proposed Solutionsmentioning

confidence: 99%