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

DRANS: Daily Routine Analysis for Node Searching in delay tolerant networks

Author

Listed:
  • Xingyu He
  • Guisong Yang
  • Hao Zhang

Abstract

In delay tolerant networks, the success rate and the transmission speed are restricted by limited social interaction and complex node mobility pattern analysis. To increase the success rate and reduce the transmission delay in delay tolerant networks, we propose Daily Routine Analysis for Node Searching in delay tolerant networks. In Daily Routine Analysis for Node Searching, each node is required to generate a Staying Probability Table and a Transiting Probability Table by analyzing its own daily routine, then to distribute its Staying Probability Table and Transiting Probability Table to the whole network with the help of other nodes having different mobility patterns. On the basis of the Staying Probability Table and Transiting Probability Table, Daily Routine Analysis for Node Searching further provides a node tracking strategy and an opportunistic routing strategy for delivering data from the source node to the destination node. Trace-driven experiments are performed to compare Daily Routine Analysis for Node Searching with previous node searching methods. The experimental results demonstrate that Daily Routine Analysis for Node Searching is able to promote the success rate and reduce the transmission delay effectively.

Suggested Citation

  • Xingyu He & Guisong Yang & Hao Zhang, 2017. "DRANS: Daily Routine Analysis for Node Searching in delay tolerant networks," International Journal of Distributed Sensor Networks, , vol. 13(7), pages 15501477177, July.
    • Handle: RePEc:sae:intdis:v:13:y:2017:i:7:p:1550147717718105
    DOI: 10.1177/1550147717718105
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717718105
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147717718105?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:13:y:2017:i:7:p:1550147717718105. 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.