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

DFDP: A Distributed Algorithm for Finding Disjoint Paths in Wireless Sensor Networks with Correctness Guarantee

Author

Listed:
  • Kejia Zhang
  • Guisheng Yin
  • Qilong Han
  • Junyu Lin

Abstract

In wireless sensor networks, routing messages through multiple (node) disjoint paths between two sensor nodes is a promising way to increase robustness, throughput, and load balance. This paper proposes an efficient distributed algorithm named distributedly finding disjoint paths (DFDP) to find k disjoint paths connecting two given nodes s and t . A set of paths connecting s and t are disjoint if any two of them do not have any common nodes except s and t . Unlike the existing distributed algorithms, DFDP guarantees correctness; that is, it will output k disjoint paths if there exist k disjoint paths in the network or the maximum number of disjoint paths otherwise. Compared with the centralized algorithms which also guarantee correctness, DFDP is shown to have much better efficiency and load balance by theory analysis and simulation results.

Suggested Citation

  • Kejia Zhang & Guisheng Yin & Qilong Han & Junyu Lin, 2014. "DFDP: A Distributed Algorithm for Finding Disjoint Paths in Wireless Sensor Networks with Correctness Guarantee," International Journal of Distributed Sensor Networks, , vol. 10(6), pages 258959-2589, June.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:6:p:258959
    DOI: 10.1155/2014/258959
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/258959
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/258959?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:10:y:2014:i:6:p:258959. 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.