An Approach for Solving the Base Station Placement Problem using Particle Swarm Intelligence

A large amount of studies deals with the base station placement problem (BSP), but few studies involve the selection of base stations to meet a set of users. This paper presents an approach for solving BSP problems in an indoor environment, aiming at meeting a set of users, with a minimum number of base stations, using a binary particle swarm optimization (PSO). A benchmark of four maps of increasing complexity was created for testing the system. Results of the binary PSO were compared with optimal solutions found by an exhaustive search algorithm. The computational results suggest that the PSO algorithm provides a quite efficient approach to obtain (near) optimal solutions with small computational effort.