Registration area planning for PCS networks using genetic algorithms

In a personal communication service (PCS) network, the signaling traffic required to support user mobility is extremely high due to the huge numbers of users and the small sizes of cells. The requirement to minimize this traffic increases the importance of registration area (RA) planning in the PCS network design. In the literature, several heuristic algorithms have been proposed for RA planning, however, they may get trapped into local minima and may lack robustness. In this paper, we reformulate the problem of RA planning as a cost-optimization problem and propose genetic algorithms for RA planning in PCS networks. Simulation results show that genetic algorithms are robust for RA planning.

[1]  E. D. Sykas,et al.  Method for efficient location area planning in mobile telecommunications , 1993 .

[2]  D.C. Cox,et al.  Personal communications-a viewpoint , 1990, IEEE Communications Magazine.

[3]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[4]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[5]  Yi-Bing Lin,et al.  Eliminating the boundary effect of a large-scale personal communication service network simulation , 1994, TOMC.

[6]  Ravi Jain,et al.  A caching strategy to reduce network impacts of PCS , 1994, IEEE J. Sel. Areas Commun..

[7]  E. D. Sykas,et al.  Model for location updating and handover rate estimation in mobile telecommunications , 1993 .

[8]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  A. Gamst Application of graph theoretical methods to GSM radio network planning , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[10]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[11]  Yi-Bing Lin,et al.  Comparing the PCS location tracking strategies , 1996 .

[12]  Yi-Bing Lin Determining the user locations for personal communications services networks , 1994 .

[13]  J. Plehn,et al.  The design of location areas in a GSM-network , 1995, 1995 IEEE 45th Vehicular Technology Conference. Countdown to the Wireless Twenty-First Century.

[14]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  George L. Lyberopoulos,et al.  Evaluation of location area planning scenarios in future mobile telecommunication systems , 1995, Wirel. Networks.

[17]  William C. Y. Lee,et al.  Mobile Cellular Telecommunications Systems , 1989 .

[18]  William C. Y. Lee,et al.  Mobile Communications Design Fundamentals: Lee/Mobile , 1993 .

[19]  Ravi Jain,et al.  Two user location strategies for personal communications services , 1994, IEEE Personal Communications.