Routing in Delay-tolerant network Based on Nodes’ Sociality
Long Tan, Zixuan Men · Journal of Physics Conference Series · 2021
Abstract To solve the problem of low ratio success delivery, long latency caused by the rapid dynamic change of network topology, limited node buffer, large amount of data transmission and large user population density in delay-tolerant network (DTN). This paper propose a routing algorithm in DTN based on nodes’ sociality. In this paper, contact history was used to determine the node link quality; Markov model was used to predict the node position based on the nodes’ movement track; according to nodes’ social similarity to divide community, then calculated node betweenness centrality. Finally, the best forwarding nodes for message transmission were determined. Besides, to increase the ratio of successful delivery, message delivery probability in the relay node’s buffer was calculated. Experimental results show that compared with traditional routing algorithm, the proposed algorithm performs better on the delivery ratio and average end-to-end delay.