Improving the Spatial Consistency of the Assignment of Base Stations to Controllers in Cellular Networks

Hierarchical network structuring will be a central issue in future cellular networks. In the literature, many graph partitioning methods have been proposed to assign network elements to controllers to minimize network signaling. This paper presents two refinements to such methods, namely the connectedness and site constraints, to improve the spatial consistency of solutions, which is key for easy checking by the operator. Assessment is based on real problem instances of the assignment of base stations to packet control units in GSM-EDGE Radio Access Network (GERAN). Results show that fragmentation and overlapping in the final solution can be greatly reduced, while degrading the network performance only marginally.

[1]  Matías Toril,et al.  Analysis of Heuristic Graph Partitioning Methods for the Assignment of Packet Control Units in GERAN , 2011, Wirel. Pers. Commun..

[2]  Rajesh Krishnan,et al.  Optimization algorithms for large self-structuring networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  Matías Toril,et al.  Optimization of the Assignment of Base Stations to Base Station Controllers in GERAN , 2008, IEEE Communications Letters.

[4]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[5]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[6]  Hakan Deliç,et al.  Location area planning and cell-to-switch assignment in cellular networks , 2004, IEEE Transactions on Wireless Communications.

[7]  Matías Toril,et al.  Optimization of the assignment of cells to packet control units in GERAN , 2006, IEEE Communications Letters.

[8]  Vipin Kumar,et al.  Graph partitioning for high-performance scientific simulations , 2003 .