FHQA Joint Dynamic Resource Allocation Approach-1

The first JDRA-1 approach optimises the conventional DRA scheme of Figure 5.12 by allo- cating the RBs having the highest channel gain for the R-D links to the appropriate users, which are stored in an ordered user set at each relay in terms of their first-hop CQI. We assume that each relay stores and labels a sorted CQI set of the S-R links, while receiving from K users. The resultant J appropriately ordered CQI sets of the S-R links and the CQI sets of the R-D links are then exchanged among the J relays via the relays’ cluster-head, as shown in Fig. 5.7.

A flow chart of the proposed JDRA-1 algorithm is presented in Figure 5.13(a), where the pro- cessing blocks inherited from the conventional methods are highlighted using bold acronyms. Furthermore, compared to the conventional combination of DSA and DRS as portrayed in Figure 5.12, the differences in both the snapshots of topology and RB allocation using JDRA-1 are illustrated in Figure 5.14 in the same channel quality scenario as used in Fig-

MTs ORs BS 0 0 1 2 1 0 2 gSR_k,j Nr− 1 2 1 3 4 gRD_j,m

(a) Snapshot of Topology, which may be contrasted to Figures 5.12(a) and

5.11(a). TD TD second−hop first−hop FD FD FD FD FD FD FD FD FD FD TD TD TD TD j= 1 j= 2 j= 4 j= 0 j= 3 m= 0 m = 1 m = 2 m = 3 m= 0 m = 1 m = 2 m = 3 gRD_j,m gSR_k,j k= 0 k= 1 k= 2 k= 0 k= 2 k= 1

(b) Snapshot of Resource Block Allocation

Figure 5.14: _{The illustration of first-hop-quality-aware (FHQA) joint dynamic resource}

allocation: approach 1 (JDRA-1) for K = 3, M = 4 and J = 5, which may be contrasted to the separate static and dynamic resource allocation schemes (DRS-SSA and DRS-DSA) of Figures 5.11 and 5.12. Their main difference is that the JDRA-1 scheme optimises the conventional DRA scheme of Figure 5.12 by allocating the RBs having the highest channel gains for the R-D links to the appropriate users, which are stored in an ordered user set at

each relay in terms of their first-hop CQI.

ures 5.11 and 5.12. For example, Table 5.8 characterises the allocation strategy based on the conventional DSA combined with the DRS procedure of Table 5.6.

5.3.5.1 FHQA JDRA-1 Algorithm

To elaborate on the FHQA JDRA-1 scheme a little further, we describe the associated procedures step by step as follows:

Second-Hop DRS and DSA: Initially, we adopt the second-hop DSA combined with

Table 5.7: _{First-hop-quality-aware (FHQA) joint dynamic resource allocation: approach-1} (JDRA-1) algorithm

1. 2nd-Hop DRS-DSA: Detailed in Section 5.3.4. 2. FHQA Ordering: At the j-th relay, ∀j ∈ J: (a) Set ˚GSR_j = ∅, ˚Kj= ∅;

(b) Collect GSR

j = {g0,jSR, g1,jSR, · · · , gK−1,jSR };

(c) For i = 0, 1, · · · , K − 1:

(i) Obtain the i-th ordered user index in the set ˚Kj:

˚_{ki,j= arg maxk∈K{g}SR k,j};

(ii) Update ˚Kj= ˚Kj∪ {˚ki,j}, ˚GSRj = ˚GSRj ∪ {g˚_kSR_i,j}, and GSRj = GSRj \ {g˚SR_ki,j}.

3. User Assignment: Set ˚K= ∅;

For the ı-th user to be given resources, (ı = 0, 1, · · · , K − 1), ∀˚k_i,ˇj ˚ mı ∈ Kˇjmı˚ , ∀ˇjm˚ı ∈ ˇJ: (a) Let i = 0; (b) If ˚k_i,ˇj ˚ mı ∈ ˚/K:

(i) Collect the user ˚ki,ˇj_mı˚ to the ı-th element of ˚K, ˚K= ˚K∪ {˚ki,ˇj_mı˚ };

(ii) Update ˚Kˇj_mı˚ = ˚Kˇj_mı˚ \ {˚ki,ˇj_mı˚ };

(iii) Assign the user ˚ki,ˇj_mı˚ with the resource pair (˚mı, ˇjm˚ı).

Else if ˚ki,ˇj_mı˚ ∈ ˚K, we apply i := i + 1, return to step 3-(a);

First-Hop Consideration: At the j-th relay, we obtain the S-R channel gains g_k,jSR of the k-th user, which we would like to optimise. The gains of all users are contained in the set GSR_j . Meanwhile, the ordered set ˚GSR_j of the S-R channel qualities recorded for the links spanning from the K users to the j-th relay and the ordered user set ˚K_j regarding the j-th relay are initialised to be empty. Furthermore, by maximising g_k,jSR for the j-th relay among all users, we obtain the i-th ordered user index (i = 0, 1,_{· · · , K − 1) as the i-th element in} the set ˚K_j at the j-th relay. The corresponding channel gain gSR

˚_ki,j is then fed into the S-R

channel quality based ordered set ˚GSR_j with respect to the j-th relay, and it is also removed from the set GSR

j for the next allocation.

User Assignment: After clearing the ordered set ˚K, the index of the ı-th user about

to be given resources is denoted by ˚k_i,ˇj

˚

mı if ˚ki,ˇjmı˚ ∈ ˚/ K. In other words, the user ˚ki,ˇjmı˚

may be assigned to the ı-th element of ˚K. Meanwhile, for the sake of avoiding the repeated allocation of the subband group and that of a specific relay to the users to be given resources, the assigned user should be removed from the S-R link’s ordered user set ˚K_ˇj

˚

mı regarding the

ˇjm˚ı-th relay. Otherwise, in case of ˚ki,ˇjmı˚ ∈ ˚K, we apply i := i + 1 for the sake of providing

the next user with communication resources in the ordered set ˚K_ˇj

˚ mı.

Table 5.8: _{An example of first-hop-quality-aware (FHQA) joint dynamic resource allo-} cation: approach 1 (JDRA-1) for K = 3, M = 4 and J = 5, which may be contrasted to the separate static and dynamic resource allocation schemes (DRS-SSA and DRS-DSA) of Tables 5.4 and 5.6. Explicitly, their main difference is that the user assignment of the

JDRA-1 scheme is dependent on the first-hop quality, namely on the gSR

k,j-based ordered

user set at the specific relays, which were allocated the second-hop RBs associated with the

K highest gains gRD

j,m. For instance, the second-hop RB associated with g

RD

1,3 = 4.41 at the

subband group m = 3 and the relay j = 1 is assigned to user k = 2, since the first-hop RB

of user k = 2 has the highest hirst-hop gain of gSR

2,1 = 0.57 amongst the users at relay j = 1.

First-hop gSR k,j Second-hop gj,mRD k = 0 k = 1 k = 2 m = 0 m = 1 m = 2 m = 3 j = 0 0.05(3rd) 0.53(2nd) 2.262.262.26(1st) 0.04 0.33 1.901.901.90(3rd) 0.56 j = 1 0.16(3rd) _0.20(2nd) _0.570.570.57(1st) _{0.70 1.91 0.84 4.414.414.41}(1st) j = 2 0.90 3.073.073.07 0.70 0.45 0.26 0.28 0.90 j = 3 0.18(2nd) _0.09(3rd) _0.210.210.21(1st) _1.751.751.75(4th) _2.502.502.50(2nd) _{0.02 0.09} j = 4 1.42 1.441.441.44 0.81 0.29 1.36 0.17 0.05 Target (ˇj, ˇm) (3, 1) (0, 2) (1, 3)

5.3.5.2 An Example of FHQA JDRA-1

To elaborate on Table 5.8 a little further, which should be contrasted to Table 5.6, let us consider the S-R and R-D channel gains of all the K = 3 users, M = 4 subband groups and J = 5 relays. In the S-R links user k = 0 benefits from the highest gain of g_0,4SR = 1.42 via relay j = 4, user k = 1 attains the gain of gSR

1,2 = 3.07 using relay j = 2, while user k = 2 has

gSR_2,0 = 2.26 using relay j = 0. Specifically, the sorted CQI set of each S-R channel may be obtained by ordering the gSR

k,j values in each row of Table 5.8 marked with (1st), (2nd) and

(3rd). After choosing the RBs having the best K combination of relays in the rows and the best subband groups in the columns of Table 5.8 for transmission over the R-D channels, the user waiting for resource assignment is determined by the corresponding relay, where the specific ordering of g_k,jSR is considered. As a result, compared to the random user assignment of the DRS-DSA scheme characterised in Table 5.6, we arrive at the second-hop RBs having indices of (j, m) = (1, 3). More explicitly, these RBs are associated with a first-hop quality gSR

2,1 = 0.570.570.57 for user k = 2 and with the second-hop RB of (j, m) = (3, 1) associated with

the first-hop quality of gSR_0,3 = 0.18 for user k = 0 and finally with the second-hop RB of (j, m) = (0, 2) associated with the first-hop quality of gSR

1,0 = 0.53 for user k = 1.