A dynamic Markov chain prediction model for delay-tolerant networks

Il-kyu Jeon and Kang-whan Lee

International Journal of Distributed Sensor Networks, 2016, vol. 12, issue 9, 1550147716666662

Abstract: In this study, prediction routing algorithms are proposed to select efficient relay nodes. While most prediction algorithms assume that nodes need additional information such as node’s schedule and connectivity between nodes, the network reliability is lowered when additional information is unknown. To solve this problem, this study proposes a context-aware Markov chain prediction based on the Markov chain that uses the node’s movement history information without requiring additional information. The evaluation results show that the proposed scheme has competitive delivery ratio but with less average latency.

Keywords: Delay-tolerant network; prediction; context-awareness; Markov chain (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/1550147716666662 (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:12:y:2016:i:9:p:1550147716666662

DOI: 10.1177/1550147716666662

Access Statistics for this article

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