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
|Pages||606 - 610|
|Publication status||Published - May 1999|
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Name of Conference: 49th Vehicular Technology Conference 1999 (VTC 1999-Spring)
Venue of Conference: Houston
- genetic algorithms
- cellular radio