Algorithm 2 Joint allocation mechanism of bandwidth and power.

Input:  Illuminated cells in current time slot: $\left\{N\right\}$, demand of illuminated cells: $D_t=\left\{D_t^i\left|i\in \mathrm{N}\right.\right\}$, onboard available resources: $B_{tot}$, $P_{tot}$, sub-bands: $\{{\beta }_1,{\beta }_2,\dots ,{\beta }_m\}$, constraint between power and band: $\left\{Pt{h}_i^{\beta m}\right\}$ Output:  $B_i$ and $P_i$ for each illuminated cell 1:Perform interference clustering according to Section 4.2.1 and the number of cells in each cluster is n; 2:if$n>1$then; 3:    Population initialize 4:    for $t=1$ to iteration time do 5:        Calculate fitness according to Section 4.2.2 (A) 6:        Record elite with best fitness 7:        Perform selection, coding, crossover, mutation and decoding with optimal control considering $\left\{Pt{h}_i^{\beta m}\right\}$; 8:        Replace the least fit individuals with elite; 9:    end for 10:    Calculate $C_i$ by Equation (11); 11:else 12:   Select $B_i=\{{\beta }_a,\dots ,{\beta }_b\}$ and $P_i=min\{Pt{h}_i^{\beta m},m\in (a,b)\}$ according to Section 4.2.2 (B) based on Constraint Map shown as Figure 5; 13:end if 14:Recalculate $C_i$ considering the CCI of all cells according to Section 3.4.1; 15:return allocation scheme $B_i$, $P_i$ and capacity $C_i$;