Research On Routing Protocols For Delay And Disruption Tolerant Network Based On The Social Relationship Of Nodes

Delay and disruption tolerant network are characterized by intermittent connectivity, frequent partitions, extremely high latency, asymmetric data rates, high error rates, heterogeneous interconnection, etc. It can communicate better when the topology of the network is changing frequently or the network segmentation is more frequent. As a key technology for a new generation of wireless communication network, delay and disruption tolerant network is a hot topic which has attracted much attention in the field of research. And it has an important research value and broad application prospect.A routing protocol was proposed based on the relationship of nodes. With a method of relation evaluation among nodes in network, the relation intensity matrix between the groups was figured out. The source node chose proper member nodes as next intermediate node to forward the messages according to the relation intensity matrix, which avoided the message to be sent to the selfness nodes and reduced the probability of dropping the message. A mechanism is used to control the message copy in the network. Replications of each message copied to the network is limited. When forwarding a message, distribute the number of copies according to the node centricity in a certain proportion.centricity is an important quantitative criteria. It is representative of the communication capacity of the nodes. Node which has a big centricity has the large amount percentage of the replications. And node which has a small centricity has the small amount percentage of the replications. According to the evaluation of routing protocols, a gray comprehensive evaluation model is proposed in this paper. First, it uses analytic hierarchy process to determine the weighting coefficients of evaluation indexes. Then it applies the method of gray theory to construct the evaluation sample matrix and gray ranking to gain the coefficients of the gray evaluation and the weighting matrix. At last, the final comprehensive evaluation is obtained. By using the analytic hierarchy method and gray theory, the subjective factors that influence the performance evaluation are restricted greatly and the objectivity of performance evaluation results is improved.It experiment and simulate the proposed routing protocols. Simulation results show that routing protocol proposed based on the relationship of nodes has a good routing performance compared with the Epidemic protocol and Probabilistic Routing Protocol using History of Encounters and Transitivity. The proposed protocol keep a stable delivery ratio and average transport latency and the network overhead of the protocol is small. Evaluate the routing protocol proposed, the result is good. The evaluation results and the simulation results are identical with each other.