Algorithm 1 Heuristic Beam Scheduling Algorithm

Require: $\mathcal{T}$, $\mathcal{I}$, $\mathcal{J}$, $\mathcal{K}.$ Ensure: $\mathcal{H}$. 1:Initialize Let $\mathcal{H}=Ø$, $\mathcal{H}={\left\{0\right\}}_{1\times K}$. 2:Calculate the proportion of the ST number in all cells using $\mathcal{T}$, and store them in $\mathcal{P}$ (the total number of slots is $I\times J$). 3:for slot i in $\mathcal{I}$ do 4:   Let ${\mathcal{K}}^{\prime }=\mathcal{K}$. 5:   for beam j in $\mathcal{J}$ do 6:     Let $a=1$ 7:     while ($a==1$) do 8:        Choose a cell k from ${\mathcal{K}}^{\prime }$ randomly. 9:   if the allocated slot proportion for cell k is smaller than $\mathcal{P}\left(k\right)$ then 10:         if the beam that points to cell k is not interfered with other beams then 11:              Append $\{i,j,k\}$ to $\mathcal{H}$. 12:              Let $\mathcal{T}\left(k\right)=\mathcal{T}\left(k\right)+1$. 13:              Let ${\mathcal{K}}^{\prime }\left(k\right)=0$ or delete k from ${\mathcal{K}}^{\prime }$. 14:            Update the traffic size or required number of slots for cell k according to allocated slot and traffic arrival of cell k. 15:              Let $a=0$. 16:          else 17:              Let ${\mathcal{K}}^{\prime }\left(k\right)=0$ or delete k from ${\mathcal{K}}^{\prime }$. 18:          end if 19:        else 20:          Let ${\mathcal{K}}^{\prime }\left(k\right)=0$ or delete k from ${\mathcal{K}}^{\prime }$. 21:        end if 22:     end while 23:   end for 24:end for