Energy-Saving Traffic Scheduling in Hybrid Software Defined Wireless Rechargeable Sensor Networks

. 2017 Sep 15;17(9):2126. doi: 10.3390/s17092126

Algorithm 2 Optional Paths Search Function

Input:
A flow f, the first SDN node s on the MTE route of f, the set of neighbours of s $V_{s}$
Output:
The set of optional paths $P_{f}$
1:
for each $v \in V_{s}$ do
2:
Find the MTE route $p_{v}$ from node v to the destination of flow f with the actual energy consumption calculated by formula (20);
3:
$p_{v} = p_{v} + s$ ;
4:
Delete the loop in $p_{v}$ ;
5:
$P_{f} \leftarrow P_{f} + p_{v}$ ;
6:
end for
7:
return $P_{f}$ .