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 meta-heuristics. 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ouzineb, M., Nourelfath, M., Gendreau, M.: An Efficient Heuristic for Reliability Design. Optimization Problems. Computers 37, 223–235 (2010)
Dorigo, M., Di Caro, G., Gambardella, L.M.: Algorithms for Discrete Optimization. University Libre de Bruxelles, Belgium (2003)
Rodrigues, R.C., Mateus, G.R., Loureiro, A.A.F.: Optimal Base Station Placement and Fixed Channel Assignment Applied to Wireless Local Area Network Project. In: Proc. Int. IEEE Conf. ICON, pp. 186–192 (1999)
Song, H.Y.: A Method of Mobile Base Station Placement for High Attitude Platform Based Network. In: Proc. of Intern. Multi-Conference on Computer Science and Information Technology, pp. 869–876 (2008)
Hashimuze, A., Mineno, H., Mizuno, T.: Multi-base Station Placement for Wireless Reprogramming in Sensor Networks. In: Velásquez, J.D., RĂos, S.A., Howlett, R.J., Jain, L.C. (eds.) KES 2009. LNCS, vol. 5712, pp. 648–655. Springer, Heidelberg (2009)
Shi, Y., Hou, Y.T., Efrat, A.: Algorithm Design for Base Station Placement Problems in Sensor Networks. In: Proc. ACM Intern. Conf. Series, vol. 191 (2006)
Choi, Y.S., Kim, K.S.: The Displacement of Base Station in Mobile Communication with Genetic Approach. ETRI South Korea (2008)
Dias, A.H.F., Vasconcelos, J.A.: Multi-objective Genetic Algorithms Applied to Solve Optimization Problems. IEEE Trans. on Magn. 38, 1133–1138 (2002)
Tamilarasi, A., Kumar, T.A.: An Enhanced Genetic Algorithm with Simulated Annealing for Job Shop Scheduling. Int. J. of Engineering, Science and Technology 2, 141–151 (2010)
Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1996)
Gendreau, M.: An Introduction to Tabu Search. Université de Montréal (2003)
Hayder, H.: Object Programming with PHP 5. Helion, Gliwice (2009) (in Polish)
Kmiecik, W., Wojcikowski, M., Koszalka, L., Kasprzak, A.: Task Allocation in Mesh Connected Processors with Local Search Meta-heuristic Algorithms. In: KES-AMSTA 2009. LNCS (LNAI), vol. 5559, pp. 215–224. Springer, Heidelberg (2010)
Koszalka, L., Lisowski, D., Pozniak-Koszalka, I.: Comparison of allocation algorithms for mesh structured networks with using multistage simulation. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3984, pp. 58–67. Springer, Heidelberg (2006)
Kasprzak, A.: Packet Switching Wide Area Networks. In: WPWR, Wroclaw (2001) (in Polish)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Regula, P., Pozniak-Koszalka, I., Koszalka, L., Kasprzak, A. (2011). Evolutionary Algorithms for Base Station Placement in Mobile Networks. In: Nguyen, N.T., Kim, CG., Janiak, A. (eds) Intelligent Information and Database Systems. ACIIDS 2011. Lecture Notes in Computer Science(), vol 6592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20042-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-20042-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20041-0
Online ISBN: 978-3-642-20042-7
eBook Packages: Computer ScienceComputer Science (R0)