Post deployment planning of 3G cellular networks through dual homing of NodeBs

Authors:
Samir K. Sadhukhan;Swarup Mandal;Partha Bhaumik;Debashis Saha
Affiliations:
Indian Institute of Management, Calcutta;Wipro Technologies, Kolkata, India;Department of Computer Science and Engineering, Jadavpur University, Kolkata, India;Indian Institute of Management, Calcutta
Venue:
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Year:
2010

Citing 6
Cited 0

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
A Simple Heuristic for Assignment of Cells to Switches in a PCS Network

Wireless Personal Communications: An International Journal
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
Post-deployment tuning of UMTS cellular networks through dual-homing of RNCs

COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
An approach for location area planning in a personal communication services network (PCSN)

IEEE Transactions on Wireless Communications
A genetic algorithm for solving dual-homing cell assignment problem of the two-level wireless ATM network

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

3G Cellular networks typically consist of a group of NodeBs connected to a Radio Network Controller (RNC), and a group of RNCs to a Serving GPRS Support Node (SGSNs) as well as to a Mobile Switching Centre (MSCs). Post deployment planning of such network is to re-plan the connectivity among the above mentioned network elements with an objective to minimize the cost of operation of the network. This planning problem is traditionally solved under single homing consideration (i.e., one NodeB is homed with only one RNC). However, a single homing solution becomes ineffective when the subscriber distribution changes over time and groups of subscribers begin to show a specific diurnal pattern of their inter-MSC/SGSN mobility. One of the solutions for this problem is dual-homing where some selected NodeBs are connected to two RNCs to reduce the complex handoffs involving two different RNCs as well as two different MSCs/SGSNs. In this paper, we have mapped the dual-homing problem into a search problem and used Simulated Annealing (SA) and Tabu Search (TS) techniques to optimally select the NodeBs and RNCs to be connected. A comparison of the performances of the two meta-heuristic techniques reveals that, though both are efficient enough to produce good solutions, TS is found to be better than SA throughout.