Power Control for Maximum Throughput in Spectrum Underlay Cognitive Radio Networks

Power Control for Maximum Throughput in Spectrum Underlay Cognitive Radio Networks

\authorblockNJohn Tadrous, Ahmed Sultan, Mohammed Nafie and Amr El-Keyi \authorblockAWireless Intelligent Networks Center (WINC)
Nile University, Cairo, Egypt
Email: john.tadrous@nileu.edu.eg, {asultan, mnafie, aelkeyi}@nileuniversity.edu.eg
Abstract

We investigate power allocation for users in a spectrum underlay cognitive network. Our objective is to find a power control scheme that allocates transmit power for both primary and secondary users so that the overall network throughput is maximized while maintaining the quality of service (QoS) of the primary users greater than a certain minimum limit. Since an optimum solution to our problem is computationally intractable, as the optimization problem is non-convex, we propose an iterative algorithm based on sequential geometric programming, that is proved to converge to at least a local optimum solution. We use the proposed algorithm to show how a spectrum underlay network would achieve higher throughput with secondary users operation than with primary users operating alone. Also, we show via simulations that the loss in primary throughput due to the admission of the secondary users is accompanied by a reduction in the total primary transmit power. 111This work was supported in part by a grant from the Egyptian National Telecommunications Regulatory Authority

I Introduction

Cognitive radios, or secondary users, are spectrum agile devices that can sense the spectrum, identify the underutilized bands, and opportunistically share those bands with the original users (primary users) such that they do not cause harmful interference on those primary users [1]. Hence, more users can share the spectrum efficiently and provide more utilization to the underutilized bands. However, when a secondary user is severely interfering with the primary users, it should abandon this primary band and try to exploit another underutilized one.

Cognitive radios can operate with a primary network using either overlay, or underlay spectrum sharing [2]. In spectrum overlay, secondary users are allowed to access the primary bands that are totally free of primary operation. Consequently, the interference caused on primary users is almost negligible, and robust sensing is demanded of secondary users. In spectrum underlay, secondary users can share the same spectrum band concurrently with the primary users, so long as the interference caused on the primary users is small enough to guarantee minimum primary QoS. The secondary users do not have to employ sophisticated sensing mechanisms. Instead, efficient resource allocation procedure is needed so that the spectrum can be shared with high utilization.

In this paper we consider the problem of power allocation for primary and secondary users in a spectrum underlay system. Most of the existing work separates the power allocation for the secondary network from that of the primary network. In [3] and [4] the authors consider the power allocation for secondary users under maximum tolerable interference constraint on the primary users, besides minimum QoS constraint on each secondary user. They address two scenarios, the first is the maximization of the secondary network throughput in case that all of the secondary users can be supported under the given constraints. The second is the maximization of the number of admitted secondary users under their minimum QoS constraints when not all of them can be supported. The second scenario is also addressed in [5] where a lower complexity and more efficient algorithm is proposed. In [6] the authors combine the power allocation and admission control for secondary users in one problem aiming at maximizing the overall secondary throughput.

In this work we consider an underutilized primary network and investigate the overall network throughput in the presence of cognitive radios. Our objective is to jointly allocate power to both primary and secondary users so that the overall network throughput is maximized, while protecting the QoS of the primary users by keeping their signal-to-interference-and-noise-ratio (SINR) above a minimum level. Since power allocation for maximum sum throughput in multiuser wireless networks is a non-convex problem, we introduce an iterative algorithm that is proved to converge to an optimal value (not necessarily the global) of the total sum throughput. We investigate the efficiency of the solutions to which the proposed algorithm converges via numerical simulations, and show that the network can achieve better utilization by incorporating secondary users operation. Also, we show the throughput and power prices paid by primary users in order to sustain the secondary operation and achieve higher utilization. Our results show that although the primary users may lose throughput due to the secondary operation, their total transmit power is significantly reduced.

The rest of this paper is organized as follows. In Section II we describe the underlay network model. In Section III we state the problem formulation. We introduce the proposed algorithm and establish its convergence in Section IV. Simulation results are presented in Section V and the work is concluded in Section VI.

Ii System Model

We consider a spectrum sharing model where secondary users share the same frequency band with primary users. In this model we focus on the uplink transmission from primary users toward their base station (BS), whereas the secondary users are communicating with each other in an ad-hoc fashion as shown in Fig. 1.

Fig. 1: System Model

The primary network is assumed to have a single BS with primary users. We denote the transmit power of the primary user by , , the channel gain from user to the base station by and the SINR of primary user by . Thus,

(1)

where there exist secondary links within the coverage area of the primary BS. Each secondary link comprises one transmitter and one corresponding receiver. The parameter is the transmit power of the transmitter of secondary link , is the channel gain between the secondary transmitter and the primary BS, and is the background noise power in the frequency band of operation. The channel gain between a secondary transmitter and a secondary receiver is , whereas the channel gain between a primary transmitter and a secondary receiver is . Hence, we can write the SINR of the secondary link , , as

(2)

A central controller is assumed to be responsible for the resource allocation for the network nodes. This controller is assumed to have knowledge of all of the channels in the system.

Iii Problem Formulation

For the given system, we consider the sum throughput. The network users are allocated powers so that the total throughput, primary and secondary, is maximized. However, in order to guarantee minimum QoS for the primary users, the power control scheme should guarantee that the SINR of each primary user does not fall below a minimum level. The QoS constraint on the primary users are

(3)

This is equivalent to guaranteeing a minimum rate for each primary user. Moreover, each transmitter, secondary or primary, cannot increase its transmit power beyond a certain maximum level. The power constraints on secondary and primary users are

(4)
(5)

Using the definition of the throughput of user in bps/Hz as , the optimization problem is written as


maximize
subject to
(6)

where the optimization variables are and for and . The SINRs: and are defined in (1) and (2). Parameters and are control binary variables to switch between three different scenarios: 1) , in which secondary users are not allowed to operate, 2) , in which secondary users can share the spectrum with the primary users, and 3) , in which the secondary sum throughput is maximized under the primary QoS constraints. We consider the second scenario in the next section. The optimization problem in (6) is a non-convex one and has no tractable solution [7]. In [3], a similar optimization problem is reduced to a convex problem, by omitting the unity term added to the SINR in each throughput term. That is, the system is assumed to operate in high SINR regime where and the problem is then converted to a geometric program and solved for a global optimum. But the difference in our formulation is that there are no constraints on the SINR of the secondary network, i.e., the system is opportunistic for the secondary users, consequently high SINR is not guaranteed for every user.

Also, the feasibility of the problem in (6) necessitates that the primary network alone is feasible. That is, there exists a power allocation for every primary transmitter so that all the primary users can be supported exactly at their minimum QoS requirements. We assume that the proposed algorithm takes place when the primary network is feasible.

Iv Iterative Geometric Programming

We convert the non-convex problem in (6) to a convex one by approximating the objective function by a monomial. We formulate the resulting problem as a geometric program that can be solved efficiently with polynomial computational complexity. Then, we iteratively update the approximate function and solve the geometric program again till convergence to at least a local maximum solution of the original problem.

Iv-a Geometric Programming

Before defining the geometric program we first introduce the following two terms:

  • A monomial where is non-negative real constant, and are real constants.

  • A posynomial is a sum of monomials [8].

A geometric program is defined as follows:


minimize
subject to
(7)

where, , , are posynomials and , are monomials.

Geometric programs can be simply converted into convex problems [8]. Since , the optimization problem (6) can be written as:

subject to
(8)

where and are the vectors of secondary and primary power allocations, respectively, and and are vectors of SINR allocations of secondary and primary users. We note that the constraints of the optimization problem (8) satisfy the conditions of posynomials. However, the conversion of the objective from maximization to minimization while maintaining the posynomial form is not achievable. For this reason we approximate the objective function, , to a monomial where

(9)

consequently, the approximate optimization problem will be

subject to
(10)

where the parameters , , and , and are determined iteratively so that, for any two successive iterations and we always have non-decreasing sum throughput, i.e.,

(11)

where is the solution to the approximate problem (10) for the iteration.

Iv-B Determination of for Non-decreasing Throughput

In this subsection, we consider the complete determination of in a certain iteration so that the inequality of (11) holds. Let be the solution to the approximate problem (10) in the previous iteration. Then, to have a sum throughput in the following iteration that is at least no less than that corresponding to , the approximate function should satisfy the following conditions:

  1. for all ,

  2. ,

  3. .

The above three conditions are sufficient to guarantee that the solution of each approximate problem increases the objective function, and after convergence of the series of the approximate problems, the Karush-Kuhn-Tucker conditions of the original problem in (8) will be satisfied [9, 10]. Let where , , , , , where , , , and .

From the third condition we have:

Therefore,

(12)

From the second condition we have:

(13)

By obtaining , and for and , the approximate objective function is determined for the next iteration. What remains is to show how would the new approximate function satisfy the first condition. It is required to prove that

Equivalently by substituting for and from (13) and (12),

(14)
Theorem 1

Fix , for all the following inequality is satisfied:

(15)

Proof. By combining both sides of (15), and taking the we define:

(16)

Now we prove that by showing that the maximum of is zero. First, the stationary point is obtained by:

By substituting with in (16):

The second derivative of is:

which is negative for . Therefore, for , and consequently the inequality of (15) is satisfied.

Since the inequality of (15) is satisfied for all , inequality (14) is also satisfied, and the first condition on the approximate function is maintained.   

Our proposed iterative algorithm is implemented as follows:

  1. Choose positive initial values for c,, .

  2. Solve the approximate problem in (10).

  3. If a target accuracy is reached, stop the algorithm. Otherwise go to step 4).

  4. Calculate new values of and from (12), (13), then go to step 2).

Note that, the proposed technique can be applied to any sum throughput maximization problem where the constraints are convex. In [11], an approach to solve the sum throughput maximization in interference channels is proposed based on single and double condensation methods [9]. The single condensation method is shown to be outperformed by the double condensation method. However the approximate objective function of the double condensation method was not proved to satisfy the first condition in Section. IV.

V Numerical Results

The simulation setup we use is close to that used in [4]. We assume that the secondary transmitters and the primary users are located in an area of size with BS of the primary network located at the center. The receiving node of each secondary link is placed randomly in a square with its transmitting node at the center. The channel gain between any transmitter and receiver is modeled as , where is the corresponding distance, is a random Gaussian variable with zero mean and a standard deviation of 6 dB to account for shadowing effects, and is a factor that includes some system parameters such as antenna gain and carrier frequency. The background noise power is watt. The maximum transmit power on each secondary transmitter is watt, and on each primary transmitter watt. For simulations we use the CVX, a package for specifying and solving convex programs [12].

V-a Convergence of the Iterative Algorithm

We compare the value of the sum throughput to which the proposed algorithm converges with the optimum solution obtained by exhaustive search, for this simulation we consider and , the minimum QoS for the primary transmitters is chosen to be dB. For the feasibility of the primary network we assume primary and secondary users employ CDMA with primary processing gain , and secondary processing gain . We run five different simulations where in each one the locations of all users are generated randomly. The exhaustive search result is obtained by discretizing the transmit power range of each user into samples and trying all possible combinations of these samples, then picking the one that achieves the maximum sum throughput under the QoS constraints. We start the iterative algorithm with all exponents in equal to one, i.e., . Fig. 2 shows how the iterative algorithm almost converges to the optimum solution for small number of users. The proposed algorithm, however, is not guaranteed to converge to the global solution in general situations.

Fig. 2: Total network throughput in different simulations for both the iterative and exhaustive search schemes and

The convergence in a low SINR regime is shown in Fig. 3, where a simulation is run under unity processing gain for both primary and secondary users. And the minimum QoS for the primary users is dB, while the initial condition is not changed. Here, we note that, the initial condition of equal values of means that the system is at high SINR which is not true in the current scenario, and that is obvious from the solution of the first iteration, however the proposed algorithm then iteratively increases the throughput till it reaches a local maximum that is the exhaustive search solution in this setup.

Fig. 3: Convergence of the proposed algorithm in low SINR regime for and

V-B Network Utilization and Primary Cost

In this subsection we compare between the total throughput of the primary network alone, and the total throughput of the overall underlay network. In this simulation we assume users, and . Both primary and secondary users use processing gain of . The minimum QoS for each primary user is dB. We use the proposed iterative algorithm in the three scenarios discussed in Section III. The initial components of the vector are equal. We run five experiments, where in each one, the locations of all users are generated randomly and the three optimization scenarios take place. For each optimization scenario we calculate the total sum throughput, the primary sum throughput and the total primary transmit power. The results showing those three quantities are depicted in Fig. 4, Fig. 5 and Fig. 6, respectively.

Fig. 4: Total underlay network throughput for and
Fig. 5: Primary network sum throughput for and
Fig. 6: Total primary transmit power for and

From Fig. 4 it is clear that the second scenario in which the primary-plus-secondary sum throughput is maximized is the one that leads to higher utilization in terms of total underlay network throughput. In Fig. 5 the primary throughput is shown, and it is clear that the concurrent operation of the secondary and primary users leads to degradation of the throughput that the primary network can achieve with no secondary operation. However, the throughput loss of the primary users in the second scenario is not severe and a cooperative primary network may tolerate this throughput price for the sake of more utilization. Fig. 6 shows the total transmit power of the primary network in each of the three scenarios. Although the primary users lose some throughput due to the secondary operation, their total transmit power is reduced significantly as a consequence of the throughput loss. Since the third scenario yields minimum transmit primary power under maximization of the secondary network throughput, the third scenario can be used in an optimization problem that aims at maximizing the secondary sum throughput while the primary users are kept at their minimum possible transmit power with QoS constraints.

Vi Conclusion

We have considered the resource allocation for spectrum underlay cognitive radio networks. Our objective is to allocate power jointly to primary and secondary users so that the total underlay network throughput is maximized. In the optimization problem the primary users are protected against the opportunistic behavior by setting a minimum QoS constraint for each of them. Since the objective function of the optimization problem is non-convex, we introduce an iterative algorithm based on successive solutions to approximate geometric programs. We provide a mathematical proof of the convergence of the proposed algorithm and show that the algorithm converges always to one of the local optima of the original problem. Then we show via simulations the efficient results to which the algorithm converges compared to the exhaustive search method. Finally, we show how the algorithm is used to increase the overall network throughput (utilization) with relatively small loss in primary throughput and with considerable decrease in total primary transmit power.

References

  • [1] FCC, ET Docket No 03-222 Notice of proposed rule making and order, December 2003.
  • [2] Ian F. Akyildiz, Won-Yeol Lee, Mehmet C. Vuran, and Shantidev Mohanty, “NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey,” Computer Networks Journal (Elsevier), September 2006.
  • [3] Y. Xing, C. N. Mathur, M. A. Haleem, R. Chandramouli, and K. P. Subbalakshmi, “Dynamic spectrum access with QoS and interference temperature constraints,” IEEE Trans. Mobile Comp., vol. 6, no. 4, pp. 423433, April 2007.
  • [4] L. Le and E. Hossain, “Resource allocation for spectrum underlay in cognitive radio networks,” IEEE Transactions on Wireless Communications, vol. 7, Issue 12, Part 2, December 2008.
  • [5] J. George, A. Sultan, and M. Nafie, “ Distributed admission and power control for cognitive radios in spectrum underlay networks,” to appear, GLOBECOM proceedings.
  • [6] D. I. Kim, L. Le, and E. Hossain, “Joint rate and power allocation for cognitive radios in dynamic spectrum access environment,” IEEE Transactions on Wireless Communications, vol. 7, Issue 12, Part 2, December 2008.
  • [7] Z.-Q. and S. Zhang, “Dynamic Spectrum Management: Complexity and Duality,” IEEE Jour. of Selected Topics in Signal Processing, vol. 2, no. 1, pp. 57-72, February 2008.
  • [8] S. Boyd and L. Vandenberge,“Convex Optimization,” Cambridge University Press, 2004.
  • [9] M. Chiang, C. W. Tan, D.P. Palomar, D. O’Neill and D. Julian, “Power Control By Geometric Programming,” IEEE Transactions on Wireless Communications, vol. 6, Issue 7, July 2007.
  • [10] B. R. Marks and G. P. Wright, “A general inner approximation algorithm for nonconvex mathematical programs,” Operations Research, vol. 26, no. 4, pp. 681-683, 1978.
  • [11] M. Charafeddine and A. Paulraj, “Sequential geometric programming for interference channel power control,” 41st Annual Conference on Information Sciences and Systems, pp. 185-189, 2007.
  • [12] M. Grant and S. Boyd. CVX: Matlab software for disciplined convex programming. http://stanford.edu/~boyd/cvx, June 2009.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
84214
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description