Algorithm 1 Proposed ECM-RMA algorithm
Input: $\mathit{Q}\left(t\right),\mathit{E}\left(t\right),B_{m,ul},h_{m,ul}\left(t\right),w_0,f_m^n\left(t\right),L_m\left(t\right),T,\forall m\in \mathcal{M},\forall n\in \mathcal{N}$
Output: ${\mathit{p}}^{\ast }\left(t\right),{\mathit{\tau }}^{\ast }\left(t\right),{\mathit{e}}^{\ast }\left(t\right),\mathit{Q}(t+1),\mathit{E}(t+1)$
1:	$/\ast$ Transmission Power and Transmission Time Allocation $\ast /$
2:	for $m\in \mathcal{M}$ do
3:	for $n\in \mathcal{N}$ do
4:	Solve the standard convex optimization problem in (35) to acquire the optimal power and time allocation policy;
5:	end for
6:	end for
7:	$/\ast$ Battery Management $\ast /$
8:	for$m\in \mathcal{M}$do
9:	if $E_m\left(t\right)<\mathsf{\Omega }$ then
10:	$e_{m,w}\left(t\right)=max\{\mathsf{\Omega }-E_m\left(t\right)-{\gamma }_m\left(t\right),0\}$;
11:	${\ell }_m\left(t\right)=T-{\displaystyle {\displaystyle \sum }_{n\in \mathcal{N}}}{\tau }_m^n\left(t\right)$;
12:	${{\ell }_m}^{\ast }\left(t\right)=min\{{\ell }_m,\frac{e_{m,w}\left(t\right)}{\mu p_{ap}\left(t\right)h_{m,dl}\left(t\right)}\}$;
13:	$e_{m,w}^{\ast }\left(t\right)=\mu p_{ap}\left(t\right)h_{m,dl}\left(t\right){{\ell }_m}^{\ast }\left(t\right)$;
14:	else
15:	$e_{m,w}^{\ast }\left(t\right)=0$
16:	end if
17:	end for
18:	$/\ast$ Update the Queue Length $\ast /$
19:	for $m\in \mathcal{M}$ do
20:	Compute $E_m(t+1)$ based on Equation (11);
21:	for $n\in \mathcal{N}$ do
22:	Compute $Q_m^n(t+1)$ based on Equation (14);
23:	end for
24:	end for