基于自由树的中心的MAODV改进算法  

An Improved Algorithm Based on the Center of a Free Tree

作　　者：何锦东[1] 杨波[2] 

机构地区：[1]云南师范大学人事处,云南昆明650092 [2]红河学院工学院,云南蒙自661100

出　　处：《红河学院学报》2009年第5期57-59,共3页Journal of Honghe University

摘　　要：MAODV路由协议是应用于移动Ad Hoc网络的一个组播路由协议,协议中的组长选取具有较大的随机性。本文分析了协议中组长的位置选取的相关特征,并在此基础上提出了基于自由树的中心的MAODV改进,改进算法避免了MAODV路由协议中组长处于组播共享树叶子结点的位置,减少了数据分组的传输次数,降低了网络传输的延迟。MAODV routing protocol is a multicast routing protocol applied in mobile Ad Hoc networks.The selections of the head in the protocol are at great random.This paper analyzes the characteristics concerning the selections of head position choices in the protocol,and then improves the MAODV Routing Protocol on the center of a free tree.This improved algorithm makes the head in the MAODV Routing Protocol avoid in a position as leaf node in a multicast sharing tree,reduce the number of data packet transmission and reduce the network transmission delay.

关 键 词：MAODV路由协议 自由树的中心 组长选取 

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