A Nonintersecting Multipath Routing Protocol for Wireless Sensor Networks

Due to constrained resources, stable and reliable routing protocols have always been a research focus in sensor networks. In order to improve network stability, based on the breadth-first search, this paper proposes a non-intersecting multi-path routing algorithm based on the breadth-first search. The proposed algorithm constructs two disjoint paths transmitting the data collected by sensing nodes to sink node to improve the reliability of the routing protocol, which can well solve common-link problem and/or the common-node problem in multipath routing protocols. Moreover, this algorithm can also be easily applied to multi-sink node network and be extended to multi-path routing (more than two non-intersecting paths). The experiments in this study show that the packet loss rate of the algorithm does not increase when the number of network nodes increases. In addition, this algorithm can significantly reduce the average routing length and improve routing reliability in multi-sink node networks.