International Journal of Soft Computing
ISSN: OnlineISSN: Print 1816-9503
Abstract
In this study, we investigate a specific optimization problem involving the optimal assignment of mobile base stations to switches which minimize cost. This assumes that all base stations locations are fixed and known. The cost has two components, one is the cost of handoffs that involves two switches and the other is the cost of cabling. This problem is modeled as a complex integer programming problem and it is an NP-hard problem which, for real size mobile networks, could not be solved using exact methods. Well-known in the literature as an NP-hard combinatorial optimization problem, this problem requires recourse to heuristic methods in order to obtain good (not necessarily optimal) solutions within a practical amount of time. In this context, heuristic approaches a Genetic Algorithm (GA) can be used. This study proposes a genetic algorithm to solve this problem. The implementation of this algorithm has been subject to extensive tests. The result obtained confirms the efficiency and the effectiveness of GA to provide good solutions for moderate- and large-sized cellular mobile networks. The goals and the present status of our research are also discussed.
How to cite this article:
Sakthivel, S. and R. Suresh . A Genetic Algorithm Approach for Assigning Mobile Base Stations to Switches in Cellular Mobile Networks.
DOI: https://doi.org/10.36478/ijscomp.2006.166.169
URL: https://www.makhillpublications.co/view-article/1816-9503/ijscomp.2006.166.169