A grouping genetic algorithm for registration area planning

The enormous increase in wireless customers in recent years has taxed wireless network resources, in particular, the bandwidth available. The scarce bandwidth is not only consumed by placing and receiving calls on a portable, but by performing routine control functions to ensure universal service and increased quality of service. Among the control functions performed by a wireless network is finding the location of called mobiles. The registration area planning problem attempts to achieve this with minimal impact on the network's bandwidth. In this paper, we develop a grouping genetic algorithm to efficiently solve the registration area planning problem. The problem is NP-complete, therefore the literature has concentrated on heuristics to find good solutions in an acceptable time. The goal of registration area planning is to group wireless network cells into contiguous areas to minimize location update costs subject to paging bound and preset constraints. Therefore, the registration area planning problem is a grouping problem and grouping genetic algorithms, which have been shown to be a useful tool in solving these types of problems, are an applicable solution methodology. The proposed grouping genetic algorithm, GGARAP, has been extensively tested. Our results indicate that GGARAP is robust and finds good solutions for the registration area planning problem for a wide range of network situations. Furthermore, the computational effort involved in running GGARAP is minimal.

[1]  B. Sengupta,et al.  Assignment of cells to switches in PCS networks , 1995, TNET.

[2]  Hakan Deliç,et al.  Location area planning and cell-to-switch assignment in cellular networks , 2004, IEEE Transactions on Wireless Communications.

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

[4]  Robert T. Sumichrast,et al.  Evaluating performance advantages of grouping genetic algorithms , 2005, Eng. Appl. Artif. Intell..

[5]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[6]  Alain Delchambre,et al.  A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[7]  Israel Cidon,et al.  An efficient mobility management strategy for personal communication systems , 1998, MobiCom '98.

[8]  Nicole Immorlica,et al.  Efficient location area planning for personal communication systems , 2006, TNET.

[9]  Jano I. van Hemert,et al.  Graph Coloring with Adaptive Evolutionary Algorithms , 1998, J. Heuristics.

[10]  Gunar E. Liepins,et al.  Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.

[11]  Guang Wan,et al.  Cost reduction in location management using semi‐realtime movement information , 1999, Wirel. Networks.

[12]  Panagiotis Demestichas,et al.  Control of the location update and paging signaling load in cellular systems by means of planning tools , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[13]  Lashon B. Booker,et al.  Proceedings of the fourth international conference on Genetic algorithms , 1991 .

[14]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[15]  Israel Cidon,et al.  Efficient location management based on moving location areas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[16]  Amitava Mukherjee,et al.  Location area planning for personal communication services networks , 1999, MSWiM '99.

[17]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

[19]  Vicente Casares Giner,et al.  Reducing location update and paging costs in a PCS network , 2002, IEEE Trans. Wirel. Commun..

[20]  Christopher R. Houck,et al.  On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[21]  Apurva Kumar,et al.  Mobility modeling of rush hour traffic for location area design in cellular networks , 2000, WOWMOM '00.

[22]  Emanuel Falkenauer,et al.  The Grouping Genetic Algorithm , 1996 .

[23]  Nicholas J. Radcliffe,et al.  Forma Analysis and Random Respectful Recombination , 1991, ICGA.

[24]  Nicole Immorlica,et al.  Efficient location area planning for personal communication systems , 2003, IEEE/ACM Transactions on Networking.

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

[26]  Hakan Deliç,et al.  Location area planning in cellular networks using simulated annealing , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[27]  Thomas Kunz,et al.  The Peril of Evaluating Location Management Proposals through Simulations , 2001, Wirel. Networks.

[28]  Victor B. Kreng,et al.  Modular product design with grouping genetic algorithm - a case study , 2004, Comput. Ind. Eng..

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

[30]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

[31]  Amitava Mukherjee,et al.  Intelligent paging strategies for personal communication services network , 1999, MobiDe '99.

[32]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[33]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[34]  Cheng-Hong Yang,et al.  The effects of initial population in genetic search for time constrained traveling salesman problems , 1993, CSC '93.

[35]  Chien-Chao Tseng,et al.  Registration area planning for PCS networks using genetic algorithms , 1998 .

[36]  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.

[37]  Ian F. Akyildiz,et al.  Mobility Management in Next Generation Wireless Systems , 1999, ICCCN.

[38]  Evelyn C. Brown,et al.  CF-GGA: A grouping genetic algorithm for the cell formation problem , 2001 .