无线自组织覆盖网络协同单播路由算法  

Cooperative unicast routing algorithm for wireless self-organizing overlay network

作　　者：张丽[1] 吴志强[1] 曲攀[1] 

机构地区：[1]河南理工大学计算机科学与技术学院,河南焦作454003

出　　处：《计算机工程与设计》2013年第11期3806-3810,共5页Computer Engineering and Design

基　　金：国家自然科学基金项目(51174263);河南省科技厅重点科技攻关基金项目(122102210116);河南省高等教育教学改革课题基金项目(2012SJGLX121);河南理工大学博士基金项目(2010-84)

摘　　要：针对无线自组织网络的动态拓扑,以覆盖网络为基础提出协同单播路由算法AHR。AHR综合利用先应式和反应式路由的优点,由覆盖层节点发起,以网络层路由为依托,充分利用物理路径,先应维护的本地路由域中的节点对之间转发分组,没有任何路由发现开销或延迟;对于域外节点不需使用网络洪泛的路由发现,利用覆盖层提供全局索引的功能,很快引导分组到达节点位置,避免昂贵的洪泛路由发现代价。对算法进行了分析研究,实验结果表明,该算法在不增加延时的基础上能有效提供单播路由并降低网络总流量,提高了网络的效用和性能。In connection with the dynamic topology of the wireless self-organization network, the AHR （hybrid unicast routing algorithm）, combining with the merits of proaetive and reactive routing, is put forward on the basis of the overlay network. As to the routing of the local domain, the routine of AHR, making full use of the physical path, forwards and divides the node pairs into groups, which is initiated by overlay nodes and supported by the network layer routing. Regarding to the extraterritorial nodes with no use of flooding rooting, the AHR guides the node pairs to the node positions soon using the index function ,of over lay, which avoids the high expense of flooding routing. It is proved by the experiments that this algorithm improves the ability of unicast routing and decreases the total network traffic without the increase of delay, thus enhances the validity and performance of the network further.

关 键 词：覆盖网络 无线自组织网络 协同路由 网络层 单播路由 

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