Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
A polynomial algorithm for the k-cut problem for fixed k
Mathematics of Operations Research
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
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Radio Interface System Planning for GSM/Gprs/Umts
Radio Interface System Planning for GSM/Gprs/Umts
Radio Network Planning and Optimisation for Umts
Radio Network Planning and Optimisation for Umts
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
GSM, GPRS and EDGE Performance: Evolution Toward 3G/UMTS
GSM, GPRS and EDGE Performance: Evolution Toward 3G/UMTS
Introduction to Algorithms
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
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Solving the mesh-partitioning problem with an ant-colony algorithm
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Fundamentals of Cellular Network Planning and Optimisation: 2G/2.5G/3G... Evolution to 4G
Fundamentals of Cellular Network Planning and Optimisation: 2G/2.5G/3G... Evolution to 4G
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
A distributed multilevel ant-colony algorithm for the multi-way graph partitioning
International Journal of Bio-Inspired Computation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
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.