Paper Info
Title
Three-phase heuristic algorithm for Wireless LAN planning
Abstract
In this work, we deal with the Wireless LAN planning problem. We study this problem and we propose to couple its two major issues: AP placement and channel assignment to treat them jointly. Here, we propose a novel fast and scalable three-phase heuristic algorithm (TPHA). Our proposal is able to resolve the defined multiobjective problem to provide (1) the efficient number of Access Points (APs) to be deployed, while (2) ensuring the coverage of all Test Points (TPs) and (3) maximizing their nominal data rate. To achieve the first objective, we propose an heuristic called MCL-ILP combining the quick decision making yields from the Markovian CLustering algorithm and the exact solution provided by the Integer Linear Programming. Hence, a TPs-based Least Interfering Channel Search algorithm (TLICS) has been proposed for channel assignment to improve the throughput at TP locations. However, the Virtual Forces-based WLAN Planing Algorithm namely VFPA considers the results delivered by the two previous algorithms as an initial solution and tries to enhance it by adjusting the APs's positions and re-assigning their operating frequencies. Computational results exhibit that our proposal is highly beneficial to designing WLANs.
Year
DOI
Venue
2012
10.1109/WCNC.2012.6214176
Wireless Communications and Networking Conference
Keywords
Field
DocType
Markov processes,channel allocation,decision making,integer programming,linear programming,telecommunication network planning,wireless LAN,MCL-ILP combining,Markovian clustering,access points placement,channel assignment,decision making,integer linear programming,least interfering channel search,multiobjective problem,nominal data rate,test points,three-phase heuristic algorithm,virtual forces-based WLAN planing,wireless LAN planning
Heuristic,Mathematical optimization,Search algorithm,Heuristic (computer science),Computer science,Computer network,Real-time computing,Integer programming,Linear programming,Throughput,Cluster analysis,Channel allocation schemes
Conference
ISSN
ISBN
Citations 
1525-3511
978-1-4673-0436-8
2
PageRank 
References 
Authors
0.40
4
3
Name
Order
Citations
PageRank
Abdelhak Farsi182.25
Nadjib Achir213122.92
Khaled Boussetta319327.71