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

RABP: Delay/disruption tolerant network routing and buffer management algorithm based on weight

Author

Listed:
  • Hezhe Wang
  • Guangsheng Feng
  • Huiqiang Wang
  • Hongwu Lv
  • Renjie Zhou

Abstract

Delay/disruption tolerant network is a novel network architecture, which is mainly used to provide interoperability for many challenging networks such as wireless sensor network, ad hoc networks, and satellite networks. Delay/disruption tolerant network has extremely limited network resources, and there is typically no complete path between the source and destination. To increase the message delivery reliability, several multiple copy routing algorithms have been used. However, only a few can be applied efficiently when there is a resource constraint. In this article, a delay/disruption tolerant network routing and buffer management algorithm based on weight (RABP) is proposed. This algorithm estimates the message delay and hop count to the destination node in order to construct a weight function of the delay and hop count. A node with the least weight value will be selected as the relay node, and the algorithm implements buffer management based on the weight of the message carried by the node, for efficiently utilizing the limited network resources. Simulation results show that the RABP algorithm outperforms the Epidemic, Prophet, and Spray and wait routing algorithms in terms of the message delivery ratio, average delay, network overhead, and average hop count.

Suggested Citation

  • Hezhe Wang & Guangsheng Feng & Huiqiang Wang & Hongwu Lv & Renjie Zhou, 2018. "RABP: Delay/disruption tolerant network routing and buffer management algorithm based on weight," International Journal of Distributed Sensor Networks, , vol. 14(3), pages 15501477187, March.
  • Handle: RePEc:sae:intdis:v:14:y:2018:i:3:p:1550147718757874
    DOI: 10.1177/1550147718757874
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147718757874
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147718757874?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Samira Esfandiari & Mohammad Hossein Rezvani, 2021. "An optimized content delivery approach based on demand–supply theory in disruption-tolerant networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 76(2), pages 265-289, February.

    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:14:y:2018:i:3:p:1550147718757874. 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.