A study on programming model and heuristic optimization algorithms for WCDMA radio networks

Jie Z., Jun Y., Aydin M. E.

1st International Conference on Communications and Networking in China, ChinaCom '06, Beijing, China, 25 - 27 October 2006, (Full Text) identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1109/chinacom.2006.344922
  • City: Beijing
  • Country: China
  • İstanbul Ticaret University Affiliated: No

Abstract

The 3rd Generation (3G) cellular networks, such as WCDMA (wideband code-division multiple access) networks, require accurate network planning and optimization. However, the planning and optimization of WCDMA radio network, which is a highly dynamic and inter-dependent system, are often carried out based on the static snapshot simulation due to simplicity and time limitation. Therefore, importing the link-level performance with consideration to some essential factors, such as power control and soft handover, has been a trend. Due to the complexity and inter-dependency, these characteristics have not been considered together in the previous works. In this paper, we give a brief introduction to our programming models with consideration to these characteristics, and present optimisation strategies base on three major meta-heuristics, namely genetic algorithms (GA), simulated annealing (SA) and variable neighborhood search (VNS), are presented. Extensive experiment results are provided and the performances of different algorithms are compared. © 2006 IEEE.