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

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Molina, A., Athanasiadou, G.E., Nix, A.R.
Format: Conference Proceeding
Language:English
Subjects:
3G mobile communication
Costs
Electronic mail
Genetic algorithms
Greedy algorithms
Land mobile radio cellular systems
Microcell networks
Next generation networking
Testing
Traffic control
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1090-3038
2577-2465
DOI:10.1109/VETEC.1999.778212