Assignment of cells to switches in PCS networks
IEEE/ACM Transactions on Networking (TON)
Tabu Search
A Simple Heuristic for Assignment of Cells to Switches in a PCS Network
Wireless Personal Communications: An International Journal
A tabu search approach for assigning cells to switches in cellular mobile networks
Computer Communications
A local search heuristic for the global planning of UMTS networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Uplink UMTS network design: an integrated approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hierarchical maximal-coverage location-allocation: Case of generalized search-and-rescue
Computers and Operations Research
Optimal switch location in mobile communication networks using hybrid genetic algorithms
Applied Soft Computing
A tabu search algorithm for the global planning problem of third generation mobile networks
Computers and Electrical Engineering
Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic
Computers and Operations Research
International Journal of Autonomous and Adaptive Communications Systems
| Hi-index | 0.01 |
In this paper we propose a model for the expansion problem of the network subsystem (NSS) of a universal mobile telecommunication system (UMTS) wireless cellular network considering an update in the base station subsystem (BSS). The objective is to minimize the expansion cost of the network subsystem while considering network performance (e.g., call and handover blocking). Since the network expansion problem is a generalization of the design problem, the proposed model can also be used for designing networks. In order to find good solutions, we propose a heuristic based on the tabu search principle. Finally, we present a performance analysis of the proposed heuristic. The analysis shows that quasi-optimal solutions are found with the proposed heuristic.