Table - PMC

Skip to main content

View full-text article in PMC

. 2023 Sep 14;23(18):7889. doi: 10.3390/s23187889

Algorithm 1: Window Update Algorithm

1:

i f (C u r r e n t w i n d o w i s R T S w i n d o w | | N e x t w i n d o w i s R T S w i n d o w) {

2:

{W i n d}_{n e x t} = {W i n d}_{c u r r}

;
3:

b r e a k

;
4:

}

5:

e l s e {

6:

i f (P_{l o s s} \leq P_{u p}) {

7:

i f (R_{c u r r} < R_{m a x}) {

8:

{W i n d}_{n e x t} = {W i n d}_{m i n};

9:

}

10:

e l s e {

11:

{W i n d}_{n e x t} = {W i n d}_{c u r r} + c e i l ({W i n d}_{c u r r} * (P_{u p} - P_{l o s s}))

;
12:

i f ({W i n d}_{n e x t} \geq {W i n d}_{m a x}) {

13:

{W i n d}_{n e x t} = {W i n d}_{m a x}

;
14:

}

15:

}

16:

}

17:

e l s e i f (P_{l o s s} \geq P_{d o w n}) {

18:

i f (R_{c u r r} > R_{m i n}) {

19:

{W i n d}_{n e x t} = {W i n d}_{c u r r} - c e i l ({W i n d}_{c u r r} * (P_{l o s s} - P_{d o w n}))

;
20:

i f ({W i n d}_{n e x t} \leq {W i n d}_{m i n}) {

21:

{W i n d}_{n e x t} = {W i n d}_{m i n}

;
22:

}

23:

}

24:

e l s e {

25:

{W i n d}_{n e x t} = {W i n d}_{m a x}

;
26:

}

27:

}

28:

e l s e {

29:

{W i n d}_{n e x t} = {W i n d}_{c u r r}

;
30:

}

31:

}