Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties

. 2021 Oct 31;21(21):7254. doi: 10.3390/s21217254

Algorithm 3: The Edge Filtering Algorithm On The Fly, EF_OTF

Input: An uncertain graph G, an integer k, a weight threshold

ω

Output: top-k RSTs.

1: $Q \leftarrow ⌀; ρ \leftarrow 0; s o r t (E); C \leftarrow X . I n i t i a l i z e ()$

2: while $C i s n o t t h e l a s t c o m b i n a t i o n$ do

3: $ρ \leftarrow Q . m i n () . p r o b a b i l i t y ()$

4: if $P (C) > ρ$ then

5: if $W (C) < ω$ and $i s T r e e (C)$ then

6: $P_{M S T} (T_{C}) \leftarrow c a c u l a t e_M S T_P r o b a b i l i t y (T_{C})$

7: if $Q . s i z e () < k$ then

8: $Q . i n s e r t (T_{C})$

9: else if $P_{M S T} > ρ$ then

10: $Q . r e m o v e_m i n ()$ ; $Q . i n s e r t (T_{C})$

11: end if

12: end if

13: $C \leftarrow n e x t c o m b i n a t i o n$

14: else

15: $C \leftarrow f i r s t c o m b i n a t i o n o f n e x t g r o u p$

16: end if

17: end while

18: return $Q . a l l ()$