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
-
Reducing the Amount of Data for Creating Routes in a Dynamic DTN via Wi-Fi on the Basis of Static Data
by: Yulia Shichkina, et al.
Published: (2017-01-01) -
Internet of Things Optimal Routing based on Markov-Reinforcement Learning Algorithm
by: Jamal M.Ali Radha, et al.
Published: (2024-09-01) -
Prediction of Mine Dust Concentration Based on Grey Markov Model
by: Zhou Xu, et al.
Published: (2021-01-01) -
Application of BP Neural Network Improved by Fireworks Algorithm on Suspender Damage Prediction of Long-Span Half-Through Arch Bridge
by: Jian Guo, et al.
Published: (2023-01-01) -
Euclid meets Popeye: The Euclidean Algorithm for $2\times 2$ Matrices
by: Bacher, Roland
Published: (2023-07-01)