A local search heuristic for the design problem of 3G UMTS All-IP release 4 networks with realistic traffic

Author

Pasandideh, Mohammad Reza ; St-Hilaire, Marc

Author_Institution

Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, ON, Canada

fYear

2011

fDate

4-8 July 2011

Firstpage

1216

Lastpage

1221

Abstract

In this paper, we focus on the development of an efficient heuristic in order to solve the planning problem of 3rd Generation (3G) Universal Mobile Telecommunication System (UMTS) all-IP Release 4 networks. We also incorporate a realistic traffic profile taken from real live networks. Since the problem is NP-hard, an approximate algorithm based on the local search principles is proposed. Numerical results demonstrate 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

3G mobile communication; IP networks; communication complexity; search problems; telecommunication network planning; telecommunication traffic; 3G UMTS All-IP release 4 networks; 3rd generation; NP-hard problem; local search algorithm; local search heuristic; planning problem; realistic traffic; universal mobile telecommunication system; 3G mobile communication; IP networks; Mathematical model; Mobile computing; Planning; Search problems; All-IP; Heuristic; Network planning; Universal Mobile Telecommunications System (UMTS) Release 4;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications and Mobile Computing Conference (IWCMC), 2011 7th International

Conference_Location

Istanbul

Print_ISBN

978-1-4244-9539-9

Type

conf

DOI

10.1109/IWCMC.2011.5982713

Filename

5982713