Back to Search Start Over

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

Authors :
En Wang
Yongjian Yang
Bing Jia
Tingting Guo
Source :
International Journal of Distributed Sensor Networks. 2013, p1-7. 7p.
Publication Year :
2013

Abstract

Putting forward an efficient routing algorithm in DTN (delay tolerant network) has become a focus of attention due to the existing phenomena that the connections between nodes in the network change dramatically over time and the communications suffer from frequent disruptions. In this paper, the meeting time span between nodes is predicted using the Markov model, and the relay node holding the shortest meeting time span with the destination node is determined as the most efficient node. In the two phases, spray phase and wait phase, the message is routed according to the utility value. Thus, the routing algorithm based on Markov meeting time span prediction model is provided. Simulation results suggest that this algorithm efficiently improves the delivery rate and reduces the average delay. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
15501329
Database :
Academic Search Index
Journal :
International Journal of Distributed Sensor Networks
Publication Type :
Academic Journal
Accession number :
95291128
Full Text :
https://doi.org/10.1155/2013/736796