Comparative Study of Various Cooling Schedules for Location Area Planning in Cellular Networks Using Simulated Annealing

Autor:	Nilesh B. Prajapati, Rupal R. Agravat, Mosin I. Hasan
Rok vydání:	2009
Předmět:	Base station GSM Computer science Mobile station Simulated annealing Real-time computing Cellular network Paging Base station subsystem Adaptive simulated annealing
Zdroj:	NetCoM
DOI:	10.1109/netcom.2009.60
Popis:	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. For getting optimal results, LA planning, various cooling schedules are used in simulated annealing algorithm.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::167e035fd7c04f7e354f91d706192dab https://doi.org/10.1109/netcom.2009.60 Zobrazit plný text záznamu