首页 | 本学科首页   官方微博 | 高级检索  
     

编码感知的机会路由算法研究
引用本文:朱馨培,寇应展,杨鸾. 编码感知的机会路由算法研究[J]. 军械工程学院学报, 2014, 0(3): 60-67
作者姓名:朱馨培  寇应展  杨鸾
作者单位:[1]军械工程学院信息工程系,河北石家庄050003 [2]263886部队,河南洛阳471003
基金项目:国家自然科学基金资助项目(61173191);军队科研计划项目
摘    要:提出一种编码感知的机会路由算法——CAR.它利用机会传输增加编码机会,并通过引入一系列参数衡量"机会"好坏,创造性地解决了交叉数据流下机会路由转发节点的选取问题,解决了流间网络编码和机会路由算法结合时数据包上下跳节点"已知"与"未知"的矛盾.CAR算法能够最大化每次编码传输中原始数据包的个数,仿真表明,它能够显著提高可靠传输协议以及整个网络的传输性能.通过机会传输实现多用户分集,可显著增加流间网络编码机会,引入的转发延时也可增加流间网络编码机会.

关 键 词:编码感知  机会路由  机会传输  交叉数据流  网络编码

Research on Coding-Aware opportunistic Routing Algorithm
ZHU Xin-pei,KOU Ying-zhan,YANG Luan. Research on Coding-Aware opportunistic Routing Algorithm[J]. Journal of Ordnance Engineering College, 2014, 0(3): 60-67
Authors:ZHU Xin-pei  KOU Ying-zhan  YANG Luan
Affiliation:1. Information Engineering Department,Ordnance Engineering College,Shijiazhuang 050003,China ; 2. Unit 63886,Luoyang 471003,China)
Abstract:A Coding-Aware opportunistic Routing (CAR)algorithm is proposed.It utilizes oppor-tunistic forwarding to create network coding opportunities.A new metric is introduced in CAR to evaluate the quality of“opportunity”and CAR creatively solves the problem of next-hop selection among overlapping data flows.Meanwhile,the difficult problem in incorporating network coding into opportunistic routing is also solved by CAR.CAR maximizes the number of native packets coded in each single transmission.Simulations demonstrate that CAR greatly improves the performance of reliable transport protocol as well as the whole network.Opportunistic forwarding can increase network coding opportunities with multiuser diversity.The introduced forwarding delays also add extra network coding chances.
Keywords:coding-aware  opportunistic routing  opportunistic forwarding  overlapping data flows  network coding
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号