Friendship and location-based routing in delay tolerant networks

Abstract

The network with the delay tolerant capabilities enables communication in the environment where intermittent connectivity or peer-to-peer connection is available. Routing for these networks is a challenging problem, therefore, the concept of Social Delay Tolerant Networks has been proposed by researchers. Friendship is a property of Social DTN where the friendship between nodes is used for transmission of a message between nodes. The problem arises in friendship-based routing is when any node doesn’t have any friend it cannot send the data to the destination. Therefore, we are proposing a novel algorithm for routing based on friendship and location to overcome the problem in friendship based routing by adding the location-based similarity which is another social property of DTN with friendship based routing algorithm. Therefore, Delivery probability is heightened and the average latencies caused to find a friend can be decreased.