Solving the base station placement problem by means of swarm intelligence

Author

Talau, Marcos ; Wille, E.C.G. ; Lopes, Heitor Silverio

Author_Institution

Fed. Univ. of Technol. Parana, Curitiba, Brazil

fYear

2013

fDate

16-19 April 2013

Firstpage

39

Lastpage

44

Abstract

The base station placement problem (BSP) is characterized as the most important issue to solve in planning a wireless network. It corresponds to a constrained combinatorial optimization problem, being classified as NP-hard. This paper presents a binary PSO approach for solving BSP problems in a CDMA indoor environment (with obstructions), aiming at serving a set of users, with a minimum number of base stations. A benchmark of four maps of increasing complexity was created for testing the system. To evaluate the performance of our approach, PSO results are compared with the optimal solutions found by an exhaustive search (ES) procedure. Analytical results for a variety of problem instances suggest that the PSO algorithm presents a good tradeoff between processing times and results.

Keywords

code division multiple access; combinatorial mathematics; computational complexity; indoor environment; particle swarm optimisation; wireless channels; BSP; CDMA indoor environment; NP-hard; base station placement problem; binary PSO approach; constrained combinatorial optimization problem; exhaustive search procedure; particle swarm optimization; swarm intelligence; wireless network planning; Base stations; Benchmark testing; Complexity theory; Equations; Indoor environments; Loading; Multiaccess communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence for Communication Systems and Networks (CIComms), 2013 IEEE Symposium on

Conference_Location

Singapore

Print_ISBN

978-1-4673-5902-3

Type

conf

DOI

10.1109/CICommS.2013.6582852

Filename

6582852