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

一种基于分组交换的低时延路由算法
引用本文:程方,陶惠,张治中,裴二荣.一种基于分组交换的低时延路由算法[J].吉林大学学报(工学版),2012(Z1):392-395.
作者姓名:程方  陶惠  张治中  裴二荣
作者单位:重庆邮电大学通信与信息工程学院
基金项目:国家科技重大专项(2012ZX0300508);科技部中芬国际合作项目4G无线组网与核心(S2010GR0902)
摘    要:针对现有延迟可容忍网络路由算法在SV分组发送和数据分组交换过程中存在的冗余问题,提出了一种基于分组交换的延迟可容忍网络路由算法——PEA(Packet exchange algorithm)。PEA算法通过调整数据分组发送顺序及SV分组发送方式,加快了数据分组交换,降低了分组端到端时延。仿真结果表明,在相同消息传输成功率的条件下,PEA算法比Epi-demic算法具有更低的端到端时延。

关 键 词:通信技术  延迟可容忍网络  路由算法  分组交换  多副本

Low delay algorithm for DTN networks based on packet exchange
CHENG Fang,TAO Hui,ZHANG Zhi-zhong,PEI Er-rong.Low delay algorithm for DTN networks based on packet exchange[J].Journal of Jilin University:Eng and Technol Ed,2012(Z1):392-395.
Authors:CHENG Fang  TAO Hui  ZHANG Zhi-zhong  PEI Er-rong
Affiliation:(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
Abstract:Epidemic-based routing algorithms have some redundancy in the process of packets exchange and sensing neighbor.To address this problem,a low-delay routing algorithm of Delay-Tolerated Network based on packet exchange,PEA(Packet exchange algorithm),was proposed in this paper.PEA algorithm firstly sent data packet when nodes sensed encountered node,broadcast SV packets to speed sensing neighbor and decrease end-to-end delay.Theoretical analysis and simulation results show that PEA outperforms the classical Epidemic routing algorithm in terms of end-to-end delay,the total time of data delivery.
Keywords:communications  DTN Networks  routing algorithms  packets exchange  multi-copy
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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