Earticle

초록

영어

MaxNLMRGA (Max Network-Lifetime Multicast Routing Algorithm based on Genetic algorithm) for the NLMR (Network-Lifetime Multicast Routing) problem was presented. The genetic operators of this algorithm reduce the transmission cost and energy consumption of multicast trees, and mutation operator prolongs the network lifetime, thus accelerating the convergence speed of the algorithm. Experiment results show that the multicast tree found by this algorithm not only has the minimum transmission cost, but also has the longest network lifetime. Furthermore, this algorithm converges quickly.

목차

Abstract
 1. Introduction
 2 Problem Presentation
  2.1 Creation of Network Model
  2.2 Establishment of Network Lifetime Model
  2.3 Network Lifetime Minimum Cost Multicast Routing Problem
 3. Max Network-Lifetime Multicast Routing Algorithm based onGenetic algorithm (MaxNLMRGA)
  3.1. Encoding
  3.2. Population Initialization
  3.3 Fitness Function
  3.4 Selective Operator
  3.5 Crossover Operator
  3.6 Mutation Operator
 4. Comparison 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 Transmission Cost Ratio Comparison
  5.4 Network Lifetime Ratio Comparison
  5.5 Running Time Comparison
 6. Conclusion
 Acknowledgement
 References

키워드

저자

• Cai Jingying [ Institute of Engineering, Mudanjiang Normal University Mudanjiang 157011, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605