Algorithm 2 Bisection Search of $P_{\mathrm{rad}}$

1:Initialization: $a=P_{\min }-P_{\mathrm{com}}$, $b=P_{\mathrm{Total}}-P_{\mathrm{com}}$, $c^{\left(n\right)}$, $f\left(x\right)=Q_1\left(\sqrt{2{\gamma }_{\mathrm{rad}}x},\sqrt{2\lambda }\right)$, the tolerance $ϵ>0$;   2:Loop until: $p_{\mathrm{D}}^{\left(n\right)}-{\delta }_{\mathrm{D}}\ge ϵ$   if $f\left(a\right)\ge 0$ then      $P_{\mathrm{rad}}^{\left(n\right)}\leftarrow a$ and stop the iteration;   else      $c^{\left(n\right)}\leftarrow \frac{a+b}{2}$;      if $f\left(c^{\left(n\right)}\right)=0$ then       $P_{\mathrm{rad}}^{\left(n\right)}\leftarrow a$ and stop the iteration;      if $f\left(c^{\left(n\right)}\right)<0$ then       $a\leftarrow c^{\left(n\right)}$;       $c^{\left(n\right)}\leftarrow \frac{a+b}{2}$;      if $f\left(c^{\left(n\right)}\right)>0$ then       $b\leftarrow c^{\left(n\right)}$;       $c^{\left(n\right)}\leftarrow \frac{a+b}{2}$;      end if      Set $n\leftarrow n+1$;   end if   3:End loop