Assignment of cells to switches in PCS networks
IEEE/ACM Transactions on Networking (TON)
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Fast and effective algorithms for graph partitioning and sparse-matrix ordering
IBM Journal of Research and Development - Special issue: optical lithography I
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
The node capacitated graph partitioning problem: a computational study
Mathematical Programming: Series A and B - Special issue on computational integer programming
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Radio Network Planning and Optimisation for Umts
Radio Network Planning and Optimisation for Umts
The GSM System for Mobile Communications
The GSM System for Mobile Communications
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
SIAM Journal on Scientific Computing
A Simple Heuristic for Assignment of Cells to Switches in a PCS Network
Wireless Personal Communications: An International Journal
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Improving Discrete Model Representations via Symmetry Considerations
Management Science
Exact Solutions to Task Allocation Problems
Management Science
Lower bounds for the partitioning of graphs
IBM Journal of Research and Development
Location area planning and cell-to-switch assignment in cellular networks
IEEE Transactions on Wireless Communications
An approach for location area planning in a personal communication services network (PCSN)
IEEE Transactions on Wireless Communications
A tabu search approach for assigning cells to switches in cellular mobile networks
Computer Communications
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
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.