원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
This paper first describes the dynamic multicast routing and routing optimization standard, then puts forward the RPL protocol based energy efficient DODAG multicast routing algorithm. Through simulation experiments, we can compare and analyze the advantages and disadvantages of several kinds of dynamic multicast routing algorithm. And according to the simulation results obtained conclusion, EE - DODAG multicast in the process of each packet sent after more a small amount of forwarding nodes, and consume less energy in survival time.
목차
Abstract
1. Introduction
2. Description of the Dynamic Multicast Routing Problem
3. Comparison of Several Non-Rearranged Dynamic Multicast Routing Algorithms Based on QoS
3.1. Greedy” Algorithm and Weighted “Greedy” Algorithm
3.2. Dynamic Multicast Routing Algorithm Based on Minimum Spanning Tree
3.2. Description of Delay Constrained Dynamic Multicast Routing Problem
3.4. Performance Analyses
4. DODAG Energy Efficient Multicast Routing Algorithm Based RPL Protocol
4.1. Issues Raised
4.2. Algorithm Description
4.3. Total Energy Simulation Analysis
5. Conclusions
Acknowledgements
References
1. Introduction
2. Description of the Dynamic Multicast Routing Problem
3. Comparison of Several Non-Rearranged Dynamic Multicast Routing Algorithms Based on QoS
3.1. Greedy” Algorithm and Weighted “Greedy” Algorithm
3.2. Dynamic Multicast Routing Algorithm Based on Minimum Spanning Tree
3.2. Description of Delay Constrained Dynamic Multicast Routing Problem
3.4. Performance Analyses
4. DODAG Energy Efficient Multicast Routing Algorithm Based RPL Protocol
4.1. Issues Raised
4.2. Algorithm Description
4.3. Total Energy Simulation Analysis
5. Conclusions
Acknowledgements
References
키워드
저자정보
참고문헌
자료제공 : 네이버학술정보