Low-delay Node-disjoint Multi-path Routing using Complementary Trees for Industrial Wireless Sensor Networks

• Luming Liu,
• Zhihao Ling,
• Yun Zuo,

Vol. 5, No. 11, November 28, 2011
10.3837/tiis.2011.11.010, Download Paper (Free):

• Node-disjoint multi-path routing
• complementary trees
• path discovery method
• average path length
• Time Complexity

Abstract

Complementary trees are two spanning trees rooted at the sink node satisfying that any source nodes two paths to the sink node on the two trees are node-disjoint. Complementary trees routing strategy is a special node-disjoint multi-path routing approach. Several complementary trees routing algorithms have been proposed, in which path discovery methods based on depth first search (DFS) or Dijkstras algorithm are used to find a path for augmentation in each round of path augmentation step. In this paper, a novel path discovery method based on multi-tree-growing (MTG) is presented for the first time to our knowledge. Based on this path discovery method, a complementary trees routing algorithm is developed with objectives of low average path length on both spanning trees and low complexity. Measures are employed in our complementary trees routing algorithm to add a path with nodes near to the sink node in each round of path augmentation step. The simulation results demonstrate that our complementary trees routing algorithm can achieve low average path length on both spanning trees with low running time, suitable for wireless sensor networks in industrial scenarios.

Statistics

Cite this article