A Genetic Algorithm for Finding Optimal Location Area Configurations for Mobility Management

Authors:
Javid Taheri;Albert Y. Zomaya
Affiliations:
The University of Sydney;The University of Sydney
Venue:
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
Year:
2005

Citing 0
Cited 10

Clustering techniques for dynamic mobility management

Proceedings of the 4th ACM international workshop on Mobility management and wireless access
A Simulated Annealing approach for mobile location management

Computer Communications
Clustering techniques for dynamic location management in mobile computing

Journal of Parallel and Distributed Computing
New research in nature inspired algorithms for mobility management in GSM networks

Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Applying scatter search to the location areas problem

IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
Differential evolution for solving the mobile location management

Applied Soft Computing
A combined genetic-neural algorithm for mobility management

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fuzzy online location management in mobile computing environments

Journal of Parallel and Distributed Computing
A multi-objective approach to solve the location areas problem

TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
Solving the location areas scheme in realistic networks by using a multi-objective algorithm

EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation

Quantified Score

Hi-index	0.02

Visualization

Abstract

This work presents a new approach to solve the location management problem by using the location areas approach. A modified Genetic Algorithm is used to find the optimal configuration of location areas in a mobile network. The location areas configuration of the network is modeled so that the general condition of all the chromosomes of each population improves rapidly. Since a generic genetic algorithm will not be so efficient in solving this problem, several modifications have been made to the genetic optimizer to improve its performance. These modifications deal with the mutation operation where three types of mutation are considered after the crossover operation of the genetic algorithm. Simulation results are very promising and they lead to network configurations that are unanticipated.