Algorithm 1 Pseudo-code of the proposed algorithm

c = 0;

for k = 1; k < I; k++

while ($\text{c}++<c_{MAX}$)

Perform data transmission and record ${\beta }_k$

end

if (k == 1)

${{\displaystyle \sum }}_{j\ne i}\left(1/t_j\right)=g\left({\beta }_k\right)$

${\lambda }_i=$RateUpdate(${{\displaystyle \sum }}_{j\ne i}\left(1/t_j\right)$)

else if ($\left|{\beta }_k-{\beta }_{last}\right|<{\beta }_{THR}$)

// Do not change the transmission rate

else if $\left({\beta }_k>{\beta }_{last}\right)$

${{\displaystyle \sum }}_{j\ne i}\left(1/{\lambda }_j\right)=g\left({\beta }_k\right)$

Obtain new nodes’ traffic:

${{\displaystyle \sum }}_{l\in change}\left(1/t_l\right)={{\displaystyle \sum }}_{j\ne i}\left(1/{\lambda }_j\right)-{\mathrm{\Delta }}^{*}{{\displaystyle \sum }}_{j\ne i}\left(1/t_j\right)$

${\lambda }_i=$RateUpdate(${{\displaystyle \sum }}_{j\ne i}\left(1/t_j\right)+{{\displaystyle \sum }}_{l\in change}\left(1/t_l\right)$)

else if $\left({\beta }_k<{\beta }_{last}\right)$

${{\displaystyle \sum }}_{l\in current}\left(1/{\lambda }_j\right)=g\left({\beta }_k\right)$

Obtain the current traffic:

${{\displaystyle \sum }}_{l\in current}\left(1/t_l\right)={{\displaystyle \sum }}_{l\in current}\left(1/{\lambda }_j\right)/{\mathrm{\Delta }}^{*}$

${\lambda }_i=$RateUpdate(${{\displaystyle \sum }}_{l\in current}\left(1/t_l\right)$)

end

c = 0

end

function ${\lambda }_i=$RateUpdate(Traffic)

${\beta }_{last}={\beta }^{*}=h\left(\text{Traffic}\right)$

${\mathrm{\Delta }}^{*}={\mathrm{\Delta }}^{*}\left({\beta }^{*},\text{Traffic}\right)$ (using Equation (11))

${\lambda }_i=t_i/{\mathrm{\Delta }}^{*}$

end