An Algorithm for Automatic Base Station Placement in Cellular Network Deployment - Networked Services and Applications - Engineering, Control and Management Access content directly
Conference Papers Year : 2010

An Algorithm for Automatic Base Station Placement in Cellular Network Deployment

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.
Fichier principal
Vignette du fichier
010_Toros_Fazekas_Eunice2010_28Final_Version_29_v2.pdf (389.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01056483 , version 1 (20-08-2014)

Licence

Attribution

Identifiers

Cite

István Törős, Péter Fazekas. An Algorithm for Automatic Base Station Placement in Cellular Network Deployment. 16th EUNICE/IFIP WG 6.6 Workshop on Networked Services and Applications - Engineering, Control and Management (EUNICE), Jun 2010, Trondheim, Norway. pp.21-30, ⟨10.1007/978-3-642-13971-0_3⟩. ⟨hal-01056483⟩
114 View
860 Download

Altmetric

Share

Gmail Facebook X LinkedIn More