An adaptive multi-start graph partitioning algorithm for structuring cellular networks
In mobile network design, the problem of assigning network elements to controllers when defining network structure can be modeled as a graph partitioning problem. In this paper, a comprehensive analysis of a sophisticated graph partitioning algorithm for grouping base stations into packet control units in a mobile network is presented. The proposed algorithm combines multi-level and adaptive multi-start schemes to obtain high quality solutions efficiently. Performance assessment is carried out on a set of problem instances built from measurements in a live network. Overall results confirm that the proposed algorithm finds solutions better than those obtained by the classical multi-level approaches and much faster than classical multi-start approaches. The analysis of the optimization surface shows that the best local minima values follow a Gumbel distribution, which justifies the stagnation of naive multi-start approaches after a few attempts. Likewise, the analysis shows that the best local minima share strong similarities, which is the reason for the superiority of adaptive multi-start approaches. Finally, a sensitivity analysis shows the best internal parameter settings in the algorithm.
KeywordsMobile network Optimization Graph partitioning Multi-level refinement Adaptive multi-start
Unable to display preview. Download preview PDF.
- Fiduccia, C., Mattheyses, R.: A linear time heuristic for improving network partitions. In: Proc. 19th ACM/IEEE Design Automation Conference, pp. 175–181 (1982) Google Scholar
- Gondim, P.: Genetic algorithms and location area partitioning problem in cellular networks. In: Proc. 46th IEEE Vehicular Technology Conference, pp. 1835–1838 (1996) Google Scholar
- Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proc. 1995 ACM/IEEE Conference on Supercomputing. ACM, New York (1995) Google Scholar
- Krishnan, R., Ramanathan, R., Steentrup, M.: Optimization algorithms for large self-structuring networks. In: Proc. INFOCOM’99, vol. 1, pp. 71–78 (1999) Google Scholar
- Laiho, J., Wacker, A., Novosad, T.: Radio Network Planning and Optimisation for UMTS. Wiley, New York (2002) Google Scholar
- Mishra, AR: Advanced Cellular Network Planning and Optimisation. Wiley, New York (2007) Google Scholar
- Mouly, M., Pautet, M.B.: The GSM System for Mobile Communications. Cell & Sys. Telecom Publishing, Palaiseau (1992) Google Scholar
- Plehn, J.: The design of location areas in a GSM-network. In: Proc. 45th IEEE Vehicular Technology Conference, pp. 871–875 (1995) Google Scholar
- Schloegel, K., Karypis, G., Kumar, V.: Graph partitioning for high performance scientific simulations. In: Dongarra, J., Foster, I., Fox, G., Kennedy, K., White, A. (eds.) CRPC Parallel Computing Handbook. Morgan Kaufmann, San Mateo (2000) Google Scholar
- Toril, M.: Self-tuning algorithms for the assignment of packet control units and handover parameters in GERAN. Ph.D. thesis, University of Málaga (2007) Google Scholar
- Toril, M., Wille, V., Molina-Fernández, I., Walshaw, C.: An adaptive multi-start graph partitioning algorithm for structuring cellular networks. Tech. Rep. IC-10-01, University of Málaga (2010). http://mobilenet.ic.uma.es/images/stories/Publications/IC-10-01.pdf
- Walshaw, C., Everett, M.G.: Multilevel landscapes in combinatorial optimisation. Tech. Rep. 02/IM/93 (2002) Google Scholar