Journal ArticleOPEN ACCESS

Simulated Annealing for Location Area Planning in Cellular networks

  • N. B. P
  • R. R A
  • M. I H
International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks (2010) 2(1) 1-7
DOI: 10.5121/jgraphhoc.2010.2101
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

N. B., P., R. R, A., & M. I, H. (2010). Simulated Annealing for Location Area Planning in Cellular networks. International Journal on Applications of Graph Theory In Wireless Ad Hoc Networks And Sensor Networks, 2(1), 1–7. https://doi.org/10.5121/jgraphhoc.2010.2101

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free