Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

This paper investigates the MINimum-length-\(k\)-Disjoint-Paths (MIN-\(k\)-DP) problem: in a sensor network, given two nodes \(s\) and \(t\), a positive integer \(k\), finding \(k\) (node) disjoint paths connecting \(s\) and \(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\) disjoint paths if there exist \(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\)-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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Baek JW, Nam YJ, Seo D-W (2007) An energy-efficient k-disjoint-path routing algorithm for reliable wireless sensor networks. In: Proceedings of the 5th IFIP WG 10.2 international conference on software technologies for embedded and ubiquitous systems (SEUS)

  • Bhandari R (1997) Optimal physical diversity algorithms and survivable networks. In: Proceedings of the 2nd IEEE symposium on computers and communications (ISCC)

  • Bley Andreas (2003) On the complexity of vertex-disjoint length-restricted path problems. Comput Complex 12:131–149

    Article  MathSciNet  MATH  Google Scholar 

  • Cai Z, Chen Z, Lin G (2009) Approximation algorithm for the capacitated multicast tree routing problem. Theor Comput Sci 410:5415–5424

    Article  MathSciNet  MATH  Google Scholar 

  • Cai Z, Chen ZZ, Lin G, Wang L (2008) An improved approximation algorithm for the capacitated multicast tree routing problem. Lect Notes Comput Sci 5165:286–295

    Article  MathSciNet  MATH  Google Scholar 

  • Cai Z, Goebel R, Lin G (2011) Size-constrained tree partitioning: a story on approximating the multicast k-tree routing problem. Theor Comput Sci 412:240–245

    Article  MathSciNet  MATH  Google Scholar 

  • Cai Z, Lin G, Xue G (2005) Improved approximation algorithms for the capacitated multicast routing problem. Lect Notes Comput Sci 3595:136–145

    Article  MathSciNet  MATH  Google Scholar 

  • Chen Y, Guo X, Zeng Q (2004) Amr: a multipath routing algorithm based on maximum flow in ad hoc networks. Acta Electron Sin 32:1297–1301

    Google Scholar 

  • Deb B, Bhatnagar S, Nath B (2003) Reinform: reliable information forwarding using multiple paths in sensor networks. In: Proceedings of the 28th annual IEEE international conference on local computer networks

  • Fang X, Shi S, Li J (2009) A disjoint multi-path routing algorithm in wireless sensor network. J Comput Res Develop 46:2053–2061

    Google Scholar 

  • Ganesan D, Govindan R, Shenker S, Estrin D (2001) Highly-resilient, energy-efficient multipath routing in wireless sensor networks. In: Proceedings of the 2nd ACM international symposium on mobile ad hoc networking & computing (MobiHoc)

  • Griffin M, Korkmaz T (2011) Distributed verification of global multiple disjoint paths in mobile wireless networks. In: International wireless communications and mobile computing conference (IWCMC)

  • Guo L, Li Y, Cai Z (2014) Minimum-latency aggregation scheduling in wireless sensor network. J Comb Optim 10:1–32

    MathSciNet  MATH  Google Scholar 

  • Hashiguchi T, Tajima K, Takita Y, Naito T (2011) Node-disjoint paths search in wdm networks with asymmetric nodes. In: International conference on optical network design and modeling (ONDM)

  • Ishida K, Kakuda Y, Kikuno T (1995) A routing protocol for finding two node-disjoint paths in computer networks. In: Proceedings of the 1995 international conference on network protocols (ICNP)

  • Itai A, Perl Y, Shiloach Y (1982) The complexity of finding maximum disjoint paths with length constraints. Networks 12:277–286

    Article  MathSciNet  MATH  Google Scholar 

  • Iwama K, Iwamoto C, Ohsawa T (1997) A faster parallel algorithm for k-connectivity. Inf Process Lett 61:265–269

    Article  MathSciNet  Google Scholar 

  • Khuller S, Schieber B (1989) Efficient parallel algorithms for testing connectivity and finding disjoint s–t paths in graphs. In: 30th annual symposium on foundations of computer science

  • Kumar A, Varma S (2010) Geographic node-disjoint path routing for wireless sensor networks. IEEE Sens J 6:1138–1139

    Article  Google Scholar 

  • Lee YO, Reddy ALN (2010) Disjoint multi-path routing and failure recovery. In: IEEE international conference on communications (ICC)

  • Li D, Zhu Q, Du H, Li J (2014) An improved distributed data aggregation scheduling in wireless sensor networks. J Comb Optim 27(2):221–240

    Article  MathSciNet  MATH  Google Scholar 

  • Li S, Wu Z (2005) Node-disjoint parallel multi-path routing in wireless sensor networks. In: Proceedings of the second international conference on embedded software and systems (ICESS)

  • Ogier R, Shacham N (1989) A distributed algorithm for finding shortest pairs of disjoint paths. In: Proceedings of the eighth annual joint conference of the IEEE computer and communications societies (INFOCOM)

  • Omar S, Zoulikha M, Cousin B (2011) Energy efficiency in ad hoc wireless networks with node-disjoint path routing. In: International workshop on systems, signal processing and their applications (WOSSPA)

  • Ronen D, Perl Y (1984) Heuristics for finding a maximum number of disjoint bounded paths. Networks 14:531–544

    Article  MathSciNet  MATH  Google Scholar 

  • Sidhu D, Nair R, Abdallah S (1991) Finding disjoint paths in networks. In: Proceedings of the conference on communications architecture & protocols (SIGCOMM)

  • Srinivas A, Modiano E (2003) Minimum energy disjoint path routing in wireless ad-hoc networks. In: Proceedings of the 9th annual international conference on mobile computing and networking (MobiCom)

  • Suurballe JW (1974) Disjoint paths in a network. Networks 4:125–145

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang K, Yin G, Han Q, Lin J (2014) Dfdp: a distributed algorithm for finding disjoint paths in wireless sensor networks with correctness guarantee. Int J Distrib Sens Netw

  • Zhou J, Zhang Z, Wu W, Xing K (2014) A greedy algorithm for the fault-tolerant connected dominating set in a general graph. J Comb Optim 28(1):310–319

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work is supported by National Natural Science Foundation of China (Grant Nos. 61300207, 61272186, 61370084, 61272184), Fundamental Research Funds for the Central Universities (Grant Nos. HEUCF100610, HEUCF100609).

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Harbin Engineering University, Room 541, Building No. 21, Harbin, 150001, China

    Kejia Zhang, Qilong Han, Guisheng Yin & Haiwei Pan

Authors
  1. Kejia Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qilong Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guisheng Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Haiwei Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kejia Zhang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, K., Han, Q., Yin, G. et al. OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks. J Comb Optim 31, 1623–1641 (2016). https://doi.org/10.1007/s10878-015-9845-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-015-9845-2

Keywords

Search

Navigation