延迟容忍网络中基于社交网络和介数中心性的路由机制
A Routing Mechanism Based on Social Networks and Betweenness Centrality in Delay-Tolerant Networks
摘要：
随着移动智能设备的日益普及，现有的网络已经无法满足许多复杂场景的需求，现有的网络架构和协议不能很好地适应高时延、频繁断网的网络。为了提高这些网络的性能，一些学者开辟了一个新的研究领域--容迟网络，其中一个重要的研究课题就是数据包的转发和路由机制。针对计算机网络和社交网络中节点具有高度行为相似性的特点，提出了一种基于社交网络的路由方案。为了进一步提高效率，本文还提出了一种机制，这是现有的介数中心的路由算法的改进版本。实验结果表明，该方案具有更好的性能比现有的友谊路由算法。
英文摘要：
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing scheme based on social networks owing to the fact that nodes in computer networks and social networks have high behavioural similarity. To further improve efficiency this paper also suggests a mechanism, which is the improved version of an existing betweenness centrality based routing algorithm. The experiments showed that the proposed scheme has better performance than the existing friendship routing algorithms.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
