Integer and combinatorial optimization
Integer and combinatorial optimization
New methods to color the vertices of a graph
Communications of the ACM
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
802.11 Wireless Networks: The Definitive Guide
802.11 Wireless Networks: The Definitive Guide
Planning system for indoor wireless network
IEEE Transactions on Consumer Electronics
Large-scale wireless LAN design
IEEE Communications Magazine
On predicting in-building WiFi coverage with a fast discrete approach
International Journal of Mobile Network Design and Innovation
Wireless LAN planning: a didactical model to optimise the cost and effective payback
International Journal of Mobile Network Design and Innovation
Mono- and multiobjective formulations for the indoor wireless LAN planning problem
Computers and Operations Research
Hi-index | 0.00 |
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.