Finding disjoint paths in networks
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
A faster parallel algorithm for k-connectivity
Information Processing Letters
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Optimal Physical Diversity Algorithms and Survivable Networks
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
A routing protocol for finding two node-disjoint paths in computer networks
ICNP '95 Proceedings of the 1995 International Conference on Network Protocols
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
On the complexity of vertex-disjoint length-restricted path problems
Computational Complexity
Node-Disjoint Parallel Multi-Path Routing in Wireless Sensor Networks
ICESS '05 Proceedings of the Second International Conference on Embedded Software and Systems
End-to-end pairwise key establishment using node disjoint secure paths in wireless sensor networks
International Journal of Security and Networks
Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
Computers and Operations Research
An energy-efficient k-disjoint-path routing algorithm for reliable wireless sensor networks
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Efficient multipath in wireless networks using network coding over braided meshes
International Journal of Sensor Networks
A multipath QoS routing protocol in wireless sensor networks
International Journal of Sensor Networks
k-penalty: a novel approach to find k-disjoint paths with differentiated path costs
IEEE Communications Letters
| Hi-index | 0.00 |
Routing messages through multiple node disjoint paths connecting two sensor nodes is a promising way to increase robustness, throughput and load balance of sensor networks. This paper proposes a distributed algorithm to find k disjoint paths connecting two given nodes s and t. A set of paths connecting s and t are disjoint if any two of them do not have any common nodes besides s and t. Unlike the existing distributed algorithms, the proposed algorithm can guarantee answer correctness, i.e. it will output k disjoint paths if there exist k disjoint paths in the network or the maximum number of disjoint paths otherwise. Compared to the centralised algorithms which can also guarantee answer correctness, this algorithm is shown to have much lower communication cost, which is confirmed by experimental results. To the best of our knowledge, this algorithm is the first distributed algorithm which can guarantee answer correctness.