Algorithm 1. Increasing $Q^H$ slot allocation

1: for all node i do

2: if $q_t^{\left(H,i\right)}$!=0

3:  Calculate $F_t^{\left(H,i\right)}$

4: end if

5: if $q_t^{\left(L,i\right)}$!=0

6:  Calculate $F_t^{\left(L,i\right)}$

7: end if

8: if $F_t^{\left(H,i\right)}>F_t^{\left(L,i\right)}$

9:  if $p_t^{\left(L,i\right)}>0$

10:   ${\widehat{F}}_t^{\left(H,i\right)}\leftarrow$ $p_t^{\left(H,i\right)}+1$

11:   ${\widehat{F}}_t^{\left(L,i\right)}\leftarrow$ $p_t^{\left(L,i\right)}-1$

12:   ${\widehat{\mathbf{𝓕}}}_t^i\leftarrow \sqrt{{(1-{\widehat{F}}_t^{\left(H,i\right)})}^2+{(1-{\widehat{F}}_t^{\left(L,i\right)})}^2}$

13:   ${\mathbf{𝓕}}_t^i\leftarrow \sqrt{{(1-F_t^{\left(H,i\right)})}^2+{(1-F_t^{\left(L,i\right)})}^2}$

14:  end if

15:  while ${\mathcal{F}}_t^i>{\widehat{\mathcal{F}}}_t^i$ do

16:   $p_t^{\left(H,i\right)}\leftarrow p_t^{\left(H,i\right)}+1$

17:   $p_t^{\left(L,i\right)}\leftarrow p_t^{\left(L,i\right)}-1$

18:   $\mathbf{if}{p}_t^{\left(L,i\right)}>0$

19:    ${\mathbf{𝓕}}_t^i\leftarrow {\widehat{\mathbf{𝓕}}}_t^i$

20:    ${\widehat{\mathbf{𝓕}}}_t^i\leftarrow \sqrt{{(1-{\widehat{F}}_t^{\left(H,i\right)})}^2+{(1-{\widehat{F}}_t^{\left(L,i\right)})}^2}$

21:   else break;

22:   end if

23:  end while

24: end if

25: end if