OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
From MaRDI portal
Publication:281809
DOI10.1007/S10878-015-9845-2zbMath1338.90437OpenAlexW2028675638MaRDI QIDQ281809
Haiwei Pan, Qilong Han, Ke-Jia Zhang, Guisheng Yin
Publication date: 11 May 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9845-2
Related Items (3)
Metric and Distributed On-Line Algorithm for Minimizing Routing Interference in Wireless Sensor Networks ⋮ DOAMI: a distributed on-line algorithm to minimize interference for routing in wireless sensor networks ⋮ Secure path key establishment schemes based on random key management for WSN
Cites Work
- A faster parallel algorithm for \(k\)-connectivity
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph
- Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
- On the complexity of vertex-disjoint length-restricted path problems
- An improved distributed data aggregation scheduling in wireless sensor networks
- Efficient Parallel Algorithms for Testingkand Finding Disjoints-tPaths in Graphs
- Heuristics for finding a maximum number of disjoint bounded paths
- Disjoint paths in a network
- Distributed algorithms for computing shortest pairs of disjoint paths
- The complexity of finding maximum disjoint paths with length constraints
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
- Computing and Combinatorics
- Minimum-latency aggregation scheduling in wireless sensor network
This page was built for publication: OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
