Please use this identifier to cite or link to this item: https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1101
Title: Improving quality of experience of subscribers through post deployment network planning in UMTS cellular networks
Authors: Sadhukhan, Samir K.
Mandal, Swarup
Keywords: Ant colony
Cellular network
Dual-homing
Heuristic search
Network planning
Optimization
Simulated Annealing
Tabu search
Universal mobile telecommunication service (UMTS)
Issue Date: 2012
Publisher: SCOPUS
International Journal of Business Data Communications and Networking
Series/Report no.: 8(3)
Abstract: It is an established fact that cost of churning is a common concern for being profitable in the cellular network service provider's space. Service providers can view this problem as a service management problem and can have a solution to enhance the stickiness of subscribers by managing the quality of user experience. Quality of Experience (QoE) is important in contrast to Quality of Service (QoS). Three basic components of service management are stage, prop, and user experience. In this cellular network service context, network infrastructure acts as prop. Prop needs to be flexible to enable the personalization in providing the service. In reality the major challenge for a service provider is keep the fitment between prop and the dynamic changes in subscriber profile in a cost effective manner. To define the problem more precisely, the authors take the conventional UMTS cellular network. Here, operators have considered single-homing of RNCs to MSCs/ SGSNs (i.e., many-to-one mapping) with an objective to generate service at lower cost over a fixed period of time. However, a single-homing network does not remain cost-effective and flexible anymore when subscribers later begin to show specific inter-MSC/SGSN mobility patterns over time. This necessitates post-deployment topological extension of the network 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 authors formulate the scenario as a combinatorial optimization problem and solve the NP-Complete problem using three meta-heuristic techniques, namely Simulated Annealing (SA), Tabu search (TS), and Ant colony optimization (ACO). They then compare these techniques with a novel optimal heuristic search method that the authors propose typically to solve the problem. The comparative results reveal that the search-based method is more efficient than meta-heuristic techniques in finding optimal solutions quickly. Copyright � 2012, IGI Global.
Description: Sadhukhan, Samir K., Indian Institute of Management Calcutta, India; Mandal, Swarup, Wipro Technologies, Kolkata, India
ISSN/ISBN - 15480631
pp.1-27
DOI - 10.4018/jbdcn.2012070101
URI: https://www.scopus.com/inward/record.uri?eid=2-s2.0-84877889237&doi=10.4018%2fjbdcn.2012070101&partnerID=40&md5=6a111bc2d9fb8b622ac686a9469bcf4a
https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1101
Appears in Collections:Management Information Systems

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.