Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-01056483
Contributor : Hal Ifip <>
Submitted on : Wednesday, August 20, 2014 - 10:14:19 AM
Last modification on : Friday, December 8, 2017 - 6:04:02 PM
Long-term archiving on: : Thursday, November 27, 2014 - 11:12:11 AM

File

010_Toros_Fazekas_Eunice2010_2...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

167

Files downloads

1336