中文摘要：

面向意向容迟网络的资源分配协议（RAPID）路由算法通过引入效能函数避免其他容迟网络（DTN）路由算法对某一性能指标的影响。然而算法中的相遇时间分布问题增加了算法的不确定性和应用局限性。针对这一问题,该文设计了新的基于位置信息的效能函数计算方法。新方法通过元数据交换获得各个节点的位置信息,采用灰色系统预测算法获得较长时间没有消息的目的节点的位置信息。通过最小化到达目的节点的时间,设计了更详细的消息复制优先级及复制规则。仿真表明,新算法能有效克服RAPID算法的问题,降低了消息复制数和平均时延,提高了消息成功递交率,网络的整体性能得到进一步提升。

英文摘要：

The resource allocation protocol for intentional delay （RAPID） routing algorithm applied for delay tolerant networks （DTN） adopts the utility function to avoid accidental effect on some metrics occurred in other DTN routing algorithms did. However, the problem of inter-meeting time distribution between nodes brings the algorithm＇s uncertainty and the limitation for applications. For this problem, a new method for computing utility function is designed based on position information. In the new method, every node acquires other node＇s position information by metadata exchange. The position information of a long-time-lost destination node is predicted by the gray system prediction algorithm. By minimizing messages arriving time to destination, the more detailed priority and rules of message duplication are designed. Simulations show that the new algorithm can overcome the problem in the RAPID algorithm effectively, decrease the number of message duplicate and average delay, increase message successive delivery ratio and improve the performance of the entire network further.