Algorithm 1.

LGR-Primal Algorithm.

Step 1) Assign the arc weight of the each link (n, k) as $e_{\mathit{nk}}\left(d_{\mathit{nk}}\right)+u_{\mathit{nk}}^2+u_{\mathit{nk}}^3+u_{\mathit{nk}}^4+u_{\mathit{nk}}^5+u_{\mathit{nk}}^6$. Step 2) Perform a Dijkstra’s shortest path algorithm to identify the routing path (i.e., xsp) from each data source node s to the sink node. Step 3) Determine the other decision variables (y(n,k), rn, znk and cnk) without violating the associated constraints. Step 4) Calculate the objective value of the problem (IP).