一种基于社交关系的容迟网络数据传输方法

由于无法维护稳定的端到端路径，现有的数据传输多采用即遇即传的路由算法，普遍存在信息投递率低、网络冗余大、节点易受攻击等问题；同时，延迟容忍网络路由技术越来越多地应用于存在着节点自私性的社会网络中。为了解决以上问题，提出了一种考虑用户社交关系同时提高信息传输效率为目的数据传输方法。主要分3个步骤：初始化，节点根据社会关系权值建立各自的通讯录；路由选择，利用节点的历史投递时延作为其传输成功率的依据，并以此进行高效的路由选择；副本管理和队列调度，采用节点最大副本数来减少信息冗余以及最大化社会关系权值进行队列调度。THE ONE仿真工具的实验结果表明，提出的SRDD算法，与EPIDEMIC和PROPHET算法相比，具有更高的数据传输成功率以及更低的传输时延，同时保证了节点更好的安全性。

Novel data transmission method based on social relationship in disruption tolerant network

Because the network is unable to maintain a stable end to end path, current data transmission adopts the routing algorithm that transmits as soon as the nodes connect. However, there exists some primary defects, such as low delivery rate, severe network redundancy and node’s vulnerability to hostile attack. Meanwhile, disruption tolerant network routing techniques are increasingly used in social networks with selfish nodes. This paper put forward a kind of efficient data transmission method aimed at improving the efficiency of data transmission as well as considering the social relationship. This method is mainly divided into three steps: the first step is initialization, where nodes establish their respective address lists according to the social relationship weight (SRE). The second step is routing, and the node uses historical delivery delay (HDD) to calculate its delivery rate, and then routes based on that. The third step is copy management and queue scheduling using the maximum copies′ numbers to reduce the information redundancy and maximize the social relationship weight to schedule queue. Simulation results from the one platform show that, compared with data transmission algorithms like EPIDEMIC and PROPHET, the proposed method social based reliable data delivery (SRDD) performs higher delivery ratio, lower transmission delay as well as better security of the nodes.