To solve the common-link and common-node problem, disjoint multi-path routing (DMPR) is employed where sensors send data to the sink through link-disjoint or node-disjoint path.

This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.

Based on the basic ideas of the K-shortest path and partial link-disjoint protection, DCSP can provide differentiated services for customers according to their SLA-parameters.