Title: A local search heuristic to solve the planning problem of 3G UMTS all-IP release 4 networks with realistic traffic

Authors: Mohammad Reza Pasandideh; Marc St-Hilaire

Addresses: Department of Systems and Computer Engineering, Carleton University, Ottawa, K1S 5B6 Ontario, Canada ' Department of Systems and Computer Engineering, Carleton University, Ottawa, K1S 5B6 Ontario, Canada

Abstract: The purpose of this paper is to develop an efficient heuristic in order to solve the planning problem of 3rd Generation (3G) Universal Mobile Telecommunication System (UMTS) all-IP Release 4 networks. Since the problem is NP-hard, an approximate algorithm based on the local search principle is proposed. Targeting a realistic planning tool, a realistic traffic profile was taken from real live networks. To evaluate the efficiency of the proposed heuristic, a comparative study in which the results are compared with respect to a reference model is conducted. Numerical analysis demonstrates that the local search algorithm produces solutions that are, on average, within 5.03% of the optimal solution, and in the best and worst cases at 0.87% and 9.29% of the optimal solution respectively.

Keywords: Universal Mobile Telecommunications System; UMTS release 4; all-IP; network planning; local search heuristic; 3G networks.

DOI: 10.1504/IJAACS.2014.058013

International Journal of Autonomous and Adaptive Communications Systems, 2014 Vol.7 No.1/2, pp.1 - 20

Received: 08 May 2021
Accepted: 12 May 2021

Published online: 04 Sep 2013 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article