Multi Hop DTN Routing Algorithm for Maritime Networks

2021 ◽  
pp. 865-873
Author(s):  
Nidhi Sonkar ◽  
Sudhakar Pandey ◽  
Sanjay Kumar
Keyword(s):  
Routing Algorithm ◽  
Dtn Routing ◽  
Maritime Networks

scholarly journals The DTN Routing Algorithm Based on Markov Meeting Time Span Prediction Model

2013 ◽  
Vol 9 (9) ◽  
pp. 736796 ◽  
Author(s):  
En Wang ◽  
Yongjian Yang ◽  
Bing Jia ◽  
Tingting Guo
Keyword(s):  
Prediction Model ◽  
Routing Algorithm ◽  
Time Span ◽  
Dtn Routing

DTN Routing Mechanism Based on Area Dipartition

2013 ◽  
Vol 756-759 ◽  
pp. 851-854
Author(s):  
Yun Yang ◽  
Long Sheng Han ◽  
Ran Yan ◽  
Xiu Ping Kong ◽  
Wen Chun Xu
Keyword(s):  
Network Architecture ◽  
Data Transfer ◽  
Routing Algorithm ◽  
Network Routing ◽  
Message Delivery ◽  
Transfer Path ◽  
Delivery Probability ◽  
Dtn Routing ◽  
Routing Mechanism ◽  
Delay Tolerant

Delay Tolerant Networks (DTN) has been widely used in challenge networks as an emerging network architecture. Among all studies , routing mechanism is the key problem in DTN. Because of high latency and low data rate, the traditional network routing algorithm can not apply to DTN. This paper proposed a DTN routing mechanism based on area dipartition. The mechanism divided the space into several regions, and calculated the probability of occurrence of each node in each region to determine data transfer path according to the probability. Finally, the simulation results show that the mechanism can significantly enhance the message delivery probability and reduce the packet loss rate.

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.

scholarly journals Survey on Various DTN Routing Algorithms for Vehicular ADHOC Network (VANET)

2020 ◽  
pp. 224-228
Author(s):  
Saravanan M ◽  
Kamaraj K ◽  
Eswaran Arumugam
Keyword(s):  
Routing Algorithm ◽  
Opportunistic Routing ◽  
Routing Algorithms ◽  
Single Node ◽  
Intermittent Connectivity ◽  
Self Organized ◽  
Adhoc Network ◽  
Dtn Routing ◽  
Disruption Tolerant Network ◽  
Carry And Forward

Vehicle Adhoc Network (VANET) permits self-organized infrastructure. Link or Connectivity breakage or long delay (intermittent connection) is an important issue in the VANET which arises due to the dynamic topological changes. Mainly two algorithms Vehicle assisted Data Delivery (VADD) and Opportunistic routing algorithm supports for handling delay/disruption tolerant network (DTN). Intention of DTN is to create dynamic link between the sender and receiver vehicle in the case of link disruption or absence of path between two nodes and forwards the data using store carry and forward. VADD carry and forward the data as much as possible in disconnected network using intersection mode, straightway mode or destination mode. Opportunistic routing can deal the unreliable data and intermittent connectivity in VANET by considering the multiple nodes as a next hop forwarder instead of considering pre-selected single node to be the best forwarder. This paper gives the study about various opportunistic routing algorithms for handling delay/disruption tolerant network.

Directed Flooding Routing Algorithm Based on Location in DTN

2013 ◽  
Vol 846-847 ◽  
pp. 1664-1667
Author(s):  
Geng Yu ◽  
Fu Jie Huang
Keyword(s):  
Communication Channel ◽  
Routing Algorithm ◽  
Propagation Delay ◽  
Routing Algorithms ◽  
Location Information ◽  
Delivery Ratio ◽  
Disruption Tolerant Networks ◽  
Message Transmission ◽  
Dtn Routing ◽  
Epidemic Routing

. In allusion to the high delay, restricted nodes resources and lack of persistent end to end connections in Delay /Disruption Tolerant Networks ( DTN) ,this paper proposes a novel directed flooding routing algorithm based on location information. The algorithm combines DTN with the known nodes locations in communication channel to improve the DTN networks topology knowledge to reduce the noneffective duplicate,then conducts single duplicate routing depending on location. The algorithm can increase the directivity and purposiveness of message transmission, decrease the consumption of networks resources, and thereby reduce propagation delay and improve the delivery ratio. The simulation shows that the proposed algorithm is feasible and effective, and it is superior to the typical DTN routing algorithms such as Epidemic Routing.

Sign in / Sign up

Export Citation Format

Share Document