earticle

논문검색

Multicast Routing Algorithm of Network Lifetime

초록

영어

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

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.