DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
A polynomial-time approximation scheme for base station positioning in UMTS networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Wireless IP and Building the Mobile Internet
Wireless IP and Building the Mobile Internet
An efficient heuristic for the expansion problem of cellular wireless networks
Computers and Operations Research
Manual and automatic design for UMTS networks
Mobile Networks and Applications
On the design problem of cellular wireless networks
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Uplink UMTS network design: an integrated approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fundamentals of Cellular Network Planning and Optimisation: 2G/2.5G/3G... Evolution to 4G
Fundamentals of Cellular Network Planning and Optimisation: 2G/2.5G/3G... Evolution to 4G
Base Station Location and Service Assignments in W--CDMA Networks
INFORMS Journal on Computing
A tabu search algorithm for the global planning problem of third generation mobile networks
Computers and Electrical Engineering
Evolving core networks from GSM to UMTS R4 version
International Journal of Mobile Network Design and Innovation
Hybrid Metaheuristics: An Emerging Approach to Optimization
Hybrid Metaheuristics: An Emerging Approach to Optimization
UMTS base station location planning with invasive weed optimization
ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
Automatic planning of UMTS release 4.0 networks using realistic traffic
WOWMOM '10 Proceedings of the 2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)
Comparison of different meta-heuristics to solve the global planning problem of UMTS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimization of base stations positioning in mobile networks
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Measurement-Based optimization of a 3g core network: a case study
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
IP connectivity for gateway GPRS support node
IEEE Wireless Communications
Tackling electrosmog in completely configured 3G networks by parallel cooperative meta-heuristics
IEEE Wireless Communications
Planning UMTS base station location: optimization models with power control and algorithms
IEEE Transactions on Wireless Communications
Providing fault tolerance in wireless access networks
IEEE Communications Magazine
Planning reliable UMTS terrestrial access networks
IEEE Communications Magazine
Efficient solution of the 3G network planning problem
Computers and Industrial Engineering
| Hi-index | 0.01 |
Most Universal Mobile Telecommunications Systems (UMTS) service providers are switching to an all-IP (also called flat-IP) architecture. Using an all-IP architecture within 3G networks provides a cost-effective transport network since the same infrastructure can be used for both voice and data services. However, planning and designing such an architecture is very complex especially if realistic traffic profiles are taken into consideration. As a result, this paper first provides a mathematical formulation (presented in Appendix for readability reasons) for the global planning problem of 3G UMTS all-IP Release 4 networks with realistic traffic profile. Due to the complexity of the problem, heuristics based on local search and tabu search are also proposed. Finally, a comparative study is performed to evaluate how good the heuristics are with respect to a reference model. Results show that the tabu search is able to provide solutions that are close to optimal solutions in a much shorter computation time.