Skip to Main Content
In this paper, an energy-efficient multiple paths routing algorithm for wireless sensor network (WSN) is proposed. It consists of three elements: (i) gradients to disseminate data over multiple paths from a source to a sink, (ii) rules to set up disjoint multiple paths, and (iii) policies to select the working path. By limiting the maximum number of the gradients, the exploratory data messages forwarded are decreased efficiently. By using the rules for setting up disjoint multiple paths, the sink node can get a sufficient number of disjoint multiple paths, which enables our algorithm to recover from a routing failure quickly. Finally, we evaluate its performance and compare to other related algorithms from perspectives of average dissipated energy and the delay to set up multiple paths.