Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Assignment of cells to switches in PCS networks
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Simple Heuristic for Assignment of Cells to Switches in a PCS Network
Wireless Personal Communications: An International Journal
User Mobility Pattern Scheme for Location Update and Paging in Wireless Systems
IEEE Transactions on Mobile Computing
A Heuristic Technique for Solving Dual-Homing Assignment Problem of 2.5G Cellular Networks
ICCTA '07 Proceedings of the International Conference on Computing: Theory and Applications
An approach for location area planning in a personal communication services network (PCSN)
IEEE Transactions on Wireless Communications
Assigning cells to switches in cellular mobile networks using taboosearch
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
Post deployment planning of 3G cellular networks through dual homing of NodeBs
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
International Journal of Business Data Communications and Networking
An Analysis of Traffic and Throughput for UMTS Packet Core Networks
International Journal of Interdisciplinary Telecommunications and Networking
| Hi-index | 0.00 |
In conventional UMTS cellular networks, during deployment usually a set of NodeBs is assigned to one Radio Network Controller (RNC), and a set of RNCs to one Serving GPRS Support Node (SGSN) for data services, as weD as to one Mobile Switching Centre (MSC) for voice services. Operators thus far have considered single-homing of RNCs to MSCs/SGSNs (i.e., many-to-one mapping) with an objective to reduce the total cost over a fixed period of time. However, a single-homing network does not remain cost-effective any more when subscribers later on begin to show specific inter-MSC/SGSN mobility patterns (say, diurnality of office goers) over time. This necessitates post-deployment topological extension of the network in terms of dual-homing of RNCs, in which some specific RNCs are connected to two MSCs/SGSNs via direct links resulting in a more complex many-to-two mapping structure in parts of the network. The partial dual-homing attempts to increase link cost minimally and reduce handoff cost maximaDy, thereby significantly reducing the total cost in a post-deployment optimal extension. In this paper, we formulate the scenario as a combinatorial optimization problem and solve the NP-Complete problem using two meta-heuristic techniques, namely Simulated Annealing (SA) and Tabu search (TS). We then compare these techniques with a novel optimal heuristic search method that we propose typically to solve the problem. The comparative results reveal that, though aD of them perform equally well for small networks, for larger networks, the search-based method is more efficient than meta-heuristic techniques in finding optimal solutions quickly.