Solving the base station placement problem by means of swarm intelligence

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.

[1]  Roger M. Whitaker,et al.  Comparison and Evaluation of Multiple Objective Genetic Algorithms for the Antenna Placement Problem , 2005, Mob. Networks Appl..

[2]  Michael J. Neve,et al.  Base station placement in indoor wireless systems using binary integer programming , 2006 .

[3]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[4]  Michael J. Neve,et al.  A New Algorithm for Efficient Optimisation of Base Station Placement in Indoor Wireless Communication Systems , 2009, 2009 Seventh Annual Communication Networks and Services Research Conference.

[5]  Russell C. Eberhart,et al.  Swarm intelligence for permutation optimization: a case study of n-queens problem , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[6]  Heitor Silvério Lopes,et al.  Particle Swarm Optimization for the Multidimensional Knapsack Problem , 2007, ICANNGA.

[7]  Edoardo Amaldi,et al.  Planning UMTS base station location: optimization models with power control and algorithms , 2003, IEEE Trans. Wirel. Commun..

[8]  Lajos Nagy,et al.  Indoor base station location optimization using genetic algorithms , 2000, 11th IEEE International Symposium on Personal Indoor and Mobile Radio Communications. PIMRC 2000. Proceedings (Cat. No.00TH8525).

[9]  Leandro dos Santos Coelho,et al.  Particle Swarn Optimization with Fast Local Search for the Blind Traveling Salesman Problem , 2005, Fifth International Conference on Hybrid Intelligent Systems (HIS'05).

[10]  Yuan Ping,et al.  Particle swarm optimization for base station placement in mobile communication , 2004, IEEE International Conference on Networking, Sensing and Control, 2004.

[11]  Han Kyu Park,et al.  Genetic approach with a new representation for base station placement in mobile communications , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).