On the design of large-scale UMTS mobile networks using hybrid genetic algorithms

被引:8
作者
Quintero, Alejandro [1 ]
Pierre, Samuel [1 ]
机构
[1] Ecole Polytech, Mobile Comp & Networking Res Lab LARIM, Montreal, PQ H3C 3A7, Canada
关键词
cellular networks; genetic algorithms (GAs); migration; multipopulation algorithm; Node Bs' assignment; tabu search; universal mobile telecommunications service (UMTS);
D O I
10.1109/TVT.2007.912601
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Third-generation mobile systems provide access to a wide range of services and enable mobile users to communicate, regardless of their geographical location and their roaming characteristics. Due to the growing number of mobile users and global connectivity, one of the most critical issues regarding the design of universal mobile telecommunications service (UNITS) networks pertains to the assignment of Node Bs to radio network controllers (RNCs), which is an NP-hard problem. Hence, for real-sized mobile networks, this problem cannot be practically solved by using exact methods. This paper proposes a hybrid genetic algorithm (HA) with migration to solve the problem of assigning Bs to RNCs as a design step of large-scale UNITS mobile networks. Computational results obtained from extensive tests confirm the effectiveness of the HA to provide superior solutions compared to other heuristic methods that are Well documented in the literature. Such an algorithm is particularly suitable to design large-scale cellular mobile networks with Node Bs whose quantity varies between 100 and 500 and whose the number of RNCs ranges between five and ten.
引用
收藏
页码:2498 / 2508
页数:11
相关论文
共 45 条
[1]   Planning UMTS base station location: Optimization models with power control and algorithms [J].
Amaldi, E ;
Capone, A ;
Malucelli, F .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2003, 2 (05) :939-952
[2]  
AMALDI E, 2001, P 5 INT WORKSH DISCR, P1
[3]  
[Anonymous], 2006, UNDERSTANDING UMTS R
[4]   An Overview of Evolutionary Algorithms for Parameter Optimization [J].
Baeck, Thomas ;
Schwefel, Hans-Paul .
EVOLUTIONARY COMPUTATION, 1993, 1 (01) :1-23
[5]  
BEAUBRUN R, 1999, P 11 INT C WIR COMM, V1, P259
[6]  
Cantu-Paz E., 2000, EFFICIENT ACCURATE P
[7]   Optimal location area design to minimize registration signaling traffic in wireless systems [J].
Cayirci, E ;
Akyildiz, IF .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2003, 2 (01) :76-85
[8]   Genetic algorithm to solve optimum TDMA transmission schedule in broadcast packet radio networks\ [J].
Chakraborty, G .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (05) :765-777
[9]  
Ching-Hung Wang, 1998, IEEE Transactions on Evolutionary Computation, V2, P138, DOI 10.1109/4235.738978
[10]  
COHOON JP, 1991, P 4 INT C GEN ALG, P244