|
Algorithm 1 User association matching scheme. |
-
1:
Initialize the power for all users using (14)
-
2:
Initialize the associated users , unassociated users , and lists to record the associated users with the BSs, the unassociated users, and the preferable BS, respectively.
-
3:
while
do
-
4:
for
do
-
5:
if
then
-
6:
Find the maximum value in according to:
-
7:
Assign the user to the BS m from the list , and remove him/her from .
-
8:
if all BSs have more than one user, calculate the EE
for all possible
sets. then
-
9:
Select the set that has maximal EE:
-
10:
Update by adding the new set . Update by removing the elements of the set .
-
11:
Update by removing the preference m of the unmatched user.
-
12:
end if
-
13:
end if
-
14:
end for
-
15:
end while
|