This paper studies the uplink resource allocation for multiple radio access (MRA) in reconfigurable radio systems, where multiple-input and multiple-output (MIMO) multicarrier-code division multiple access (MC-CDMA) and MIMO orthogonal frequency-division multiple access (OFDMA) networks coexist. By assuming multi-radio user equipment with network-guided operation, the optimal resource allocation for MRA is analyzed as a cross-layer optimization framework with and without fairness consideration to maximize the uplink sum-rate capacity. Numerical results reveal that parallel MRA, which uses MC-CDMA and OFDMA networks concurrently, outperforms the performance of each MC-CDMA and OFDMA network by exploiting the multiuser selection diversity.
An exponential growth in mobile data traffic, which is driven by the use of wireless devices such as smartphones and tablet PCs, is placing an increasing demand on Internet service providers to provide higher rates of data transmission. To deal with this demand, various issues have been discussed in heterogeneous cellular networks [1]. Among these networks, one of the promising candidates for the provision of higher rates of data transmission is the cognitive wireless network (CWN) [2], whose main feature is that it allows for the coexistence of multiple radio access networks (RANs). In a CWN, multi-radio user equipment (MUE) can choose a suitable RAN with various supported radio access technologies (RATs) [2]. This reconfigurable radio system using multiple RATs has been studied within the framework of software-defined radio and cognitive radio in recent years [3]. For a radio enabler in this system, a cognitive pilot channel is used for spectrum awareness and radio resource management [4]. From the viewpoint of signaling overhead, Yagyu and others [5] show that the increase of control overhead is not significant even in carrier aggregation deployment scenarios.There have been several studies on the concurrent use of multiple RANs in heterogeneous cellular networks. Lo and others [6] present a comparison of the potential maximum sum capacity of downlink multiple-input and multiple-output (MIMO) multicarrier-code division multiple access (MC-CDMA) and MIMO orthogonal frequency-division multiple access (OFDMA) in a single-cell multiuser environment. For OFDMA-based multiple RANs, an uplink joint resource allocation for parallel multiple radio access (MRA) is investigated in [7], where OFDMA-based multiple RATs are used at the same time for data transmission. However, the parallel MRA of MC-CDMA and OFDMA is not considered in [6], and the case of heterogeneous cellular networks (that is, when there exist MC-CDMA and OFDMA networks simultaneously) is not investigated in [7]. Hence, it is the right time to explore the uplink resource allocation problem for parallel MRA in heterogeneous cellular networks, where MIMO MC-CDMA and MIMO OFDMA networks coexist.This paper considers the maximization of the sum-rate capacity in an uplink CWN system, which employs MIMO OFDMA and MIMO MC-CDMA networks as a subsystem. Use of Karush–Kuhn–Tucker (KKT) conditions, for obtaining an optimal solution, means we are able to find a new efficient channel and power-allocation algorithm. This algorithm uses both a water-filling and a bisection method, where the problem being solved is really that of network-guided operation.The rest of this paper is organized as follows. Section II introduces the reconfigurable radio system model and explains the channel structure of each OFDMA and MC-CDMA system. In Section III, the problem of maximizing the sum capacity for the system model is formulated. Numerical analysis for optimal user selection and resource allocation is provided in Section IV. Section V presents the numerical results of the reconfigurable radio system. Finally, Section VI concludes the paper.
II. System Model
This system model is based on [6], which uses a switched MRA scheme among available RATs, where only one RAT is used alternatively for data transmission in the downlink case. However, our proposed system model uses a parallel MRA scheme, where multiple RATs are utilized concurrently in the uplink case. Figure 1(a) describes a reconfigurable radio system model, where different type of RANs can be used concurrently to transmit data in the uplink. Each RAN, with its access point (AP) having similar coverage to that of other RANs, has a different channel-gain link between its AP and MUEs. Each MUE can access multiple RANs simultaneously. Figure 1(b) shows the channel structure for analysis, which is based on [6]. This model divides the whole channel into a number of flat-fading subcarriers, which are further grouped into N_{B} sub-bands, each containing N_{S} subcarriers. The sub-band size is within the coherence bandwidth. Therefore, every subcarrier in a sub-band has the same channel gain. The AP has N_{R} receive antennas, while the MUE has N_{T} transmit antennas; thus, put together they form a MIMO channel characterized by an N_{R} × N_{T} matrix, H_{kb}, for every subcarrier within sub-band b of user k.
Reconfigurable radio system model: (a) heterogeneous environment of OFDMA and MC-CDMA and (b) channel structure.
This channel structure, based on [6], can be used in different ways within different RANs as follows:
▪ The users (or MUEs, alternatively) of an OFDMA system are divided by different sets of subcarriers. Hence, the transmit signal resembles a single-user’s situation, which is for the assigned subcarriercin sub-bandb.
▪ In an MC-CDMA system, each and every subcarrier is simultaneously shared between several users. This system assumes that each symbol is spread with an orthogonal code over one sub-band and that the channel is flat within each sub-band. And, perfect synchronization at the bit and chip levels is assumed in the system model. Thus, both the intra- and inter-user interference can be set to zero. Each user’s transmit signals are multiplexed by both spatial signatures and spreading codes within a sub-band. More than one code channel can be occupied by a user, and the number of codes available is equal to the number of subcarriers within a sub-band, which leads to a total number ofNS˜codes, each with lengthNS˜chips.
III. Problem Formulation
This work investigates the maximum sum capacity^{1)} to explore uplink resource allocation for parallel MRA, which considers the optimal joint user selection (that is, subcarrier or code allocation) and power allocation.Only one user of the OFDMA system can occupy every subcarrier. Hence, the rate of user k[5] is$${R}_{k}^{\text{OFDMA}}={N}_{S}{\displaystyle \sum _{b=1}^{{N}_{B}}\rho \left(k,b\right)}{\displaystyle \sum _{p=1}^{{N}_{P}}{\mathrm{log}}_{2}\left(1+{\gamma}_{kb}^{(p)}\frac{{P}_{kb}^{(p)}}{{N}_{S}}\right)},$$where
γ kb (p)
and
P kb (p)
are the effective channel-gain-to-interference-plus-noise ratio (that is, with white inter-cell interference) and the power of the user k on sub-band b and spatial channel p, respectively. Selecting spatially separated antennas determines the spatial channel p for each subcarrier. The number of available spatial channels, N_{P}, is bounded by min (N_{T}, N_{R}). The indicator function ρ(k,b) ∈ {0,1} is equal to one in the case of a sub-band b where OFDMA is being allocated to user k and is equal to zero otherwise.A user of the MC-CDMA system occupies the whole spectrum. Therefore, the rate of user k is expressed as$${R}_{k}^{\text{CDMA}}={\displaystyle \sum _{\tilde{c}=1}^{{N}_{\tilde{S}}}\rho \left(k,\tilde{c}\right)}{\displaystyle \sum _{\tilde{b}=1}^{{N}_{\tilde{B}}}{\displaystyle \sum _{\tilde{p}=1}^{{N}_{\tilde{P}}}{\mathrm{log}}_{2}\left(1+{\gamma}_{k\tilde{b}}^{(\tilde{p})}{P}_{k\tilde{b}\tilde{c}}^{(\tilde{p})}\right)}},$$where
P k b ˜ c ˜ ( p ˜ )
is the power spent of user k on sub-band
b ˜
and spatial channel
p ˜
with code channel
c ˜
. The indicator function ρ(k,
c ˜
) ∈ {0,1} is equal to one in the case of a code channel
c ˜
where MC-CDMA is being allocated to user k and is equal to zero otherwise.In a CWN, a user can access OFDMA and MC-CDMA systems simultaneously. Thus, the rate of user k can be expressed as$${R}_{k}^{\text{CWN}}={R}_{k}^{\text{OFDMA}}+{R}_{k}^{\text{CDMA}}.$$Therefore, the optimization problem can be written as$${C}^{\text{CWN}}=\underset{\left\{\begin{array}{l}\rho \left(k,b\right)\in \left\{0,1\right\},\\ {P}_{kb}^{(p)}\ge 0,\\ \rho \left(k,\tilde{c}\right)\in \left\{0,1\right\},\\ {P}_{k\tilde{b}\tilde{c}}^{(\tilde{p})}\ge 0\end{array}\right\}}{\mathrm{max}}\left({\displaystyle \sum _{k=1}^{K}{R}_{k}^{\text{OFDMA}}}+{\displaystyle \sum _{k=1}^{K}{R}_{k}^{\text{CDMA}}}\right)$$subject to$$\sum _{k=1}^{K}\rho \left(k,b\right)}=1\text{}\forall b\in \left\{1,\text{\hspace{0.17em}\hspace{0.17em}}2,\text{\hspace{0.17em}\hspace{0.17em}}\mathrm{...}\text{\hspace{0.17em}\hspace{0.17em}},\text{\hspace{0.17em}\hspace{0.17em}}{N}_{B}\right\},$$$$\sum _{k=1}^{K}\rho \left(k,\tilde{c}\right)}=1\text{}\forall \tilde{c}\in \left\{1,\text{\hspace{0.17em}\hspace{0.17em}}2,\text{\hspace{0.17em}\hspace{0.17em}}\mathrm{...}\text{\hspace{0.17em}\hspace{0.17em}},\text{\hspace{0.17em}\hspace{0.17em}}{N}_{\tilde{S}}\right\},$$and$$\sum _{b=1}^{{N}_{B}}{\displaystyle \sum _{p=1}^{{N}_{P}}{P}_{kb}^{(p)}}}+{\displaystyle \sum _{\tilde{c}=1}^{{N}_{\tilde{S}}}{\displaystyle \sum _{\tilde{p}=1}^{{N}_{\tilde{P}}}{\displaystyle \sum _{\tilde{b}=1}^{{N}_{\tilde{B}}}{P}_{k\tilde{b}\tilde{c}}^{(\tilde{p})}}}}={P}_{k}^{T}\text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}\forall k;$$where K is the total number of users and
P k T
is the total power of the user k.
IV. Optimal User Selection and Resource Allocation
- 1. Optimal Solution
Given the total power constraint of (7), the optimal user assignment for a channel depends on the user assignment in other channels. The formulation described in (4) is combinatorial; hence, the concept of time-sharing is necessary [8]. The time-sharing factors of [8] mean that the ranges of ρ(k,b) ∈ {0,1} and ρ(k,
c ˜
) ∈ {0,1} are relaxed to real numbers within the interval [0, 1].Relaxing the constraints, we can rewrite the optimization problem as$$\begin{array}{l}{C}^{\text{CWN}}=\underset{\left\{\begin{array}{l}\rho \left(k,b\right)\in \left[0,1\right],\\ {s}_{kb}\in [0,\infty ),\\ \rho \left(k,\tilde{c}\right)\in \left[0,1\right],\\ {s}_{k\tilde{c}}\in [0,\infty )\end{array}\right\}}{\mathrm{max}}\{{\displaystyle \sum _{b=1}^{{N}_{B}}{\displaystyle \sum _{k=1}^{K}\rho \left(k,b\right){C}_{kb}\left(\frac{{s}_{kb}}{\rho \left(k,b\right)}\right)}}\\ \text{}\text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}+{\displaystyle \sum _{\tilde{c}=1}^{{N}_{\tilde{S}}}{\displaystyle \sum _{k=1}^{K}\rho \left(k,\tilde{c}\right){C}_{k\tilde{c}}\left(\frac{{s}_{k\tilde{c}}}{\rho \left(k,\tilde{c}\right)}\right)}}\}\end{array}$$subject to$$\sum _{b=1}^{{N}_{B}}{s}_{kb}}+{\displaystyle \sum _{\tilde{c}=1}^{{N}_{\tilde{S}}}{s}_{k\tilde{c}}}={P}_{k}^{T}\text{}\forall k,$$where$${s}_{kb}=\rho \left(k,b\right){P}_{kb}\text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}with}{P}_{kb}={\displaystyle \sum _{p=1}^{{N}_{P}}{P}_{kb}^{(p)}},$$$${C}_{kb}\left({P}_{kb}\right)=\underset{\left\{{\displaystyle \sum _{p=1}^{{N}_{P}}{P}_{kb}^{(p)}}={P}_{kb}\right\}}{\mathrm{max}}{N}_{S}{\displaystyle \sum _{p=1}^{{N}_{P}}{\mathrm{log}}_{2}\left(1+{\gamma}_{kb}^{(p)}\frac{{P}_{kb}^{(p)}}{{N}_{S}}\right)},$$$${s}_{k\tilde{c}}=\rho \left(k,\tilde{c}\right){P}_{k\tilde{c}}\text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}with}{P}_{k\tilde{c}}={\displaystyle \sum _{\tilde{b}=1}^{{N}_{\tilde{B}}}{\displaystyle \sum _{\tilde{p}=1}^{{N}_{\tilde{P}}}{P}_{k\tilde{b}\tilde{c}}^{(\tilde{p})}}},$$and$${C}_{k\tilde{c}}\left({P}_{k\tilde{c}}\right)=\underset{\left\{{\displaystyle \sum _{\tilde{b}=1}^{{N}_{\tilde{B}}}{\displaystyle \sum _{\tilde{p}=1}^{{N}_{\tilde{P}}}{P}_{k\tilde{b}\tilde{c}}^{(\tilde{p})}}}={P}_{k\tilde{c}}\right\}}{\mathrm{max}}{\displaystyle \sum _{\tilde{b}=1}^{{N}_{\tilde{B}}}{\displaystyle \sum _{\tilde{p}=1}^{{N}_{\tilde{P}}}{\mathrm{log}}_{2}\left(1+{\gamma}_{k\tilde{b}}^{(\tilde{p})}{P}_{k\tilde{b}\tilde{c}}^{(\tilde{p})}\right)}}.$$Since
ρ( k,b ) C kb ( s kb ρ( k,b ) )
and
ρ( k, c ˜ ) C k c ˜ ( s k c ˜ ρ( k, c ˜ ) )
in (8) are concave with respect to (ρ(k,b),s_{kb}) and
(ρ(k, c ˜ ), s k c ˜ )
, respectively (because all constraints are linear functions), the above formulation becomes a convex problem. This means that an optimal solution can be obtained as a global maximum. For uplink resource optimality, the Lagrangian is$$\begin{array}{l}L\left\{{s}_{kb},\text{}\rho \left(k,b\right),\text{}{s}_{k\tilde{c}},\text{}\rho \left(k,\tilde{c}\right),\text{}{\beta}_{b},\text{}{\beta}_{\tilde{c}},\text{}{\alpha}_{k}\right\}\\ \text{}={\displaystyle \sum _{b=1}^{{N}_{B}}{\displaystyle \sum _{k=1}^{K}\rho \left(k,b\right){C}_{kb}\left(\frac{{s}_{kb}}{\rho \left(k,b\right)}\right)}}\\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}+{\displaystyle \sum _{\tilde{c}=1}^{{N}_{\tilde{S}}}{\displaystyle \sum _{k=1}^{K}\rho \left(k,\tilde{c}\right){C}_{k\tilde{c}}\left(\frac{{s}_{k\tilde{c}}}{\rho \left(k,\tilde{c}\right)}\right)}}\\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}-{\displaystyle \sum _{b=1}^{{N}_{B}}{\beta}_{b}\left({\displaystyle \sum _{k=1}^{K}\rho \left(k,b\right)}-1\right)}-{\displaystyle \sum _{\tilde{c}=1}^{{N}_{\tilde{S}}}{\beta}_{\tilde{c}}\left({\displaystyle \sum _{k=1}^{K}\rho \left(k,\tilde{c}\right)}-1\right)}\\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}-{\displaystyle \sum _{k=1}^{K}{\alpha}_{k}}\left({\displaystyle \sum _{b=1}^{{N}_{B}}{s}_{kb}}+{\displaystyle \sum _{\tilde{c}=1}^{{N}_{\tilde{S}}}{s}_{k\tilde{c}}}-{P}_{k}^{T}\right),\end{array}$$where β_{b},
β c ˜
and α_{k} are the Lagrange multipliers for the constraints (5), (6), and (9), respectively. To obtain the necessary conditions for the optimal solution *, differentiating
L{ s kb , ρ(k,b), s k c ˜ , ρ(k, c ˜ ), β b , β c ˜ , α k }
.By using (16) and (18), one can obtain the optimal user assignment k for sub-band b for OFDMA and code channel
c ˜
for MC-CDMA when the following is maximized for the optimal value α_{k} :$$\begin{array}{l}{H}_{kb}\left({\alpha}_{k}\right)={C}_{kb}\left({C}_{kb}^{\text{'}-1}\left({\alpha}_{k}\right)\right)\\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}-{\alpha}_{k}{C}_{kb}^{\text{'}-1}\left({\alpha}_{k}\right)\text{\hspace{0.17em}\hspace{0.17em}forOFDMA,}\end{array}$$$$\begin{array}{l}{H}_{k\tilde{c}}\left({\alpha}_{k}\right)={C}_{k\tilde{c}}\left({C}_{k\tilde{c}}^{\text{'}-1}\left({\alpha}_{k}\right)\right)\\ \text{\hspace{0.17em}\hspace{0.17em}}-{\alpha}_{k}{C}_{k\tilde{c}}^{\text{'}-1}\left({\alpha}_{k}\right)\text{\hspace{0.17em}\hspace{0.17em}forMC-CDMA,}\end{array}$$where α_{k} is chosen by using a gradient-based search for (9), and C^{−1}(.) represents the inverse mapping function of C. For the optimal user assignment k in the CWN, (9) can be expressed as$$\sum _{b=1}^{{N}_{B}}\rho \left(k,b\right){C}_{kb}^{\text{'}-1}\left({\alpha}_{k}\right)}+{\displaystyle \sum _{\tilde{c}=1}^{{N}_{\tilde{S}}}\rho \left(k,\tilde{c}\right){C}_{k\tilde{c}}^{\text{'}-1}\left({\alpha}_{k}\right)}={P}_{k}^{T}.$$Intuitively, (19) and (20) implies a power efficiency measure because the user assignment k^{*} with the maximum H_{kb}(α_{k}) and
H k c ˜ ( α k )
represents the most efficient power use for maximizing its total throughput on sub-band b and on code channel
c ˜
for a given α_{k}.By using
P kb * = C kb '−1 ( α k )
and
P k c ˜ * = C k c ˜ '−1 ( α k )
from the KKT conditions, the power constraint can be expressed in terms of the water level (λ_{k}) as$$\begin{array}{l}{H}_{kb}\left({\lambda}_{k}\right)={C}_{kb}\left({P}_{kb}^{*}\right)\\ \text{\hspace{0.17em}\hspace{0.17em}}-{\left({\lambda}_{k}\mathrm{ln}2\right)}^{-1}{P}_{kb}^{*}\text{\hspace{0.17em}\hspace{0.17em}forOFDMA,}\end{array}$$$$\begin{array}{l}{H}_{k\tilde{c}}\left({\lambda}_{k}\right)={C}_{k\tilde{c}}\left({P}_{k\tilde{c}}^{*}\right)\\ \text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}}-{\left({\lambda}_{k}\mathrm{ln}2\right)}^{-1}{P}_{k\tilde{c}}^{*}\text{\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}forMC-CDMA,}\end{array}$$where α_{k} = (λ_{k} 1n 2)^{−1}, and$${P}_{kb}^{*}\left({\lambda}_{k}\right)={N}_{S}{\displaystyle \sum _{p=1}^{{N}_{P}}{\left[{\lambda}_{k}-\frac{1}{{\gamma}_{kb}^{(p)}}\right]}^{+}}\text{forOFDMA,}$$$${P}_{k\tilde{c}}^{*}\left({\lambda}_{k}\right)={\displaystyle \sum _{\tilde{p}=1}^{{N}_{\tilde{P}}}{\displaystyle \sum _{\tilde{b}=1}^{{N}_{\tilde{B}}}{\left[{\lambda}_{k}-\frac{1}{{\gamma}_{k\tilde{b}}^{(\tilde{p})}}\right]}^{+}}}\text{forMC-CDMA,}$$with [z]^{+} = max{z, 0}. Therefore, the optimal user assignment set is given by$${k}^{*}\left(b,\tilde{c}\right)=\mathrm{arg}\underset{k}{\mathrm{max}}\left\{{H}_{kb}\left({\lambda}_{k}\right)+{H}_{k\tilde{c}}\left({\lambda}_{k}\right)\right\}\text{,}\forall b,\text{\hspace{0.17em}\hspace{0.17em}}\tilde{c}$$and the optimal λ_{k} is achieved under the condition of (21).
- 2. Proposed Algorithm
This paper proposes the following algorithm for finding the optimal solution by using the bisection method.^{2)}
Step 1.Initialize the water levelλk(> 0).
Setλkl= 0 whereλkl is the lower limit.
Step 2.Computeγkb,Pkb for OFDMA, andγkb˜,Pkc˜ for MC-CDMA.
Step 3.Select the optimal userk*(b,c˜) according to (26).
Step 4.Evaluate the power constraint of (21) and updateλk.
IF∑bPk*(b,c˜)b*(λk)+∑c˜Pk*(b,c˜)c˜*(λk)
Setλkl=λkandλk← 2 ×λk.
Go back to Step 3.
Else
Setλku=λkwhereλkuis the upperbound.
End
Step 5.Adjustλkuntil the error toleranceεis satisfied as below:
Setλk=(λkl+λku)2and compute the optimalk*(b,c˜) according to (26).
IF∑bPk*(b,c˜)b*(λk)+∑c˜Pk*(b,c˜)c˜*(λk)
Setλkl=λk.
Else if∑bPk*(b,c˜)b*(λk)+∑c˜Pk*(b,c˜)c˜*(λk)>PkT
Setλku=λk.
End
End
- 3. Consideration of Fairness
To consider the fairness, some additional constraints are imposed on (8) and (9) as follows:$$\sum _{b=1}^{{N}_{B}}\rho \left(k,b\right)}\le {\rho}_{k,\mathrm{max}}\text{}\forall k\text{forOFDMA$$and$$\sum _{\tilde{c}=1}^{{N}_{\tilde{S}}}\rho \left(k,\tilde{c}\right)}\le {\tilde{\rho}}_{k,\mathrm{max}}\text{}\forall k\text{forMC-CDMA,$$where ρ_{k,max} and
ρ ˜ k,max
are the maximum number of sub-bands and code channels user k can occupy, respectively. When the fairness is considered, the Lagrangian of (14) can be changed as below$$\begin{array}{l}L={\displaystyle \sum _{b=1}^{{N}_{B}}{\displaystyle \sum _{k=1}^{K}\rho \left(k,b\right){C}_{kb}\left(\frac{{s}_{kb}}{\rho \left(k,b\right)}\right)}}\\ \text{}+{\displaystyle \sum _{\tilde{c}=1}^{{N}_{\tilde{S}}}{\displaystyle \sum _{k=1}^{K}\rho \left(k,\tilde{c}\right){C}_{k\tilde{c}}\left(\frac{{s}_{k\tilde{c}}}{\rho \left(k,\tilde{c}\right)}\right)}}\\ \text{}-{\displaystyle \sum _{b=1}^{{N}_{B}}{\beta}_{b}\left({\displaystyle \sum _{k=1}^{K}\rho \left(k,b\right)}-1\right)}-{\displaystyle \sum _{\tilde{c}=1}^{{N}_{\tilde{S}}}{\beta}_{\tilde{c}}\left({\displaystyle \sum _{k=1}^{K}\rho \left(k,\tilde{c}\right)}-1\right)}\\ \text{}-{\displaystyle \sum _{k=1}^{K}{\alpha}_{k}}\left({\displaystyle \sum _{b=1}^{{N}_{B}}{s}_{kb}}+{\displaystyle \sum _{\tilde{c}=1}^{{N}_{\tilde{S}}}{s}_{k\tilde{c}}}-{P}_{k}^{T}\right)\\ \text{}-{\displaystyle \sum _{k=1}^{K}{\phi}_{k}\left({\displaystyle \sum _{b=1}^{{N}_{B}}\rho \left(k,b\right)}-{\rho}_{k,\mathrm{max}}\right)}\\ \text{}-{\displaystyle \sum _{k=1}^{K}{\tilde{\phi}}_{k}\left({\displaystyle \sum _{\tilde{c}=1}^{{N}_{\tilde{S}}}\rho \left(k,\tilde{c}\right)}-{\tilde{\rho}}_{k,\mathrm{max}}\right)},\end{array}$$where φ_{k} and
φ ˜ k
are the Lagrange multipliers.Since the additional constraints are linear functions, the KKT conditions give the power constraint of (22) and (23) as below$$\begin{array}{l}{H}_{kb}\left({\lambda}_{k}\right)={C}_{kb}\left({P}_{kb}^{*}\right)\\ \text{}-{\left({\lambda}_{k}\mathrm{ln}2\right)}^{-1}{P}_{kb}^{*}-{\phi}_{k}\text{forOFDMA,}\end{array}$$$$\begin{array}{l}{H}_{k\tilde{c}}\left({\lambda}_{k}\right)={C}_{k\tilde{c}}\left({P}_{k\tilde{c}}^{*}\right)\\ \text{}-{\left({\lambda}_{k}\mathrm{ln}2\right)}^{-1}{P}_{k\tilde{c}}^{*}-{\tilde{\phi}}_{k}\text{forMC-CDMA}.\end{array}$$By using (30) and (31), the optimal user assignment k* can be explored with (26).
V. Numerical Results
- 1. Simulation Environments
The system model based on [6] is investigated for uplink optimal resource allocation with and without the fairness constraint in a single-cell (or equivalently, multi-cell with white inter-cell interference) environment, where fairness is modeled by a maximum number of allowable allocated channels for each user. The users are uniformly distributed over a shared region comprising hexagonal cells of radius 1 km, with the APs located at the left and right edges of the shared region. The simulation environment considers a frequency-selective fading channel and models it as an exponential power delay profile with each tap experiencing independent and identically distributed Rayleigh fading. Without loss of generality, shadowing is excluded, while the path loss effect is considered as P_{k} = P_{0} (d_{k} / d_{0})^{−δ} for d_{k} ≥ d_{0}, where P_{k} is the average power of user k at distance d_{k}, P_{0} is the average received power at d_{0}, and δ is the path loss exponent. Every user has the same P_{0} for d_{k} < d_{0} (d_{0} = 100 m). The detailed simulation parameters are summarized in Table 1. It is assumed that the queue for every user is full and that no delay constraint is considered.
Simulation parameters and assumptions for uplink analysis, which is based on[6].
MC-CDMA and OFDMA parameter
Total number of subcarriers
1,024
Maximum spreading factor (N_{S})
32
Number of sub-bands (N_{B})
32
Number of antennas (N_{R} = N_{T})
2
Power delay profile
Exponential (i.i.d. Rayleigh)
Maximum delay (τ_{max})
160 samples
rms delay (τ_{rms})
16 samples
Cell parameter
Total transmit power (${P}_{k}^{T}$)
10 dBm/MHz
Average received power
−20 dBm/MHz (at 100 m)
Noise power PSD
−40 dBm/MHz
Average SNR/subcarrier
20 dB (at 100 m)
Path-loss exponent
3
Constraint of maximum allowable channels per user
For 2, 4, 8, 16, and 32 users, respectively
16, 8, 4, 2, 1, and respectively
- 2. Simulation Results
The sum capacity of the parallel MRA is compared with each OFDMA and MC-CDMA system in Fig. 2, where multiple antennas (that is, N_{R} = N_{T} = 2) are applied in the CWN system model. In all cases, the sum capacities of the parallel MRA are better than each system, and the parallel MRA achieves more capacity increase (approximately 15%) with the number of users. The reason for this is because the parallel MRA achieves a more efficient exploitation of multiuser diversity.
The effect of the fairness constraint on the sum capacity is evaluated in Fig. 3. This result shows a different behavior to that of the capacity gap when the fairness constraint is applied to MC-CDMA, OFDMA, and parallel MRA. This means that significant capacity decreases and a broadened capacity gap are due to the fairness constraint. The two-antenna configuration achieves more than a three-fold decrease. This indicates that a consideration of fairness affects the capacity loss of the systems, which is crucial for practical system settings.
Comparison of average sum capacity with maximum channel constraint.
VI. Conclusion
This paper analyzed the adaptive resource allocation for MRA in reconfigurable radio systems, where MC-CDMA and OFDMA networks coexist. The proposed algorithm exploited users who utilize the power most efficiently for both network accesses. Numerical results demonstrated that the parallel MRA (that is, concurrent use of MC-CDMA and OFDMA systems) outperforms the performance of each system because of the superiority in exploiting the multiuser selection diversity over the frequency domain.
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2013R1A1A2061292).
The maximum average sum capacity is expressed as ${C}^{\text{ergodic}}=\mathrm{max}\text{}E\left\{{\displaystyle {\sum}_{k=1}^{K}{R}_{k}(t)}\right\}$, where R_{k(t)} is the instantaneous rate function of user k at time t, which represents the number of bits per symbol transmitted. This can be achieved by maximizing the instantaneous sum rate ${C}^{\text{inst}}=\mathrm{max}\left\{{\displaystyle {\sum}_{k=1}^{K}{R}_{k}(t)}\right\}$.
There are different methods (e.g., Newton’s method, golden section search, etc.) to find an optimal solution. In general, there exists a trade-off between the converging speed and robustness of the solution.
BIO
yh.choi@jnu.ac.krYonghoon Choi received his BS degree in electronics engineering from Sungkyunkwan University, Suwon, Rep. of Korea, in 1999 and his MS and PhD degrees in information and communications engineering from the Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Rep. of Korea, in 2003 and 2010, respectively. From 1999 to 2007, he worked for the Ministry of Information and Communications, Seoul, Rep. of Korea. He was a postdoctoral visiting scholar from 2010 to 2013 at the Department of Electrical Engineering, Stanford University, CA, USA. From 2013 to 2014, he worked as a research assistant professor at the KAIST Institute of IT Convergence, Daejeon, Rep. of Korea. Since 2014, he has been with the Department of Electrical Engineering, Chonnam National University, Gwangju, Rep. of Korea, where he is now an assistant professor. His research interests include the design, analysis, and optimization of wireless/mobile communications systems; powerline communications; IT convergence networks; and network economics. He is a senior member of the IEEE and a member of the Korean Institute of Communications and Information Sciences. He is also an international professional engineer (APEC Eng. & EMF Eng.) and a registered professional engineer in Korea.
Buljore S.
2009
“Architecture and Enablers for Optimized Radio Resource Usage in Heterogeneous Wireless Access Networks: The IEEE 1900.4 Working Group,”
IEEE Commun. Mag.
47
(1)
122 -
129
DOI : 10.1109/MCOM.2009.4752689
Mueck M.
2010
“ETSI Reconfigurable Radio Systems: Status and Future Directions on Software Defined Radio and Cognitive Radio Standards,”
IEEE Commun. Mag.
48
(9)
78 -
86
DOI : 10.1109/MCOM.2010.5560591
Sallent O.
“Cognitive Pilot Channel: A Radio Enabler for Spectrum Awareness and Optimized Radio Resource Management,”
Proc. ICT-Mobile Summit
Santander, Spain
June 10–12, 2009
Yagyu K.
2011
“Investigation on Signaling Overhead for Mobility Management with Carrier Aggregation in LTE-Advanced,”
IEICE Trans. Commun.
E94-B
(12)
3335 -
3345
Lo E.
2007
“Adaptive Resource Allocation and Capacity Comparison of Downlink Multiuser MIMO-MC-CDMA and MIMO-OFDMA,”
IEEE Trans. Wireless Commun.
6
(3)
1083 -
1093
DOI : 10.1109/TWC.2007.05510
Wong C.Y.
1999
“Multiuser OFDM with Adaptive Subcarrier, Bit, and Power Allocation,”
IEEE J. Sel. Areas Commun.
17
(10)
1747 -
1758
DOI : 10.1109/49.793310
Citing 'Adaptive Resource Allocation for MC-CDMA and OFDMA in Reconfigurable Radio Systems
'
@article{ HJTODO_2014_v36n6_953}
,title={Adaptive Resource Allocation for MC-CDMA and OFDMA in Reconfigurable Radio Systems}
,volume={6}
, url={http://dx.doi.org/10.4218/etrij.14.0113.0843}, DOI={10.4218/etrij.14.0113.0843}
, number= {6}
, journal={ETRI Journal}
, publisher={Electronics and Telecommunications Research Institute}
, author={Choi, Yonghoon}
, year={2014}
, month={Oct}
TY - JOUR
T2 - ETRI Journal
AU - Choi, Yonghoon
SN - 1225-6463
TI - Adaptive Resource Allocation for MC-CDMA and OFDMA in Reconfigurable Radio Systems
VL - 36
PB - Electronics and Telecommunications Research Institute
DO - 10.4218/etrij.14.0113.0843
PY - 2014
UR - http://dx.doi.org/10.4218/etrij.14.0113.0843
ER -
Choi, Y.
( 2014).
Adaptive Resource Allocation for MC-CDMA and OFDMA in Reconfigurable Radio Systems.
ETRI Journal,
36
(6)
Electronics and Telecommunications Research Institute.
doi:10.4218/etrij.14.0113.0843
&
Choi, Y
2014,
Adaptive Resource Allocation for MC-CDMA and OFDMA in Reconfigurable Radio Systems,
ETRI Journal,
vol. 6,
no. 6,
Retrieved from http://dx.doi.org/10.4218/etrij.14.0113.0843
[1]
and
Y Choi
,
“Adaptive Resource Allocation for MC-CDMA and OFDMA in Reconfigurable Radio Systems”,
ETRI Journal,
vol. 6,
no. 6,
Oct
2014.
Choi, Yonghoon
and
.
“Adaptive Resource Allocation for MC-CDMA and OFDMA in Reconfigurable Radio Systems”
ETRI Journal,
6.
6
2014:
Choi, Y
Adaptive Resource Allocation for MC-CDMA and OFDMA in Reconfigurable Radio Systems.
ETRI Journal
[Internet].
2014.
Oct ;
6
(6)
Available from http://dx.doi.org/10.4218/etrij.14.0113.0843
and
Choi, Yonghoon
.
“Adaptive Resource Allocation for MC-CDMA and OFDMA in Reconfigurable Radio Systems.”
ETRI Journal
6
no.6
()
Oct,
2014):
http://dx.doi.org/10.4218/etrij.14.0113.0843