Open Access
This article is

- freely available
- re-usable

*Energies*
**2016**,
*9*(7),
568;
https://doi.org/10.3390/en9070568

Article

Multislot Simultaneous Spectrum Sensing and Energy Harvesting in Cognitive Radio

^{1}

School of Information and Communication Engineering, Dalian University of Technology, Dalian 116024, China

^{2}

School of Information Science and Technology, Dalian Maritime University, Dalian 116026, China

^{3}

Communication Research Center, Harbin Institute of Technology, Harbin 150080, China

^{*}

Authors to whom correspondence should be addressed.

Academic Editor:
Hongjian Sun

Received: 8 June 2016 / Accepted: 15 July 2016 / Published: 21 July 2016

## Abstract

**:**

In cognitive radio (CR), the spectrum sensing of the primary user (PU) may consume some electrical power from the battery capacity of the secondary user (SU), resulting in a decrease in the transmission power of the SU. In this paper, a multislot simultaneous spectrum sensing and energy harvesting model is proposed, which uses the harvested radio frequency (RF) energy of the PU signal to supply the spectrum sensing. In the proposed model, the sensing duration is divided into multiple sensing slots consisting of one local-sensing subslot and one energy-harvesting subslot. If the PU is detected to be present in the local-sensing subslot, the SU will harvest RF energy of the PU signal in the energy-harvesting slot, otherwise, the SU will continue spectrum sensing. The global decision on the presence of the PU is obtained through combining local sensing results from all the sensing slots by adopting “Or-logic Rule”. A joint optimization problem of sensing time and time splitter factor is proposed to maximize the throughput of the SU under the constraints of probabilities of false alarm and detection and energy harvesting. The simulation results have shown that the proposed model can clearly improve the maximal throughput of the SU compared to the traditional sensing-throughput tradeoff model.

Keywords:

cognitive radio (CR); spectrum sensing; energy harvesting; throughput; detection probability## 1. Introduction

To improve the current spectrum utilization, cognitive radio (CR) has been proposed to allow a secondary user (SU) to access the spectrum licensed to the primary user (PU), providing that the PU is not occupying the spectrum [1,2]. To avoid causing harmful interference to the PU, the SU should detect whether the PU exists in the frequency band depending on performing spectrum sensing before any available transmissions. Only if the absence of the PU is detected, can the SU access the PU spectrum for its transmission [3,4]. The spectrum sensing performance is reflected by the probabilities of false alarm and detection. Decreasing false alarm probability improves the spectrum access of the SU, while increasing detection probability reduces the interference to the PU [5].

Since it is often hard to obtain any PU information from the SU, energy sensing has been frequently used in CR as an effective spectrum sensing method, which can be implemented easily without acquiring any prior information from the emission signal of the PU [6]. Increasing sensing time may improve the sensing performance but decrease the transmission time, thus it is important to develop a sensing-throughput tradeoff scheme to acquire both reliable energy sensing for detecting the presence of the PU signal and efficient data transmission for the SU [7]. In [8], the optimal sensing time is determined to maximize the achievable throughput of the SU subject to the constraint of detection probability of the PU. A joint optimization of sensing time and transmission power for maximizing the aggregate throughput of a cooperative CR network is studied in [9]. In [10], an energy-efficient CR system is designed to simultaneously meet spectrum sensing reliability and secondary data transmission rate constraints. However, the energy consumption for spectrum sensing, which may affect both energy sensing performance and transmission power of SU, has not been considered in [7,8,9,10]. The signal sampling of energy sensing has to consume some electrical power from the stored battery energy that originally supplies data transmission; thus, the achievable throughput of the SU is decreased.

Recently, energy harvesting has been proposed by some references, which may collect the radio frequency (RF) energy of the environmental signal sources to supply the electrical power for a wireless communication system instead of a fixed power supply [11,12]. An energy-harvesting circuit that consisted of semiconductor-based rectifying elements was designed to convert the received RF energy to the direct current (DC) power [13]. In [14,15], an energy-harvesting SU is investigated to harvest the RF energy of the PU signal in the transmission time when the PU is occupying this channel. However, energy harvesting is often performed independently after spectrum sensing; thus, the energy consumption of spectrum sensing cannot be duly supplemented. Moreover, since the spectrum sensing may consume some of the total power, without energy harvesting in the sensing duration, the initial transmission power of the SU may reduce, thus decreasing the transmission rate of the SU. Since the RF energy of the PU signal can be used both for spectrum sensing and energy harvesting, the simultaneous spectrum sensing and energy harvesting will become a profitable research are, which may save the consumed sensing energy by using the harvested PU signal energy to supply spectrum sensing.

The contributions of the paper are listed as follows:

- The paper firstly combines spectrum sensing and energy harvesting, the sensing duration is divided into multiple sensing slots consisted of one local-sensing subslot for energy sensing of the PU and one energy-harvesting subslot for harvesting the RF energy of the PU signal. If the presence of the PU is detected in the local-sensing subslot, the SU will harvest energy in the energy-harvesting subslot. Then the harvested energy is used to supply the spectrum sensing in the following sensing slot.
- The paper has proposed a jointly optimal allocation of sensing time and harvesting time to maximize the achievable throughput of the SU under the constraints that the target probabilities of detection and false alarm are both guaranteed and the harvested energy may supply the spectrum sensing. A joint optimization algorithm based on binary searching and alternating direction optimization (ADO) has been proposed to achieve the optimal solutions to the proposed optimization problem.

The rest of the paper is organized as follows: the energy sensing and energy harvesting are described in Section 2, both the system model building and the throughput of SU in the proposed model are given in Section 3, the joint optimization algorithm of sensing time and time splitting in the proposed model is defined in Section 4, and the simulations and discussions are finally drawn in Section 5.

## 2. Energy Sensing and Harvesting

#### 2.1. Energy Sensing

Since SU and PU are two different kinds of communication systems, the SU is often hard to acquire any prior information of the PU signal, hence, energy detection is performed to sense the PU as an effective spectrum sensing method, without needing any information of the detected signal. The detected signal y received by the SU is seen as a binary hypothesis problem as follows [16]:
where ${H}_{0}$ and ${H}_{1}$ denote the absence and presence of the PU, respectively, $s\left(t\right)$ is the PU signal with the power of ${p}_{\mathrm{s}}$, $n\left(t\right)$ is the Gaussian noise with the variance of ${\mathsf{\sigma}}_{n}^{2}$, $h\left(t\right)$ is the channel gain from the PU transmitter to the SU receiver, M is the number of the signal samples. We also suppose that $P\left({H}_{0}\right)$ and $P\left({H}_{1}\right)$ are the existent probabilities of ${H}_{0}$ and ${H}_{1}$, respectively. Supposing the sampling frequency as ${f}_{\mathrm{s}}$ and the sensing time as $\mathsf{\tau}$, we get $M=\mathsf{\tau}{f}_{\mathrm{s}}$. From Equation (1), the energy statistic of y is given as follows:
where $y\left(1\right),y\left(2\right),\dots ,y\left(M\right)$ are independently and identically distributed. With a large M, $\Omega \left(y\right)$ obeys the Gaussian distribution as follows:
where $\mathsf{\gamma}={h}^{2}{p}_{\mathrm{s}}/{\mathsf{\sigma}}_{n}^{2}$ is the sensing signal to noise ratio (SNR). Comparing $\Omega \left(y\right)$ to a presettled detection threshold $\mathsf{\lambda}$, the probabilities of false alarm and detection are respectively given as follows:
where the function $Q\left(x\right)={\textstyle \frac{1}{\sqrt{2\mathsf{\pi}}}}{\int}_{x}^{+\infty}exp\left(-{z}^{2}/2\right)\mathrm{d}z$.

$$y\left(t\right)=\left\{\begin{array}{c}n\left(t\right),{H}_{0}\hfill \\ h\left(t\right)s\left(t\right)+n\left(t\right),{H}_{1}\hfill \end{array}\right.,t=1,\phantom{\rule{3.33333pt}{0ex}}2,\phantom{\rule{3.33333pt}{0ex}}\dots ,\phantom{\rule{3.33333pt}{0ex}}M$$

$$\Omega \left(y\right)=\frac{1}{M}{\displaystyle \sum _{t=1}^{M}}{\u2225y\left(t\right)\u2225}^{2}$$

$$\Omega \left(y\right)\sim \left\{\begin{array}{c}\mathcal{N}\left({\mathsf{\sigma}}_{n}^{2},\frac{{\mathsf{\sigma}}_{n}^{4}}{M}\right),{H}_{0}\hfill \\ \mathcal{N}\left(\left(1+\mathsf{\gamma}\right){\mathsf{\sigma}}_{n}^{2},\frac{{\left(1+\mathsf{\gamma}\right)}^{2}{\mathsf{\sigma}}_{n}^{4}}{M}\right),{H}_{1}\hfill \end{array}\right.$$

$$\left\{\begin{array}{c}{P}_{\mathrm{f}}\left(\mathsf{\tau}\right)={P}_{\mathrm{r}}\left(\Omega \left(y\right)\ge \mathsf{\lambda}\left|{H}_{0}\right.\right)\phantom{\rule{1.0pt}{0ex}}\phantom{\rule{1.0pt}{0ex}}=Q\left(\left(\frac{\mathsf{\lambda}}{{\mathsf{\sigma}}_{n}^{2}}-1\right)\sqrt{\mathsf{\tau}{f}_{\mathrm{s}}}\right)\hfill \\ {P}_{\mathrm{d}}\left(\mathsf{\tau}\right)={P}_{\mathrm{r}}\left(\Omega \left(y\right)\ge \mathsf{\lambda}\left|{H}_{1}\right.\right)=Q\left(\left(\frac{\mathsf{\lambda}}{{\mathsf{\sigma}}_{n}^{2}(\mathsf{\gamma}+1)}-1\right)\sqrt{\mathsf{\tau}{f}_{\mathrm{s}}}\right)\hfill \end{array}\right.$$

#### 2.2. Energy Harvesting

In this paper, we consider an energy-harvesting SU consisting of a spectrum sensing device and an energy-harvesting device, which converts the harvested RF energy of the PU signal to the electrical power for supplying spectrum sensing. The SU senses the PU signal and simultaneously stores the arriving energy from the PU in a rechargeable battery, through deploying an energy-harvesting circuit consisting of band-pass filter, rectifying circuit and low-pass filter, as shown in Figure 1.

The SU firstly uses a band-pass filter to suppress the out-of-band energy radiation of the received PU signal and then converts the RF signal to a DC signal by the rectifying circuit. The rectifying circuit finally outputs the DC voltage after filtering out the fundamental and harmonic signals from the DC signal through a low-pass filter. However, some of the RF signal energy has to be reradiated to the outside environment due to the electromagnetic characters of the energy-harvesting circuit, thus we assume that $0<\mathsf{\mu}<1$ is the energy-harvesting efficiency, which is determined by the characters of the energy-harvesting circuit elements [16].

## 3. System Model

#### 3.1. Traditional Model

The traditional frame structure designed for the SU consists of one sensing slot and one data transmission slot, and the SU must firstly sense the absence of the PU before any available transmissions, as shown in Figure 2. We suppose the sensing duration as $\mathsf{\tau}$ and the frame duration as T. The SU can operate in the frequency band of the PU in the following two scenarios [17]:

- When the PU is really absent in probability of $P\left({H}_{0}\right)$ and no false alarm is generated by the SU in probability of $1-{P}_{\mathrm{f}}$, the SU may access the spectrum effectively in probability of $P\left({H}_{0}\right)(1-{P}_{\mathrm{f}})$;
- When the PU is really present in probability of $P\left({H}_{1}\right)$ but not detected by the SU in probability of $1-{P}_{\mathrm{d}}$, the SU may also access the spectrum but cause harmful interference to the PU in probability of $P\left({H}_{1}\right)(1-{P}_{\mathrm{d}})$.

Thus, the average achievable throughput of the SU is given as follows:
where ${C}_{0}$ and ${C}_{1}$ denote the throughput of the SU when it operates in the absence and presence of the PU, respectively. If there is only one point-to-point transmission in the secondary link, the SNR for this secondary link is ${\mathsf{\gamma}}_{\text{SU}}=\frac{{p}_{\text{SU}}{h}_{\text{SU}}^{2}}{{\mathsf{\sigma}}_{n}^{2}}$, where ${p}_{\text{SU}}$ is the transmission power of the SU transmitter and ${h}_{\text{SU}}$ is the channel gain from the SU transmitter to SU receiver. Then we have ${C}_{0}=B{log}_{2}(1+{\mathsf{\gamma}}_{\text{SU}})$ and ${C}_{1}=B{log}_{2}(1+\frac{{\mathsf{\gamma}}_{\text{SU}}}{1+\mathsf{\gamma}})$ where B is the bandwidth, respectively. Obviously, we have ${C}_{0}>{C}_{1}$.

$$R\left(\mathsf{\tau}\right)=\frac{T-\mathsf{\tau}}{T}\left(P\left({H}_{0}\right)(1-{P}_{\mathrm{f}}\left(\mathsf{\tau}\right)){C}_{0}+P\left({H}_{1}\right)(1-{P}_{\mathrm{d}}\left(\mathsf{\tau}\right)){C}_{1}\right)$$

The higher the detection probability, the better the sensing performance. However, the lower the false alarm probability, the more chances the idle channel can be reused, thus the higher the throughput for the SU [18]. Thus there could exist a tradeoff between sensing performance and achievable throughput for the SU. The objective of sensing-throughput tradeoff model is to find the optimal sensing duration τ for maximizing the average throughput of the SU while the PU is sufficiently protected. Thus, the optimization problem of the sensing-throughput tradeoff model can be stated as follows [8]:
where ${\overline{P}}_{\mathrm{d}}$ is the lower limit of detection probability.

$$\begin{array}{}\mathrm{(6a)}& \hfill {\displaystyle \underset{\mathsf{\tau}}{\text{max}}}& R\left(\mathsf{\tau}\right)\hfill \mathrm{(6b)}& \hfill \mathrm{s}.\mathrm{t}.& {P}_{\mathrm{d}}\left(\mathsf{\tau}\right)\ge {\overline{P}}_{\mathrm{d}}\hfill \end{array}$$

#### 3.2. Proposed Model

In the common communication system, all the energy stored in the battery is used for data transmission. However, in CR system, the spectrum sensing has to consume some of the battery energy due to the circuit power of A/D chip and detector. Hence, the disadvantage of the traditional CR system is that spectrum sensing has to consume some of the stored energy for data transmission, which decreases the transmission power and throughput of the SU transmitter compared with the common communication system. In this paper, we have proposed a multislot simultaneous spectrum sensing and energy harvesting model, where the sensing duration is further divided into N sensing slots, each of which consists of local-sensing subslot and energy-harvesting subslot, as shown in Figure 3. In each sensing slot, the SU firstly senses to make a local decision on the activity of the PU in the local-sensing subslot, then if the absence of the PU is detected, in case that the PU may suddenly appear later, the SU must continue sensing the PU in the energy-harvesting subslot and make a final decision at the end of the sensing slot. However, if the presence of the PU is detected accurately in the local-sensing subslot, the SU can harvest the RF energy of the PU signal in the energy-harvesting subslot. The harvested energy in the current sensing slot is used to supply the local spectrum sensing in the following sensing slot.

Supposing that the lengths of local-sensing subslot and energy-harvesting subslot are $\mathsf{\rho}\mathsf{\tau}$ and $(1-\mathsf{\rho})\mathsf{\tau}$, respectively, where $\mathsf{\rho}$ is the time splitter factor, the probability of deciding the presence of the PU in the local-sensing subslot is $P\left({H}_{0}\right){P}_{\mathrm{f}}\left(\mathsf{\rho}\mathsf{\tau}\right)+P\left({H}_{1}\right){P}_{\mathrm{d}}\left(\mathsf{\rho}\mathsf{\tau}\right)$. However, the SU can harvest energy only when the PU is actually present, thus the harvested energy ${E}_{\mathrm{H}}$ in the energy-harvesting subslot is given by:

$${E}_{\mathrm{h}}(\mathsf{\tau},\mathsf{\rho})=\mathsf{\mu}P\left({H}_{1}\right){P}_{\mathrm{d}}\left(\mathsf{\rho}\mathsf{\tau}\right){p}_{\mathrm{s}}{h}^{2}(1-\mathsf{\rho})\mathsf{\tau}$$

While the probability of deciding the absence of the PU in the local-sensing subslot is $\xi =P\left({H}_{0}\right)(1-{P}_{\mathrm{f}}\left(\mathsf{\rho}\mathsf{\tau}\right))+P\left({H}_{1}\right)(1-{P}_{\mathrm{d}}\left(\mathsf{\rho}\mathsf{\tau}\right))$. If the absence of the PU is detected, the SU must sense the PU both in local-sensing subslot and energy-harvesting subslot in probability of ξ, thus the average sensing time is $\mathsf{\rho}\mathsf{\tau}+\xi (1-\mathsf{\rho})\mathsf{\tau}$. The achieved probabilities of false alarm and detection at the end of the sensing slot is ${P}_{\mathrm{f}}(\mathsf{\rho}\mathsf{\tau}+\xi (1-\mathsf{\rho})\mathsf{\tau})$ and ${P}_{\mathrm{d}}(\mathsf{\rho}\mathsf{\tau}+\xi (1-\mathsf{\rho})\mathsf{\tau})$. At the end of the sensing duration, the SU will obtain a global decision on the activity of the PU through combining these sensing results from all the sensing slots by adopting “Or-logic Rule”. Thus the global probabilities of false alarm and detection are given as follows:

$$\left\{\begin{array}{c}{P}_{\mathrm{f}}^{\mathrm{g}}(\mathsf{\tau},\mathsf{\rho})=1-{(1-{P}_{\mathrm{f}}\left(\mathsf{\rho}\mathsf{\tau}+\xi (1-\mathsf{\rho})\mathsf{\tau}\right))}^{N}\hfill \\ {P}_{\mathrm{d}}^{\mathrm{g}}(\mathsf{\tau},\mathsf{\rho})=1-{(1-{P}_{\mathrm{d}}\left(\mathsf{\rho}\mathsf{\tau}+\xi (1-\mathsf{\rho})\mathsf{\tau}\right))}^{N}\hfill \end{array}\right.$$

The average number of sampling nodes in each sensing slot is $\left(\mathsf{\rho}\mathsf{\tau}+\xi (1-\mathsf{\rho})\mathsf{\tau}\right){f}_{s}$. Supposing the unit sampling energy as ${e}_{\mathrm{s}}$, the total spectrum sensing energy is ${E}_{\mathrm{s}}=N{e}_{\mathrm{s}}\left(\mathsf{\rho}\mathsf{\tau}+\xi (1-\mathsf{\rho})\mathsf{\tau}\right){f}_{\mathrm{s}}$. In case that the PU is not present in the whole sensing duration, we assume that the minimal energy for spectrum sensing supported by the battery is ${E}_{\mathrm{m}}$ and thus have $N{E}_{\mathrm{h}}+{E}_{\mathrm{m}}\ge {E}_{\mathrm{s}}$. In fact, the harvested energy $N{E}_{\mathrm{h}}$ is used to compensate the loss of transmission power of the SU, thus supposing $\mathsf{\tau}\ll T$, the compensated transmission power $\u25b5{p}_{\text{SU}}\approx \frac{N{E}_{\mathrm{h}}}{T}$. The compensated SNR for the secondary link is $\u25b5{\mathsf{\gamma}}_{\text{SU}}=\frac{\u25b5{p}_{\text{SU}}{h}_{\text{SU}}^{2}}{{\mathsf{\sigma}}_{n}^{2}}$, thus the throughput of the SU in the absence and presence of the PU are ${\tilde{C}}_{0}={log}_{2}(1+{\mathsf{\gamma}}_{\text{SU}}+\u25b5{\mathsf{\gamma}}_{\text{SU}})$ and ${\tilde{C}}_{1}={log}_{2}(1+\frac{{\mathsf{\gamma}}_{\text{SU}}+\u25b5{\mathsf{\gamma}}_{\text{SU}}}{1+\mathsf{\gamma}})$, respectively.

Like Equation (5), substituting Equation (8), the average throughput of the SU in the proposed model is given as follows:

$$\tilde{R}(\mathsf{\tau},\mathsf{\rho})=\frac{T-N\mathsf{\tau}}{T}\times \left(P\left({H}_{0}\right)(1-{P}_{\mathrm{f}}^{\mathrm{g}}(\mathsf{\tau},\mathsf{\rho})){\tilde{C}}_{0}+P\left({H}_{1}\right)(1-{P}_{\mathrm{d}}^{\mathrm{g}}(\mathsf{\tau},\mathsf{\rho})){\tilde{C}}_{1}\right)$$

When there is no any transmissions in CR, the maximal lifetime of the traditional CR network can be obtained by:
where ${E}_{\mathrm{T}}$ is the total battery energy. However, according to Equation (7), the maximal lifetime of the energy-harvesting CR network can be given by:
where obviously, $\tilde{LT}>LT$.

$$LT=\frac{{E}_{\mathrm{T}}}{{e}_{\mathrm{s}}{f}_{\mathrm{s}}}$$

$$\tilde{LT}=\frac{{E}_{\mathrm{T}}}{{e}_{\mathrm{s}}{f}_{\mathrm{s}}-\mathsf{\mu}P\left({H}_{1}\right){P}_{\mathrm{d}}{p}_{\mathrm{s}}{h}^{2}}$$

## 4. Model Optimization

In the proposed system model, our goal is to maximize the average achievable throughput of the SU through jointly optimizing sensing time $\mathsf{\tau}$ and time splitter factor $\mathsf{\rho}$, subject to the constraints that the probabilities of detection and false alarm are both guaranteed and the harvested energy may supply the spectrum sensing, as follows:
where ${P}_{\mathrm{f}}$ is the upper limit of false alarm probability. We use ADO to solve Equation (12) [19]. Firstly, we fix $\mathsf{\rho}={\mathsf{\rho}}_{0}$ where ${\mathsf{\rho}}_{0}\in (0,1)$ and optimize $\mathsf{\tau}$. Then from Equation (4), since $Q\left(x\right)$ is a monotonously decreasing function, ${P}_{\mathrm{f}}$ and ${P}_{\mathrm{d}}$ have the same monotonicity in $\mathsf{\tau}$ and thus from Equation (8), ${P}_{\mathrm{f}}^{\mathrm{g}}$ increases as ${P}_{\mathrm{d}}^{\mathrm{g}}$ improves. Thus from Equation (9), $\tilde{R}$ reduces with the increasing of ${P}_{\mathrm{d}}^{\mathrm{g}}$, i.e., $\tilde{R}$ may achieve the maximum only if ${P}_{\mathrm{d}}^{\mathrm{g}}$ acquires its lower bound as ${P}_{\mathrm{d}}^{\mathrm{g}}={\overline{P}}_{\mathrm{d}}$. Then from Equations (4) and (8), ${P}_{\mathrm{f}}^{\mathrm{g}}$ is related to ${\overline{P}}_{\mathrm{d}}$ as follows:

$$\begin{array}{}\mathrm{(12a)}& \hfill {\displaystyle \underset{\mathsf{\tau},\mathsf{\rho}}{\text{max}}}& \tilde{R}(\mathsf{\tau},\mathsf{\rho})\hfill \mathrm{(12b)}& \hfill \mathrm{s}.\mathrm{t}.& {P}_{\mathrm{d}}^{\mathrm{g}}(\mathsf{\tau},\mathsf{\rho})\ge {\overline{P}}_{\mathrm{d}},{P}_{\mathrm{f}}^{\mathrm{g}}(\mathsf{\tau},\mathsf{\rho})\le {\overline{P}}_{\mathrm{f}}\hfill \mathrm{(12c)}& & N{E}_{\mathrm{h}}+{E}_{\mathrm{m}}\ge {E}_{\mathrm{s}}\hfill \mathrm{(12d)}& & 0\le \mathsf{\tau}\le \frac{T}{N}\hfill \mathrm{(12e)}& & 0\le \mathsf{\rho}\le 1\hfill \end{array}$$

$${P}_{\mathrm{f}}^{\mathrm{g}}=1-{\left(1-Q\left({Q}^{-1}\left(1-{(1-{\overline{P}}_{\mathrm{d}})}^{\frac{1}{N}}\right)(\mathsf{\gamma}+1)+\mathsf{\gamma}\sqrt{\left({\mathsf{\rho}}_{0}\mathsf{\tau}+\xi (1-{\mathsf{\rho}}_{0})\mathsf{\tau}\right){f}_{\mathrm{s}}}\right)\right)}^{N}$$

With ${P}_{\mathrm{f}}^{\mathrm{g}}\le {\overline{P}}_{\mathrm{f}}$ and ${P}_{\mathrm{d}}^{\mathrm{g}}={\overline{P}}_{\mathrm{d}}$, we have $\xi \ge P\left({H}_{0}\right){(1-{\overline{P}}_{\mathrm{f}})}^{\frac{1}{N}}+P\left({H}_{1}\right){(1-{\overline{P}}_{\mathrm{d}})}^{\frac{1}{N}}$. From Equation (13), ${P}_{\mathrm{f}}^{\mathrm{g}}$ decreases as ξ increases and thus we may optimize Equation (12) using $\xi =P\left({H}_{0}\right){(1-{\overline{P}}_{\mathrm{f}})}^{\frac{1}{N}}+P\left({H}_{1}\right){(1-{\overline{P}}_{\mathrm{d}})}^{\frac{1}{N}}$. Substituting Equation (7) into Equation (12c), it is obtained that:
where ${\mathsf{\eta}}_{0}=\mathsf{\mu}P\left({H}_{1}\right){\overline{P}}_{\mathrm{d}}{p}_{\mathrm{s}}{h}^{2}$ and ${\mathsf{\eta}}_{1}={e}_{\mathrm{s}}{f}_{\mathrm{s}}$. Then from ${P}_{\mathrm{f}}^{\mathrm{g}}\le {\overline{P}}_{\mathrm{f}}$, we get that:

$$\mathsf{\tau}\le {\mathsf{\tau}}_{\mathrm{h}}\phantom{\rule{4pt}{0ex}}\text{where}\phantom{\rule{4pt}{0ex}}{\mathsf{\tau}}_{\mathrm{h}}=\frac{{E}_{\mathrm{m}}}{N\left({\mathsf{\eta}}_{1}{\mathsf{\rho}}_{0}+(1-{\mathsf{\rho}}_{0})({\mathsf{\eta}}_{1}\xi -{\mathsf{\eta}}_{0})\right)}$$

$$\mathsf{\tau}\ge {\mathsf{\tau}}_{\mathrm{l}}\phantom{\rule{4pt}{0ex}}\text{where}\phantom{\rule{4pt}{0ex}}{\mathsf{\tau}}_{\mathrm{l}}=\frac{{({Q}^{-1}\left({\overline{P}}_{\mathrm{f}}\right)-{Q}^{-1}(1-{(1-{\overline{P}}_{\mathrm{d}})}^{\frac{1}{N}})(\mathsf{\gamma}+1))}^{2}}{{\mathsf{\gamma}}^{2}{f}_{\mathrm{s}}({\mathsf{\rho}}_{0}+\xi (1-{\mathsf{\rho}}_{0}))}$$

Substituting Equations (13) and (14) into Equation (12), with given ${\mathsf{\rho}}_{0}$, the optimization problem of $\mathsf{\tau}$ is simply rewritten as follows:
where ${\mathsf{\omega}}_{0}={Q}^{-1}\left(1-{(1-{\overline{P}}_{\mathrm{d}})}^{\frac{1}{N}}\right)(\mathsf{\gamma}+1)$, ${\mathsf{\omega}}_{1}={\mathsf{\rho}}_{0}+\xi (1-{\mathsf{\rho}}_{0})$, ${\mathsf{\phi}}_{0}=P\left({H}_{0}\right){\tilde{C}}_{0}$ and ${\mathsf{\phi}}_{1}=P\left({H}_{1}\right)(1-{\overline{P}}_{\mathrm{d}}){\tilde{C}}_{1}$. Then we express that there exists an optimal solution ${\mathsf{\tau}}_{z}\in \left(0,\frac{T}{N}\right)$ to make $\tilde{R}\left(\mathsf{\tau}\right)$ achieve the maximum. Take the first-order derivative of Equation (16a) in $\mathsf{\tau}$ as follows:

$$\begin{array}{}\mathrm{(16a)}& \hfill {\displaystyle \underset{\mathsf{\tau}}{\text{max}}}& \tilde{R}\left(\mathsf{\tau}\right)=\frac{T-N\mathsf{\tau}}{T}\left({\mathsf{\phi}}_{0}{(1-Q({\mathsf{\omega}}_{0}+\mathsf{\gamma}\sqrt{{\mathsf{\omega}}_{1}\mathsf{\tau}{f}_{s}}))}^{N}+{\mathsf{\phi}}_{1}\right)\hfill \mathrm{(16b)}& \hfill \mathrm{s}.\mathrm{t}.& {\mathsf{\tau}}_{\mathrm{l}}\le \mathsf{\tau}\le \text{min}\{\frac{T}{N},{\mathsf{\tau}}_{\mathrm{h}}\}\hfill \end{array}$$

$$\begin{array}{c}\hfill \nabla \tilde{R}\left(\mathsf{\tau}\right)=-\frac{N}{T}\left({\mathsf{\phi}}_{0}{(1-Q({\mathsf{\omega}}_{0}+\mathsf{\gamma}\sqrt{{\mathsf{\omega}}_{1}\mathsf{\tau}{f}_{\mathrm{s}}}))}^{N}+{\mathsf{\phi}}_{1}\right)+\\ \hfill \frac{N{\mathsf{\phi}}_{0}\mathsf{\gamma}(T-N\mathsf{\tau})\sqrt{{\mathsf{\omega}}_{1}{f}_{\mathrm{s}}}}{2T\sqrt{2\mathsf{\pi}\mathsf{\tau}}}{\left(1-Q({\mathsf{\omega}}_{0}+\mathsf{\gamma}\sqrt{{\mathsf{\omega}}_{1}\mathsf{\tau}{f}_{\mathrm{s}}})\right)}^{N-1}{e}^{-\frac{{({\mathsf{\omega}}_{0}+\mathsf{\gamma}\sqrt{{\mathsf{\omega}}_{1}\mathsf{\tau}{f}_{\mathrm{s}}})}^{2}}{2}}\end{array}$$

Noting $0<Q\left(x\right)<1$, we deduce the limit values from Equation (17) as follows:
which indicates that there exists a ${\mathsf{\tau}}_{z}\in \left(0,\frac{T}{N}\right)$ to make $\nabla \tilde{R}\left(\mathsf{\tau}\right)=0$. Equation (18) also means that $\nabla \tilde{R}\left(\mathsf{\tau}\right)$ increases when $\mathsf{\tau}$ approaches 0 and decreases when $\mathsf{\tau}$ approaches $\frac{T}{N}$. Hence, there is a maximum point ${\mathsf{\tau}}_{z}$ of $\tilde{R}\left(\mathsf{\tau}\right)$ within interval (0, $\frac{T}{N}$). ${\mathsf{\tau}}_{z}$ can be obtained through the Algorithm 1 based on the binary searching.

$$\left\{\begin{array}{c}\underset{\mathsf{\tau}\to 0}{\text{lim}}\nabla \tilde{R}\left(\mathsf{\tau}\right)\approx \frac{N{\mathsf{\phi}}_{0}\mathsf{\gamma}T\sqrt{{\mathsf{\omega}}_{1}{f}_{s}}}{2T\sqrt{2\mathsf{\pi}\mathsf{\tau}}}{\left(1-Q\left({\mathsf{\omega}}_{0}\right)\right)}^{N-1}{e}^{-\frac{{\mathsf{\omega}}_{0}^{2}}{2}}\to +\infty \hfill \\ \underset{\mathsf{\tau}\to \frac{T}{N}}{\text{lim}}\nabla \tilde{R}\left(\mathsf{\tau}\right)<-\frac{N}{T}\left({\mathsf{\phi}}_{0}{(1-Q\left({\mathsf{\omega}}_{0}\right))}^{N}+{\mathsf{\phi}}_{1}\right)<0\hfill \end{array}\right.$$

Algorithm 1: Searching algorithm of ${\mathsf{\tau}}_{z}\in \left(0,\frac{T}{N}\right)$ for maximizing $\tilde{R}\left(\mathsf{\tau}\right)$ |

(1) Initialize ${\mathsf{\tau}}_{\text{min}}=0$, ${\mathsf{\tau}}_{\text{max}}=\frac{T}{N}$ and estimation error $\mathsf{\delta}$; |

(2) While ($\left|{\mathsf{\tau}}_{\text{max}}-{\mathsf{\tau}}_{\text{min}}\right|>\mathsf{\delta}$) do: |

(3) Set ${\mathsf{\tau}}_{z}=\frac{{\mathsf{\tau}}_{\text{min}}+{\mathsf{\tau}}_{\text{max}}}{2}$; |

(4) If ($\nabla \tilde{R}\left({\mathsf{\tau}}_{z}\right)==\nabla \tilde{R}\left({\mathsf{\tau}}_{\text{min}}\right)$): set ${\mathsf{\tau}}_{\text{min}}={\mathsf{\tau}}_{z}$; |

(5) Else if ($\nabla \tilde{R}\left({\mathsf{\tau}}_{z}\right)==\nabla \tilde{R}\left({\mathsf{\tau}}_{\text{max}}\right)$): set ${\mathsf{\tau}}_{\text{max}}={\mathsf{\tau}}_{z}$; |

(6) End if; |

(7) End while; |

(8) Output ${\tau}_{z}=\frac{{\mathsf{\tau}}_{\text{min}}+{\mathsf{\tau}}_{\text{max}}}{2}$. |

Noting ${\mathsf{\tau}}_{\mathrm{l}}\le \mathsf{\tau}\le \text{min}\left\{\frac{T}{N},{\mathsf{\tau}}_{\mathrm{h}}\right\}$ and ${\mathsf{\tau}}_{z}<\frac{T}{N}$, we may get ${\mathsf{\tau}}_{\mathrm{l}}\le \mathsf{\tau}\le \text{min}\left\{{\mathsf{\tau}}_{\mathrm{z}},{\mathsf{\tau}}_{\mathrm{h}}\right\}$. Thus the optimal ${\mathsf{\tau}}^{*}$ to solve Equation (16) is given as follows:

$${\mathsf{\tau}}^{*}=\text{max}\left\{{\mathsf{\tau}}_{\mathrm{l}},\phantom{\rule{4pt}{0ex}}\phantom{\rule{4pt}{0ex}}\text{min}\left\{{\mathsf{\tau}}_{z},{\tau}_{\mathrm{h}}\right\}\right\}$$

Secondly, we fix ${\mathsf{\tau}}_{0}={\mathsf{\tau}}^{*}$ and optimize $\mathsf{\rho}$. From Equation (12c), with given ${\mathsf{\tau}}_{0}$, the upper limit of $\mathsf{\rho}$ is obtained as follows:

$$\mathsf{\rho}\le \frac{\frac{{E}_{\mathrm{m}}}{N{\mathsf{\tau}}_{0}}+{\mathsf{\eta}}_{0}-{\mathsf{\eta}}_{1}\xi}{{\mathsf{\eta}}_{1}(1-\xi )+{\mathsf{\eta}}_{0}}$$

As seen from Equation (13), ${P}_{\mathrm{f}}^{\mathrm{g}}$ decreases monotonously as $\mathsf{\rho}$ increases, i.e., the throughput $\tilde{R}$ may achieve the maximum only if $\mathsf{\rho}$ acquires its upper limit as $\mathsf{\rho}=\text{min}\{1,\phantom{\rule{4pt}{0ex}}\phantom{\rule{4pt}{0ex}}\frac{\frac{{E}_{\mathrm{m}}}{N{\mathsf{\tau}}_{0}}+{\mathsf{\eta}}_{0}-{\mathsf{\eta}}_{1}\xi}{{\mathsf{\eta}}_{1}(1-\xi )+{\mathsf{\eta}}_{0}}\}$. Using ADO, the joint optimal solutions $({\mathsf{\tau}}^{*},{\mathsf{\rho}}^{*})$ to Equation (12) are obtained, through iteratively and alternately optimizing $\mathsf{\tau}$ and $\mathsf{\rho}$ until both of them are convergent, as shown in Algorithm 2. Since the existent convergence of $\mathsf{\tau}$ has been expressed as above, we can also get the convergence of $\mathsf{\rho}$ that is uniquely determined by $\mathsf{\tau}$. Noting that the locally optimal value in each iteration k is non-decreasing, we can get $\tilde{R}({\mathsf{\tau}}^{(k-1)},{\mathsf{\rho}}^{(k-1)})\le \tilde{R}({\mathsf{\tau}}^{\left(k\right)},{\mathsf{\rho}}^{(k-1)})\le \tilde{R}({\mathsf{\tau}}^{\left(k\right)},{\mathsf{\rho}}^{\left(k\right)})$, which indicates that the convergence of $\tilde{R}$ can be obtained if $\mathsf{\tau}$ and $\mathsf{\rho}$ are both convergent.

Algorithm 2: Joint optimization algorithm |

(1) initialize $k=0$, ${\mathsf{\tau}}^{\left(k\right)}=0$, ${\mathsf{\rho}}^{\left(k\right)}={\mathsf{\rho}}_{0}$ where ${\mathsf{\rho}}_{0}\in (0,1)$ and estimation error $\mathsf{\delta}$; |

(2) with given ${\mathsf{\rho}}^{\left(k\right)}$, calculate ${\mathsf{\tau}}^{*}$ according to Algorithm 1 and Equation (19); |

(3) set ${\mathsf{\tau}}^{(k+1)}={\mathsf{\tau}}^{*}$; |

(4) with given ${\mathsf{\tau}}^{(k+1)}$, calculate ${\mathsf{\rho}}^{*}=\text{min}\{1,\phantom{\rule{4pt}{0ex}}\phantom{\rule{4pt}{0ex}}\frac{\frac{{E}_{\mathrm{m}}}{N{\mathsf{\tau}}^{(k+1)}}+{\mathsf{\eta}}_{0}-{\mathsf{\eta}}_{1}\mathsf{\epsilon}}{{\mathsf{\eta}}_{1}(1-\mathsf{\epsilon})+{\mathsf{\eta}}_{0}}\}$; |

(5) set ${\mathsf{\rho}}^{(k+1)}={\mathsf{\rho}}^{*}$ and $k=k-1$; |

(6) repeat (2)-(5) until both $\left|{\mathsf{\tau}}^{\left(k\right)}-{\mathsf{\tau}}^{(k-1)}\right|\le \mathsf{\delta}$ and $\left|{\mathsf{\rho}}^{\left(k\right)}-{\mathsf{\rho}}^{(k-1)}\right|\le \mathsf{\delta}$ are satisfied. |

The time complexity of the binary searching in Algorithm 1 is $O\left(log\frac{T}{N\mathsf{\delta}}\right)$ and the iterative number of the Algorithm 2 is $O\left(\frac{1}{{\mathsf{\delta}}^{2}}\right)$. Noting that the Algorithm 1 is implemented once in each iteration of Algorithm 2, the total time complexity is $O\left(\frac{1}{{\mathsf{\delta}}^{2}}log\frac{T}{N\mathsf{\delta}}\right)$. To describe the energy harvesting performance, we define the energy-harvesting efficiency as follows:
where $\u25b5R$ is the throughput increment between energy-harvesting SU and non-energy-harvesting SU.

$$\mathsf{\theta}=\frac{\u25b5R}{{E}_{\mathrm{h}}}$$

## 5. Simulations and Discussion

In the simulations, we suppose that the frame duration $T=$ 20 ms, the number of sensing slots $N=5$, the probabilities of ${H}_{0}$ and ${H}_{1}$ are $P\left({H}_{0}\right)=P\left({H}_{1}\right)=0.5$, respectively, the sampling frequency ${f}_{s}=$ 1 MHz, the channel gain h obeys the Rayleigh distribution with the mean of −10 dB, the bandwidth B = 1 KHz, the PU power ${p}_{\mathrm{s}}=$ 10 dBW, the SU power ${p}_{\text{SU}}$ = 10 dBW, the noise variance ${\mathsf{\sigma}}_{n}^{2}$ = 1 dBW, the unit sampling energy ${e}_{\mathrm{s}}$ = 0.1 mJ and the minimum spectrum sensing energy supported by the battery ${E}_{\mathrm{m}}$ = 10 mJ.

Figure 4 shows the global false alarm probability ${P}_{\mathrm{f}}^{\mathrm{g}}$ of the proposed sensing model versus the time splitter factor $\mathsf{\rho}=\{0.1,0.3,0.5,0.7\}$, with different global detection probability ${P}_{\mathrm{d}}^{\mathrm{g}}$. It is seen that ${P}_{\mathrm{f}}^{\mathrm{g}}$ and ${P}_{\mathrm{d}}^{\mathrm{g}}$ have the same monotonicity, which indicates that the spectrum access decreases as ${P}_{\mathrm{d}}^{\mathrm{g}}$ improves and the maximal throughput can be obtained if ${P}_{\mathrm{d}}^{\mathrm{g}}$ acquires its lower limit; ${P}_{\mathrm{f}}^{\mathrm{g}}$ decreases as $\mathsf{\rho}$ increases, which indicates that the maximal spectrum access can be achieved if $\mathsf{\rho}$ acquires its upper limit. Figure 5 indicates the throughput R changed with the sensing time $\mathsf{\tau}$. It is seen that there exists an optimal $\mathsf{\tau}$ that makes R achieve the maximum. When $\mathsf{\tau}$ is small, R improves as $\mathsf{\tau}$ increases, because the spectrum sensing performance mainly improves; however, when $\mathsf{\tau}$ is large, R decreases as $\mathsf{\tau}$ increases, because the data transmission time mainly decreases. Thus, there is a tradeoff between spectrum sensing and throughput.

Figure 6 shows the throughput R changed with the harvested energy ${E}_{\mathrm{h}}$ with ${P}_{\mathrm{d}}^{\mathrm{g}}=\{0.75,0.8,0.85,0.9\}$. It is seen that R decreases as ${E}_{\mathrm{h}}$ increases, because the sensing time decreases while the harvesting time increases, which yields higher false alarm probability but more harvested energy. Thus the larger throughput can be achieved if the harvested energy appropriately supplies the spectrum sensing.

Figure 7 indicates the throughput versus different spectrum sensing models: the traditional sensing-throughput tradeoff model [8] and the proposed simultaneous spectrum sensing and energy harvesting model with $\mathsf{\rho}=\{0.1,0.3,0.5\}$. It is seen that the throughput of the traditional model is larger than that of the proposed model with $\mathsf{\rho}=\{0.1,0.3\}$, because the spectrum sensing performance is very low with small $\mathsf{\rho}$ and the false alarm probability is very large; however, the throughput of the traditional model is smaller than that of the proposed model with large $\mathsf{\rho}$, because the lost transmission energy is compensated with the harvested energy while the spectrum sensing performance is guaranteed.

Figure 8 indicates the maximum throughput versus theoretic optimum and joint optimum with ${P}_{\mathrm{d}}^{\mathrm{g}}=\{0.75,0.8,0.85,0.9\}$. It is seen that the maximal throughput obtained by the joint optimization algorithm accords with the corresponding theoretical maximum.

Figure 9 shows the maximum throughput versus different spectrum sensing models: the traditional sensing-throughput tradeoff model [8] and the proposed model. It is seen that the proposed model can improve the achievable maximal throughput of the SU obviously through using the harvested energy of the PU signal to compensate the energy consumption of spectrum sensing. Figure 10 indicates the energy-harvesting efficiency $\mathsf{\theta}$ versus traditional energy-harvesting SU [15] and the proposed energy-harvesting SU, with different frame duration T. It is seen that the efficiency of the traditional SU is lower than that of the proposed SU under small T but higher under large T, because the traditional SU can only harvest energy in the transmission slot and the sensing energy consumption cannot be supplemented. Figure 11 compares the lifetime of the tradiotnal CR and the energy-harvesting CR. It is seen that the energy-harvesting CR can achieve longer life.

## 6. Conclusions

In this paper, a multislot simultaneous spectrum sensing and energy harvesting model is proposed to improve the achievable throughput of the SU through using the harvested RF energy of the PU signal to compensate the energy consumption of spectrum sensing. The sensing duration is divided into multiple sensing slots, each of which consisted of one local-sensing subslot for energy sensing and one energy-harvesting subslot for collecting the RF energy in the presence of the PU. We have formulated a joint optimization problem of sensing time and time splitter factor to maximize the average achievable throughput of the SU. From the simulations, we have concluded the following results:

- there exists an optimal sensing time that maximizes the average achievable throughput of the SU while the sensing performance is guaranteed;
- the maximal throughput of the SU can be obtained only if the detection probability acquires its lower limit and the harvested energy appropriately supplies spectrum sensing;
- the proposed model can improve the maximal throughput of the SU obviously through using the harvested energy to compensate the energy consumption of spectrum sensing.

In the future, we will apply the proposed model in cooperative spectrum sensing.

## Acknowledgments

This work was supported by the National Natural Science Foundations of China under Grant Nos. 61301131 and 91438205, the Natural Science Foundation of Jiangsu Province under Grant No. BK20140828, the Fundamental Research Funds for the Central Universities under Grant No. DUT16RC(3)045, the Chinese Postdoctoral Science Foundation under Grant No. 2015M580425, the Scientific Research General Project of Liaoning Province Eduction Commission under Grant No. L2014204.

## Author Contributions

Xin Liu and Zhenyu Na conceived and designed the communication models; Min Jia and Xuemai Gu optimized the proposed models; Xiaotong Li performed the simulations of the model; Xin Liu wrote the paper.

## Conflicts of Interest

The authors declare no conflict of interest.

## References

- Hamdaoui, B. Adaptive spectrum assessment for opportunistic access in cognitive radio networks. IEEE Trans. Wirel. Commun.
**2009**, 8, 922–930. [Google Scholar] [CrossRef] - Haykin, S. Cognitive radio: Brain-empowered wireless communications. IEEE J. Sel. Areas Commun.
**2005**, 23, 201–220. [Google Scholar] [CrossRef] - Liu, X.; Tan, X. Optimization algorithm of periodical cooperative spectrum sensing in cognitive radio. Int. J. Commun. Syst.
**2014**, 27, 705–720. [Google Scholar] [CrossRef] - Sun, H.; Nallanathan, A.; Wang, C.; Chen, Y. Wideband spectrum sensing for cognitive radio networks: A survey. IEEE Wirel. Commun.
**2013**, 20, 74–81. [Google Scholar] - Liu, X.; Bi, G.; Jia, M.; Guan, Y.L.; Zhong, W.; Lin, R. Joint optimization of sensing threshold and transmission power in wideband cognitive radio. Radio Sci.
**2013**, 48, 359–370. [Google Scholar] - Shen, J.; Liu, S.; Wang, Y.; Xie, G.; Rashvand, H.F.; Liu, Y. Robust energy detection in cognitive radio. IET Commun.
**2009**, 3, 1016–1023. [Google Scholar] [CrossRef] - Tang, L.; Chen, Y.; Hines, E.L.; Alouini, M.S. Effect of primary user traffic on sensing-throughput tradeoff for cognitive radios. IEEE Trans. Wirel. Commun.
**2011**, 10, 1063–1068. [Google Scholar] [CrossRef] - Liang, Y.; Zeng, Y.; Peh, E.C.Y.; Hoang, A.T. Sensing-throughput tradeoff for cognitive radio networks. IEEE Trans. Wirel. Commun.
**2008**, 7, 1326–1337. [Google Scholar] [CrossRef] - Liu, X. A new sensing-throughput tradeoff scheme in cooperative multiband cognitive radio network. Int. J. Netw. Manag.
**2014**, 24, 200–217. [Google Scholar] [CrossRef] - Subhankar, C.; Santi, P.M.; Tamaghna, A. Energy efficient cognitive radio system for joint spectrum sensing and data transmission. IEEE J. Emerg. Sel. Top. Circuits Syst.
**2014**, 4, 292–300. [Google Scholar] - Valenta, C.R.; Durgin, G.D. Harvesting wireless power: survey of energy-harvester conversion efficiency in farfield, wireless power transfer systems. IEEE Microw. Mag.
**2014**, 15, 108–120. [Google Scholar] - Liu, L.; Zhang, R.; Chua, K.C. Wireless information transfer with opportunistic energy harvesting. IEEE Trans. Wirel. Commun.
**2013**, 3, 345–362. [Google Scholar] - Ren, Y.; Li, M.; Chang, K. 35 GHz rectifying antenna for wireless power transmission. Electron. Lett.
**2007**, 43, 602–603. [Google Scholar] [CrossRef] - Lee, S.; Zhang, R.; Huang, K. Opportunistic wireless energy harvesting in cognitive radio networks. IEEE Trans. Wirel. Commun.
**2013**, 12, 4788–4799. [Google Scholar] [CrossRef] - Ding, T.H.; Niyato, D.; Wang, P.; Kim, D.I. Opportunistic channel access and RF energy harvesting in cognitive radio networks. IEEE J. Sel. Areas Commun.
**2014**, 32, 2039–2052. [Google Scholar] - Liu, X.; Chen, K.; Yan, J.; Na, Z.Y. Optimal energy harvesting-based weighed cooperative spectrum sensing in cognitive radio network. Mobile Netw. Appl.
**2016**, 3, 1–12. [Google Scholar] [CrossRef] - Liu, X.; Jia, M.; Gu, X.; Tan, X. Optimal periodic cooperative spectrum sensing based on weight fusion in cognitive radio networks. Sensors
**2013**, 13, 5251–5272. [Google Scholar] [CrossRef] [PubMed] - Gou, K.; Sun, L.; LI, Y.; Jia, S. Channel-aware and queue-aware joint-layer resource optimization for cognitive radio networks. Sci. China Inf. Sci.
**2010**, 53, 2576–2583. [Google Scholar] - Boyd, S.; Parikh, N.; Chu, E.; Peleato, B.; Eckstein, J. Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn.
**2011**, 3, 1–122. [Google Scholar] [CrossRef]

© 2016 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC-BY) license (http://creativecommons.org/licenses/by/4.0/).