Algorithm 1: Minimum-throughput Maximization Algorithm

1:initialize: ${\delta }_k^r=\Delta /K$, given ${\mathbf{Q}}_{\mathrm{ET}}^r\left[n\right]$, and ${\mathbf{Q}}_{\mathrm{ET}}^r\left[n\right]$, let $r=0$ 2: repeat 3: repeat 4:  Solve (P3) by CVX for given ${\delta }_k^r$, ${\mathbf{Q}}_{\mathrm{ET}}^r\left[n\right]$, and ${\mathbf{Q}}_{\mathrm{ET}}^r\left[n\right]$, the optimal solution denote as $P_k^r\left[n\right]$, $P_{\mathrm{ET}}^r\left[n\right]$. 5:  Solve time allocation for given $P_k^r\left[n\right]$, $P_{\mathrm{ET}}^r\left[n\right]$, ${\mathbf{Q}}_{\mathrm{ET}}^r\left[n\right]$ and ${\mathbf{Q}}_{\mathrm{DG}}^r\left[n\right]$, the optimal solution denote as ${\delta }_k^r$. 6: until convergence or maximum number of iterations 7: Output ${\delta }_k^{r+1}={\delta }_k^r$, $P_k^{r+1}\left[n\right]=P_k^r\left[n\right]$, and $P_{\mathrm{ET}}^{r+1}\left[n\right]=P_k^r\left[n\right]$ 8: Solve (P2.2) by CVX for given ${\delta }_k^{r+1}$, $P_k^{r+1}\left[n\right]$, $P_{\mathrm{ET}}^{r+1}\left[n\right]$, ${\mathbf{Q}}_{\mathrm{ET}}^r\left[n\right]$ and ${\mathbf{Q}}_{\mathrm{ET}}^r\left[n\right]$, the optimal solution is denoted as ${\mathbf{Q}}_{\mathrm{ET}}^{r+1}\left[n\right]$ and ${\mathbf{Q}}_{\mathrm{ET}}^{r+1}\left[n\right]$ 9: Update $r=r+1$ 10:until converge or maximum number of iterations;