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

En Wang, Yongjian Yang, Bing Jia and Tingting Guo

International Journal of Distributed Sensor Networks, 2013, vol. 9, issue 9, 736796

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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2013/736796 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:9:y:2013:i:9:p:736796

DOI: 10.1155/2013/736796

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().