On the wireless local area network design problem with performance guarantees

In this paper, we propose a model for the wireless local area network (WLAN) design problem with performance guarantees. This problem consists of selecting the location of the access points (APs) as well as the power and the channel of each AP. The performance guarantees we refer to are coverage and minimum bandwidth guarantees. Since this problem is NP -hard, we propose a tabu search algorithm to find solutions for real-size instances of the problem. Finally, numerical results are presented. The results show that good solutions can be found with the proposed algorithm in a reasonable amount of time.