This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Comparison of Three Artificial Life Techniques for Reporting Cell Planning in Mobile Computing
February 2003 (vol. 14 no. 2)
pp. 142-153

Abstract—Location management is a very important and complex problem in today's mobile computing environments. There is a need to develop algorithms that could capture this complexity yet can be easily implemented and used to solve a wide range of location management scenarios. Artificial life techniques have been used to solve a wide range of complex problems in recent times. The power of these techniques stems from their capability in searching large search spaces, which arise in many combinatorial optimization problems, very efficiently. This paper compares several well-known artificial life techniques to gauge their suitability for solving location management problems. Due to their popularity and robustness, a Genetic algorithm (GA), tabu search (TS), and ant colony algorithm (ACA) are used to solve the reporting cells planning problem. In the reporting cell location management scheme, some cells in the network are designated as reporting cells; mobile terminals update their positions (location update) upon entering one of these reporting cells. To create such a planner, a GA, TS, as well as several different AC algorithms are implemented. The effectiveness of each algorithm is shown for a number of test problems.

[1] H.S. Abdinnour and S.W. Hadley, “Tabu Search Based Heuristics for Multi-Floor Facility Layout,” Int'l J. Production Research, vol. 38, pp. 365-383, 2000.
[2] M.A. Abido, “A Novel Approach to Conventional Power System Stabilizer Design Using Tabu Search,” Int'l J. Electrical Power and Energy Systems, vol. 21, pp. 443-454, 1999.
[3] P.J. Agrell, M. Sun, and A. Stam, “A Tabu Search Multi-Criteria Decision Model for Facility Location Planning,” Proc. Decision Sciences Inst., 1997.
[4] M.A.S. Al, “Commercial Applications of Tabu Search Heuristics,” Proc. IEEE Int'l Conf. Systems, Man, and Cybernetics, 1998.
[5] V.R. Alvarez, E. Crespo, and J.M. Tamarit, “Assigning Students to Course Sections Using Tabu Search,” Ann. Operations Research, vol. 96, pp. 1-16, 2000.
[6] N.A. Bar and I. Kessler, “Tracking Mobile Users in Wireless Communications Networks,” IEEE Trans. Information Theory, vol. 39, pp. 1877-1886, 1993.
[7] G. Barbarosoglu and D. Ozgur, “A Tabu Search Algorithm for the Vehicle Routing Problem,” Computers and Operations Research, vol. 26, pp. 255-270, 1999.
[8] B. Bullnheimer, R.F. Hartl, and C. Strauss, “An Improved Ant System Algorithm for the Vehicle Routing Problem,” Ann. Operations Research, vol. 89, pp. 319-328, 1999.
[9] M.F. Catedra and J.P. Arriaga, Cell Planning for Wireless Communications. Boston, Mass.: Artech House, 1999.
[10] A. Colorni, M. Dorigo, and V. Maniezzo, “Distributed Optimization by Ant Colonies,” Proc. First European Conf. Artificial Life, 1991.
[11] D. Costa and A. Hertz, “Ants Can Colour Graphs,” J. Operational Research Soc., vol. 48, pp. 295-305, 1997.
[12] M. Dorigo and C.G. Di, “Ant Colony Optimization: A New Meta-Heuristic,” Proc. 1999 Congress on Evolutionary Computation, 1999.
[13] M. Dorigo, C.G. Di, and L.M. Gambardella, “Ant Algorithms for Discrete Optimization,” Artificial Life, vol. 5, pp. 137-172, 1999.
[14] M. Dorigo, V. Maniezzo, and A. Colorni, “The Ant System: Optimization by a Colony of Cooperating Agents,” IEEE Trans. Systems, Man and Cybernetics, Part B (Cybernetics), vol. 26, pp. 29-41, 1996.
[15] F. Glover, “Future Paths for Integer Programming and Links to Artificial Intelligence,” Computers and Operations Research, vol. 13, pp. 533-549, 1986.
[16] F. Glover, “Tabu Search. I,” ORSA J. Computing, vol. 1, pp. 190-206, 1989.
[17] F. Glover, “Tabu Search. II,” ORSA J. Computing, vol. 2, pp. 4-32, 1990.
[18] F. Glover, J.P. Kelly, and M. Laguna, “Genetic Algorithms and Tabu Search: Hybrids for Optimization,” Computers and Operations Research, vol. 22, pp. 111-134, 1995.
[19] F. Glover and M. Laguma, “Tabu Search,” Handbook of Combinatorial Optimization, D. Du and P.M. Pardalos, eds., vol. 3, pp. 621-757, 1999.
[20] F. Glover, M. Laguma, and R. Marti, “Fundamentals of Scatter Search and Path Relinking,” Control and Cybernetics, vol. 29, pp. 653-684, 2000.
[21] F. Glover, E. Taillard, and D. de Werra, “A User's Guide to Tabu Search,” Annals of Operations Research, vol. 41, pp. 3-28, 1993.
[22] D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, Mass.: Addison-Wesley, 1989.
[23] P.R.L. Gondim, “Genetic Algorithms and the Location Area Partitioning Problem in Cellular Networks,” Proc. IEEE 46th Vehicular Technology Conf., 1996.
[24] L. Guoying and L. Zemin, “Multicast Routing Based on Ant-Algorithm with Delay and Delay Variation Constraints,” Proc. IEEE Asia Pacific Conf. Circuits and Systems Electronic Comm. Systems, 2000.
[25] A. Hac and X. Zhou, “Locating Strategies for Personal Communication Networks, A Novel Tracking Strategy,” IEEE J. Selected Areas in Comm., vol. 15, pp. 1425-1436, 1997.
[26] A. Hertz and D. de Werra, “Using Tabu Search Techniques for Graph Coloring,” Computing, vol. 39, pp. 345-351, 1987.
[27] A. Hertz, E. Taillard, and D. de Werra, “Tabu Search,” Local Search in Combinatorial Optimization, E. Aarts and J.K. Lenstra, eds., Chichester: John Wiley and Sons, pp. 121-136, 1997.
[28] J.H. Holland, Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, 1975.
[29] T. Imielinski and B.R. Badrinath, “Querying Locations in Wireless Environments,” Proc. Wireless Comm. Future Directions, 1992.
[30] C.L. Karr and L.M. Freeman, Industrial Applications of Genetic Algorithms. Boca Raton, Fl: CRC Press, 1999.
[31] V. Maniezzo and A. Colorni, “The Ant System Applied to the Quadratic Assignment Problem,” IEEE Trans. Knowledge and Data Eng., vol. 11, pp. 769-778, 1999.
[32] Z. Miachalewicz, Genetic Algorithm + Data Structure = Evolution Programming, Springer-Verlag, New York, 1992.
[33] R. Michel and M. Middendorf, “An Island Model-Based Ant System with Lookahead for the Shortest Supersequence Problem,” Proc. Parallel Problem Solving from Nature PPSN V Fifth Int'l Conf., 1998.
[34] M. Mitchell, An Introduction to Genetic Algorithms. MIT Press, 1996.
[35] S. Okasaka, S. Onoe, S. Yasuda, and A. Maebara, “A New Location Updating Method for Digital Cellular Systems,” Proc. 41st IEEE Vehicular Technology Conf., 1991.
[36] D. Plassmann, “Location Management Strategies for Mobile Cellular Networks of 3rd Generation,” Proc. IEEE 44th Vehicular Technology Conf., 1994.
[37] T.S. Rappaport, Cellular Radio and Personal Communications: Selected Readings. Piscataway, N.J.: IEEE, 1995.
[38] G.L. Stuber, Principles of Mobile Communication. Boston: Kluwer Academic, 1996.
[39] R. Subrata and A.Y. Zomaya, “Location Management in Mobile Computing,” Proc. ACS/IEEE Int'l Conf. Computer Systems and Applications, 2001.
[40] M.D. Vose, The Simple Genetic Algorithm: Foundations and Theory. Cambridge, Mass.: MIT Press, 1999.
[41] H. Xie, S. Tabbane, and D. Goodman, “Dynamic Location Area Management and Performance Analysis,” Proc. 43rd IEEE Vehicular Technology Conf., pp. 533-539, May 1993.
[42] K.L. Yeung and T.S.P. Yum, “A Comparative Study on Location Tracking Strategies in Cellular Mobile Radio Systems,” Proc. IEEE Global Telecomm. Conf., 1995.
[43] K.K. Yu, “A Quasi-Static Cluster-Computing Approach for Dynamic Channel Assignment in Cellular Mobile Communication Systems,” Proc. IEEE VTS 50th Vehicular Technology Conf., 1999.

Index Terms:
Ant colony algorithm, genetic algorithm, mobile computing, mobility management, and tabu search.
Citation:
Riky Subrata, Albert Y. Zomaya, "A Comparison of Three Artificial Life Techniques for Reporting Cell Planning in Mobile Computing," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 2, pp. 142-153, Feb. 2003, doi:10.1109/TPDS.2003.1178878
Usage of this product signifies your acceptance of the Terms of Use.