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

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

Algorithm 3 Optional Path Selection Function

Input:
The set of optional paths $P_{f}$ of all flows F
Output:
A selected optional path p and its corresponding flow f
1:
for each $p \in P$ do
2:
Calculate the $c o u n t$ , $r e s t s i z e$ , and $c a p$ of p;
3:
end for
4:
Arrange P in ascending order according to $c o u n t$ ;
5:
Initialize $i \leftarrow 0$ , a temporary set of optional paths $P_{t} \leftarrow Ø$ ;
6:
for $i = 0; i \leq | P |; i + +$ do
7:
if $c o u n t [i]$ ==count[0] then
8:
$P_{t} \leftarrow P_{t} + P [i]$ ;
9:
end if
10:
end for
11:
Arrange $P_{t}$ in descending order according to $\bar{r}$ and $r e s t s i z e$ ;
12:
for $i = 0; i \leq | P_{t} |; i + +$ do
13:
if $r e s t s i z e [i] > 0$ then
14:
break;
15:
end if
16:
end for
17:
return $p \leftarrow P [i]$ and the corresponding flow f.