IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v12y2016i9p1550147716666662.html
   My bibliography  Save this article

A dynamic Markov chain prediction model for delay-tolerant networks

Author

Listed:
  • Il-kyu Jeon
  • Kang-whan Lee

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.

Suggested Citation

  • Il-kyu Jeon & Kang-whan Lee, 2016. "A dynamic Markov chain prediction model for delay-tolerant networks," International Journal of Distributed Sensor Networks, , vol. 12(9), pages 15501477166, September.
    • Handle: RePEc:sae:intdis:v:12:y:2016:i:9:p:1550147716666662
    DOI: 10.1177/1550147716666662
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147716666662
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147716666662?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:12:y:2016:i:9:p:1550147716666662. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.