Simulated Annealing for Location Area Planning in Cellular networks
DOI: 10.5121/jgraphhoc.2010.2101 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks, 2010. Verfasst von Prajapati N. B. und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref).
Abstract (Originalsprache)
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.
Zitieren
APA
B., P. N., R, A. R., & I, H. M. (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. https://doi.org/10.5121/jgraphhoc.2010.2101
Vancouver
B. PN, R AR, I HM. Simulated Annealing for Location Area Planning in Cellular networks. International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks. 2010. doi:10.5121/jgraphhoc.2010.2101
BibTeX
@article{B2010,
author = {B., Prajapati N. and R, Agravat R. and I, Hasan M.},
title = {Simulated Annealing for Location Area Planning in Cellular networks},
journal = {International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks},
year = {2010},
doi = {10.5121/jgraphhoc.2010.2101}
}
EUVIMED