Simulated Annealing for Location Area Planning in Cellular networks

TL;DR

This paper applies simulated annealing to optimize location area planning in GSM cellular networks, balancing update and paging costs efficiently.

Contribution

It introduces a simulated annealing approach for LA planning, providing a practical method to achieve near-optimal solutions with acceptable runtime.

Findings

Optimized LA size reduces management costs.

Simulated annealing achieves near-optimal solutions.

Method is computationally efficient.

Abstract

LA planning in cellular network is useful for minimizing location management cost in GSM network. In fact, size of LA can be optimized to create a balance between the LA update rate and expected paging rate within LA. To get optimal result for LA planning in cellular network simulated annealing algorithm is used. Simulated annealing give optimal results in acceptable run-time.