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
Benchmarking a wide spectrum of metaheuristic techniques for the radio network design problem
IEEE Transactions on Evolutionary Computation
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
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.