Research On Routing Technology In Delay Tolerant Networks Based On Social Attributes

With the rapid development of wireless communication technique and the expansion of its application fields,Delay Tolerant Networks(DTN)technology has gained more and more popularity in recent years.Different from the traditional Internet,DTN have such characteristics as high dynamic network topology,long delay,absence of persistent end-to-end path,limited node storage and computing capability,which disable traditional routing algorithms.Thus,the research on DTN routing technology has multiple challenges and is also of great significance.DTN adopt the “store-carry-forward” mechanism to overcome the absence of persistent end-to-end path.In recent years,there are many researches on DTN routing technology from the perspective of social attributes in wireless mobile networks because of the characteristics of nodes being influenced by their carriers' behavior.This paper first analyzes the structure and protocol architecture of DTN and summarizes the current research status of DTN routing technology.Starting from the social relations among individuals in social networks,the paper proposes a DTN routing algorithm based on social attributes.The algorithm proposes the concept of synthetic attribute value that evaluates the node's ability to forward messages according to the social connection strength.Synthetic attribute value is composed of intra-domain attribute value and inter-domain attribute value.The algorithm adopts the single-copy forwarding strategy and calculates the synthetic attribute value according to historical contact information.It achieves effective delivery of messages by transmitting them to nodes with higher synthetic attribute value.The algorithm is independent of global information,which makes it highly practical.We build the protocol model of this algorithm in OMNeT++ network simulation environment.Through the establishment of social network scenarios,we analyze the performance of the algorithm.We compare the performance indexes such as average delay and delivery rate of the proposed algorithm with existing routing algorithms to illustrate the advantages and application characteristics of the proposed algorithm.