时延容忍网络中一种基于社会属性的路由算法研究

In recent years, because of the wide applications, Delay Tolerant Networks (DTNs) are obtaining more and more attentions by researchers and public. However, the inherent characteristics of DTN, i.e., frequent topology changes, usually cause the interruptions and partitions of the network. It is impossible to find and maintain a reliable source-destination route for message transmission in such networks. In this paper, we suggest to bring in the social attributes of networks to the design of routing protocol. According to the higher frequency of the communications between friends, and that between nodes and some fixed points, we propose a friend circle and fixed points based routing algorithm for DTN. Simulations are carried out in ONE simulator. Comparing with existing protocols, the proposed protocol achieves better performances, including increasing the transmission efficiency and reducing the transmission delay.