Algorithm 2 CoMP Clustering and Dynamic Spectrum Allocation Algorithm
Input:   $K_{\mathsf{\Omega }},M_{\mathsf{\Omega }},H,Q,C,Y$
Output:   Clustering Result and RB Allocation;
1:	Initialization:
2:	Each user selects the neighboring RRU with the requested content as the cooperative set
3:	Coalition Structure Update Process:
4:	for$k\in K_{\mathsf{\Omega }}$do
5:	while $V_k<V_k^{th}$ do
6:	for $B_m\in F_k$ do
7:	if ${\eta }_m^k{V}_k$ is minimum of all ${\eta }_{m^{\prime }}^k{V}_k,\forall B_m\in F_k$ then
8:	$F_k\leftarrow F_k-\left\{B_m\right\}$
9:	else if $V_{k^{\prime }}^{F_m^{*}}<V_{k^{\prime }}^{th}$ then
10:	$F_m^{*}\leftarrow F_m^{*}-\left\{k\right\}$ and update RB Allocation
11:	end if
12:	end for
13:	for $m^{\prime }\in \{M_{\mathsf{\Omega }}-F_k\}$ do
14:	if $v(F_k\cup m^{\prime })>v\left(F_k\right)$ then
15:	$v\left(B_{m^{\prime }}^{F_{m^{\prime }}^{*}\cup k}\right)>v\left(B_{m^{\prime }}^{F_{m^{\prime }}^{*}}\right)$ and (13) satisfied
16:	$F_{m^{\prime }}^{*}\leftarrow F_{m^{\prime }}^{*}\cup \left\{k\right\}$ and update RB Allocation
17:	end if
18:	end for
19:	end while
20:	end for
21:	Repeat:
22:	for$m\in M_{\mathsf{\Omega }}$do
23:	update $F_m^{*}$ according to formula (20) and $H\left(B_m\right)$, update RB Allocation
24:	end for
25:	Until stable coalition structure