scholarly journals A Motion and Counting Based-Routing Algorithm for Delay Tolerant Network

Author(s):  
Xiao Du ◽  
Wuwen Lai ◽  
Jie Zhang ◽  
Hua Wang
IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 18727-18740 ◽  
Author(s):  
Jiagao Wu ◽  
Yahang Guo ◽  
Hongyu Zhou ◽  
Lu Shen ◽  
Linfeng Liu

2014 ◽  
Vol 644-650 ◽  
pp. 1931-1934
Author(s):  
Fan Yang ◽  
Jia Zhe Lai ◽  
Ming Zhe Li

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.


Author(s):  
Naveen Singh ◽  
Awadhesh Singh

Background & Objective: Routing is a popular challenge in ad hoc networks. A routing algorithm developed for one type of ad hoc network may be adapted for other. However, such adaptation is very difficult for Delay Tolerant Network (DTN) due to special DTN characteristics like latency, intermittency, disruptions, etc. and its applications in hostile environments like extreme terrestrial and space. Methods: We have used Ant Colony Optimization (ACO) to develop a routing algorithm suited to DTNs. The ants wander for food and after few epochs they find shortest path to it. The ant’s movement in ACO can be mapped with propagation of messages that are replicated in DTN and look for their destination. Also, we apply an efficient buffer management method to boost the performance of our routing algorithm. Results & Conclusion: To highlight the effectiveness of our algorithm, the simulation results have been compared with some leading algorithms available in the literature and have found that our algorithm produces better result than other algorithms in terms of delivery, overhead and probability ratio.


Delay Tolerant Networks finds its application in variety of environments and addresses issues like intermittent connection, long and variable delays and high latency. Vehicular Delay Tolerant Networks was introduced due to its various characteristic matches with DTNs. In particular class of VDTN there are two types of nodes: Stationary and Mobile nodes. Stationary nodes are deployed along the roadside and mobile nodes are constrained to move over the roads with variable speeds. This letter presents a new routing algorithm based on Ant Colony Optimization in Vehicular Delay Tolerant Network. We performed extensive simulation in ONE simulator and compare with Probabilistic Bundle Relaying Scheme to gauge the benefits of Ant Colony Optimization based scheme over Probabilistic Bundle Relaying scheme.


Sign in / Sign up

Export Citation Format

Share Document