scholarly journals Detecting Blackhole Attack using Encounter Records on Multi-Copy Routing Protocols in Delay Tolerant Networks (DTN)

2020 ◽  
Vol 9 (3S) ◽  
pp. 152-157
Keyword(s):  
Relay Node ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Detection Accuracy ◽  
Relay Nodes ◽  
Malicious Nodes ◽  
Blackhole Attack ◽  
Delay Tolerant ◽  
The Impact ◽  
Spray And Wait

Delay Tolerant Network (DTN) is a solution for intermittent connectivity and high delay. However, due to constrained connectivity, DTN is vulnerably susceptible to Blackhole attacks in which malicious nodes will drop all packets received from source nodes or relay nodes. The impact of a Blackhole attack can reduce the packet delivery ratio and waste resources from relay nodes that carry and forward messages. The encounter record scheme is one solution that can be applied to detect Blackhole attacks on the DTN. The encounter record mechanism is performed by utilizing a relay node that will store several records obtained from encounters between previous nodes, then the node will detect when a packet has dropped and a blacklist is performed on the node detected as a malicious node. Based on testing the performance of the routing protocol obtained that the encounter record scheme is able to detect malicious nodes so that it can again increase the delivery ratio and overhead ratio. The simulation results of this research showed that the Encounter Record has successfully detected Blackhole attacks with an average detection time of 1,5992 seconds in the spray-and-wait routing and 1,5342 seconds in the epidemic routing for 15 malicious nodes. Detection accuracy is 100% on spray-and-wait routing and 73,85% on routing epidemic for 15 malicious nodes.

Memory Performance Optimization of Delay Tolerant Network Relay Node Based on Queuing Model

2020 ◽  
Vol 57 (17) ◽  
pp. 170608
Author(s):  
冀常鹏 Ji Changpeng ◽  
韩星美 Han Xingmei ◽  
冀雯馨 Ji Wenxin
Keyword(s):  
Performance Optimization ◽  
Memory Performance ◽  
Relay Node ◽  
Delay Tolerant Network ◽  
Queuing Model ◽  
Delay Tolerant

scholarly journals Advanced Optimal Buffer Scheduling Policy in Opportunistic Networks

2012 ◽  
Vol 4 ◽  
pp. 13-18
Author(s):  
Qi Lie Liu ◽  
Guang De Li ◽  
Yun Li ◽  
Ying Jun Pan ◽  
Feng Zhi Yu
Keyword(s):  
Buffer Management ◽  
Opportunistic Networks ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Scheduling Policy ◽  
Optimal Theory ◽  
Overall Performance ◽  
Delay Tolerant ◽  
Ratio Transmission ◽  
Better Than

Opportunistic Networks (ONs) are the newly emerging type of Delay Tolerant Network (DTN) systems that opportunistically exploit unpredicted contacts among nodes to share information. As with all DTN environments ONs experience frequent and large delays, and an end-to-end path may only exist for a brief and unpredictable time. In this paper, we employ optimal theory to propose a novel buffer management strategy named Optimal Buffer Scheduling Policy (OBSP) to optimize the sequence of message forwarding and message discarding. In OBSP, global optimization considering delivery ratio, transmission delay, and overhead is adopted to improve the overall performance of routing algorithms. The simulation results show that the OBSP is much better than the existing ones.

scholarly journals A Framework and Mathematical Modeling for the Vehicular Delay Tolerant Network Routing

2016 ◽  
Vol 2016 ◽  
pp. 1-14 ◽  
Author(s):  
Mostofa Kamal Nasir ◽  
Rafidah Md. Noor ◽  
Mohsin Iftikhar ◽  
Muhammad Imran ◽  
Ainuddin Wahid Abdul Wahab ◽  
...  
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Network Routing ◽  
Packet Delivery Ratio ◽  
Packet Transmission ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Intermediate Node ◽  
Packet Delivery ◽  
Dtn Routing ◽  
Delay Tolerant

Vehicular ad hoc networks (VANETs) are getting growing interest as they are expected to play crucial role in making safer, smarter, and more efficient transportation networks. Due to unique characteristics such as sparse topology and intermittent connectivity, Delay Tolerant Network (DTN) routing in VANET becomes an inherent choice and is challenging. However, most of the existing DTN protocols do not accurately discover potential neighbors and, hence, appropriate intermediate nodes for packet transmission. Moreover, these protocols cause unnecessary overhead due to excessive beacon messages. To cope with these challenges, this paper presents a novel framework and an Adaptive Geographical DTN Routing (AGDR) for vehicular DTNs. AGDR exploits node position, current direction, speed, and the predicted direction to carefully select an appropriate intermediate node. Direction indicator light is employed to accurately predict the vehicle future direction so that the forwarding node can relay packets to the desired destination. Simulation experiments confirm the performance supremacy of AGDR compared to contemporary schemes in terms of packet delivery ratio, overhead, and end-to-end delay. Simulation results demonstrate that AGDR improves the packet delivery ratio (5–7%), reduces the overhead (1–5%), and decreases the delay (up to 0.02 ms). Therefore, AGDR improves route stability by reducing the frequency of route failures.

scholarly journals CHBR: Contact History Based Routing in Time Varying Approach

2014 ◽  
Vol 13 (2) ◽  
pp. 4237-4247 ◽  
Author(s):  
Pravesh S Patel ◽  
Hemal Shah ◽  
Yogeshwar Kosta
Keyword(s):  
Routing Protocol ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Time Varying ◽  
Intermittent Connectivity ◽  
Real Trace ◽  
Synthetic Datasets ◽  
Delay Tolerant ◽  
Communication Path ◽  
Selection Of

In Delay tolerant network having intermittent connectivity so there is no guarantee of finding a complete communication path that connecting the source and destination. There no any end to end connectivity for delay-tolerant network selection of routing protocol is important to deliver the message in an efficient way and increases chance to deliver a message to the destination. Some existing routing protocols improve the delivery ratio but it also increases the overhead. Our paper proposed Contact History Based Routing (CHBR) that use Neighborhood Index and Time varying properties such as temporal distance, Temporal Diameter and centrality for benchmarking the existing routing protocol. First, temporal metrics are evaluated for synthetic and real trace data. Then CHBR protocol is compared with the Epidemic and PROPHET for delivery ratio, overhead and the number of messages dropped. This has been carried using Opportunistic Network Environment simulator under real and synthetic datasets.

Validation of Fuzzy-Based Routing Algorithm for DTN

2014 ◽  
Vol 644-650 ◽  
pp. 1931-1934
Author(s):  
Fan Yang ◽  
Jia Zhe Lai ◽  
Ming Zhe Li
Keyword(s):  
Routing Algorithm ◽  
Simulation Software ◽  
Delay Tolerant Network ◽  
Research Issue ◽  
Network Environment ◽  
Opportunistic Network ◽  
Dtn Routing ◽  
Delay Tolerant ◽  
Spray And Wait

In the research of Delay Tolerant Network (DTN), DTN routing algorithm is a key research issue. The performance of a non-flooding routing algorithm is verified in our paper. The verified algorithm is an Adaptive Priority Routing Algorithm (APRA) which is based on fuzzy strategies. Firstly, we introduce the principle of APRA, then using Opportunistic Network Environment (ONE) -simulation software to compare the performance of Epidemic algorithm, Spray and Wait algorithm, PRoPHET algorithm and APRA. By comparing overhead of netword, rate of messages delivered and average dealy, it finds that the APRA performs better. At last, the weaknesses of this paper and further improvement are also discussed.

Sign in / Sign up

Export Citation Format

Share Document