Monitor Potential Attack Locations in a Specific Area within DTN Network

In this paper will discuss and examine message transmission from the attacker process within the scope of Delay Tolerance Networks (DTNs). DTNs are a new area of research that can be developed in networking. Delay-tolerant networks are those networks that may not have a complete path between networks end-to-end via direct links and may be under development for a long time. As part of the improvement, we will compare a survey of DTN routing protocols with a real region area, and then taking into account the possibilities of detecting the presence of areas of weakness that lead to penetration, which will occur in the nodes while on the move. In this study, we will use the ONE simulator to track messages within nodes.

Download Full-text

Delay Tolerant Networks: An Analysis of Routing Protocols with ONE Simulator

International Journal of Computer Network and Information Security ◽

10.5815/ijcnis.2016.12.07 ◽

2016 ◽

Vol 8 (12) ◽

pp. 51-58 ◽

Cited By ~ 2

Author(s):

Richa Thakur ◽

◽

K.L. Bansal

Keyword(s):

Routing Protocols ◽

Delay Tolerant Networks ◽

One Simulator ◽

Delay Tolerant

Download Full-text

On the Performance of Delay-Tolerant Routing Protocols in Intermittently Connected Mobile Networks

Rajshahi University Journal of Science and Engineering ◽

10.3329/rujse.v43i0.26177 ◽

2015 ◽

Vol 43 ◽

pp. 29-38 ◽

Cited By ~ 2

Author(s):

Md. Sharif Hossen ◽

Muhammad Sajjadur Rahim

Keyword(s):

Mobile Networks ◽

Routing Protocols ◽

Performance Metrics ◽

Delay Tolerant Networks ◽

Buffer Size ◽

Mobile Nodes ◽

Dtn Routing ◽

Delay Tolerant ◽

Spray And Wait ◽

Intermittently Connected

Delay-Tolerant Networks are used to enable communication in challenging environments where nodes are intermittently connected, and an end-to-end path does not exist all the time between source and destination, e.g., Intermittently Connected Mobile Networks (ICMNs). Therefore, network environments, where the nodes are characterized by opportunistic connectivity, are appropriately modeled as Delay-Tolerant Networks (DTNs). In this paper, we have investigated the performance of DTN routing protocols, namely Epidemic, PRoPHET, and Spray-and-Wait (Binary version) in an ICMN scenario. Their performances are analyzed in terms of delivery probability, average latency, and overhead ratio of varying message generation rates and number of mobile nodes, respectively. In addition, the impacts of varying buffer size and Time-to-Live (TTL) on their performances are investigated. For evaluating these performance metrics, we have used Opportunistic Network Environment (ONE) simulator as the simulation tool. The outcome of this work shows that for the ICMN scenario, the best DTN routing technique is Binary Spray-and-Wait, whereas Epidemic routing exhibits the worst performance in terms of all the metrics considered here.

Download Full-text

Routing Protocols in Delay Tolerant Networks: Comparative and Empirical Analysis

Wireless Personal Communications ◽

10.1007/s11277-020-08032-4 ◽

2021 ◽

Author(s):

Ankita Verma ◽

Savita ◽

Sanjiv Kumar

Keyword(s):

Empirical Analysis ◽

Routing Protocols ◽

Delay Tolerant Networks ◽

Delay Tolerant

Download Full-text

Genetic Improvement of Routing Protocols for Delay Tolerant Networks

ACM Transactions on Evolutionary Learning and Optimization ◽

10.1145/3453683 ◽

2021 ◽

Vol 1 (1) ◽

pp. 1-37

Author(s):

Michela Lorandi ◽

Leonardo Lucio Custode ◽

Giovanni Iacca

Keyword(s):

Routing Protocols ◽

Genetic Improvement ◽

Ad Hoc ◽

Delay Tolerant Networks ◽

Unmanned Vehicles ◽

Test Cases ◽

Urban Networks ◽

Delivery Probability ◽

Apply Genetic ◽

Delay Tolerant

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.

Download Full-text