Efficient distributed algorithm for correctly finding disjoint paths in wireless sensor networks
by Kejia Zhang; Hong Gao
International Journal of Sensor Networks (IJSNET), Vol. 13, No. 3, 2013

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

Online publication date: Tue, 25-Jun-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com