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

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

Author

Listed:
  • En Wang
  • Yongjian Yang
  • Bing Jia
  • Tingting Guo

Abstract

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.

Suggested Citation

  • En Wang & Yongjian Yang & Bing Jia & Tingting Guo, 2013. "The DTN Routing Algorithm Based on Markov Meeting Time Span Prediction Model," International Journal of Distributed Sensor Networks, , vol. 9(9), pages 736796-7367, September.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:9:p:736796
    DOI: 10.1155/2013/736796
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/736796
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/736796?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:9:y:2013:i:9:p:736796. 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.