Algoritmo de Optimización aplicado al Emplazamiento de Estaciones Base para una Distribución Heterogénea de Usuarios Móviles con Requerimientos de Tipo Multiservicio (Base Station Placement Optimization Algorithm for Heterogeneous Distributions of Mobile Users with Multi-Service Requirements)

Christian Soto (csoto@cicese.mx), David H. Covarrubias (dacoro@cicese.mx), Salvador Villarreal (svillar@cicese.mx)


CICESE Research Centre
This paper appears in: Revista IEEE América Latina

Publication Date: Sept. 2012
Volume: 10,   Issue: 5 
ISSN: 1548-0992


Abstract:
In this paper the placement of base station within a cellular network is addressed as an optimization problem. A genetic algorithm is used as the optimization tool. This optimization issue is particularly important and critical in the multi-service environment commonly found in new generation cellular communications systems. Particularly, the goal of the algorithm presented in this work is to minimize the interference between base stations. It is shown that, by using the so proposed weighted objective function, it is possible to specify the base station locations, the cell coverage in terms of traffic and area, as well as the overlap levels between base stations. The weighted objective function is based on a preliminary analysis of the load factor for the base stations involved. The proposed algorithm is verified by means of a simulation scenario that considers a non-uniform distribution of users with different types of service. The presented results show an adequate tradeoff between the total traffic serviced and overlap level that allows transfers and minimizes the interference levels. Thus, our algorithm provides a useful tool for finding a near optimal solution for base station placement and efficiently determines number of base stations required in a cell planning procedure.

Index Terms:
Base Station Placement, Meta-Heurístics, Genetic Algorithms, WCDMA, Multiservice   


Documents that cite this document
This function is not implemented yet.


[PDF Full-Text (650)]