Designing WLAN with minimum bandwidth guarantees

In this paper, we propose a model for the wireless local area network (WLAN) design problem with minimum bandwidth guarantees. This problem consists of selecting the location of the access points (APs) and selecting the power and the channel of each AP. We propose a tabu search algorithm to find solutions for real-size instances of the problem. Finally, numerical results are presented and analyzed.