检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:朱静宜[1] 朱晓洁[2] 张亶[3] ZHU Jing-yi ZHU Xiao-jie ZHANG Dan(Department of Computer and Information Technology, Zhejiang Changzheng Vocational and Technical College, Hangzhou 310023,China School of Ethnology, Huanghe Science and Technology College, Zhengzhou 450063,China College of Computer Science and Technology, Zhejiang University, Hangzhou 310027,China)
机构地区:[1]浙江长征职业技术学院计算机与信息技术系,浙江杭州310023 [2]黄河科技学院民族学院,河南郑州450063 [3]浙江大学计算机科学与技术学院,浙江杭州310027
出 处:《计算机工程与设计》2017年第11期2983-2987,共5页Computer Engineering and Design
基 金:2016年度浙江省级公益技术应用研究计划基金项目(2016C31058;2016C33109)
摘 要:提出一种面向移动自组织网络应用的中继节点选择策略。依据生存时间、有效带宽和队列容量3个度量自适应计算每一个节点的转发意愿度量;依据节点之间的链路传递概率、转发频率和握手损耗3个度量计算节点的转发能力度量;将节点的转发意愿度量和转发能力度量进行加权融合,用于度量无向图模型中节点之间的边的长度属性;依据边长最大准则,选择最优的中继节点进行数据转发。仿真结果表明,与EM-AODV和TARF两种常用的路由协议相比,采用该策略建立的路由具有更高的报文送达率和更低的端到端传输延时。A relay node selection strategy for mobile ad hoc networks application was presented.Forward willing metric of each node was calculated according to its three metrics including lift time,available bandwidth and queue capacity.Forward ability metric between two nodes was calculated according to three metrics including link delivery probability,forward frequency and hand loss.Forward willing metric and forward ability metric of each node were fused,to describe the length property of the edges between two nodes in the undirected graphical model.The optimal relay nodes for data forwarding were selected based on the criterion of maximum edge length.Simulation results show that,compared with two common routing protocols including EM-AODV and TARF,the route built using the proposed strategy has higher packet delivery rate and lower end-to-end transmission delay.
关 键 词:移动自组织网络 图模型 节点选择 路由协议 传递概率
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229