基于节点关键度的DTN路由算法  

DTN Routing Algorithm Based on Key Nodes

作　　者：李建铎 刘建明 李龙 林丹 LI Jian - duo;LIU Jian - ming;LI Long;Lin Dan(School of Computer and Information Security, Guilin University of Electronic Technology, Guilin Guangxi 541004, China)

机构地区：[1]桂林电子科技大学计算机与信息安全学院,广西桂林541004

出　　处：《计算机仿真》2018年第4期126-130,共5页Computer Simulation

基　　金：国家自然科学基金(61262074);广西可信软件重点实验室开放课题(kx201101);广西高校优秀人才资助计划(桂教人201065);广西自然科学回国基金(2012GXNSFCA053009);桂林电子科技大学研究生创新项目(YJCXS201542);桂林电子科技大学计算机软件创新团队资助(桂电科201204)

摘　　要：针对延迟容忍网络(DTN)拓扑剧烈变化、频繁割裂,所造成的网络传输成功率和平均时延受限等问题,提出了一种基于节点关键度的DTN路由算法。上述算法综合节点剩余能量、活跃程度和缓存空闲率三方面因素考虑,得出性能最优的节点作为消息转发的中继节点,并对节点的缓存管理机制进行优化,从而提高网络性能。仿真结果表明,上述算法在不同网络状态下对传输成功率、平均时延和网络开销都有显著改善。For the topology changing and frequent lacerating in delay tolerant network （ DTN ） caused by transmis- sion success rate and average delay problems, the paper puts forward a DTN routing algorithm based on node key de- gree. The proposed algorithm considers the three aspects of the residual energy, the active degree and the cache idle rate. The node with the best performance acted as the relay node for message forwarding, and the node cache man- agement mechanism was optimized, so as to improve the network performance. The simulation results show that the proposed algorithm has a significant improvement in transmission success rate, average delay and network overhead.

关 键 词：容忍延迟网络 路由算法 关键度 缓存管理 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]