Factual Demonstration of Blockchain Routing in Delay Tolerant Network

Abstract Frequent disconnection, high end-to-end latency, dynamic topology, sparse node density, lack of pre-existing infrastructure, and opportunistic message transmission on wireless link, makes routing difficult in Opportunistic network (Oppnet). In present scenario, Oppnet allows the people to interact with contrasting ways like with diverse mobility, groups, and etc. During transmission of messages in such network security and trust performs major role. Delay Tolerant Network (DTN) are much prone of having inherent risk of attack. Malicious node, selfish node, and attacks are major impact on deteriorating network performance. To prevent the network from such deteriorating factors, this paper introduces the new platform to provide reliable and authentic transmission of message in opportunistic network. Blockchain-based Routing in Opportunistic Network (BRON) uses the concept of Blockchain through which each node work as an authentic node and transmit the secure messages in Oppnet. Opportunistic Network Environment (ONE) tool is used to implement BRON. This protocol generates 36% reduced packet drops ratio, 57% enhanced delivery ratio, 55% lesser overhead ratio, 35.2% reduced average latency, and 65% lesser average buffer time as compared to direct delivery ratio with respect to number of nodes.

Advanced Optimal Buffer Scheduling Policy in Opportunistic Networks

Advanced Engineering Forum ◽

10.4028/www.scientific.net/aef.4.13 ◽

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.

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

Mobile Information Systems ◽

10.1155/2016/8163893 ◽

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 ◽

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.

CHBR: Contact History Based Routing in Time Varying Approach

INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY ◽

10.24297/ijct.v13i2.2911 ◽

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.

Performance Evaluation of Routing Metrics in the LOADng Routing Protocol

Journal of Communications Software and Systems ◽

10.24138/jcomss.v13i2.376 ◽

2017 ◽

Vol 13 (2) ◽

pp. 87 ◽

Cited By ~ 3

Author(s):

Jose V. V. Sobral ◽

Joel J. P. C. Rodrigues ◽

Neeraj Kumar ◽

Chunsheng Zhu ◽

Raja W. Ahmad

Keyword(s):

Routing Protocol ◽

Network Performance ◽

Ad Hoc ◽

Average Energy ◽

Delivery Ratio ◽

Traffic Patterns ◽

Routing Metric ◽

Lossy Networks ◽

Routing Metrics ◽

Average Latency

LOADng (Lightweight On-demand Ad hoc Distance-vector Routing Protocol - Next Generation) is an emerging routing protocol that emerged as an alternative to RPL (IPv6 Routing Protocol for Low power and Lossy Networks). Although some work has been dedicated to study LOADng, these works do not analyze the performance of this protocol with different routing metrics. A routing metric is responsible for defining values for paths during the route creation process. Moreover, based on these metrics information a routing protocol will select the path to forward a message. Thus, this work aims to realize a performance assessment study considering different routing metrics applied to LOADng. The scenarios under study consider different traffic patterns and network sizes. The routing metrics are evaluated considering the packet delivery ratio, average energy spent per bit delivered, average latency, and number of hops. The results reveals that routing metrics used by this protocol may influence (directly) the network performance.

Improving Vehicular Delay-Tolerant Network Performance with Relay Nodes

2009 Next Generation Internet Networks ◽

10.1109/ngi.2009.5175762 ◽

2009 ◽

Cited By ~ 23

Author(s):

Vasco N. G. J. Soares ◽

Farid Farahmand ◽

Joel J. P. C. Rodrigues

Keyword(s):

Network Performance ◽

Delay Tolerant Network ◽

Relay Nodes ◽

Validation of Fuzzy-Based Routing Algorithm for DTN

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.644-650.1931 ◽

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.

Evaluation of Spray Based Routing Approaches in Delay Tolerant Networks

Journal of Communications Software and Systems ◽

10.24138/jcomss.v10i4.117 ◽

2014 ◽

Vol 10 (4) ◽

pp. 213 ◽

Author(s):

Sweta Jain ◽

Meenu Chawla

Keyword(s):

Routing Protocols ◽

Ad Hoc ◽

Performance Metrics ◽

Delay Tolerant Networks ◽

Delivery Ratio ◽

Composite Methods ◽

Average Latency ◽

Delay Tolerant ◽

Overhead Ratio ◽

Spray And Wait

Delay Tolerant Networks (DTN) are mobile ad-hoc networks in which connections are often disruptive or discontinuous. Data forwarding using an appropriate routing strategy is a highly confronting issue in such networks. The traditional ad-hoc routing protocols which require end-to-end connectivity fail to function here due to frequent occurrences of network partitions. Spray and Wait (SaW) routing algorithm is a popular controlled replication based DTN protocol which provides a better delivery performance balancing the average delay and overhead ratio. An empirical analysis of various spray based approaches that have been proposed for DTN has been performed in this paper to compare and evaluate the basic Spray and Wait algorithms (Source Spray and Wait and Binary Sprayand Wait) with some of its major improvements (Spray andFocus, Average Delivery Probability Binary Spray and Wait and Composite methods to improve Spray and Wait). The main aim of this comparative study is to verify the effect of utility metrics in spray based routing protocols over simple spray based approaches. The ONE simulator has been used to provide a simulation environment to evaluate these algorithms and generate results. The performance metrics used are delivery ratio (DR), overhead ratio (OR) and average latency (ALat). The simulation results show that in terms of delivery ratio and average latency, Composite methods to improve Spray and Wait which incorporates delivery predictability metric in the wait phase and also acknowledgements to delete already deliveredmessages from a node’s buffer, outperforms all the other variants compared.

ELKOMIKA Jurnal Teknik Energi Elektrik Teknik Telekomunikasi & Teknik Elektronika ◽

Analisis Performansi Algoritma Routing First Contact dengan Stationary Relay Node pada Delay Tolerant Network

10.26760/elkomika.v4i2.123 ◽

2018 ◽

Vol 4 (2) ◽

pp. 123 ◽

Author(s):

LEANNA VIDYA YOVITA ◽

JODI NUGROHO RESTU

Keyword(s):

Routing Algorithm ◽

Relay Node ◽

Routing Algorithms ◽

Delay Tolerant Network ◽

Delivery Probability ◽

Average Latency ◽

End To End ◽

Delay Tolerant ◽

First Contact ◽

Overhead Ratio

ABSTRAKAlgoritma routing pada jaringan klasik dapat berjalan jika hubungan end-to-end selalu ada.Algoritma routing ini bekerja dengan menggunakan informasi mengenai seluruh jalur yang tersedia.Untuk itu, pada jaringan dengan kondisi ekstrim seperti ini diperlukan algoritma routing yang sesuai.Salah satu algoritma routing yang dapat dijalankan pada Delay Tolerant Network (DTN) adalah First Contact.Algoritma iniakanmelakukan penggandaan pesan yang dibawanyauntuk kemudian diberikan kepada node lainnya yang pertama kali ditemui.Dalam penelitian ini ditambahkan stationary relay node untuk meningkatkan delivery probability.Dengan penambahan stationary relay node diperoleh peningkatan delivery probability 2 hingga 6% dibandingkan dengan jaringan tanpa stationary relay node. Parameter overhead ratio meningkat sebesar 7-18% dibandingkan jaringan tanpa Stationary relay node. Algoritma First Contact dengan tambahan Stationary relay nodejuga memberikan tambahan average latency, 118 – 171 detik.Nilaiini berbanding lurus dengan jumlah mobile node DTN yang ada pada area tersebut.Kata kunci: Delay Tolerant Network, first contact,Stationaryrelaynode, routing algorithm, delivery probability, overhead ratio, average latency.ABSTRACTClassical routing algorithms only works if there is end to end connection.This algorithms uses the information about every available path, and then choose the best path related to spesific metric.. For the networks with the extreme condition, it is needed the suitable routing alorithms. One of the routing algorithms that is able to be applicated in Delay Tolerant Network (DTN) is First Contact. This algorithm will make a single copy message and then forward it to the first encountered node. In this research, the stationaryrelaynodes were added to improve delivery probability. The effect of adding stationary relay node is increasing the delivery probability about 2-6%, compared to networks without stationary relay node. The overhead ratio increased about 7-18% compared to networks without stationary relay node. First Contact algorithm with stationary relay node gives bigger average latency, 118 – 171 second. This value is directly proportional to the number of mobile DTN nodes that exist in the area.Keywords: Delay Tolerant Network, first contact, Stationaryrelaynode, routing algorithm, delivery probability, overhead ratio, average latency..

A Message Transfer Framework for Enhanced Reliability in Delay-Tolerant Networks

Network Protocols and Algorithms ◽

10.5296/npa.v7i3.8201 ◽

2015 ◽

Vol 7 (3) ◽

pp. 52

Author(s):

Farzana Yasmeen ◽

Uyen Trang Nguyen ◽

Nurul Huda ◽

Shigeki Yamada ◽

Cristian Borcea

Keyword(s):

Network Performance ◽

Performance Metrics ◽

Delay Tolerant Networks ◽

Delivery Ratio ◽

Message Delivery ◽

Delivery Performance ◽

End To End Delay ◽

End To End ◽

Deadline Constraints ◽

Delay-tolerant networks (DTNs) can tolerate disruption on end-to-end paths by taking advantage of temporal links emerging between nodes as nodes move in the network. Intermediate nodes store messages before forwarding opportunities become available. A series of encounters (i.e., coming within mutual transmission range) among different nodes will eventually deliver the message to the desired destination. The message delivery performance in a DTN (such as delivery ratio and end-to-end delay) highly depends on the time elapsed between encounters and the time two nodes remain in each others communication range once a contact is established. As messages are forwarded opportunistically among nodes, it is important to have sufficient contact opportunities in the network for faster, more reliable delivery of messages. We propose a simple yet efficient method for improving the performance of a DTN by increasing the contact duration of encountered nodes (i.e., mobile devices). Our proposed sticky transfer framework and protocol enable nodes in DTNs to collect neighbors’ information, evaluate their movement patterns and amounts of data to transfer in order to make decisions of whether to “stick” with a neighbor to complete the necessary data transfers. The sticky transfer framework can be combined with any DTN routing protocol to improve its performance. We evaluate ourframework through simulations and measure several network performance metrics. Simulation results show that the proposed framework can improve the message delivery ratio, end-to-end delay, overhead ratio, buffer occupancy, number of disrupted message transmissions and so on. It can be well adopted for challenged scenarios where larger messages sizes need to be delivered with application deadline constraints. Furthermore, performance of the DTN improved (upto 43%) at higher node densities and (up to 49%) under increased mobility conditions.

A comparative study on delay-tolerant network routing protocols

International Journal of Intelligent Unmanned Systems ◽

10.1108/ijius-06-2020-0024 ◽

2020 ◽

Vol ahead-of-print (ahead-of-print) ◽

Author(s):

M. Angulakshmi ◽

M. Deepa ◽

M. Vanitha ◽

R. Mangayarkarasi ◽

I. Nagarajan

Keyword(s):

Routing Protocols ◽

Delay Tolerant Network ◽

Delivery Rate ◽

Low Latency ◽

Network Environment ◽

Opportunistic Network ◽

Content Type ◽

Dtn Routing ◽

Delay Tolerant ◽

Spray And Wait

PurposeIn this study, we discuss three DTN routing protocols, these are epidemic, PRoPHET and spray and wait routing protocols. A special simulator will be used; that is opportunistic network environment (ONE) to create a network environment. Spray and wait has highest delivery rate and low latency in most of the cases. Hence, spray and wait have better performance than others. This analysis of the performance of DTN protocols helps the researcher to learn better of these protocols in the different environment.Design/methodology/approachDelay-Tolerant Network (DTN) is a network designed to operate effectively over extreme distances, such as those encountered in space communications or on an interplanetary scale. In such an environment, nodes are occasional communication and are available among hubs, and determinations of the next node communications are not confirmed. In such network environment, the packet can be transferred by searching current efficient route available for a particular node. Due to the uncertainty of packet transfer route, DTN is affected by a variety of factors such as packet size, communication cost, node activity, etc.FindingsSpray and wait have highest delivery rate and low latency in most of the cases. Hence, spray and wait have better performance than others.Originality/valueThe primary goal of the paper is to extend these works in an attempt to offer a better understanding of the behavior of different DTN routing protocols with delivery probability, latency and overhead ratio that depend on various amounts of network parameters such as buffer size, number of nodes, movement ratio, time to live, movement range, transmission range and message generation rate. In this study, we discuss three DTN routing protocols: these are epidemic, PRoPHET and spray and wait routing protocols. A special simulator will be used; that is opportunistic network environment (ONE) to create a network environment. Spray and wait have highest delivery rate and low latency in most of the cases. Hence, spray and wait have better performance than others. This analysis of the performance of DTN protocols helps the researcher to learn better of these protocols in the different environment.