Hard handoff minimization using genetic algorithms

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

12 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)1047-1058
Journal / PublicationSignal Processing
Volume82
Issue number8
Publication statusPublished - Aug 2002

Abstract

To set up personal communication services networks using code division multiple access cellular system standard, cost is always an important factor for consideration. In this paper, we aim to present a genetic algorithm-based method to reduce the cost of facilities as much as possible while the service performance is guaranteed. Handoff induces a cost to the investment significantly; thus, hard handoff minimization is desired. We formulate a combinatorial optimization problem to minimize the weighted-distance costs and hard handoff cost. Also, an efficient searching technique, genetic algorithms (GA), is adopted in this minimization problem. Both single objective and multiple objective approaches of GA are applied to the problem. It is found that the results obtained by the single objective approach can provide small weighted distance costs and hard handoff cost while the network partition is still balanced. © 2002 Elsevier Science B.V. All rights reserved.

Research Area(s)

  • Code division multiple access (CDMA), Facility location problem, Genetic algorithms, Hard handoff, Personal communication services (PCS)

Citation Format(s)

Hard handoff minimization using genetic algorithms. / Chan, T. M.; Kwong, S.; Man, K. F. et al.

In: Signal Processing, Vol. 82, No. 8, 08.2002, p. 1047-1058.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review