检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中南大学信息科学与工程学院,湖南长沙410083
出 处:《小型微型计算机系统》2007年第1期31-35,共5页Journal of Chinese Computer Systems
基 金:国家自然科学基金网络与信息安全重大研究计划(90304010)资助;湖南省自然科学基金(03JJY5032)资助.
摘 要:在深入分析ODMRP组播协议的基础上,本文提出了将传输节点分成不同类型的策略,并在此基础上提出了一种结合路径跳数和转发组成员数的组播路由协议HF-ODMRP(OptimalMulticastProtocolwithHopsandFGsbasedonODMRP).在HF-ODMRP协议中,节点根据网络已有的转发信息将自身标记为普通节点、FG(ForwardingGroup)节点的邻居或FG节点,并赋予不同的权值.在建立路由的过程中,每个节点首先计算路径上节点的累计权值和路径的总跳数,并优先选择具有两者比值最大的路径上的节点构成FG,从而使得发送者和接收者之间既可以共用更多FG节点,降低了转发组中冗余FG节点个数,又可以提高了组播协议的有效性.模拟结果验证HF-ODMRP不仅对动态拓扑具有良好的适应性,而且大大提高了组播协议的数据转发有效性和能源消耗有效性.This paper first proposes a node-classification method, which classifies the nodes into different categories. On the basis, an optimal multicast protocol with Hops and FGs based on ODMRP (HF-ODMRP) is proposed in the mobile ad hoe Networks. HF-ODMRP classifies the nodes into three categories (ordinary nodes, neighbor nodes, and FG (Forwarding Group) nodes) according to their history forwarding information. Each category is assigned with a different weight and every node maintains a Weight Table to cache its weight information. During the setup of forwarding group, HF-ODMRP calculates the cumulative weight of the nodes of the path, the hops of the path and the ratio of these two values. Then it chooses the nodes of the path with the highest ratio to become the forwarding nodes. Therefore, HF-ODMRP reduces a lot of redundant FG nodes by sharing some FG nodes between different sender and receiver pairs. Results obtained through simulations demonstrate HF-ODMRP can not only work well in the condition with frequently changing topology, but also enhance the data forwarding and energy consumption efficiency of multicast protocol in the mobile ad hoe networks.
关 键 词:移动自组网 组播 转发组(FG) 节点分类 路径跳数
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222