咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >A hybrid multiple copy routing... 收藏

A hybrid multiple copy routing algorithm in space delay-tolerant networks

A hybrid multiple copy routing algorithm in space delay-tolerant networks

作     者:Peng WAN Shi CHEN Tao YU Zhongjie HUA 

作者机构:Beijing Institute of Tracking and Telecommunications Technology National Space Science Center Chinese Academy of Sciences 

出 版 物:《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期:2017年第60卷第4期

页      面:124-134页

核心收录:

学科分类:0810[工学-信息与通信工程] 08[工学] 081001[工学-通信与信息系统] 

主  题:space delay-tolerant networks routing algorithms contact graph routing hybrid single copy rout ing hybrid multiple copy routing 

摘      要:With the development of technology and applications in space delay-tolerant networks(SDTNs), increasing attention has been paid on the routing technologies between different DTN nodes. This paper proposes a novel hybrid multiple copy routing(HMCR) algorithm that can be applied not only to deterministic space scenarios but also to opportunistic space scenarios. HMCR combines contact graph and delivery probability metrics to make forwarding decisions. In order to verify the new HMCR algorithm’s performance, research work has been carried out to prove its availability in SDTNs. The analysis and simulation results show that, compared with other algorithms such as contact graph routing(CGR), Epidemic, and PRo PHET, the new HMCR algorithm performs well in the areas of message delivery ratios, average end-to-end delays, and transmission overhead, which proves to be suitable for highly dynamic SDTNs.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分