Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks

Engineering Applications of Artificial Intelligence

Volumn 23, Issue 5, 2010, Pages 806-819

  Cheng, Hui ^a   Yang, Shengxiang ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

Dynamic multicast; Dynamic optimization; Genetic algorithm; Immigrants scheme; Mobile ad hoc network

Indexed keywords

AD HOC NETWORKS; COMPUTATIONAL COMPLEXITY; FORESTRY; GENETIC ALGORITHMS; MOBILE TELECOMMUNICATION SYSTEMS; MULTICASTING; NETWORK ROUTING; OPTIMIZATION; QUALITY OF SERVICE; TOPOLOGY; TREES (MATHEMATICS); WIRELESS AD HOC NETWORKS; WIRELESS NETWORKS;

COMMUNICATION TECHNOLOGIES; DYNAMIC MULTICAST; DYNAMIC NETWORK ENVIRONMENT; DYNAMIC OPTIMIZATION; IMMIGRANTS SCHEME; INHERENT CHARACTERISTICS; MOBILE ADHOC NETWORK (MANETS); WIRELESS MOBILE NETWORKS;

MOBILE AD HOC NETWORKS;

ALGORITHMS; ELECTRICITY; FORESTRY; MATHEMATICS; NETWORKS; OPTIMIZATION; TREES;

EID: 79951957167     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2010.01.021     Document Type: Article

References (44)

1. Adelstein, F., Richard, G., Schwiebert, L., 2003. Distributed multicast tree generation with dynamic group membership. Comput. Commun. 26 (10), 1105-1128.
2. Aharoni, E., Cohen, R., 1998. Restricted dynamic Steiner trees for scalable multicast in datagram networks. IEEE/ACM Trans. Networking 6 (3), 286-297. (Pubitemid 128750047)
3. Ahn, C., Ramakrishna, R., 2002. A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans. Evol. Comput. 6 (6), 566-579.
4. Ahn, C., Ramakrishna, R., Kang, C., Choi, I., 2001. Shortest path routing algorithm using Hopfield neural network. Electron. Lett. 37 (19), 1176-1178. (Pubitemid 32909378)
5. Branke, J., 2002. Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers, Dordrecht.
6. Cordeiro, C., Gossain, H., Agrawal, D., 2003. Multicast over wireless mobile ad hoc networks: present and future directions. IEEE Network 17 (1), 52-59.
7. Din, D., 2005. Anycast routing and wavelength assignment problem on WDM network. 1E1CE Trans. Commun. E88-B (10), 3941-3951. (Pubitemid 41795208)
8. Gen, M., Cheng, R., 2000. Genetic Algorithms and Engineering Optimization. Wiley, New York.
9. Goldberg, D., 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, USA.
10. Grefenstette, J., 1992. Genetic algorithms for changing environments. In: Proceedings of the Second International Conference on Parallel Problem Solving from Nature, pp. 137-144.
11. Helvig, C., Robins, G., Zelikovsky, A., 2000. An improved approximation scheme for the group Steiner problem. Networks 37 (1), 8-20.
12. Holland, J., 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor.
13. Hwang, F., Richards, D., 1992. Steiner tree problems. Networks 22 (1), 55-89.
14. Jia, X., 1998. A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Trans. Networking 6 (6), 828-837. (Pubitemid 128745475)
15. Jia, X., Pissinou, N., Makki, K., 1997. A real-time multicast routing algorithm for multimedia applications. Comput. Commun. 20 (12), 1098-1106. (Pubitemid 127397010)
16. Khuller, S., Raghavachari, B., Young, N., 1995. Balancing minimum spanning and shortest path trees. Algorithmica 14 (4), 305-321.
17. Kuipers, F., Mieghem, P.V., 2002. MAMCRA: a constrained-based multicast routing algorithm. Comput. Commun. 25 (8), 802-811. (Pubitemid 34105517)
18. Law, L., Krishnamurthy, S.V., Faloutsos, M., 2005. Fireworks: an adaptive group communications protocol for mobile ad hoc networks. In: Proceedings of the Fourth IFIP Networking, pp. 853-868. (Pubitemid 41312847)
19. Lee, S., Soak, S., Kim, K., Park, H., Jeon, M., 2008. Statistical properties analysis of real world tournament selection in genetic algorithms. Appl. Intell. 28 (2), 195-2205.
20. Morrison, R.W., 2004. Designing Evolutionary Algorithms for Dynamic Environments. Springer, Berlin.
21. Narvaez, P., Siu, K.-Y., Tzeng, H.-Y., 2000. New dynamic algorithms for shortest path tree computation. IEEE/ACM Trans. Networking 8 (6), 734-746. (Pubitemid 32226992)
22. Oh, S., Ahn, C., Ramakrishna, R., 2006. A genetic-inspired multicast routing optimization algorithm with bandwidth and end-to-end delay constraints. In: Proceedings of the 13th International Conference on Neural Information Processing (ICONIP 2006), October, Lecture Notes in Computer Science, vol. 4234. Springer, Berlin, pp. 807-816. (Pubitemid 44699922)
23. Oliveira, C., Pardalos, P., 2005. A survey of combinatorial optimization problems in multicast routing. Comput. Oper. Res. 32 (8), 1953-1981.
24. Papadimitriou, C., Steiglitz, K., 1998. Combinatorial Optimization: Algorithms and Complexity. Dover Publications Inc, New York.
25. Parsa, M., Zhu, Q., Garcia-Luna-Aceves, J., 1998. An iterative algorithm for delay-constrained minimum-cost multicasting. IEEE/ACM Trans. Networking 6 (4), 461-474. (Pubitemid 128747931)
26. Perkins, C.E., 2001. Ad Hoc Networking. Addison-Wesley, London.
27. Robins, G., Zelikovsky, A., 2000. Improved Steiner tree approximation in graphs. In: Proceedings of the ACM/SIAM Symposium on Discrete Algorithms.
28. Siva Ram Murthy, C., Manoj, B.S., 2004. Ad Hoc Wireless Networks: Architectures and Protocols. Prentice-Hall PTR, Englewood Cliffs, NJ.
29. Tinos, R., Yang, S., 2007. A self-organizing random immigrants genetic algorithm for dynamic optimization problems. Genet. Program. Evol. Mach. 8 (3), 255-286. (Pubitemid 47255802)
30. Toh, C.-K., 2002. Ad Hoc Mobile Wireless Networks: Protocols and Systems. Prentice-Hall PTR, Englewood Cliffs, NJ.
31. Tyan, H.-Y., Hou, J.C., Wang, B., 2003. Many-to-many multicast routing with temporal quality of service guarantees. IEEE Trans. Comput. 52 (6), 826-832.
32. Vavak, F., Fogarty, T., 1996. A comparative study of steady state and generational genetic algorithms for use in nonstationary environments. In: Proceedings of the AISB Workshop on Evolutionary Computing, pp. 297-304. (Pubitemid 126129023)
33. Wang, B., Hou, J., 2000. A survey on multicast routing and its QoS extensions: problems, algorithms, and protocols. IEEE Network 14 (1), 22-36. (Pubitemid 30553490)
34. Wang, X., Cao, J., Cheng, H., Huang, M., 2006. QoS multicast routing for multimedia group communications using intelligent computational methods. Comput. Commun. 29 (12), 2217-2229. (Pubitemid 44041669)
35. Weicker, K., 2003. Evolutionary Algorithms and Dynamic Optimization Problems. Der andere Verlag, Osnabruck, Germany.
36. Xiao, X., Ni, L., 1999. Internet QoS: a big picture. IEEE Network 13, (2), 8-18.
37. Xue, G., 2003. Minimum-cost QoS multicast and unicast routing in communication networks. IEEE Trans. Commun. 51 (5), 817-824.
38. Yang, S., 2007. Genetic algorithms with elitism-based immigrants for changing optimization problems. In: Evoworkshops 2007: Applications of Evolutionary Computing. Lecture Notes in Computer Science, vol. 4448, pp. 627-636. (Pubitemid 47290121)
39. Yang, S., Tinos, R., 2007. A hybrid immigrants scheme for genetic algorithms in dynamic environments. Int. J. Automat. Comput. 4 (3), 243-254. (Pubitemid 47167351)
40. Yang, S., Yao, X., 2005. Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Comput. 9 (11), 815-834. (Pubitemid 43019030)
41. Yang, S., Yao, X., 2008. Population-based incremental learning with associative memory for dynamic environments. IEEE Trans. Evol. Comput. 12 (5), 542-561.
42. Yong, K., Poo, G., Cheng, T., 2008. Proactive rearrangement in delay constrained dynamic membership multicast. Comput. Commun. 31 (10), 2566-2580.
43. Yu, X., Tang, K., Yao, X., 2008. An immigrants scheme based on environmental information for genetic algorithms in changing environments. In: Proceedings of the 2008 Congress on Evolutionary Computing, pp. 1141-1147.
44. Yu, X., Tang, K., Chen, T., Yao, X., 2009. Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization. Memetic Comput. 1 (1), 3-24.