Recently there is a growing interest of indoor wireless communications and the problem of choosing the optimal locations of access points in these environments. This problem is very hard to consider because it is a combinatorial optimization problem. It is needed to design the appropriate model for the problem of optimal locations of access points.
For this model, deterministic ray tube method is used for the analysis of indoor environments in consideration of various propagation paths. Simulated annealing algorithm is suggested for optimizing method and is adaptive to optimization model. It can be more efficient and suitable by means of modifying algorithm and linking to pattern matching. Pattern is normalized cost function set of generalized template of building structure by unit grid. It gives a tendency making a new neighbor solution, so it increases an acceptability of neighbor solution and decreases a total iteration times. This paper proposes a suitable algorithm for optimizing a location of access points and results will be shown using simulation.
