文档介绍：自适应组播路由算法研究
王冀鲁1,2,余镇危1,何胜利2,代万州1
(北京)计算机科学与技术系,北京,100083
,北京,100089
E-mail: wjlgax@, david_dwz@
摘要:所具有的分布式、多跳、自组织、动态拓扑、时变信道、资源受限等特点,中直接应用,的特点设计专门的组播路由算法和协议。组播路由的优点,提出一种基于贪婪覆盖集(Greedy Set Cover)组播路由算法ADMMR(Adaptive Distributed Multicast Route based on Greedy Set Cover),节点可以动态地、分布式计算各自的转发列表,根据转发列表进行组播数据的转发,节省有限的带宽,减少信道冲突,降低网络负载,提高算法的总体性能。验证了该算法的有效性。
关键词: 组播自适应分布式 ADMMR
An adaptive multicast routing for based on Greedy Cover Set
WANG Ji-Lu1,2,YU Zhen-Wei1,HE Sheng-Li2,DAI Wan-Zhou1
1. Department puter Science and Technology, Chinese University of Mining and Technology, Beijing, 100083, China
2. Computer center, Beijing Foreign Studies University, Beijing, 100089, China
Abstract:These special characteristics such as distributed, multi-hop, anizing, dynamic topology, time-variant channels, and limited resources etc make the traditional routing algorithms and protocols for works and centered works can’t be used in mobile ad works directly. So the appropriative multicast routing algorithms and protocols for mobile ad works must be designed. In the paper, Combining merits between the Mesh-based and the Tree-based multicast protocol, we proposed ADMMR protocol (Adaptive Distributed Multicast Route based on Greedy Set Cover), whose node putes forward list dynamically and distributed. This mechanics can save the limited bandwidth, decrease the channel