摘要
传统容滞网络散发等待路由算法的节点副本数是确定的,使得获得节点的转发次数具有一定的盲目性,不能很好地适应网络环境,降低了递交率。针对该问题,研究节点的最终平均缓冲区占用率和副本数的关系,提出一种基于缓冲区占用率的路由算法。该算法由节点的最终平均缓冲区占用率动态调整初始化副本数。在节点的最终平均缓冲区占用率较低的情况下,增大报文的初始化副本数,以提高递交率,在节点的最终平均缓冲区占用率较高的情况下,减小报文的初始化副本数,以避免拥塞的发生。仿真结果表明,与二分法散发等待路由算法相比,当网络中节点的平均缓存占用率较低时,该算法能改善递交率和降低网络平均延时。当网络中节点的平均缓存占用率较高时,在改进递交率的同时,能降低整个网络的开销。
In traditional Spray and Wait（SAW）routing algorithm in Delay Tolerant Network（DTN）,the number of copies of the message is certain,which results in some blindness about the forwarding number of the message.It causes the routing algorithm can not adapt to the network environment and cuts down the delivery ratio.To deal with this issue,it gives the relationship between the final average buffer occupancy of the node and the initial number of copies,and proposes a Spray and Wait Routing Concerned on Buffer Occupancy（SAW-BO）in DTN.The algorithm adjusts the initial number of copies dynamically based on the average buffer occupancy rate of the node.It ought to increase the initial number of copies to increase the delivery ratio when the average buffer occupancy of the node is relatively low and it should decrease the initial number of copies when the average buffer occupancy of the node is relatively high to avoid the occurrence of congestion.Simulation results show that compared with BSW routing,the proposed algorithm can significantly improve the delivery ratio and increases the average latency when the average buffer occupancy of the node is low in the network,it can also enhance the delivery ratio and reduce the network overhead when the average buffer occupancy of the node is high in the network.
出处
《计算机工程》
CAS
CSCD
北大核心
2015年第10期88-93,共6页
Computer Engineering
关键词
容滞网络
路由
散发等待
缓冲区占用率
副本数
Delay Tolerant Network（DTN）
routing
Spray and Wait（SAW）
buffer occupancy rate
number of copies
