Social and dynamic graph-based scalable routing protocol in a DTN network

In this paper we consider the DTN routing problem in networks where the links between nodes are not stable, but tend to change over time. In these cases, the classical algorithms are not adequate, so new protocols are needed to deliver the highest number of messages, trying to limit the amount of messages transmitted in the network. We propose a new algorithm, S-Grasp, whose foundations are found in other works already presented in the literature, but in some cases it improves their performances. Finally we will show, through simulations, that although the success rate is close to the optimal value, the number of retransmissions is reduced by at least 50% compared to that of other analyzed algorithms.