Route recovery in vertex-disjoint multipath routing for many-to-one sensor networks

  • Authors:

  • Wei Cheng;Kai Xing;Xiuzhen Cheng;Xicheng Lu;Zexin Lu;Jinshu Su;Baosheng Wang;Yujun Liu

  • Affiliations:

  • The George Washington University, Washington, DC, USA;The George Washington University, Washington, DC, USA;The George Washington University, Washington, DC, USA;National University of Defense Technology, Changsha, China;National University of Defense Technology, Changsha, China;National University of Defense Technology, Changsha, China;National University of Defense Technology, Changsha, China;Academy of Armored Forces Engineering, Beijing, China

  • Venue:
  • Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multipath routing is attractive for load-balancing, fault-tolerance, and security enhancement. However, constructing and maintaining a set of node-disjoint paths between the data source and sink is non-trivial in a dynamic environment. In this paper, we study the problem of route recovery in vertex-disjoint multipath routing for sensor networks with many-to-one traffic patterns. We identify the sufficient conditions for multipaths to be recovered when the existing node-disjoint paths are broken, and provide a simple framework for multipath maintenance. This framework is very efficient in time when multipath source routing is employed. Our findings can help to conserve network resource by not launching any route discovery when the data source realizes that a new route may not exist, to guide mobile data sources to relocate themselves in order to reconstruct the new multipaths, and to help newly-deployed data sources quickly determine whether the required number of multipaths exist for sure or not and then compute them. The technique proposed in this paper is a good complement to the classic max-flow algorithm when node-disjoint multipaths are needed.