CGR-QV: A virtual topology DTN routing algorithm based on queue scheduling

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.

Download Full-text

A survivable routing algorithm with differentiated domain protection based on a virtual topology graph in multi-domain optical networks☆

Information Sciences ◽

10.1016/j.ins.2009.03.016 ◽

2009 ◽

Vol 179 (14) ◽

pp. 2453-2459 ◽

Cited By ~ 6

Author(s):

Lei Guo ◽

Xingwei Wang ◽

Jiannong Cao ◽

Yu Zhang ◽

Xiaobing Zheng ◽

...

Keyword(s):

Optical Networks ◽

Routing Algorithm ◽

Virtual Topology ◽

Topology Graph

Download Full-text

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.

Download Full-text

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

10.46532/978-81-950008-1-4_049 ◽

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.

Download Full-text