期刊文献+

基于最小链路成本优化排名的低功耗有损网络路由协议 被引量:3

Low power lossy network routing protocol based on minimum link cost ranking optimization
下载PDF
导出
摘要 针对低功耗有损网络的数据流量负载分配及传输效率优化问题,提出一种基于最小链路成本优化排名的低功耗有损网络路由协议。采用基于排名规则的改进多路径RPL算法,通过引入一个目的地为导向的有向无环图,使每个节点具有多条到达汇聚点的路径,根据链路的成本排名选择跳数更少和输出流量速率更大的链路;构造k-连通性的路由图表,根据能量消耗情况选择节点父代,通过启发式负载分配方法最小化路由总传输成本,根据节点的输出流量速率分配负载,实现负载均衡的同时提高路由的传输效率。仿真结果表明,相比主动与低功耗的有损网络反应式路由算法和低功耗有损网络链路质量感知路由协议,该算法数据投递成功率提高了15%以上,平均网络吞吐量提高了30%以上。 For data traffic load distribution and transmission efficiency optimization in low power lossy networks?a lossy network routing protocol based on minimum link cost ranking optimization was proposed.Algorithms based on improved multi-path RPL ranking rules were used by introducing a destination-oriented directed acyclic graph,each node had multiple paths to reach the rendezvous point,and based on the cost ranking link,links with less hops and greater output flow rate were selected.K-connectivity routing charts were constructed to choose the parent node according to the energy consumption,and the total transport costs were minimized using routing heuristic load distribution method.Load flow rate was assigned based on the output node,load was balanced while improving routing transmission efficiency.Simulation results show that the proposed method compared to lossy network reactive routing algorithms and low power quality lossy network links aware routing protocol,data delivery success rate is15%above,and the average network throughput is increased by more than30%.
作者 刘文杰 程聪 柴旭清 杨新锋 LIU Wen-jie;CHENG Cong;CHAI Xu-qing;YANG Xin-feng(Computer Network Center, Nanyang Institute of Technology, Nanyang 473004,China;Department of Public Education, Xinlian College of Henan Normal University, Zhengzhou 450000, China;School of Computer Science and Information Engineering, Henan Normal University, Xinxiang 453000, China;School of Computer and Information Engineering, Nanyang Institute of Technology, Nanyang 473004,China)
出处 《计算机工程与设计》 北大核心 2017年第2期313-317,373,共6页 Computer Engineering and Design
基金 河南省科技攻关重点计划基金项目(122102210563 132102210215) 河南省高等学校重点科研项目计划基金项目(15B520008) 河南省科技厅资助性基金项目(9412012Y0004 9412012Y0005)
关键词 低功耗有损网络 多路径路由 链路成本排名机制 启发式负栽分配 最低成本代价 low power lossy networks multi-path routing link cost ranking mechanism heuristic load distribution the lowest cost price
  • 相关文献

参考文献3

二级参考文献47

  • 1Pajarola R, Rossignac J. Compressed progressive meshes [J]. IEEE Transactions on Visualization and Computer Graphics. 2000, 6(1): 79-93. 被引量:1
  • 2Pajarola R, Rossignac J. SQUEEZE: fast and progressive decompression of triangle meshes [C]//Proceedings of the Computer Graphics International, Geneva, 2000: 173-182. 被引量:1
  • 3Park S B, Kim C S, Lee S U. Progressive mesh compression using cosine index predictor and 2-stage geometry predictor [C] //Proceeding of the IEEE International Conference on Image Processing, Vancouver, 2000:233-236. 被引量:1
  • 4Lindstrom P. Model simplification using image and geometry-based metrics [D]. Atlanta: Georgia Institute of Technology, 2000. 被引量:1
  • 5Sinha P, Nandagopal T, Venkitaraman N, et al. WTCP: a reliable transport protocol for wireless wide-area networks [J]. Wireless Networks, 2002, 8(3): 301-316. 被引量:1
  • 6Max N. Weights for computing vertex normals from facet normals [J]. Journal of Graphics Tools, 1999, 4(2) : 1-6. 被引量:1
  • 7Thurmer G, Wuthrich C A. Computing vertex normals from polygonal facets [J]. Journal of Graphics Tools, 1998, 3(1) : 43-46. 被引量:1
  • 8Fu C P, Soung C, Liew S C. TCP Veno: TCP enhancement for transmission over wireless access networks [J]. IEEE Journal on Selected Areas in Communications, 2003, 21(2): 216-228. 被引量:1
  • 9Hu J H, Feng G, Yeung N L. Hierarchical cache design for enhancing TCP over heterogeneous networks with wired and wireless links [J]. IEEE Transactions on Wireless Communications, 2003, 2(2): 205-217. 被引量:1
  • 10Meyer M, Sachs J, Holzke M. Performance evaluation of a TCP proxy in WCDMA networks [J].IEEE Wireless Communications, 2003, 10(5): 70-79. 被引量:1

共引文献2

同被引文献28

引证文献3

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部