Algorithm 1 Channel selection algorithm based on matching

1. Initialize preference lists $P{L}_n^E$, $P{L}_k^C$ for eMBB users and channels

2. Set the matching set $M{C}^E=\varnothing$, $op=1$;

3. while $op==1$ do

4. Set $op=0$;

5.  for each eMBB user $n$ do

6.   if $P{L}_{n,k}^E\ne \varnothing$

7.    Select the optimal channel $c_k$ in the preference list $P{L}_n^E$ as $M{C}^E\left(u_n\right)$;

8.   if the number of participants of $M{C}^E\left(u_n\right)==$ maximum capacity of the channel

9.    Select the worst matching user $u_n^{\prime }$ in $M{C}^E\left(c_k\right)$;

10.          if $u_n$ is better than $P{L}_n^E\left(u_n^{\prime }\right)$

11.    Swap matching $u_n$ and $u_n^{\prime }$ in $M{C}^E\left(c_k\right)$;

12.          else

13.     $P{L}_n^E=P{L}_n^E\backslash c_k$;

14.          end if

15.          Set $op=1$

16.          end if

17.          $M{C}^E=M{C}^E\cup \left(u_n,c_k\right)$

18.          end if

19.   end for

20. end while

21. Repeat steps (1)–(20) to obtain the matching result $M{C}^U$ for the URLLC users.

22. Output matching results $M{C}^U$ and $M{C}^E$.