Improving Quality of Experience of Subscribers through Post Deployment Network Planning in UMTS Cellular Networks

• Published in: International journal of business data communications and networking 2012-07, Vol.8 (3), p.1-27
• Main Authors: Sadhukhan, Samir Kumar, Mandal, Swarup
• Format: Article
• Language: English
• Subjects: Ant colony optimization; Cellular communication; Combinatorial analysis; Heuristic; Heuristic methods; Homing; Mapping; Mathematical optimization; Search methods; Simulated annealing; Tabu search; Universal Mobile Telecommunications System (UMTS); User experience
• ISSN: 1548-0631; 1548-064X
• DOI: 10.4018/jbdcn.2012070101

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.