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.
Domains
Digital Libraries [cs.DL]
Fichier principal
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...