A tabu search approach for assigning node Bs to switches in UMTS networks

Authors:
Mamadou M. Diallo;Samuel Pierre;Ronald Beaubrun
Affiliations:
Siemens Corporate Research, Princeton, NJ;Department of Computer and Software Engineering, École Polytechnique de Montréal, Montreal, Qc, Canada;Department of Computer Science and Software Engineering, Université Laval, Quebec, Qc, Canada
Venue:
IEEE Transactions on Wireless Communications
Year:
2010

Citing 7
Cited 0

Assignment of cells to switches in PCS networks

IEEE/ACM Transactions on Networking (TON)
3G Wireless Networks

3G Wireless Networks
Uplink UMTS network design: an integrated approach

Computer Networks: The International Journal of Computer and Telecommunications Networking
A tabu search algorithm for the global planning problem of third generation mobile networks

Computers and Electrical Engineering
Assigning cells to switches in cellular networks by incorporating a pricing mechanism into Simulated annealing

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A tabu search approach for assigning cells to switches in cellular mobile networks

Computer Communications
Dynamic network composition for beyond 3G networks: a 3GPP viewpoint

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper proposes a mathematical model for assigning Node Bs to switches in UMTS networks, as well as an implementation of the tabu search metaheuristic for solving such a problem. In this model, the overall problem is divided into two assignment sub-problems: the assignment of a set of Node Bs to a set of radio network controllers (RNCs), and the assignment of those RNC concurrently to a set of voice switches (MSCs: Mobile Switching Centers) and a set of data switches (SGSNs: Serving GPRS Support Nodes). In order to solve the overall assignment problem, the proposed implementation defines a number of moves which enable to efficiently explore the set of possible solutions. Computational results enable to identify the parameters that are able to reduce the costs of the obtained solutions, as such costs are relatively close to the estimated lower bounds and found in reasonable computational time.