A Multi-objective Approach to Solve the Location Areas Problem
- 673 Downloads
The Public Land Mobile Networks (PLMN) are designed to provide anywhere, any kind, and anytime services to either static or moving users, therefore mobile location management is a fundamental tool in these systems. One of the techniques used in mobile location management is the location areas strategy, which set out the problem as an optimization problem with two costs, location update and paging. In this paper we resort to a multi-objective evolutionary algorithm, Non-dominated Sorting Genetic Algorithm II (NSGA-II), for finding quasi-optimal solutions of this optimization problem. At present, there is not any previous work that addresses the problem in a multi-objective manner, so we compare our results with those obtained by mono-objective algorithms from other authors. Results show that, for this problem, better solutions are achieved when each objective is treated separately.
KeywordsMobile Location Management Multi-Objective Optimization Non- Dominated Sorting Genetic Algorithm Location Areas Problem
Unable to display preview. Download preview PDF.
- 1.Taheri, J., Zomaya, A.: A genetic algorithm for finding optimal location area configurations for mobility management. In: Proceedings of the IEEE Conference on Local Computer Networks 30th Anniversary, pp. 568–577. IEEE Computer Society, Washington (2005)Google Scholar
- 5.Gondim, P.: Genetic algorithms and the location area partitioning problem in cellular networks. In: Proceedings of IEEE 46th Vehicular Technology Conference, ‘Mobile Technology for the Human Race’, vol. 3, pp. 1835–1838 (1996)Google Scholar