基于泛洪约束的MANET按需组播路由协议  

On-Demand Multicast Routing Protocol with Constrained Flooding for Mobile Ad hoc Networks

作　　者：江国星[1] 梅锐[1] 

机构地区：[1]华中科技大学电子与信息工程系,武汉430074

出　　处：《电子与信息学报》2010年第2期278-283,共6页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(60502023)资助课题

摘　　要：降低路由控制开销是MANET网络组播路由协议节省节点能量,提高带宽利用率的关键因素之一。本文研究了组播路径近邻节点对路由维护的作用以及链路的连通性,分别提出了一个新的k-泛洪约束算法和一个混合泛洪模式。基于k-泛洪约束算法和混合泛洪模式,提出一个新的按需组播路由协议ODMRP-CF,ODMRP-CF协议通过选择k-路由近邻节点转发泛洪分组来提高泛洪效率。ODMRP-CF协议不仅保持了ODMRP协议所具有的简单,对节点移动鲁棒性好的优点,而且有效地降低了ODMRP-CF协议的控制开销。In Mobile Ad hoc Networks （MANET）, it is one of the dominant factors saving a node＇s battery power and improving the efficiency of network bandwidth to reduce the routing overhead for a multicast routing protocol. The roles of some nodes near the paths in the maintenance of multicasting paths and the link connectivity are studied, a local flooding algorithm, namely k-constrained flooding algorithm, and a mixed flooding pattern are presented, and then a new multicast routing protocol, which is called the On-Demand Multicast Routing Protocol with Constrained Flooding （ODMRP-CF）, is also proposed in this paper. In ODMRP-CF, only k-nodes near the paths can be selected to forward the control packets to enhance the flooding efficiency. Simulation results show that the ODMRP-CF can reduce significantly control overhead while keeping similar packet delivery ratio to ODMRP.

关 键 词：移动自组织网络 组播 路由 泛洪 控制开销 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]