An explicit disjoint multipath algorithm for Cost efficiency in wireless sensor networks

In this paper, we investigate the use of explicit disjoint for the multipath routing to achieve cost-efficient operation of wireless sensor networks. The focus is on constructing completely disjointed multiple paths between the source of sensing stimulus and the destination of gathered sensor data. We propose simple schemes for multipath construction based on explicit multiple anchor nodes. For the fully disjointed multipath construction, we exploit the logical and physical schemes. The logical method classifies a multipath through the pipeline of the area where there is at least one sensor. The physical approach comprises completely disjoint multiple paths to be comprised at the source level based on the geographic routing, intermediate node side, and anchor node side and destination node side. We propose explicit multiple paths to comprise a disjoint multipath so that we removes the flooding overhead used in the multipath discovery process. The proposed scheme constructs the distributed multiple paths with data transmission through the localized information exchange between neighbor nodes. Our simulation results show the fundamental importance of an explicitly disjointed multipath proposed in this paper. For example, one of our results shows that the proposed scheme significantly reduces the signaling overhead compared to the existing multipath routing methods when there are many nodes in WSN. The simulation result also shows that the proposed scheme, compared to the explicit disjoint multiple paths, is more cost efficient than an existing multipath scheme.