Issue No. 12 - Dec. (2013 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2013.10
Fengyuan Xu , College of William and Mary, Williamsburg
Xiaojun Zhu , Nanjing University, Nanjing
Chiu C. Tan , Temple University, Philadelphia
Qun Li , College of William and Mary, Williamsburg
Guanhua Yan , Los Alamos National Laboratory, Los Alamos
Jie Wu , Temple University, Philadelphia
As the first step of the communication procedure in 802.11, an unwise selection of the access point (AP) hurts one client's throughput. This performance downgrade is usually hard to be offset by other methods, such as efficient rate adaptations. In this paper, we study this AP selection problem in a decentralized manner, with the objective of maximizing the minimum throughput among all clients. We reveal through theoretical analysis that the selfish strategy, which commonly applies in decentralized systems, cannot effectively achieve this objective. Accordingly, we propose an online AP association strategy that not only achieves a minimum throughput (among all clients) that is provably close to the optimum, but also works effectively in practice with reasonable computation and transmission overhead. The association protocol applying this strategy is implemented on the commercial hardware and compatible with legacy APs without any modification. We demonstrate its feasibility and performance through real experiments and intensive simulations.
IEEE 802.11 Standards, Load modeling, Interference, Algorithm design and analysis, Load management
F. Xu, X. Zhu, C. C. Tan, Q. Li, G. Yan and J. Wu, "SmartAssoc: Decentralized Access Point Selection Algorithm to Improve Throughput," in IEEE Transactions on Parallel & Distributed Systems, vol. 24, no. 12, pp. 2482-2491, 2013.