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

DOI10.1007/S10878-015-9845-2zbMATH1338.90437OpenAlexW2028675638MaRDI QIDQ281809FDOQ281809

Authors Ke-Jia Zhang, Qilong Han, Guisheng Yin, Haiwei Pan

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

zbMATH Keywords

distributed algorithmsensor networksdisjoint pathsminimum total length

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Distributed algorithms for computing shortest pairs of disjoint paths
• Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
• Optimal distributed all pairs shortest paths and applications
• Publication:3026357
• Minimum energy node disjoint multipath routing for Ad-hoc networks
• Optimal algorithms for broadcast and gossip in the edge-disjoint path modes

Cites work

• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• A faster parallel algorithm for \(k\)-connectivity
• A greedy algorithm for the fault-tolerant connected dominating set in a general graph
• An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
• An improved distributed data aggregation scheduling in wireless sensor networks
• Computing and Combinatorics
• Disjoint paths in a network
• Distributed algorithms for computing shortest pairs of disjoint paths
• Efficient Parallel Algorithms for Testingkand Finding Disjoints-tPaths in Graphs
• Heuristics for finding a maximum number of disjoint bounded paths
• Minimum-latency aggregation scheduling in wireless sensor network
• On the complexity of vertex-disjoint length-restricted path problems
• Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem
• The complexity of finding maximum disjoint paths with length constraints

Cited in

(5)

• Secure path key establishment schemes based on random key management for WSN
• DOAMI: a distributed on-line algorithm to minimize interference for routing in wireless sensor networks
• Distributed algorithms for computing shortest pairs of disjoint paths
• Metric and distributed on-line algorithm for minimizing routing interference in wireless sensor networks
• On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks

This page was built for publication: OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281809)