2010

Abstract Routing in delay tolerant networks (DTN) have attracted a great interest recently. Increasingly popular type of DTNs are mobile social networks (MSN) also called pocket switched networks. Hence, analyzing accurately social network properties has become an important issue in designing efficient routing protocols for MSNs. In this paper, we first introduce a new metric for detecting the quality of friendships accurately.

2009

Abstract Delay Tolerant Networks (DTNs) are wireless networks in which at any given time instance, the probability of having a complete path from a source to destination is low due to the intermittent connectivity between nodes. Several routing schemes have been proposed for such networks to make the delivery of messages possible despite the intermittent connections.

2021

Delay-tolerant networks (DTN) is an approach to deal with scarce network connectivity found in sparse mobile ad-hoc networks (MANETs) which makes the problem of routing messages a challenging task. DTNs have find their usefulness in many challenging environments such as tactical networks, underwater sensor networks, wildlife monitoring, disaster recovery etc. Pocket Switched Networks (PSNs) have emerged as a new application of the delay tolerant networks where network nodes are computing devices carried by humans. Hence, the study of how humans interact in their day-to-day life, the places they visit frequently, the people they meet frequently, the social groups in which they participate on regular basis etc. can help improve routing process in PSNs. This type of routing inspired from the way humans interact with each other is referred to as social based routing and had been a recent topic of research in the field of DTNs. This paper presents a comprehensive survey of the various so...

With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing scheme based on social networks owing to the fact that nodes in computer networks and social networks have high behavioural similarity. To further improve efficiency this paper also suggests a mechanism, which is the improved version of an existing betweenness centrality based routing algorithm [1]. The experiments showed that the proposed scheme has better performance than the existing friendship routing algorithms.

2012

Abstract Routing in delay tolerant networks is a challenging problem due to the intermittent connectivity between nodes resulting in the frequent absence of end-to-end path for any source-destination pair at any given time. Recently, this problem has attracted a great deal of interest and several approaches have been proposed. Since mobile social networks (MSN) are increasingly popular type of DTNs, making accurate analysis of social network properties of these networks is essential for designing efficient routing protocols.

International Conference on Computer, Communication, Chemical, Materials and Electronic Engineering (IC4ME2-2018), 2018

In opportunistic environments data forwarding is challenging where connectivity is intermittent because of network partitioning, dynamic topologies and long delays. Traditional routing protocols of Delay Tolerant Network (DTN) exploit “Store-Carry-and-Forward” strategy in these cases. But the pitfall of this approach is the selection of perfect relay node and the determination of best data transmission moment in dense and urban areas. To route data in such dynamic, heterogeneous networks social-based routing is an emerging technique that concerns social behaviors and interactions of nodes. Here, we look into the performances of customary routing protocols of DTN, such as Epidemic, Spray-and-Wait (SNW), PRoPHET with two social-aware routing protocols: SCORP and dLife by conducting simulations in Opportunistic Network Environment (ONE) simulator through three criteria, that are: delivery ratio, average latency and transmission cost with necessary simulation settings. The performances are evaluated by varying node density and message Time-To-Live (TTL). From the outcomes of this experiment, it can be said that dLife acts best for delivery ratio but worst for average latency. On the other hand, SNW has best performance for average latency, Epidemic shows lowest performance for both delivery ratio and transmission cost, where SCORP as well as SNW show best performances for transmission cost.

2015

Delay Tolerant Network has lack of continuous network connectivity, so probability of end to end path between source and destination for any given time is low. Routing in DTN is challenging because it consists a network partitioning, long delay and unstable topology. DTN use store-carry-forward approach for routing, in that packet stored until it encountered relay node to forward. In recent years, social based approaches have drawn much interests in routing design which exploits a social behavior of the node to make better routing decision. Social Network Analysis mainly focuses on studying the relationship among social entities, patterns and implication of their relationship. By using social properties, we can improve routing performance. SimBet is social based routing protocol, which use two social properties named Similarity and Betweenness Centrality for routing packets. We have proposed SimBet multi-copy routing scheme that transferred a number of copies of a message during con...

2012

Abstract Most routing protocols for delay tolerant networks resort to the sufficient state information, including trajectory and contact information, to ensure routing efficiency. However, state information tends to be dynamic and hard to obtain without a global and/or long-term collection process. In this paper, we use the internal social features of each node in the network to perform the routing process.

European Journal of Engineering Research and Science, 2019