Analysis of Heuristic Graph Partitioning Methods for the Assignment of Packet Control Units in GERAN
Over the last few years, graph partitioning has been recognized as a suitable technique for optimizing cellular network structure. For example, in a recent paper, the authors proposed a classical graph partitioning algorithm to optimize the assignment of cells to Packet Control Units (PCUs) in GSM-EDGE Radio Access Network. Based on this approach, the quality of packet data services in a live environment was increased by reducing the number of cell re-selections between different PCUs. To learn more about the potential of graph partitioning in cellular networks, in this paper, a more sophisticated, yet computationally efficient, partitioning algorithm is proposed for the same problem. The new method combines multi-level refinement and adaptive multi-start techniques with algorithms to ensure the connectivity between cells under the same PCU. Performance assessment is based on an extensive set of graphs constructed with data taken from a live network. During the tests, the new method is compared with classical graph partitioning approaches. Results show that the proposed method outperforms classical approaches in terms of solution quality at the expense of a slight increase in computing time, while providing solutions that are easier to check by the network operator.
KeywordsGraph partitioning Mobile Network Optimization Packet control unit
Unable to display preview. Download preview PDF.
- 1.Lempiainen J., Manninen M. (2001) Radio interface system planning for GSM/GPRS/UMTS. Kluwer, DordrechtGoogle Scholar
- 2.Laiho J., Wacker A., Novosad T. (2002) Radio network planning and optimisation for UMTS. Wiley, West SussexGoogle Scholar
- 4.Halonen T., Melero J., Romero J. (2002) GSM, GPRS and EDGE performance: Evolution toward 3G/UMTS. Wiley, ChichesterGoogle Scholar
- 6.Schloegel K., Karypis G., Kumar V. (2000) 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, Los AltosGoogle Scholar
- 7.Miller, G. L., Teng, S.-H., Thurston, W., & Vavasis, S. A. (1993). Automatic mesh partitioning. In A. George, J. R. Gilbert, & J. Liu (Eds.), Sparse matrix computations: Graph theory issues and algorithms (An IMA Workshop Volume). Springer.Google Scholar
- 10.Hendrickson, B., & Leland, R. (1995). A multilevel algorithm for partitioning graphs. In Proceedings of 1995 ACM/IEEE Conference on Supercomputing. ACM Press.Google Scholar
- 17.Plehn, J. (1995). The design of location areas in a GSM-network. In Proceedings of 45th IEEE vehicular technology conference (pp. 871–875).Google Scholar
- 18.Gondim, P. (1996). Genetic algorithms and location area partitioning problem in cellular networks. In Proceedings of 46th IEEE vehicular technology conference (pp. 1835–1838).Google Scholar
- 21.3GPP TS 05.08, Digital cellular telecommunications system (Phase 2); Radio subsystem link control (2000, November).Google Scholar
- 22.3GPP TS 43.129, Packet Switched Handover for GERAN A/Gb Mode; Stage 2 (2004, May).Google Scholar
- 23.Krishnan, R., Ramanathan, R., & Steentrup, M. (1999). Optimization algorithms for large self-structuring networks. In Proceedings of INFOCOM ’99 (Vol.~1, pp. 71–78).Google Scholar
- 33.Fiduccia, C., Mattheyses, R. (1982). A linear time heuristic for improving network partitions. In Proceedings of 19th ACM/IEEE design automation conference (pp. 175–181).Google Scholar