A heuristics based approach for cellular mobile network planning
Proceedings of the 2006 international conference on Wireless communications and mobile computing
A hybrid grouping genetic algorithm for the registration area planning problem
Computer Communications
Performance improvement of LTE tracking area design: a re-optimization approach
Proceedings of the 6th ACM international symposium on Mobility management and wireless access
Network performance model for location area re-planning in GERAN
Computer Networks: The International Journal of Computer and Telecommunications Networking
An adaptive multi-start graph partitioning algorithm for structuring cellular networks
Journal of Heuristics
Analysis of Heuristic Graph Partitioning Methods for the Assignment of Packet Control Units in GERAN
Wireless Personal Communications: An International Journal
Distributed cell-centric neighborhood-related location area planning for PCS networks
Computer Communications
Performance and cost trade-off in Tracking Area reconfiguration: A Pareto-optimization approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Evolutionary algorithms for location area management
EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
Mitigating signaling congestion in LTE location management by overlapping tracking area lists
Computer Communications
International Journal of Business Data Communications and Networking
International Journal of Mobile Network Design and Innovation
| Hi-index | 0.01 |
Location area (LA) planning plays an important role in cellular networks because of the tradeoff caused by paging and registration signalling. The upper boundary for the size of an LA is the service area of a mobile services switching center (MSC). In that extreme case, the cost of paging is at its maximum but no registration is needed. On the other hand, if each cell is an LA, the paging cost is minimal but the cost of registration is the largest. Between these extremes lie one or more partitions of the MSC service area that minimize the total cost of paging and registration. In this paper, we seek to determine the location areas in an optimum fashion. Cell to switch assignments are also determined to achieve the minimization of the network cost. For that purpose, we use the available network information to formulate a realistic optimization problem, and propose an algorithm based on simulated annealing (SA) for its solution. Then, we investigate the quality of the SA-based technique by comparing it to greedy search, random generation methods, and a heuristic algorithm.