An efficient integer programming formulation for the assignment of base stations to controllers in cellular networks

In mobile networks, the assignment of base stations to controllers when planning the network has a strong impact on network performance. In a previous paper, the authors formulated the assignment of base stations to packet controllers in GSM-EDGE Radio Access Network (GERAN) as a graph partitioning problem, which was solved by a heuristic method. In this paper, an exact method is presented to find optimal solutions that can be used as a benchmark. The proposed method is based on an effective re-formulation of the classical integer linear programming model of the graph partitioning problem, which is solved by the branch-and-cut algorithm in a commercial optimization package. Performance assessment is based on an extensive set of problem instances built from data of a live network. Preliminary analysis shows some properties of the graphs in this problem justifying the limitations of heuristic approaches and the need for more sophisticated methods. Results show that the proposed method outperforms classical heuristic algorithms used for benchmarking, even under runtime constraints. Likewise, it improves the efficiency of exact methods previously applied to similar problems in the cellular field.

[1]  Syed Zahid.  LOCATION MANAGEMENT IN CELLULAR MOBILE RADIO NETWORKS , 2002 .

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

[3]  Djamal Zeghlache,et al.  Energy Efficient Scheme for Large Scale Wireless Sensor Networks with Multiple Sinks , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[5]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[6]  Byung Ro Moon,et al.  Genetic Algorithm and Graph Partitioning , 1996, IEEE Trans. Computers.

[7]  Catherine A. Schevon,et al.  Optimization by simulated annealing: An experimental evaluation , 1984 .

[8]  J. Plehn,et al.  The design of location areas in a GSM-network , 1995, 1995 IEEE 45th Vehicular Technology Conference. Countdown to the Wireless Twenty-First Century.

[9]  Cid C. de Souza,et al.  A column generation approach for SONET ring assignment , 2006 .

[10]  Sandip Roy,et al.  A Flexible Algorithm for Sensor Network Partitioning and Self-partitioning Problems , 2006, ALGOSENSORS.

[11]  Ian F. Akyildiz,et al.  Optimal Location Area Design to Minimize Registration Signaling Traffic in Wireless Systems , 2003, IEEE Trans. Mob. Comput..

[12]  Azzedine Boukerche,et al.  Algorithms and Protocols for Wireless Sensor Networks , 2008, Wiley series on parallel and distributed computing.

[13]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[14]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[15]  V. Rexhepi,et al.  Performance of streaming services in GERAN A/Gb mode , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[16]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[17]  Michael M. Sørensen,et al.  The optimal graph partitioning problem , 1993 .

[18]  M. N. Shanmukha Swamy,et al.  Simulated Annealing and Tabu Search Algorithms for Multiway Graph Partition , 1992, J. Circuits Syst. Comput..

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

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

[22]  Chien-Chao Tseng,et al.  Registration area planning for PCS networks using genetic algorithms , 1998 .

[23]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[24]  Michael Jünger,et al.  Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits , 1994, Math. Program..

[25]  M. R. Rao,et al.  The partition problem , 1993, Math. Program..

[26]  Panagiotis Demestichas,et al.  Control of the location update and paging signaling load in cellular systems by means of planning tools , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[27]  Jack Dongarra,et al.  Sourcebook of parallel computing , 2003 .

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

[29]  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).

[30]  Juan Melero,et al.  GSM, GPRS and EDGE Performance: Evolution Toward 3G/UMTS , 2002 .

[31]  P.R.L. Gondim,et al.  Genetic algorithms and the location area partitioning problem in cellular networks , 1996, Proceedings of Vehicular Technology Conference - VTC.

[32]  Fabien Houéto,et al.  A tabu search approach for assigning cells to switches in cellular mobile networks , 2002, Comput. Commun..

[33]  Franz Rendl,et al.  Graph partitioning using linear and semidefinite programming , 2003, Math. Program..

[34]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[35]  Tei-Wei Kuo,et al.  Efficient location area planning for cellular networks with hierarchical location databases , 2004, Comput. Networks.

[36]  Nicole Immorlica,et al.  Efficient location area planning for personal communication systems , 2003, IEEE/ACM Transactions on Networking.

[37]  Richard M. Leahy,et al.  An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[38]  Chris Walshaw,et al.  A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning , 2004, J. Glob. Optim..

[39]  Marc E. Pfetsch,et al.  Orbitopal Fixing , 2007, IPCO.

[40]  Michael A. Trick,et al.  Cliques and clustering: A combinatorial approach , 1998, Oper. Res. Lett..

[41]  Hanif D. Sherali,et al.  Improving Discrete Model Representations via Symmetry Considerations , 2001, Manag. Sci..

[42]  Sunil Samtani,et al.  A novel approach to OSPF-area design for large wireless ad-hoc networks , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[43]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[44]  B. Sengupta,et al.  Assignment of cells to switches in PCS networks , 1995, TNET.

[45]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[46]  Laurence A. Wolsey,et al.  The node capacitated graph partitioning problem: A computational study , 1998, Math. Program..

[47]  Chris Walshaw,et al.  Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm , 2000, SIAM J. Sci. Comput..

[48]  Anshul Gupta,et al.  Fast and effective algorithms for graph partitioning and sparse-matrix ordering , 1997, IBM J. Res. Dev..

[49]  Norbert Sensen,et al.  Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows , 2001, ESA.

[50]  Laurence A. Wolsey,et al.  Formulations and valid inequalities for the node capacitated graph partitioning problem , 1996, Math. Program..

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

[52]  Joseph Naor,et al.  Fast approximate graph partitioning algorithms , 1997, SODA '97.

[53]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[54]  Dorit S. Hochbaum,et al.  A Polynomial Algorithm for the k-cut Problem for Fixed k , 1994, Math. Oper. Res..

[55]  Amitava Mukherjee,et al.  A Simple Heuristic for Assignment of Cells to Switches in a PCS Network , 2000, Wirel. Pers. Commun..

[56]  Amitava Mukherjee,et al.  An approach for location area planning in a personal communication services network (PCSN) , 2004, IEEE Transactions on Wireless Communications.

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

[58]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: applications in VLSI domain , 1999, IEEE Trans. Very Large Scale Integr. Syst..

[59]  Chris Walshaw,et al.  Multilevel Refinement for Combinatorial Optimisation Problems , 2004, Ann. Oper. Res..