一种基于社交尺度的延迟容忍网络路由算法

Routing algorithm for delay tolerant networks based on social scale

为克服传统基于概率的路由协议因消息多次转发而导致的网络开销问题,该文在不需获知目的节点先验知识前提下,基于节点局部信息定义包含延迟度和有效性的节点社交尺度,提出了一种基于社交尺度的延迟容忍网络路由算法。该算法通过自适应选择社交延迟度低节点作为消息中继节点,实现消息的局部快速转发;根据计算节点社交有效性实现消息转发队列的调度管理。实验结果表明:在保证消息投递成功率的前提下,提出的基于社交尺度的延迟容忍网络路由算法有效降低了消息转发数和负载比率,从而降低网络开销。

In order to solve the network load increasing problem due to multiple copies in traditional route protocol based on probability,a novel routing algorithm based on social scale is proposed here. By defining nodes’ social scale as delay degree and effectiveness according to nodes’ local information, message is forwarded rapidly by selecting relay node with lower social delay degree,and scheduling management of message forward queue is calculated based on nodes’ social validity. The＆amp;nbsp;experimental results prove that this algorithm can effectively reduce network load while message delivery ratio is well retained.