Routing Protocols in Delay Tolerant Networks: Comparative and Empirical Analysis

Author(s):  
Ankita Verma ◽  
Savita ◽  
Sanjiv Kumar
2021 ◽  
Vol 1 (1) ◽  
pp. 1-37
Author(s):  
Michela Lorandi ◽  
Leonardo Lucio Custode ◽  
Giovanni Iacca

Routing plays a fundamental role in network applications, but it is especially challenging in Delay Tolerant Networks (DTNs). These are a kind of mobile ad hoc networks made of, e.g., (possibly, unmanned) vehicles and humans where, despite a lack of continuous connectivity, data must be transmitted while the network conditions change due to the nodes’ mobility. In these contexts, routing is NP-hard and is usually solved by heuristic “store and forward” replication-based approaches, where multiple copies of the same message are moved and stored across nodes in the hope that at least one will reach its destination. Still, the existing routing protocols produce relatively low delivery probabilities. Here, we genetically improve two routing protocols widely adopted in DTNs, namely, Epidemic and PRoPHET, in the attempt to optimize their delivery probability. First, we dissect them into their fundamental components, i.e., functionalities such as checking if a node can transfer data, or sending messages to all connections. Then, we apply Genetic Improvement (GI) to manipulate these components as terminal nodes of evolving trees. We apply this methodology, in silico, to six test cases of urban networks made of hundreds of nodes and find that GI produces consistent gains in delivery probability in four cases. We then verify if this improvement entails a worsening of other relevant network metrics, such as latency and buffer time. Finally, we compare the logics of the best evolved protocols with those of the baseline protocols, and we discuss the generalizability of the results across test cases.


2016 ◽  
Vol 94 (3) ◽  
pp. 859-888 ◽  
Author(s):  
Osman Khalid ◽  
Rao Naveed Bin Rais ◽  
Sajjad A. Madani

Author(s):  
Anamika Chauhan ◽  
Kapil Sharma ◽  
Alka Aggarwal

With the ever-escalating amount of vehicular traffic activity on the roads, the efficient management of traffic and safety of the drivers and passengers is of paramount gravity. Vehicular ad-hoc networks (VANETs) have emerged as the systems where vehicles would be perceptive of the locality and can supply the driver with required inputs to take necessary actions to alleviate the various issues. The system is designed to detect and identify essential traffic events and inform all concerned entities and take appropriate action. The characteristics of VANET are the topology is highly mobile, depends on city infrastructure, and the high speed of vehicles. These challenges result in frequent disruption of connections, long delays in delivering the messages. The challenges are overcome through the vehicular delay-tolerant network (VDTN) routing protocols are used that can facilitate communication under these network challenges. In this chapter, the authors evaluate the effect of the node density and message sizes on the performance of the various VDTN routing protocols.


Sign in / Sign up

Export Citation Format

Share Document