^{1}

^{*}

^{1}

^{*}

Improving utilization of the radio spectrum is the main goal of Cognitive Radio Networks (CRN). Recent studies made use of cooperative relay technology in cognitive networks, to increase transmission diversity gain. In this paper we consider an OFDM based cooperative cognitive network with a pair of Source-Destination nodes as the primary user (PU), and a pair of Source-Destination nodes—which is assisted with a relay—as the secondary (cognitive) user (SU). Both primary and secondary users share a same spectrum. In a two hop transmission, the source transmits in the first hop, and the half-duplex relay decodes the message, re-encodes and forwards it to the destination in the second hop on a different subcarrier. The cognitive network obeys an underlay paradigm where the SU is allowed to transmit simultaneously with PU, while its power is limited such that the interference caused for PU does not exceed a defined temperature. Under this constraint, a joint subcarrier pairing and power allocation is proposed for SU to maximize its weighted sum rate. The problem is transformed to a convex optimization problem and solved in the dual domain. Then an algorithm to achieve feasible solutions is used based on the optimization results. Through extensive simulations, we compare the spectrum utilization of the proposed approach with the existing ones, and show that interestingly the proposed method improves the weighted sum rate of SU.

In the era of communications, daily increasing demands for wireless services and its high penetration in routine human activities is overloading the precious radio spectrum. Beside this bottleneck, and according to spectrum efficiency measurements recently revealed by FCC [

Among different system models defined in recent studies, some made use of cooperative relay technology in cognitive networks to increase transmission diversity gain. In [

A cognitive cooperative relaying scheme in which cognitive users assist PUs by relaying their information is proposed in [

It can be widely seen that novel wireless communications tend to use multi-carrier OFDM method because of its flexibility in resource allocation and the benefits on minimizing the impact of multi-path fading. To be in harmony with this trend, our interest in this study lies on an OFDM-based cooperative cognitive radio network. Among three different paradigms of cognitive radios, we choose underlay transmission where both the primary and cognitive users transmit over a same spectrum. Two pairs of Source-Destination (SD) nodes are considered where one pair is the primary user and the other is the secondary user. Also we assume that the secondary user’s transmission is assisted with a cognitive DF relay node. In underlay scenario, it is assumed that the secondary network is aware about channel gains from its transmitters to the PU. SU’s and the relay’s power are limited in this case, because simultaneous transmission with licensed users is available while cognitive transmitters (secondary source and the relay) have not violated an interference temperature which is constrained by primary network.

Our goal is to maximize the throughput of secondary network with interference power constraint defined by primary network, and total power constraint of secondary transmitter and the relay. A joint optimization of power allocation and subcarrier pairing for secondary transmitter and the DF relay node is developed. We formulate the joint power allocation and subcarrier pairing optimization problem, and then solve it using continuous relaxation, to reform the problem to dual problem. An algorithm to achieve feasible subcarrier pairing and power allocation is proposed based on the solution results. Extensive simulation results show that the proposed algorithm almost achieve the optimal weighted sum rate, and outperform existing methods in secondary throughput improvement.

The rest of this paper is organized as follows. In Section 2, we define our cooperative cognitive radio network model and formulate the Weighted Sum Rate (WSR) maximization problem by introducing our objective and constraints. Section 3 solves the optimization problem and proposes an algorithm to achieve feasible solution of the problem. In Section 4, we benchmark the proposed method through extensive simulations. Section 5 concludes the paper.

In this section, we will first define a cooperative cognitive radio system model, and then formulate the WSR maximization problem by introducing the objective function, problem constraints, and the optimization variables based on the system model.

We consider an OFDM-based multicarrier cooperative cognitive radio system, in which both primary and secondary users share the same bandwidth for their transmissions. The secondary system model contains a base station (BS_{S}), a single user (SU) and a DF relay node (R), which transmits simultaneously with a primary system also containing a base station (BS_{P}) and one user (PU). The secondary transmission consists of two hops. In first hop (time slot) BS_{S} transmits over subcarrier k, while both the relay and SU receive the information. In second hop the half-duplex relay retransmits the information which has been received in the first time slot. The relay uses a Decode-and-Forward (DF) method, and transmits over a different subcarrier m, in second hop. Therefore the secondary system transmission lasts two time slots using a Subcarrier Pair denoted as SP (k, m). So if we divide the total frequency band to M subcarriers we will have M subcarrier pairs for secondary system transmission. The secondary system’s downlink destination (SU) receives the information from BS_{S} and the relay node using a Maximal Ratio Combiner (MRC) receiver to exploit spatial diversity.

As shown in _{S} to Relay on subcarrier k, and relay to SU on subcarrier m respectively. Also let denote the primary system downlink channel gain on subcarrier f. The channel gains from BS_{S} and the relay to PU are defined as and on subcarriers k and m respectively. As shown in _{P}) to SU. It’s assumed that all channel gains are independent from each other, and remain constant in a two-slot period. Moreover, all the desired channel gains of the secondary system and the interfering channel gains from secondary to primary system which are, , , , and respectively, are assumed to be perfectly known in BS_{S}. The BS_{S} performs subcarrier pairing and power allocation, and informs the relay node and the SU of the corresponding parameters through a control signaling prior to data transmission. In next section we will formulate our optimization problem based on the system model shown in

The aim of this paper is to maximize the downlink throughput of secondary system. To formulate our optimization problem we have to define our objective function, constraints, and optimization variables. Similar to [

where is the channel gain from secondary BS to SU on subcarrier k and is the variance of Additive White Gaussian Noise (AWGN) on the corresponding subcarrier.

Since a relay node is used in secondary transmissions, the subcarrier pair SP (k, m), may works in two different modes depending on relay’s activity: direct-link mode and relay mode. In the relay mode the DF relay will forward the message in the second time slot on subcarrier m, while in the direct-link mode the message will be sent only via subcarrier k of SD link in the first time slot, and the relay is not used since it will not improve the throughput.

Now that the parameters are defined, we can formulate the achievable weighted rate of secondary downlink for SP (k, m) as [14,15]

where is a weighting factor to represent Quality-of-Service (QoS) requirements on subcarrier k. Also the rate is scaled by since the transmission lasts two time slots.

Introducing total power constraint in secondary system as for SP (k, m), it is shown [

Similar to [

and defining the equivalent secondary channel gain as

the expression in (2) can be re-written in a unified format as [

Also we define which indicates whether SP (k, m) is selected or not. Now that we have defined our objective function and the required variables, the WSR optimization problem can be formulated over variables p and t as follows

where p and t are matrices with entries and for each SP (k, m), and is the total power constraint of secondary system, and is the maximum tolerable interference vector for primary user over each subcarrier. Constraints (8)-(12) are corresponded to secondary system limitations, while constraints (13) and (14) are the primary user interference temperature thresholds.

In this section, we will first solve the WSR maximization problem in the dual domain, and then propose an algorithm to achieve feasible solution of the problem based on the optimization results.

The defined problem [P1] is a Mixed Integer Programming (MIP) problem because of the constraint (11). Due to the fact that the constraint is a set of discrete points, MIP problem is hard to solve. The approach to this kind of problem is to approximate the problem by its continuous relaxation as in [

which is a convex constraint set and is more easier to deal with.

Also in [P1], constraints (13) and (14) are power limitations on the secondary source and relay respectively, while the optimization variable is as the total power constraint. To satisfy constraints (13) and (14) and make it in correspondence with, let denote the maximum total allowed power over subcarrier pair SP (k, m). Using expressions in (4) and combining constraints (13) and (14), can be immediately derived as

Using continuous relaxation and maximum total power constraint in [P1], the relaxed problem becomes

s.t. (8)-(10), and

The objective function in (17) is the same as [P1] for. The new relaxed problem is a convex optimization problem since its objective function is concave, and the constraints are convex sets [

The Lagrangian of problem (12) by using constraints (8) and (9) will be obtained as

where is the Lagrange dual variable, and is the dual Lagrange vector with entries. The dual problem will be

s. t. (10), (18), (19), and.

We will first find the optimum value of, by maximizing over

applying constraint (19), the optimal value of will be

where the following notation is used

Equation (23) is known as “constrained water-filling” [_{k}.

To obtain the optimum value of, we will rewrite the Lagrangian function (20) as (24)

(24)

In (24), and are independent of t. represents the achievable rate for selected subcarrier pair SP(k,m) including cost of selecting subcarrier m in second time slot () and price of power consumption (the last term in). Hence, the optimum pair for subcarrier k in first time slot is subcarrier m in second time slot which maximizes. It can be readily derived that

Assuming and are given we derived and in (23) and (25) respectively, and the interior part of our dual optimization problem is solved. The next step is to solve the exterior part which is finding the optimum values of and which satisfy constraints (8) and (9). The following iterative equations will obtain the optimum values of and using the sub-gradient method

where i is the iteration index, and is the step size in the ith iteration. Note that the step size of (26) and (27) can be different. In each iteration the values of and can be updated using the new values obtained for and in (23) and (25). As the iteration advances, (26) and (27) will converge and the optimum dual variables will be obtained.

The original WSR problem [P1] has an integer valued constraint which causes non-convexity of the constraints set. Hence, the curve obtained for WSR optimum value by varying the total power constraint may have discrete changes in its slope. These sudden jumps in the slope of the curve are due to the changes of the optimal SP as the total power varies. This will cause the solution to the relaxed dual problem to be an upper bound for the optimum value of [P1]. The gap is known as the duality gap. Recently, it is declared that the duality gap will be zero if the optimum answer of the optimization problem is a concave function of the constraints [

We apply our solution to [P2] using Algorithm 1. The problem [P2] has two parts, first part is maximizing the Lagrangian function (21) over variables and, assuming an initial value for dual Lagrange variables, and second part is finding the optimum values for the

Lagrange dual variables and to minimize (21) with the values of and obtained in the first part. In section 3.1 a closed form solution for the first part is derived in equations (23) and (25). While for the second part a sub-gradient method is discussed to find the optimum values of and using iterative equations (26) and (27). In Algorithm 1, we will first initialize the required variables. In each iteration, we will first calculate the optimum value of and using equations (23) and (25), and then find new values for and with the corresponding equations. The loop will continue until the dual Lagrange parameters converge to their optimum values which minimize the constraints cost. Since constraint (9) is guaranteed by equation (25), while constraint (10) may be violated, an amendment is used to avoid selecting the same relay subcarrier for more than one source subcarriers, which results in more than one “1”s in a column of t and violate constraint (10) [

In this section the proposed method for our Cooperative Cognitive Radio Network, as shown in

In Algorithm 1, the initial value of dual Lagrange multipliers are set as, and. The convergence criterion is, and the step size for the subgradient method is set to be, where i is the iteration index. In Un-Weighted Sum Rate (UWSR) scenario, the weighting factor is set to be all “1” for different subcarriers, and in Weighted Sum Rate (WSR) scenario, it obeys the equation. The results are obtained based on 1000 randomly generated channel realizations.

Two different system configurations corresponding to the position of the relay node are investigated. In the first scenario it is assumed that the relay node is placed between the secondary source and destination. The mean square of channel gains in this scenario, are set as

, , and.

In the second scenario, the relay node is placed close to the secondary source. The mean square of channel gains in this scenario, are set as

, , and.

All other assumptions are the same as the previous scenario. Figures 4 and 5 show the secondary system’s WSR and UWSR respectively through different number of subcarriers. In this scenario the improvement in WSR for subcarriers is 9%.

When the relay node is between the secondary source and destination, in

the WSR of secondary system by varying the tolerable interference for subcarriers and fixed total power [Watts]. Both Figures 6 and 7 show that the JSPPA method outperforms the FSP.

In this study we consider an OFDM based cooperative cognitive network with a pair of Source-Destination nodes as the primary user (PU), and a pair of SourceDestination nodes—which is assisted with a relay—as the secondary user SU. In a shared spectrum underlay paradigm, downlink transmission of the secondary system using a half-duplex relay with DF method under total power constraint is considered. Under defined constraints set, a joint subcarrier pairing and power allocation is proposed for SU to maximize its WSR. The problem is transformed to a convex optimization problem using continuous relaxation method, and solved in the dual domain. In large enough number of subcarriers (M) the solution to dual problem will tend to the optimal WSR solution. An algorithm to achieve feasible solutions is used based on the dual optimization results. The algorithm has two parts, the first part is to find the optimum values for optimization variables which are power allocation and subcarrier pair scheme, and second part is to minimize the Lagrangian function over Lagrange dual variables. Through extensive simulations, the spectrum utilization of the proposed approach is benchmarked, and compared with the existing ones. Interestingly it is shown that the proposed method improves the weighted sum rate of SU, and the simulations endorse our mathematical proofs. Simulations show that in best conditions the proposed method JSPPA2 improves the WSR of SU by 17% in respect to the fixed subcarrier pairing (FSP) method. Cooperation in multiuser primary and secondary systems with more relay nodes can be considered in future researches by using the same optimization approach. Also using the proposed method for cooperative cognitive networks which obey overlay paradigm, where cognitive relay nodes can help even primary users to enhance their data transmission, can be a subject of interest in future studies.

The authors wish to acknowledge the partial support of Iran Telecommunication Research Center (ITRC).