Abstract
We consider a joint optimization of sensing parameter and power allocation for an energyefficient cognitive radio network (CRN) in which the primary user (PU) is protected. The optimization problem to maximize the energy efficiency of CRN is formulated as a function of two variables, which are sensing time and transmit power, subject to the average interference power to the PU and the target detection probability. During the optimizing process, the quality of service parameter (the minimum rate acceptable to secondary users (SUs)) has also been taken into consideration. The optimal solutions are analyzed and an algorithm combined with fractional programming that maximizes the energy efficiency for CRN is presented. Numerical results show that the performance improvement is achieved by the joint optimization of sensing time and power allocation.
1. Introduction
The traditional approach of fixed spectrum allocation leads to spectrum underutilization with the fast development of wireless communications. It is reported that there are vast temporal and spatial variations in the usage of allocated spectrum, which can be as low as 15% in recent studies by the FCC [1, 2]. This motivates the concept of CRN that allows SUs to opportunistically exploit the underutilized spectrum. In other words, CRN enables SUs to share the spectrum bands opportunistically with PUs.
In a practical CRN which is powered by batteries, the concept of energyefficient design is essential. Both the sensing time and the transmission power affect the energy efficiency of a CRN. For example, if the sensing time is too short, it may reduce the energy consumption in sensing phase and increase the transmission time, but data loss probability and interference to the PU are also introduced due to false detection. If the sensing time swells, detection accuracy is improved. However, it consumes more energy without ameliorating data transmission. Similarly, transmission power is also salient from the viewpoint of energy efficiency. The larger the transmission power is, the more throughput can be obtained. However, it consumes more energy.
Some recent works dealing with the issues of CRN’s energy efficiency have been presented in [3–7]. In [3], the authors discuss the CRN’s energyefficient transmission with variable transmission duration and interference to the PU when the sensing duration is fixed. In [4], a joint design of energyefficient sensing and transmission durations for a CRN is considered. In [5], a joint optimization problem of the fusion rule threshold and detector’s threshold to maximize the energy efficiency of the CRN is studied. In [6], the authors identify the sensingaccess strategies and the sensing order that achieve the maximum energy efficiency. In [7], the authors propose a low complexity solution to the problem of finding the power allocation that maximizes the energy efficiency, while limiting the interference to the PU and meeting the SUs’ minimum rate requirements.
In this paper, we will focus on the joint optimization between the spectrum sensing time and power allocation to maximize energy efficiency, which is defined as the number of transmitted data bits per Joule of energy, with limited interference power to the PU. During the optimizing process, the target detection probability and the quality of service parameter (such as the minimum rate acceptable to SU) have also been taken into consideration. We consider the scenario that multiple SUs jointly sense one licensed spectrum band which can be divided into multiple subbands, and each SU operates exclusively in one of the subbands when the PU is detected to be absent. An optimization algorithm combined with fractional programming to solve the optimization problem is proposed. We compare the proposed scheme that jointly optimizes sensing time and power allocation with the schemes that only optimize either sensing time or power allocation, and numerical results demonstrate that the performance improvement is achieved by the joint optimization of sensing time and power allocation.
The rest of this paper is organized as follows. In Section 2, we present the system model. In Section 3, we address an optimization problem for an energyefficient CRN. In Section 4, the optimization problem is analyzed and an algorithm combined with fractional programming is given to achieve the optimum value. Then we present numerical results in Section 5. Finally, we conclude our paper in Section 6.
2. System Model
2.1. System Model
In this paper we consider a CRN where multiple SUs are allowed to access one licensed spectrum band. The entire licensed band is divided into subbands, and each SU operates exclusively in one of the subbands when the PU is detected to be absent. Such assumption is widely used in [7, 8].
The system is assumed to be perfectly synchronized, and time is divided into slots, each with a fixed length . Each slot includes three phases [9]: the sensing phase, the reporting phase, and the transmission phase. We assume that the PU is either absent or present during each slot. During the sensing time, the SUs need to sense the PU’s activity. Since the PU will operate in all the subbands once becoming active, the SUs can jointly sense the PU’s presence and send the spectrum results to the fusion center via a common control channel [5] in the reporting phase. Finally, based on the spectrum sensing results of the SUs, the fusion center determines the absent or active status of PU. With the cooperative spectrum sensing, each SU can spend less time detecting while enjoying a low false alarm probability. In addition, to keep the duration of the reporting phase at an acceptable level, the number of SUs that are involved should be limited. It can be seen that the reporting phase adds a fixed time overhead [10]. Without loss of generality, the duration of the reporting phase is assumed to be zero. The transmission phase is used for data transmission of SUs when the PU is detected to be absent. The structure of the time slot is shown in Figure 1, where denotes the sensing time, represents the reporting time of single SU, and is the transmission time.
2.2. Cooperative Spectrum Sensing
The spectrum sensing is considered as a binary hypothesis testing problem: hypothesis when the PU is absent and hypothesis when the PU is active. For the energy detection scheme, the test statistic for the energy detector of the SU is compared with a detection threshold , to decide the absent or active status of PU. Denote is the received average SNR of PU’s signal measured at the secondary detector under hypothesis . Under AWGN fading channel assumption, the probabilities of detection and false alarm of the SU are given, respectively, by [11] where represents the sensing time, denotes the sampling frequency, and finally the is the complementary distribution function of standard Gaussian.
The “most rule” is used to make the final decision by the fusion center, where at least half of SUs’ decisions say that the PU is active; then the final decision declares that the PU is active [11]. Note that our model can be readily extended to different cooperative spectrum sensing schemes. Similar to [12], we assume that the size of the CRN is small compared with its distance from the primary system. Therefore, the received signal at each SU experiences almost identical path loss. Hence each SU has the same and . For a given time slot, SUs perform spectrum sensing; the final probabilities of false alarm and detection based on the most rule are given, respectively, by [12] where .
3. Problem Formulation
3.1. Average Throughput of CRN
The spectrum band’s availability for SUs’ transmission is based on the outcome of the spectrum sensing. If the PU is detected to be absent while the PU is actually active, the PU’s signal is an interference to SUs’ transmission, and we assume the transmission will not succeed. Hence, when the PU is absent and no false alarm is generated, the SUs can successfully transmit the data.
Denote as the achievable data rate when the SU transmits under no interference from the PU over the subband labeled , and the value of is assumed to be [11] where represents the transmission power of the SU, denotes the gain on subband , and is the background noise power per Hz.
The average throughput in a time slot on subband can be expressed as where denotes the absent probability of the PU.
Therefore, the average throughput of the CRN in a time slot is
If is the minimum rate acceptable to the SU, then we have
If we let , we can rewrite (7) as
It is easy to observe that the SUs will cause interference to the PU when PU is active. Therefore, the average interference power constraint can be written as [13] where represents an acceptable average interference threshold of PU and denotes the active probability of the PU.
3.2. Average Energy Consumption of CRN
In our model, the energy consumption of the SU consists of three parts: circuit consumption power , spectrum sensing power , and data transmit power .
In the CRN, there are four different scenarios between the activities of the PU and the SUs.In this scenario, the SUs successfully detect the PU’s absent status with probability , and the energy consumed is given by For this scenario, the SUs falsely detect the PU’s absent status with probability , and the energy used is given by In this case, the SUs falsely detect the PU’s active status with probability , and the energy used is given by Under this scenario, the SUs successfully detect the PU’s active status with probability , and the energy consumed is given by
The average energy consumption in a time slot can be expressed by
3.3. Energy Efficiency
Our objective is to maximize the energy efficiency of the CRN subject to the target detection probability constraint while keeping the average interference introduced to the PU below a certain threshold, which can be expressed aswhere is the target detection probability.
Notably, the above problem is not convex, and directly obtaining the optimal solution is difficult. Hence, in the next section, fractional programming [14] is utilized to solve it.
4. Solution of Formulation
In this section, we will apply optimization algorithm combined with fractional programming to solve problem (15a)–(15f).
When the constraint (15c) is considered only, for any given , we can determine a threshold from (1) that is able to satisfy constraint (15c), which is given by where is the single SU detection probability satisfying .
Similarly, when the constraint (15d) is considered only, the optimal solution occurs only when constraint (15d) is at equality. The proof is similar to [12]. When constraint (15d) is at equality, for any given , we can determine a threshold from (2) that is able to satisfy constraint (15d), which is given by where is the single SU detection probability satisfying .
In order to satisfy both constraints (15c) and (15d), should choose the max value between (16) and (17):
Since constraints (15c) and (15d) can be satisfied by (18) for any given , the optimization (15a)–(15f) is reduced towhere .
Since lies within the limited interval , similar to [15], we can exhaustively search for the optimal sensing time over . Hence, for a given , problem (19a)–(19d) can be simplified as follows:where , , and .
The fractional programming [14] can be used to solve problem (20a)–(20c). First, a new objective function is defined as where is a positive parameter.
Hence, another problem is formulated as
Define the optimal value and solution of problem (22a)–(22c) as and , respectively. The following lemma introduced by Dinkelbach [14] can relate problem (20a)–(20c) and (22a)–(22c), and detailed proof can be found in [14].
Lemma 1. The optimal solution achieves the optimal value of problem (20a)–(20c); that is, according to (20a), if and only if
This lemma indicates that at the optimal parameter , the optimal solution to problem (22a)–(22c) is also the optimal solution to problem (20a)–(20c). Hence, solving problem (20a)–(20c) can be realized by finding the optimal power allocation of problem (22a)–(22c) for a given and then update until (23) is established.
For a given , the optimal power allocation can be obtained using convex theory [16] because of the characteristic of problem (22a)–(22c). First, the constraint (22b) is not considered; then the Lagrange function of problem (22a)–(22c) is where is the Lagrange multiplier for constraint (22c). Using the KarushKuhnTucker (KKT) condition, the optimal solution for problem (22a)–(22c) without constraint (22b) is and the value of can be found by subgradient method [16].
The optimal value of problem (22a)–(22c) without constraint (22b) can be obtained by Algorithm 1.

In the following, we classify the optimal value obtained by Algorithm 1 into two cases considering the constraint (22b); we start with Case 1, where represents the set of all SUs in the CRN.
Case 1. When for all SUs, the maximum energy efficiency of problem (20a)–(20c) is .
Case 2. for , and for . Note that for those the only way to satisfy the condition (22b) is to set
After assigning these powers to SUs who fall in , we can reformulate the problem (20a)–(20c) with optimization variables for and fixed for and resolve it through the above method.
Hence, the optimal solution for problem (15a)–(15f) is given in Algorithm 2.

5. Numerical Results
The default parameters are set as follows: the number of SUs , the fixed time slot , and the sampling frequency of the received signal is assumed to be MHz. The SNR of the PU’s signal received at the SUs is set to be dB. The background noise power is W/Hz. The active probability of the channel is set to be . The threshold of the detection probability on all channel is assumed to be . The threshold of the false alarm probability on all channel is . The sensing and circuit power are set as and , respectively. The minimum rate requirement is ; we consider a Rayleigh fading environment with average channel power gain, that is, equal to 0.1.
In Figure 2, the energy efficiency versus the sensing time is compared among different SNR when power allocation is optimized with the fixed average interference power . It can be observed that when sensing time initially increases, the energy efficiency increases. This means that the improvement in sensing performance is able to outweigh the loss in shorter transmission time and larger energy used for sensing. However, when sensing time is increased further, the energy efficiency decreases as it is no longer worth to improve the sensing performance. Furthermore, when the SNR is high, the optimal sensing time is shorter and the energy efficiency is larger.
In Figure 3, the energy efficiency versus the average interference power threshold is compared between different schemes. In the proposed scheme, the sensing time and power allocation are jointly optimized. In scheme I, the sensing time is optimized while all SUs share the same transmit power which satisfies the constraint (15f). And in scheme II, the power allocation is optimized with a fixed sensing time . It can be observed that the proposed scheme outperforms scheme I and scheme II. Energy efficiency in all schemes increases when the average interference power threshold initially increases. However, when the average interference power threshold is increased further, the energy efficiency does not increase any more as the constraint of the average interference power is loose.
6. Conclusion
In this paper, we consider the scenario that multiple SUs jointly sense one licensed spectrum band which can be divided into multiple subbands and each SU operates exclusively in one of the subbands when the PU is detected to be absent. We focus on the joint optimization between the spectrum sensing time and power allocation to maximize energy efficiency of the CRN, with limited interference to the PU. During the optimizing process, the target detection probability and the quality of service parameter have also been taken into consideration. An optimization algorithm combined with fractional programming to solve the optimization problem is proposed. Numerical results show that the performance improvement is achieved by joint optimization of sensing time and power allocation.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
This work is supported by National Nature Science Foundation of China (nos. 11301071, 61372106, 61102068, 61172077, and 61223001), Key Special Project of National Science and Technology (no. 2013ZX03003006), National 863 High Technology Development Project (no. 2013AA013601), Research Fund of National Mobile Communications Research Laboratory, Southeast University (no. 2013A04, 2014B01), and CPSF (2013M531244).