Table 3 Packet scheduling and resource management scheme

1

Initialize the total RB set Ω={1,...,N} and the RBs determined to be assigned to client k, N _k =∅, for 1≤k≤K. a _k,n =0,b _k,j =0, for 1≤k≤K,n∈Ω.

2

While (Ω≠∅)

3

For n∈Ω

5

For 1≤k≤K

6

Update N _k =N _k ∪{n} and a _k,n =1.

7

Solve the problem (10), update \(a_{k,n}^{*}=1\) and \(b_{k,j}^{*}=1\).

8

Solve the problem (11), get \(\tau _{k,m}^{*}\).

9

Calculate \(f\left (\tau _{k,m}^{*},a_{k,n}^{*},b_{k,j}^{*},N_{k}\right)=\sum \limits _{m = 1}^{M_{k}}{\tau _{k,m}^{*}}\phantom {\dot {i}\!}\) and C _k,n

10

End for For

11

\(k^{*} = \mathop {argmax}\limits _{1 \leq k \leq K} {C_{k,n}}\)

12

Update N _k =N _k ∖{n}, a _k,n =0 and \(b_{k,j^{*}}=0\phantom {\dot {i}\!}\) for k≠k ^∗. Ω=Ω∖{n}

13

End for For

14

End for while

15

Outputoptimal packet scheduling \(\tau _{k,m}^{*}\) and RB assignment \(N_{k}^{*}\).