Grid Search Algorithm For Finding Two-Hop Routing Policies In Delay Tolerant Networks 

Abstract

Abstract-Social-based routing protocols has shown its promising capability for improving the message delivery efficiency in Delay Tolerant Networks (DTNs). The efficiency relies mostly on the quality of the aggregated social graph that has been determined by the metrics used for measuring the strength of social connections. In this paper, we have proposed an improved metrics that leads to the high-quality social graph by taking both frequency and duration of the contacts into its consideration. Furthermore, to improve the performance of the social-based message transmission, we have systematically studied the community evolution problem that has been little bit investigated in the literature. Distributed algorithms based upon our new proposed metrics have been developed in such a manner that the overlapping communities and bridge nodes (i.e., connecting nodes between communities) can be dynamically detected in the evolutionary social network. Finally, we have taken all the results above into our social-based routing design. The extensive trace-driven simulation results have shown that our routing algorithm outperforms in the existing social-based forwarding strategies significantly.