Abstract
This chapter uses an ant colony meta-heuristic to optimally load balance code divisionmultiple access micro-cellular mobile communication systems. Load balancing is achieved by assigning each micro-cell to a sector.The cost function considers handoff cost and blocked calls cost, while the sectorization must meet a minimum level of compactness. The problem is formulated as a routing problem where the route of a single ant creates a sector of micro-cells. There is an ant for each sector in the system, multiple ants comprise a colony and multiple colonies operate to find the sectorization with the lowest cost. It is shown that the method is effective and highly reliable, and is computationally practical even for large problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brown, E.C. and Vrobleski, M. (2004), A grouping genetic algorithm for the microcell sectorization problem, Engineering Applications of Artificial Intelligence, Vol. 17:589–598
Chan, T. M, Kwong, S, Man, K. F, and Tang, K. S (2002), Hard handoff minimization using genetic algorithms, Signal Processing, Vol. 82:1047–1058
Chu, C., JunHua Gu, J., Xiang Dan Hou, X., and Gu, Q. (2002), A heuristic ant algorithm for solving QoS multicast routing problem, Proceedings of the 2002 Congress on Evolutionary Computation, Vol. 2:1630–1635
Demirkol, I., Ersoy, C., Caglayan, M.U. and Delic, H. (2004), Location area planning and Dell-to-Switch assignment in cellular networks, IEEE Transactions on Wireless Communications, Vol. 3, No. 3:880–890
Dorigo, M. (1992), Optimization, Learning and Natural Algorithms, PhD Thesis, Politecnico di Milano, Italy
Dorigo, M. and Di Caro, G. (1999), The ant colony optimization meta-heuristic, in D. Corne, M. Dorigo and F. Glover (eds), New Ideas in Optimization, McGraw-Hill, 11–32
Dorigo, M. Di Caro, G., and Gambardella, L. M. (1999), Ant algorithms for discrete optimization, Artificial Life, Vol. 5, No. 2:137–172
Dorigo, M., Maniezzo, V. and Colorni, A., (1996), Ant system: optimization by a colony of cooperating gents, IEEE Trans. on Systems, Man, and Cybernetics-Part B: Cybernetics, Vol. 26, No 1:29–41
Dorigo, M., Gambardella, L. M. (1997), Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Trans. on Evolutionary Computation, Vol. 1, No 1:53–66
Fournier, J.R.L. and Pierre, S. (2005), Assigning cells to switches in mobile networks using an ant colony optimization heuristic, Computer Communication, Vol. 28:65–73
Garey, M. R., Johnson, S. H., and Stockmeyer L. (1976), Some simplified NP-complete graph problems, Theoretical Computer Science, Vol. 1:237–267
Gunes, M., Sorges, U., and Bouazizi, I. (2002), ARA-the ant-colony based routing algorithm for MANETs, Proceedings of International Conference on Parallel Processing Workshops, 79–85
Kim, M. and Kim, J (1997), The facility location problems for minimizing CDMA hard handoffs, Proceedings of Global Telecommunications Conference, IEEE, Vol. 3:1611–1615
Lee, Chae Y., Kang, Hyon G., and Park, Taehoon (2002), A dynamic sectorization of micro cells for balanced traffic in CDMA: genetic algorithms approach, IEEE Trans. on Vehicular Technology, Vol.51, No.1:63–72
Liu, Y., Wu, J., Xu, K. and Xu, M. (2003), The degree-constrained multicasting algorithm using ant algorithm, IEEE 10th International Conference on Telecommunications, Vol. 1:370–374
Montemanni, R., Smith, D.H. and Allen, S. M. (2002), An ANTS algorithm for the minimum-span frequency assignment problem with multiple interference, IEEE Trans. on Vehicular Technology, Vol. 51, No. 5:949–953
Shyu, S.J., Lin, B.M.T., Hsiao, T.S. (2004), An ant algorithm for cell assignment in PCS networks, IEEE International Conference on Networking, Sensing and Control, Vol. 2:1081–1086
Shyu, S. J., Lin, B.M.T. and Hsiao, T.-S. (2006), Ant colony optimization for the cell assignment problem in PCS networks, Computers & Operations Research, Vol. 33:1713–1740
Sim, S.M. and Sun, W. H. (2003), Ant colony optimization for routing and load-balancing: survey and new directions, IEEE Trans. on Systems, Man and Cybernetics, Part A, Vol. 33, No. 5:560–572
Subing, Z and Zemin, L (2001), A Qos routing algorithm based on ant algorithm, IEEE International Conference on Communications, Vol. 5:1581–1585
Subrata, R. and Zomaya, A. Y. (2003), 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:142–153
Vroblefski, M. and Brown, E. C. (2006), A grouping genetic algorithm for registration area planning, Omega, Vol. 34:220–230
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kim, SS., Smith, A., Hong, SJ. (2007). Dynamic Load Balancing Using an Ant Colony Approach in Micro-cellular Mobile Communications Systems. In: Siarry, P., Michalewicz, Z. (eds) Advances in Metaheuristics for Hard Optimization. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72960-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-72960-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72959-4
Online ISBN: 978-3-540-72960-0
eBook Packages: Computer ScienceComputer Science (R0)