Algorithm 2. Energy conserving and transmission radius adaptive protocol.

INPUT: ${ℱ}^t$,${\Delta }_y$,$f$, $\zeta$, R,$r$,$\mathrm{𝕖}$

OUTPUT: the new maximum energy consumption ${\mathbb{E}}_{max}^o$

1: Set $𝔨=1;$

2: Calculate the available energy at time t of one day ${\mathcal{A}}_j$ using Equations (31) and (32);

3: Calculate the optimal transmission radius set $𝓇$ $=\left\{r+{𝓍}_{\nabla }^{\mathrm{o}},r-{𝓍}_{\nabla }^o, r+2{𝓍}_{\nabla }^o,r-2{𝓍}_{\nabla }^o, \dots ,r+{\mathcal{S}}_{𝓀}{𝓍}_{\nabla }^o,r-{\mathcal{S}}_{𝓀}{𝓍}_{\nabla }^o \right\}$ and its maximum energy consumption ${\mathbb{E}}_{max}^o$ using Algorithm 1;

4: Calculate the maximum energy consumption ${ℰ}_{max}^r$ using Equation (33);

5: For $𝑡=0 to 23$ Do

6: If ${\mathcal{A}}_t==\mathrm{𝕖}$ Then      // Adjusting the transmission radius with transmission radius set $𝓇$

7: For $\mathfrak{p}=1 \mathrm{to} {\mathcal{S}}_{𝓀}$ Do

8: $r_{\mathfrak{p}}=r_0+\mathfrak{p}\times {𝓍}_{\nabla }^{\mathrm{o}}$;

9: For $d>r_{\mathfrak{p}}\&\&d<R$ Do

10: Make ${\mathbb{N}}_d$ send data with the transmission radius $r_{\mathfrak{q}}$;

11: End for

12: End for

13: Else   //Make full use of solar energy and reduce delay

14: While $r<\mathrm{R}$   // Find the longest radius that is less than the available energy

15: $r_{new}=r+{\Delta }_y\times \mathfrak{k}$;

16: Calculate ${ℰ}_{max}^{r_{new}}$ using Equation (33)

17: Until ${ℰ}_{max}^{r_{new}}<{\mathcal{A}}_j$

18: For $d>r_{new}\&\&d<R$ Do     //Use a bigger transmission radius to improve energy utilization

19: Make ${\mathbb{N}}_d$ send data with the new transmission radius $r_{new}$;

20: End for

21: End if

22: End for

23: If ${\mathbb{E}}_{max}^o<{ℰ}_{max}^r$ Then

24: Output the new maximum energy consumption ${\mathbb{E}}_{max}^o$

25: End If

26: End