Algorithm 1. the algorithm of obtaining available energy and obtaining the probability of marking and logging

INPUT: the observed solar radiation power // $d_i\left(i\ge 0\right)$ is the $i$ th day, $t_{i,j}\left(0\le j\le 23\right)$ is the $j$ th hour of the $i$ th day, // $F_{i,j}$ is the observed solar radiation power at $t_{i,j}$; $E_{initial}$ is the initial energy of the node battery, // $E_{max}$ is the max electricity in battery. OUTPUT: the available energy // ${\mathrm{U}}_{\mathrm{i},\mathrm{j}}$ is the available energy at $t_{i,j}$; $r_{i,j}$ is the remaining battery level. (1) get available energy stage 1: Find a day with the minimum total observed solar radiation power in the whole day using the formula $su{m}_i={{\displaystyle \int }}_0^{23}{F}_{i,j}\mathrm{dt}$. In addition, define this day as $d_0$. 2: If $\left(i=0\right)$     $t_{0,n}$ is the time to start the sunshine.     Get $e$ using the formula $e=\lfloor \frac{E_{initial}}{n+1}\rfloor$.     Get $t_{0,𝕙}$ is the highest observed solar radiation time of the day.     If $\left(0\le j\le n\right)$       $U_{0,0}=U_{0,1}=\cdots =U_{0,n}=e$;       $r_{0,j}=r_{0,j-1}+F_{0,j}-e$;}     If $\left(n+2\le j\le 𝕙\right)$       $U_{0,j}=F_{0,j}$;       $r_{0,j}=r_{0,n}$;     If $\left(𝕙+1\le j\le 23\right)$       $U_{0,13}=\cdots =U_{0,23}=e$;       $r_{0,j}=r_{0,j-1}+F_{0,j}-e$;     If $\left(r_{i,j}\ge E_{max}\right)$       $r_{i,j}=E_{max}$;    End if  End if 3: If $\left(i\ge 1\right)$     Switch ($j$)    Case1:      If $\left(0\le j\le n\right)$           $U_{i,0}=U_{i,1}=\cdots =U_{i,n}=e$;           $r_{i,j}=r_{i,j-1}+F_{i,j}-e$;      Break;       Case2:      If $\left(j=n+1\right)$           $U_{i,n+1}=U_{0,n+1}$;      Break;     Case3:      If $(n+2\le j<𝕙)$           $U_{i,j}=F_{i,j-1}$;           $r_{i,j}=r_{i,j-1}+F_{i,j}-U_{i,j}$;           If $\left(r_{i,j}\ge E_{max}\right)$           $r_{i,j}=E_{max}$;       Break;     Case4:      If $\left(𝕙\le j\le 𝕙+2\right)$           $U_{i,j}=0.6F_{i,j-1}$;           $r_{i,j}=r_{i,j-1}+F_{i,j}-U_{i,j}$;           If $\left(r_{i,j}\ge E_{max}\right)$            $r_{i,j}=E_{max}$;      Break;     Default:      If $(𝕙+2<j\le 23)$            $U_{i,0}=U_{i,1}=\cdots =U_{i,n}=e$;            $r_{i,j}=r_{i,j-1}+F_{i,j}-e$;            If $\left(r_{i,j}\ge E_{max}\right)$             $r_{i,j}=E_{max}$;      Break;  End if (2) get the probability of marking stage 4: For each $t_{i,j}$ in the set {$t_{i,0},t_{i,1},\dots ,t_{i,23}$} Do     Get the probability of marking ${\alpha }_{i,j}$ using Equation (41);  End for (3) get the probability of logging stage 5: For each $t_{i,j}$ in the set {$t_{i,0},t_{i,1},\dots ,t_{i,23}$} Do     Get the probability of logging ${\beta }_{i,j}$ using Equation (50);  End for