Computationally efficient algorithms for location area planning in future cellular systems

✍ Scribed by P. Demestichas; N. Georgantas; E. Tzifa; V. Demesticha; M. Striki; M. Kilanioti; M. Theologou

• Publisher: Elsevier Science
• Year: 2000
• Tongue: English
• Weight: 497 KB
• Volume: 23
• Category: Article
• ISSN: 0140-3664
• DOI: 10.1016/s0140-3664(00)00194-8

✦ Synopsis

Ef®cient resource utilisation in future cellular systems is related to the control of the signalling load imposed by the location update and paging operations. Important means for controlling this load is the ªproperº planning of location areas. In this paper we de®ne and solve a version of the location area planning problem. Starting from a formal de®nition and an optimal formulation of the problem, three computationally ef®cient algorithms, adhering to simulated annealing, taboo search, and genetic algorithm paradigm, are presented.