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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Din, D.-R., Tseng, S.S.: A genetic algorithm for solving dual-homing cell assignment problem of the two-level wireless ATM network. Computer Communications 25, 1536–1547 (2005)
Demrikol, I., Ersoy, C., Caglayan, M.U., Delic, H.: Location Area Planning in Cellular Networks Using Simulated Annealing. In: Proc. IEEE INFOCOM (2001)
Pearl, J.: Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley, Reading (1984)
Saha, D., Mukherjee, A., Bhattacharya, P.S.: A Simple Heuristic for Assignment of Cells to Switches in a PCS Network. In: Proc. Wireless Personal Communications, pp. 209–224 (2000)
Bhattacharjee, P.S., Saha, D., Mukherjee, A.: An Approach for Location Area Planning in a Personal Communication Services Network (PCSN). IEEE Trans. on Wireless Communication (2004)
Mandal, S., Saha, D., Mahanti, A.: Heuristic Search Techniques for Cell to Switch Assignment in Location Area Planning for Cellular Networks. In: Proc. IEEE International Conference on Communications (ICC), pp. 4307–4311 (2004)
Transl. J. Magn. Japan, vol. 2, pp. 740–741 (August 1987); [Digests 9th Annual Conf. Magnetics Japan, p. 301, 1982]
Young, M.: The Technical Writer’s Handbook. University Science, Mill Valley (1989)
Sadhukhan, S.K., Mandal, S., Saha, D.: A Heuristic Techneque for Solving Dual-homing Assignment Problem of 2.5G Cellular Networks. In: Proc. IEEE ICCTA, Kolkata, India, pp. 66–71 (2007)
Sadhukhan, S.K., Mandal, S., Biswas, S.R., Bhaumik, P., Saha, D.: Post-deployment Tuning of UMTS Cellular Networks through Dual-homing of RNCs. In: Proc. IEEE COMSNETS 2009, Bangalore, India (January 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sadhukhan, S.K., Mandal, S., Bhaumik, P., Saha, D. (2010). Post Deployment Planning of 3G Cellular Networks through Dual Homing of NodeBs. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds) Distributed Computing and Networking. ICDCN 2010. Lecture Notes in Computer Science, vol 5935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11322-2_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-11322-2_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11321-5
Online ISBN: 978-3-642-11322-2
eBook Packages: Computer ScienceComputer Science (R0)