Abstract : 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.
Finn Arve Aagesen; Svein Johan Knapskog. 16th EUNICE/IFIP WG 6.6 Workshop on Networked Services and Applications - Engineering, Control and Management (EUNICE), Jun 2010, Trondheim, Norway. Springer, Lecture Notes in Computer Science, LNCS-6164, pp.21-30, 2010, Networked Services and Applications - Engineering, Control and Management. 〈10.1007/978-3-642-13971-0_3〉
https://hal.inria.fr/hal-01056483
Contributeur : Hal Ifip
<>
Soumis le : mercredi 20 août 2014 - 10:14:19
Dernière modification le : vendredi 8 décembre 2017 - 18:04:02
Document(s) archivé(s) le : jeudi 27 novembre 2014 - 11:12:11
István Törős, Péter Fazekas. An Algorithm for Automatic Base Station Placement in Cellular Network Deployment. Finn Arve Aagesen; Svein Johan Knapskog. 16th EUNICE/IFIP WG 6.6 Workshop on Networked Services and Applications - Engineering, Control and Management (EUNICE), Jun 2010, Trondheim, Norway. Springer, Lecture Notes in Computer Science, LNCS-6164, pp.21-30, 2010, Networked Services and Applications - Engineering, Control and Management. 〈10.1007/978-3-642-13971-0_3〉. 〈hal-01056483〉
