%0 Conference Proceedings
%T An Algorithm for Automatic Base Station Placement in Cellular Network Deployment
%+ High Speed Networks Laboratory, Dept. of Telecommunications
%A Törős, István
%A Fazekas, Péter
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 16th EUNICE/IFIP WG 6.6 Workshop on Networked Services and Applications - Engineering, Control and Management (EUNICE)
%C Trondheim, Norway
%Y Finn Arve Aagesen; Svein Johan Knapskog
%I Springer
%3 Networked Services and Applications - Engineering, Control and Management
%V LNCS-6164
%P 21-30
%8 2010-06-28
%D 2010
%R 10.1007/978-3-642-13971-0_3
%K cellular network planning
%K coverage
%K capacity
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%X The optimal base station placement is a serious task in cellular wireless networks. In this paper we propose a method that automatically distributes the base stations on a studied scenario, maintaining coverage requirement and enabling the transmission of traffic demands distributed over the area. A city scenario with normal demands is examined and the advantages/disadvantages of this method are discussed. The planner and optimizing tasks are based on an iterative K-Means clustering method. Numerical results of coverage, as well as graphical results permit on radio coverage maps, are presented as base for main consequences. Furthermore, the final results are compared to another simple planning algorithm.
%G English
%2 https://inria.hal.science/hal-01056483/document
%2 https://inria.hal.science/hal-01056483/file/010_Toros_Fazekas_Eunice2010_28Final_Version_29_v2.pdf
%L hal-01056483
%U https://inria.hal.science/hal-01056483
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-LNCS-6164
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-WG6-6
%~ IFIP-EUNICE
%~ IFIP-2010