IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v31y2016i4d10.1007_s10878-015-9845-2.html
   My bibliography  Save this article

OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks

Author

Listed:
  • Kejia Zhang

    (Harbin Engineering University)

  • Qilong Han

    (Harbin Engineering University)

  • Guisheng Yin

    (Harbin Engineering University)

  • Haiwei Pan

    (Harbin Engineering University)

Abstract

This paper investigates the MINimum-length- $$k$$ k -Disjoint-Paths (MIN- $$k$$ k -DP) problem: in a sensor network, given two nodes $$s$$ s and $$t$$ t , a positive integer $$k$$ k , finding $$k$$ k (node) disjoint paths connecting $$s$$ s and $$t$$ t with minimum total length. An efficient distributed algorithm named Optimally-Finding-Disjoint-Paths (OFDP) is proposed for this problem. OFDP guarantees correctness and optimality, i.e., (1) it will find $$k$$ k disjoint paths if there exist $$k$$ k disjoint paths in the network or the maximum number of disjoint paths otherwise; (2) the disjoint paths it outputs do have minimum total length. To the best of our knowledge, OFDP is the first distributed algorithm that can solve the MIN- $$k$$ k -DP problem with correctness and optimality guarantee. Compared with the existing centralized algorithms which also guarantee correctness and optimality, OFDP is shown to be much more efficient by simulation results.

Suggested Citation

  • Kejia Zhang & Qilong Han & Guisheng Yin & Haiwei Pan, 2016. "OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1623-1641, May.
    • Handle: RePEc:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-015-9845-2
    DOI: 10.1007/s10878-015-9845-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9845-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9845-2?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jiao Zhou & Zhao Zhang & Weili Wu & Kai Xing, 2014. "A greedy algorithm for the fault-tolerant connected dominating set in a general graph," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 310-319, July.
    2. Deying Li & Qinghua Zhu & Hongwei Du & Jianzhong Li, 2014. "An improved distributed data aggregation scheduling in wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 27(2), pages 221-240, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhao Zhang & Jiao Zhou & Shaojie Tang & Xiaohui Huang & Ding-Zhu Du, 2018. "Computing Minimum k -Connected m -Fold Dominating Set in General Graphs," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 217-224, May.
    2. Yaoyao Zhang & Zhao Zhang & Ding-Zhu Du, 2023. "Construction of minimum edge-fault tolerant connected dominating set in a general graph," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-12, March.
    3. Xiaozhi Wang & Xianyue Li & Bo Hou & Wen Liu & Lidong Wu & Suogang Gao, 2021. "A greedy algorithm for the fault-tolerant outer-connected dominating set problem," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 118-127, January.
    4. Austin Buchanan & Je Sang Sung & Sergiy Butenko & Eduardo L. Pasiliao, 2015. "An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 178-188, February.
    5. Jiao Zhou & Zhao Zhang & Shaojie Tang & Xiaohui Huang & Ding-Zhu Du, 2018. "Breaking the O (ln n ) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 225-235, May.
    6. Yanhong Gao & Ping Li & Xueliang Li, 2022. "Further results on the total monochromatic connectivity of graphs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 603-616, August.
    7. Cui Wang & Jiguo Yu & Dongxiao Yu & Baogui Huang & Shanshan Yu, 2016. "An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1052-1067, November.

    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:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-015-9845-2. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.