Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 432686, 13 pages
http://dx.doi.org/10.1155/2013/432686
Research Article

Minimum Cost Multicast Routing Using Ant Colony Optimization Algorithm

Department of Computer Science, Sun Yat-sen University, Key Laboratory of Intelligent Sensor Networks, Ministry of Education, Key Laboratory of Software Technology, Education Department of Guangdong Province, Guangzhou 510006, Guangdong Province, China

Received 7 February 2013; Accepted 18 April 2013

Academic Editor: Yuping Wang

Copyright © 2013 Xiao-Min Hu and Jun Zhang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. K. Bharath-Kumar and J. M. Jaffe, “Routing to multiple destinations in computer networks,” IEEE Transactions on Communications, vol. 31, no. 3, pp. 343–351, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. Y. Yang, J. Wang, and M. Yang, “A service-centric multicast architecture and routing protocol,” IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 1, pp. 35–51, 2008. View at Publisher · View at Google Scholar · View at Scopus
  3. D.-N. Yang and W. J. Liao, “On bandwidth-efficient overlay multicast,” IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 11, pp. 1503–1515, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. A. Ganjam and H. Zhang, “Internet multicast video delivery,” Proceedings of the IEEE, vol. 93, no. 1, pp. 159–170, 2005. View at Publisher · View at Google Scholar · View at Scopus
  5. D.-N. Yang and M.-S. Chen, “Efficient resource allocation for wireless multicast,” IEEE Transactions on Mobile Computing, vol. 7, no. 4, pp. 387–400, 2008. View at Publisher · View at Google Scholar · View at Scopus
  6. S. Guo and O. Yang, “Localized operations for distributed minimum energy multicast algorithm in mobile ad hoc networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 2, pp. 186–198, 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. J. A. Sanchez, P. M. Ruiz, J. Liu, and I. Stojmenovic, “Bandwidth-efficient geographic multicast routing protocol for wireless sensor networks,” IEEE Sensors Journal, vol. 7, no. 5, pp. 627–636, 2007. View at Publisher · View at Google Scholar · View at Scopus
  8. F. Filali, G. Aniba, and W. Dabbous, “Efficient support of IP multicast in the next generation of GEO satellites,” IEEE Journal on Selected Areas in Communications, vol. 22, no. 2, pp. 413–425, 2004. View at Publisher · View at Google Scholar · View at Scopus
  9. E. Ekici, I. F. Akyildiz, and M. D. Bender, “A multicast routing algorithm for LEO satellite IP networks,” IEEE/ACM Transactions on Networking, vol. 10, no. 2, pp. 183–192, 2002. View at Publisher · View at Google Scholar · View at Scopus
  10. E. N. Gilbert and H. O. Pollak, “Steiner minimal trees,” SIAM Journal on Applied Mathematics, vol. 16, pp. 1–29, 1968. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman and Co., San Francisco, Calif, USA, 1979. View at MathSciNet
  12. L. Kou, G. Markowsky, and L. Berman, “A fast algorithm for Steiner trees,” Acta Informatica, vol. 15, no. 2, pp. 141–145, 1981. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. V. J. Rayward-Smith and A. Clare, “On finding Steiner vertices,” Networks, vol. 16, no. 3, pp. 283–294, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. V. J. Rayward-Smith, “The computation of nearly minimal Steiner trees in graphs,” International Journal of Mathematical Education in Science and Technology, vol. 14, no. 1, pp. 15–23, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. P. Winter and J. M. Smith, “Path-distance heuristics for the Steiner problem in undirected networks,” Algorithmica, vol. 7, no. 2-3, pp. 309–327, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  16. E. Gelenbe, A. Ghanwani, and V. Srinivasan, “Improved neural heuristics for multicast routing,” IEEE Journal on Selected Areas in Communications, vol. 15, no. 2, pp. 147–155, 1997. View at Publisher · View at Google Scholar · View at Scopus
  17. Y. Leung, G. Li, and Z.-B. Xu, “A genetic algorithm for the multiple destination routing problems,” IEEE Transactions on Evolutionary Computation, vol. 2, no. 4, pp. 150–161, 1998. View at Publisher · View at Google Scholar · View at Scopus
  18. M. Dorigo and T. Stützle, Ant Colony Optimization, MIT Press, Cambridge, Mass, USA, 2004.
  19. M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 26, no. 1, pp. 29–41, 1996. View at Publisher · View at Google Scholar · View at Scopus
  20. M. Dorigo and L. M. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53–66, 1997. View at Publisher · View at Google Scholar · View at Scopus
  21. C. Solnon, “Ants can solve constraint satisfaction problems,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 4, pp. 347–357, 2002. View at Publisher · View at Google Scholar · View at Scopus
  22. Y.-C. Liang and A. E. Smith, “An ant colony optimization algorithm for the redundancy allocation problem (RAP),” IEEE Transactions on Reliability, vol. 53, no. 3, pp. 417–423, 2004. View at Publisher · View at Google Scholar · View at Scopus
  23. W.-N. Chen and J. Zhang, “Ant colony optimization for software project scheduling and staffing with an event-based scheduler,” IEEE Transactions on Software Engineering, vol. 39, no. 1, pp. 1–17, 2013. View at Publisher · View at Google Scholar
  24. W. N. Chen, J. Zhang, H. S. H. Chung, R. Z. Huang, and O. Liu, “Optimizing discounted cash flows in project scheduling-an ant colony optimization approach,” IEEE Transactions on Systems, Man and Cybernetics C, vol. 40, no. 1, pp. 64–77, 2010. View at Publisher · View at Google Scholar · View at Scopus
  25. S. Guo, H.-Z. Huang, Z. Wang, and M. Xie, “Grid service reliability modeling and optimal task scheduling considering fault recovery,” IEEE Transactions on Reliability, vol. 60, no. 1, pp. 263–274, 2011. View at Publisher · View at Google Scholar · View at Scopus
  26. W.-N. Chen and J. Zhang, “An ant colony optimization approach to a grid workflow scheduling problem with various QoS requirements,” IEEE Transactions on Systems, Man and Cybernetics C, vol. 39, no. 1, pp. 29–43, 2009. View at Publisher · View at Google Scholar · View at Scopus
  27. D. Merkle, M. Middendorf, and H. Schmeck, “Ant colony optimization for resource-constrained project scheduling,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 4, pp. 333–346, 2002. View at Publisher · View at Google Scholar · View at Scopus
  28. R. S. Parpinelli, H. S. Lopes, and A. A. Freitas, “Data mining with an ant colony optimization algorithm,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 4, pp. 321–332, 2002. View at Publisher · View at Google Scholar · View at Scopus
  29. D. Martens, M. de Backer, R. Haesen, J. Vanthienen, M. Snoeck, and B. Baesens, “Classification with ant colony optimization,” IEEE Transactions on Evolutionary Computation, vol. 11, no. 5, pp. 651–665, 2007. View at Publisher · View at Google Scholar · View at Scopus
  30. A. C. Zecchin, A. R. Simpson, H. R. Maier, and J. B. Nixon, “Parametric study for an ant algorithm applied to water distribution system optimization,” IEEE Transactions on Evolutionary Computation, vol. 9, no. 2, pp. 175–191, 2005. View at Publisher · View at Google Scholar · View at Scopus
  31. J. Zhang, H. S.-H. Chung, A. W.-L. Lo, and T. Huang, “Extended ant colony optimization algorithm for power electronic circuit design,” IEEE Transactions on Power Electronics, vol. 24, no. 1, pp. 147–162, 2009. View at Publisher · View at Google Scholar · View at Scopus
  32. A. Konak and S. Kulturel-Konak, “Reliable server assignment in networks using nature inspired metaheuristics,” IEEE Transactions on Reliability, vol. 60, no. 2, pp. 381–393, 2011. View at Publisher · View at Google Scholar · View at Scopus
  33. K. M. Sim and W. H. Sun, “Ant colony optimization for routing and load-balancing: survey and new directions,” IEEE Transactions on Systems, Man, and Cybernetics A, vol. 33, no. 5, pp. 560–572, 2003. View at Publisher · View at Google Scholar · View at Scopus
  34. R. Schoonderwoerd, O. Holland, and J. Bruten, “Ant-like agents for load balancing in telecommunications networks,” in Proceedings of the 1st International Conference on Autonomous Agents (Agents '97), pp. 209–216, New York, NY, USA, February 1997. View at Scopus
  35. G. di Caro and M. Dorigo, “AntNet: distributed stigmergetic control for communications networks,” Journal of Artificial Intelligence Research, vol. 9, pp. 317–365, 1998. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  36. S. S. Iyengar, H.-C. Wu, N. Balakrishnan, and S. Y. Chang, “Biologically inspired cooperative routing for wireless mobile sensor networks,” IEEE Systems Journal, vol. 1, no. 1, pp. 29–37, 2007. View at Publisher · View at Google Scholar
  37. O. H. Hussein, T. N. Saadawi, and M. J. Lee, “Probability routing algorithm for mobile ad hoc networks' resources management,” IEEE Journal on Selected Areas in Communications, vol. 23, no. 12, pp. 2248–2259, 2005. View at Publisher · View at Google Scholar · View at Scopus
  38. G. Singh, S. Das, S. V. Gosavi, and S. Pujar, “Ant colony algorithms for Steiner trees: an application to routing in sensor networks,” in Recent Developments in Biologically Inspired Computing, L. N. de Castro and F. J. von Zuben, Eds., pp. 181–206, Idea Group Publishing, Hershey, Pa, USA, 2004. View at Google Scholar
  39. C.-C. Shen and C. Jaikaeo, “Ad hoc multicast routing algorithm with swarm intelligence,” Mobile Networks and Applications, vol. 10, no. 1, pp. 47–59, 2005. View at Publisher · View at Google Scholar · View at Scopus
  40. C.-C. Shen, K. Li, C. Jaikaeo, and V. Sridhara, “Ant-based distributed constrained steiner tree algorithm for jointly conserving energy and bounding delay in ad hoc multicast routing,” ACM Transactions on Autonomous and Adaptive Systems, vol. 3, no. 1, article 3, 2008. View at Publisher · View at Google Scholar · View at Scopus
  41. R. C. Prim, “Shortest connection networks and some generalizations,” Bell System Technical Journal, vol. 36, pp. 1389–1401, 1957. View at Google Scholar
  42. R. W. Floyd, “Shortest path,” Communications of the ACM, vol. 5, no. 6, p. 345, 1962. View at Google Scholar
  43. T. Stützle and M. Dorigo, “A short convergence proof for a class of ant colony optimization algorithms,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 4, pp. 358–365, 2002. View at Publisher · View at Google Scholar · View at Scopus
  44. J. E. Beasley, “OR-Library: distributing test problems by electronic mail,” Journal of Operational Research Society, vol. 41, no. 11, pp. 1069–1072, 1990. View at Google Scholar
  45. M. Birattari, T. Stützle, L. Paquete, and K. Varrentrapp, “A racing algorithm for configuring metaheuristics,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '02), pp. 11–18, 2002.