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...
Saved in:
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!
|
Similar Items
-
Packet-based routing algorithm in DTN based on the intimacy between nodes
by: En WANG, et al.
Published: (2014-12-01) -
IEDR:an infrastructure enhanced DTN routing protocol
by: Zhen YU, et al.
Published: (2013-08-01) -
Minimum delay algorithm based on time aggregated graph in DTN network
by: Peng WANG, et al.
Published: (2017-10-01) -
Analysis of link interruption characteristics in the DTN
by: LI Yun, et al.
Published: (2008-01-01) -
Internet of Things Optimal Routing based on Markov-Reinforcement Learning Algorithm
by: Jamal M.Ali Radha, et al.
Published: (2024-09-01)