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

Kejia Zhang (), Qilong Han, Guisheng Yin and Haiwei Pan
Additional contact information
Kejia Zhang: Harbin Engineering University
Qilong Han: Harbin Engineering University
Guisheng Yin: Harbin Engineering University
Haiwei Pan: Harbin Engineering University

Journal of Combinatorial Optimization, 2016, vol. 31, issue 4, No 17, 1623-1641

Abstract: 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.

Keywords: Disjoint paths; Minimum total length; Sensor networks; Distributed algorithm (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9845-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-015-9845-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9845-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().