원문정보
보안공학연구지원센터(IJFGCN)
International Journal of Future Generation Communication and Networking
Vol.8 No.6
2015.12
pp.83-92
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
MRAGA (Multicast Routing Algorithm based on Genetic algorithm) for the Delay-Constrained Minimum-Energy Multicast Routing problem was presented. The genetic operators of this algorithm reduce the transmission delay and energy consumption of multicast trees, thus accelerating the convergence speed of the algorithm. Experiment results show that the multicast tree found by this algorithm not only guarantee the delay constraint, but also has the minimum energy consumption. Furthermore, this algorithm converges quickly.
목차
Abstract
1. Introduction
2. Problem Presentation
2.1. Creation of Network Model
2.2. Creation of Energy Consumption Model
3. Multicast Routing Algorithm Based on Genetic Algorithm (MRAGA)
3.1. Encoding
3.2. Population Initialization
3.3 Fitness Function
3.4. Selective Operator
3.5. Crossover Operator
3.6. Mutation Operator
4. Comparisons with Other Algorithms
4.1. Coding Way
4.2 Selection Model
4.3. Crossover Operator
4.4 Mutation Operator
5. Experiment Design and Discussion
5.1. The Experimental Setup
5.2. Performance Evaluation Indicators of Algorithms
5.3. Routing SR Comparison
5.4. Comparison of Energy Consumption
5.5 Comparison of Running Time
5. Conclusion
References
1. Introduction
2. Problem Presentation
2.1. Creation of Network Model
2.2. Creation of Energy Consumption Model
3. Multicast Routing Algorithm Based on Genetic Algorithm (MRAGA)
3.1. Encoding
3.2. Population Initialization
3.3 Fitness Function
3.4. Selective Operator
3.5. Crossover Operator
3.6. Mutation Operator
4. Comparisons with Other Algorithms
4.1. Coding Way
4.2 Selection Model
4.3. Crossover Operator
4.4 Mutation Operator
5. Experiment Design and Discussion
5.1. The Experimental Setup
5.2. Performance Evaluation Indicators of Algorithms
5.3. Routing SR Comparison
5.4. Comparison of Energy Consumption
5.5 Comparison of Running Time
5. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보