Restricted dynamic Steiner trees for scalable multicast in datagram networks
IEEE/ACM Transactions on Networking (TON)
An iterative algorithm for delay-constrained minimum-cost multicasting
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
Ad Hoc Wireless Networks: Protocols and Systems
Ad Hoc Wireless Networks: Protocols and Systems
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Evolutionary Optimization in Dynamic Environments
Evolutionary Optimization in Dynamic Environments
A Comparative Study of Steady State and Generational Genetic Algorithms
Selected Papers from AISB Workshop on Evolutionary Computing
Ad Hoc Wireless Networks: Architectures and Protocols
Ad Hoc Wireless Networks: Architectures and Protocols
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
Soft Computing - A Fusion of Foundations, Methodologies and Applications
A self-organizing random immigrants genetic algorithm for dynamic optimization problems
Genetic Programming and Evolvable Machines
Proactive rearrangement in delay constrained dynamic membership multicast
Computer Communications
Designing Evolutionary Algorithms for Dynamic Environments
Designing Evolutionary Algorithms for Dynamic Environments
ICONIP'06 Proceedings of the 13th international conference on Neural information processing - Volume Part III
Fireworks: an adaptive group communications protocol for mobile ad hoc networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
IEEE Transactions on Evolutionary Computation
A real-time multicast routing algorithm for multimedia applications
Computer Communications
Distributed multicast tree generation with dynamic group membership
Computer Communications
Many-to-many multicast routing with temporal quality of service guarantees
IEEE Transactions on Computers
MAMCRA: a constrained-based multicast routing algorithm
Computer Communications
IEEE Network: The Magazine of Global Internetworking
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
Multicast over wireless mobile ad hoc networks: present and future directions
IEEE Network: The Magazine of Global Internetworking
Genetic algorithms for delays evaluation in networked automation systems
Engineering Applications of Artificial Intelligence
Green OLSR in VANETs with differential evolution
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Information Sciences: an International Journal
Hi-index | 0.00 |
In this paper, the problem of dynamic quality-of-service (QoS) multicast routing in mobile ad hoc networks is investigated. Lots of interesting works have been done on multicast since it is proved to be a NP-hard problem. However, most of them consider the static network scenarios only and the multicast tree cannot adapt to the topological changes. With the advancement in communication technologies, more and more wireless mobile networks appear, e.g., mobile ad hoc networks (MANETs). In a MANET, the network topology keeps changing due to its inherent characteristics such as the node mobility and energy conservation. Therefore, an effective multicast algorithm should track the topological changes and adapt the best multicast tree to the changes accordingly. In this paper, we propose to use genetic algorithms with immigrants schemes to solve the dynamic QoS multicast problem in MANETs. MANETs are considered as target systems because they represent a new generation of wireless networks. In the construction of the dynamic network environments, two models are proposed and investigated. One is named as the general dynamics model in which the topologies are changed due to that the nodes are scheduled to sleep or wake up. The other is named as the worst dynamics model, in which the topologies are altered because some links on the current best multicast tree are removed. Extensive experiments are conducted based on both of the dynamic network models. The experimental results show that these immigrants based genetic algorithms can quickly adapt to the environmental changes (i.e., the network topology changes) and produce high quality solutions following each change.