基于缓冲区占用率的DTN散发等待路由算法

发布时间：2018-03-01 01:34

本文关键词： 容滞网络路由散发等待缓冲区占用率副本数　出处：《计算机工程》2015年10期 　论文类型：期刊论文

【摘要】：传统容滞网络散发等待路由算法的节点副本数是确定的,使得获得节点的转发次数具有一定的盲目性,不能很好地适应网络环境,降低了递交率。针对该问题,研究节点的最终平均缓冲区占用率和副本数的关系,提出一种基于缓冲区占用率的路由算法。该算法由节点的最终平均缓冲区占用率动态调整初始化副本数。在节点的最终平均缓冲区占用率较低的情况下,增大报文的初始化副本数,以提高递交率,在节点的最终平均缓冲区占用率较高的情况下,减小报文的初始化副本数,以避免拥塞的发生。仿真结果表明,与二分法散发等待路由算法相比,当网络中节点的平均缓存占用率较低时,该算法能改善递交率和降低网络平均延时。当网络中节点的平均缓存占用率较高时,在改进递交率的同时,能降低整个网络的开销。
[Abstract]:The number of node replicas of the traditional routing algorithm is determined, which makes the number of forwarding nodes blind, which can not adapt well to the network environment and reduce the delivery rate. To study the relationship between the final average buffer occupancy and the number of replicas of nodes, A routing algorithm based on buffer occupancy is proposed, which dynamically adjusts the number of initialized replicas by the final average buffer occupancy of nodes. The number of initialized replicas of packets is increased to improve the delivery rate, and the number of initialized replicas of packets is reduced to avoid congestion when the final average buffer occupancy of nodes is high, and the simulation results show that, Compared with the dichotomous distributed waiting routing algorithm, the algorithm can improve the delivery rate and reduce the average network delay when the average cache occupancy of the nodes in the network is lower, and when the average cache occupancy rate of the nodes in the network is higher, the average cache occupancy rate of the nodes in the network is higher. While improving the delivery rate, the overhead of the whole network can be reduced.
【作者单位】：安徽大学计算智能与信号处理教育部重点实验室;
【分类号】：TP393.02

【参考文献】