Title
Outdoor WLAN planning via non-monotone derivative-free optimization: algorithm adaptation and case study
Abstract
In this paper, we study the application of non-monotone derivative-free optimization algorithms to wireless local area networks (WLAN) planning, which can be modeled as an unconstrained minimization problem. We wish to determine the access point (AP) positions that maximize coverage in order to provide connectivity to static and mobile users. As the objective function of the optimization model is not everywhere differentiable, previous research has discarded gradient methods and employed heuristics such as neighborhood search (NS) and simulated annealing (SA). In this paper, we show that the model fulfills the conditions required by recently proposed non-monotone derivative-free (DF) algorithms. Unlike SA, DF has guaranteed convergence. The numerical tests reveal that a tailored DF implementation (termed "zone search") outperforms NS and SA.
Year
DOI
Venue
2008
10.1007/s10589-007-9091-3
Comp. Opt. and Appl.
Keywords
Field
DocType
Derivative-free optimization,Network planning
Convergence (routing),Simulated annealing,Derivative-free optimization,Mathematical optimization,Network planning and design,Algorithm,Heuristics,Differentiable function,Mathematics,Monotone polygon,Metaheuristic
Journal
Volume
Issue
ISSN
40
3
0926-6003
Citations 
PageRank 
References 
2
0.37
7
Authors
4