By Topic

A localized algorithm for finding disjoint paths in wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ronghui Hou ; Sch. of Electr. & Inf., Northwestern Polytech. Univ., Xi''an ; Haoshan Shi

This letter presents a localized algorithm that finds multiple node-disjoint paths in wireless sensor networks. The algorithm needs only local topology knowledge and provides automatic path restoration. We describe the algorithm, give the proof of correctness, and evaluate its performance using simulation. We conclude that the proposed algorithm is more suitable for wireless sensor networks than the existing distributed algorithms

Published in:

Communications Letters, IEEE  (Volume:10 ,  Issue: 12 )