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

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 mee...

Full description

Saved in:
Bibliographic Details
Main Authors: En Wang, Yongjian Yang, Bing Jia, Tingting Guo
Format: Article
Language:English
Published: Wiley 2013-09-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1155/2013/736796
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832547835623505920
author En Wang
Yongjian Yang
Bing Jia
Tingting Guo
author_facet En Wang
Yongjian Yang
Bing Jia
Tingting Guo
author_sort En Wang
collection DOAJ
description 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.
format Article
id doaj-art-3fa7fd5a478b43a28453875bf01d6333
institution Kabale University
issn 1550-1477
language English
publishDate 2013-09-01
publisher Wiley
record_format Article
series International Journal of Distributed Sensor Networks
spelling doaj-art-3fa7fd5a478b43a28453875bf01d63332025-02-03T06:43:01ZengWileyInternational Journal of Distributed Sensor Networks1550-14772013-09-01910.1155/2013/736796The DTN Routing Algorithm Based on Markov Meeting Time Span Prediction ModelEn Wang0Yongjian Yang1Bing Jia2Tingting Guo3 Department of Computer Science and Technology, Jilin University, Changchun 130012, China Department of Computer Science and Technology, Jilin University, Changchun 130012, China Department of Computer Science and Technology, Jilin University, Changchun 130012, China Department of Software Engineering, Jilin University, Changchun 130012, ChinaPutting 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.https://doi.org/10.1155/2013/736796
spellingShingle En Wang
Yongjian Yang
Bing Jia
Tingting Guo
The DTN Routing Algorithm Based on Markov Meeting Time Span Prediction Model
International Journal of Distributed Sensor Networks
title The DTN Routing Algorithm Based on Markov Meeting Time Span Prediction Model
title_full The DTN Routing Algorithm Based on Markov Meeting Time Span Prediction Model
title_fullStr The DTN Routing Algorithm Based on Markov Meeting Time Span Prediction Model
title_full_unstemmed The DTN Routing Algorithm Based on Markov Meeting Time Span Prediction Model
title_short The DTN Routing Algorithm Based on Markov Meeting Time Span Prediction Model
title_sort dtn routing algorithm based on markov meeting time span prediction model
url https://doi.org/10.1155/2013/736796
work_keys_str_mv AT enwang thedtnroutingalgorithmbasedonmarkovmeetingtimespanpredictionmodel
AT yongjianyang thedtnroutingalgorithmbasedonmarkovmeetingtimespanpredictionmodel
AT bingjia thedtnroutingalgorithmbasedonmarkovmeetingtimespanpredictionmodel
AT tingtingguo thedtnroutingalgorithmbasedonmarkovmeetingtimespanpredictionmodel
AT enwang dtnroutingalgorithmbasedonmarkovmeetingtimespanpredictionmodel
AT yongjianyang dtnroutingalgorithmbasedonmarkovmeetingtimespanpredictionmodel
AT bingjia dtnroutingalgorithmbasedonmarkovmeetingtimespanpredictionmodel
AT tingtingguo dtnroutingalgorithmbasedonmarkovmeetingtimespanpredictionmodel