The automatic location of base-stations for optimised cellular coverage: a new combinatorial approach

Author

Molina, A. ; Athanasiadou, G.E. ; Nix, A.R.

Author_Institution

Centre for Commun. Res., Bristol Univ., UK

Volume

1

fYear

1999

fDate

36342

Firstpage

606

Abstract

The cost and complexity of a network is closely related to the number of base-stations (BSs) required to achieve the system operator´s service objectives. The location of BSs is not an easy task and there are numerous factors that must be taken into account when deciding the optimum position of BSs. This paper discusses the performance of three different algorithms developed to solve the BS location problem: the greedy algorithm (GR), the genetic algorithm (GA) and the combination algorithm for total optimisation (CAT). These three methods are compared and results are given for a typical test scenario

Keywords

cellular radio; combinatorial mathematics; genetic algorithms; radio networks; UMTS; algorithm performance; automatic base-station location; cellular network-planning; combination algorithm for total optimisation; combinatorial approach; genetic algorithm; greedy algorithm; multimedia services; network complexity; network cost; optimised cellular coverage; test scenario; total optimisation; 3G mobile communication; Costs; Electronic mail; Genetic algorithms; Greedy algorithms; Land mobile radio cellular systems; Microcell networks; Next generation networking; Testing; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 1999 IEEE 49th

Conference_Location

Houston, TX

ISSN

1090-3038

Print_ISBN

0-7803-5565-2

Type

conf

DOI

10.1109/VETEC.1999.778212

Filename

778212