Evolutionary algorithms for base station placement in mobile networks

Authors:
Piotr Regula;Iwona Pozniak-Koszalka;Leszek Koszalka;Andrzej Kasprzak
Affiliations:
Dept. of Systems and Computer Networks, Wroclaw University, Wroclaw, Poland;Dept. of Systems and Computer Networks, Wroclaw University, Wroclaw, Poland;Dept. of Systems and Computer Networks, Wroclaw University, Wroclaw, Poland;Dept. of Systems and Computer Networks, Wroclaw University, Wroclaw, Poland
Venue:
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part II
Year:
2011

Citing 7
Cited 0

Tabu Search

Tabu Search
Optimal Base Station Placement and Fixed Channel Assignment Applied to Wireless Local Area Network Projects

ICON '99 Proceedings of the 7th IEEE International Conference on Networks
Algorithm design for base station placement problems in sensor networks

QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
An efficient heuristic for reliability design optimization problems

Computers and Operations Research
Multi-base Station Placement for Wireless Reprogramming in Sensor Networks

KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II
Task allocation in mesh connected processors with local search meta-heuristic algorithms

ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Comparison of allocation algorithms for mesh structured networks with using multistage simulation

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V

Quantified Score

Hi-index	0.00

Visualization

Abstract

Base station (BS) placement has a significant impact on the performance of mobile networks. Currently several algorithms are in use, differing in their complexity, task allocation time, and memory usage. In this paper, base station placement is automatically determined using two algorithms: a genetic, one and a hybrid algorithm, which combines both genetic and tabu search metaheuristics. Both designed algorithms are described, and compared with each other. For the positioning of the base station, both the power of the BS, and the size (location) of the subscriber group (SG) were considered factors. Additionally, the question of how the algorithms' parameters influence the solution was investigated. In order to conduct the investigation, a special application was created that runs both algorithms. Simulation tests prove that the hybrid algorithm outperforms the genetic algorithm in most cases. The hybrid algorithm delivers near-optimal solutions.