# Channel Selection Policy in Multi-SU and Multi-PU Cognitive Radio Networks with Energy Harvesting for Internet of Everything

Authors: Feng Hu; Bing Chen; Xiangping Zhai; Chunsheng Zhu
Journal: Mobile Information Systems
 (2016)

---

## Abstract

Cognitive radio, which will become a fundamental part of theInternet of Everything (IoE), has been identified as a promising solution for the spectrum scarcity. In a multi-SU and multi-PU cognitive radio network, selecting channels is a fundamental problem due to the channel competition among secondary users (SUs) and packet collision between SUs and primary users (PUs). In this paper, we adopt cooperative sensing method to avoid the packet collision between SUs and PUs and focus on how to collect the spectrum sensing data of SUs for cooperative sensing. In order to reduce the channel competition among SUs, we first consider thehybrid transmission model for single SU where a SU can opportunistically access both idle channels operating either theOverlay or theUnderlay model and the busy channels by using the energy harvesting technology. Then we propose a competitive set based channel selection policy for multi-SU where all SUs competing for data transmission or energy harvesting in the same channel will form a competitive set. Extensive simulations show that the proposed cooperative sensing method and the channel selection policy outperform previous solutions in terms of false alarm, average throughput, average waiting time, and energy harvesting efficiency of SUs.


---

## Body

## 1. Introduction

Due to the continuous development of wireless devices and services, our environment is transforming into anInternet of Everything (IoE) [1–5]. In this IoE paradigm, where everything and everyone will be connected, the bandwidth demand for limited spectrum has been greatly increasing. The scarcity of the spectrum resources has become a serious problem. This is mainly due to the traditional static spectrum allocation policy, where a particular portion of the spectrum can be only used by licensed wireless communications systems. The impoverishment of available spectrum and the underutilization of licensed spectrum facilitate the appearance of cognitive radio (CR) technology, which has evoked much enthusiasm of many scholars, and Federal Communications Commission (FCC) approved unlicensed use of licensed spectrum through CR technology [6–9]. CR has been regarded as an efficient approach to cope up with the spectrum shortage and low utilization problems [10–12]. Therefore, the introduction of cognitive radio in IoE environment can provide on-demand spectrum access among multiple devices.Dynamic Spectrum Access (DSA) mechanism has been offered for spectrum usage. There are two major transmission models for a secondary user (SU) efficiently using idle spectrums, which areOverlay [13] andUnderlay [14], respectively. In theOverlay model, a SU can exclusively and opportunistically use the licensed spectrum only if a primary user (PU) is inactive. In other words, the SU is not allowed to access the spectrum simultaneously with the PU in order to prevent colliding with PU transmission. In contrast, even if when the PU accesses its spectrum, a SU may coexist with it as long as the interference caused to the PU by this SU does not degrade its communication quality in theUnderlay model. However, when the PU state changes to be inactive, the transmission power of the SU will be still below theinterference threshold constraint in theUnderlay model. Therefore, the idle spectrum resources are not fully utilized, and the SU does not achieve optimal performance. On the other hand, when the licensed channels are very busy, the time that SU must wait for an available channel is too long, and then it may also significantly reduce the performance ofOverlay model [15]. Therefore, we need to find ahybrid transmission model where the advantages of bothOverlay andUnderlay models are combined for the PU state variability, so that the performance of SUs can be maximized.Thehybrid transmission model has recently been proposed in [16–18]. In [16], the SU can exchange control information in theUnderlay model and transmit data information in theOverlay model. However, the decision of accessing a model is not based on the sensing results. In [17, 18], the SU can constantly sense the activity of PUs and transmit data information in theOverlay model when the PU transmission is not detected. Otherwise, the SU reduces its transmission power to access the spectrum in theUnderlay model. However, these papers did not take into account the sensing errors and neglected the effect of PU retransmission on the SU QoS. Although these related works indicated that the SU can obtain more spectrum access opportunities in thehybrid transmission model compared with the two conventional transmission models, the issue of two or more SUs competing for the same channel has rarely been studied so far to the best of our knowledge. Furthermore, the packet collision probability between SUs and a PU will increase in the multiple SUs scenario [19]. Thus, due to the importance of the collision avoidance in a CR network with multiple SUs and multiple PU channels, we need to propose a channel selection policy in thehybrid transmission model to address the collision issue.Energy supply is always a critical issue in wireless communications. In a multi-SU and multi-PU CR network where multiple SUs access multiple PU channels in thehybrid transmission model, the SU needs to spend more energy to constantly detect many channels and switch among multiple channels. Therefore, energy efficiency is another important criterion in the CR network along with spectrum efficiency [20, 21]. Furthermore, the cost of replacing the battery is often expensive. Recently, some energy harvesting techniques have been introduced in [22–24]. Such techniques allow devices to harvest natural sources’ energy such as sun, wind, acoustic, and ambient radio frequency (RF) waves. Converting electromagnetic waves from ambient RF waves into energy is considered to be more suitable and stable for the low energy devices in sensor networks or CR networks compared with other sources [24]. Assuming that a SU is equipped with the RF energy harvesting capability, it must not only select an idle channel to transmit data but also a busy channel to harvest RF energy to obtain enough energy and spectrum usage opportunity. Hence, a suitable channel selection policy is very important to improve both the spectrum efficiency and the energy efficiency in CR networks.Inspired by the inherent benefits of the above schemes, in this paper, we focus on the channel competition among SUs and packet collision between SUs and PUs in multi-SU and multi-PU CR networks. Apart from the existing works, such as adopting the conventional noncooperative spectrum sensing method in the multi-SU CR network [25], and allowing SUs to access idle channels in theOverlay orUnderlay model [14], there is no effective solution to the packet competition among multiple SUs and PUs [26]. We adopt the cooperative sensing method and the concept of competitive set to solve these two problems so that the spectrum sensing accuracy and the throughput of multiple SUs can be improved. It is noted that, in our study, SUs can harvest RF energy from busy channels by using the energy harvesting technology so as to extend their battery life.The main contributions of this paper are as follows:(i)
We use the cooperative sensing method to avoid the packet collision between SUs and PUs. In channel sensing phase, the SUs that detect the same channel exchange the channel usage information with each other and make a more accurate decision on the state of this channel. Moreover, the packet collision between SUs and PUs can significantly decrease, since the cooperative sensing method can detect the activity of PUs reoccupy their channels with a large probability.(ii)
We propose ahybrid transmission model combiningOverlay andUnderlay models to fully utilize the available idle spectrum. Each SU can opportunistically access the unoccupied PU channel or underlay part of its signal into the portion of the channel occupied by the PU depending on the data queue state and sensing result or decide whether or not to access a busy channel to harvest RF energy given its energy queue. Extensive simulations show that our proposedhybrid transmission model can improve the efficiency of spectrum usage and the energy harvesting efficiency of SUs.(iii)
With the aim of eliminating the channel competition among SUs and reducing their average waiting time and also decreasing their spectrum handoff delay, we propose a competitive set based channel selection policy. In our proposed policy, the SUs who form a competitive set in the same channel randomly obtain integer labels fromzero. The SU who obtains thezero label has the right to use this channel. In particular, several SUs can obtain multiple labels in different competitive sets. Therefore, the average waiting time that SUs spend on switching to other idle channels or still staying on this channel for data transmission or accessing a busy channel for energy harvesting is lower compared with the random selection policy. Simulation results show that the proposed channel selection policy is simple and effective on reducing the collisions among SUs.The rest of this paper is organized as follows. The system model is described in Section2, and the cooperative spectrum sensing method is given in Section 3. In Section 4, we present thehybrid transmission model and channel selection policy and then analyze the performance in terms of average throughput, average waiting time, and energy harvesting efficiency of SUs’ three aspects. The simulation results are listed in Section 5. Finally, we conclude our work in Section 6.


## 2. System Model

### 2.1. Multi-SU and Multi-PU CR Networks

We consider a multi-SU and multi-PU CR network withM PUs and N pairs of SU, as depicted in Figure 1, where each PU is allocated a licensed channel (which we call “PU channel”). Similar to [13–15], the traffic of each channel is modeled as a two-state continuous-time Markov process: the spectrum is occupied by the PU (busy state) and the spectrum is not occupied by the PU (idle state). For the PUs, these two states are referred to as ON and OFF states, respectively. Each SU transmitter and its corresponding SU receiver are within each other’s transmission range. Therefore, the existence of a communication between two SUs depends not only on the distance between them, but also on the time-varying activities of the PUs. As illustrated in Figure 1, we consider the scenario that several SUs may access the same channel, and one SU may have more than one channel for selection.Figure 1
A scenario of the multi-SU and multi-PU CR network.As these PUs are in the interference range of some SUs, the channel power gains from the PU transmitter to the PU receiver, SU transmitter to the SU receiver, PU transmitter to the SU receiver, and SU transmitter to the PU receiver are denoted byGpp, Gss, Gps, and Gsp, respectively. We employ the model Gij=kdij-α for the channel gain between the ith transmitter and the jth receiver, where k is an attenuation factor that represents power variation caused by path loss, dij denotes the distance between them, and α is the path loss [27]. We assume that the channel power gains and the channel state information (CSI) are known to each SU, and SUs can obtain the channel availability after spectrum sensing.


### 2.2. Energy Harvesting Technology

RF energy signal can not only propagate over a distance but also broadcast in all directions [22]. However, due to the uncertainty of location, fading, and environmental conditions, the energy supplied from RF energy may not guarantee QoS in wireless applications. To ensure the static and stable energy, the RF energy signal is transformed to a DC voltage and then stored into a rechargeable battery [23]. It is reasonable to define the effective zone of the energy harvesting, since the propagation energy drops off rapidly with the distance increases. We assume that each SU can only obtain the RF energy signal from the channels that it can sense. Each SU can harvest RF energy from the busy channels occupied by PUs and store the energy in a rechargeable battery when its transmitter is equipped with an energy harvesting device, and the maximum size of battery is Emax. In this paper, the rechargeable battery is modeled by an ideal linear model [28], where the changes in the energy stored are linearly related to the amounts of energy harvested or spent. Since the increased energy harvested from PU channels can be utilized for channel sensing and data transmission, the working time of SUs will be extended.


## 2.1. Multi-SU and Multi-PU CR Networks

We consider a multi-SU and multi-PU CR network withM PUs and N pairs of SU, as depicted in Figure 1, where each PU is allocated a licensed channel (which we call “PU channel”). Similar to [13–15], the traffic of each channel is modeled as a two-state continuous-time Markov process: the spectrum is occupied by the PU (busy state) and the spectrum is not occupied by the PU (idle state). For the PUs, these two states are referred to as ON and OFF states, respectively. Each SU transmitter and its corresponding SU receiver are within each other’s transmission range. Therefore, the existence of a communication between two SUs depends not only on the distance between them, but also on the time-varying activities of the PUs. As illustrated in Figure 1, we consider the scenario that several SUs may access the same channel, and one SU may have more than one channel for selection.Figure 1
A scenario of the multi-SU and multi-PU CR network.As these PUs are in the interference range of some SUs, the channel power gains from the PU transmitter to the PU receiver, SU transmitter to the SU receiver, PU transmitter to the SU receiver, and SU transmitter to the PU receiver are denoted byGpp, Gss, Gps, and Gsp, respectively. We employ the model Gij=kdij-α for the channel gain between the ith transmitter and the jth receiver, where k is an attenuation factor that represents power variation caused by path loss, dij denotes the distance between them, and α is the path loss [27]. We assume that the channel power gains and the channel state information (CSI) are known to each SU, and SUs can obtain the channel availability after spectrum sensing.


## 2.2. Energy Harvesting Technology

RF energy signal can not only propagate over a distance but also broadcast in all directions [22]. However, due to the uncertainty of location, fading, and environmental conditions, the energy supplied from RF energy may not guarantee QoS in wireless applications. To ensure the static and stable energy, the RF energy signal is transformed to a DC voltage and then stored into a rechargeable battery [23]. It is reasonable to define the effective zone of the energy harvesting, since the propagation energy drops off rapidly with the distance increases. We assume that each SU can only obtain the RF energy signal from the channels that it can sense. Each SU can harvest RF energy from the busy channels occupied by PUs and store the energy in a rechargeable battery when its transmitter is equipped with an energy harvesting device, and the maximum size of battery is Emax. In this paper, the rechargeable battery is modeled by an ideal linear model [28], where the changes in the energy stored are linearly related to the amounts of energy harvested or spent. Since the increased energy harvested from PU channels can be utilized for channel sensing and data transmission, the working time of SUs will be extended.


## 3. Cooperative Spectrum Sensing

Spectrum sensing is the basis of the DSA mechanism. Furthermore, sensing errors will affect the performance of SUs transmission and cause packet collision between SUs and PUs. In this section, we describe our cooperative spectrum sensing method.


### 3.1. Energy Based Spectrum Sensing

Spectrum sensing has to be performed before data transmission to detect the channel availability. Many signal techniques have been used for the SUs to sense the activity of the PUs [13]. The energy detection method not only implements simply but also represents intuitively the proportion of the busy channels. Therefore, the energy detection method is accurate and optimal when the SUs have little or no prior knowledge of the PU signal [29], and we consider it as the spectrum sensing algorithm in our proposed policy. The aim of spectrum sensing is to sense the existence of signal in licensed spectrum. Thus, under the two hypotheses, the signal can be expressed as(1)H0:xt=nt,H1:xt=st+nt,where nt is an Additive White Gaussian Noise (AWGN) and st is the signal of PU in target channel. H0 and H1 are the two hypotheses of nonexistence or existence of st. From [30], we have known that the probability of detection can be denoted by Pd with a fixed SNR γ in an AWGN channel, and it can be written as(2)Pdγ,τ,λ=Qλσ2-γ-1τfs2γ+1,where τ is the sensing duration, λ is the sensing threshold, fs is the sampling frequency, σ2 is the variance of the AWGN, and Qx is the tail probability of the normal distribution. Under imperfect sensing, there are two types of sensing errors:miss detection andfalse alarm. Afalse alarm error occurs when the SU observes the channel is busy whereas it is actually idle, and amiss detection error occurs when the SU observes the channel is idle whereas it is actually busy. Hence, thefalse alarm indicates the waste of spectrum access opportunity, whereas themiss detection imposes on the potential interference to PUs. Thefalse alarm probability Pf andmiss detection probability Pm can be expressed as [31](3)Pfτ,λ=Qλσ2-1τfs,Pmγ,τ,λ=1-Qλ/σ2-1+γ1+γ2/τfs,where Pf and Pm are related to the threshold λ and the sensing time τ. Furthermore, Pm is also a function of SNR.


### 3.2. Cooperative Spectrum Sensing

Due to the effects of multipath fading, inside buildings with high penetration loss and local interference, the probability ofmiss detection andfalse alarm will be increased under the conventional noncooperative spectrum sensing method. This phenomenon will lead to packet collision between SUs and PUs in multi-SU and multi-PU CR networks. In order to deal with this problem, cooperative spectrum sensing has been adopted in some studies [15, 17, 23]. We focus on how to collect the spectrum sensing data of SUs for cooperative sensing and combine these sensing results to produce the final decision in this paper.As illustrated in Figure2, we suppose the multi-SU and multi-PU CR network with time slotted (TS), that is, one TS consists of two phases, which are the channel sensing phase (CS) and the data transmission (DT) or energy harvesting (EH) phase, respectively. In the first phase, SUs sense the PU channels to detect the activity of the PUs and exchange the channel usage information with other SUs. Then, each SU will combine its sensing results with others’. At last, two or more of the same results are considered to be the final decision of this channel. In particular, the channel will be redetected until a decision is made when a channel is detected by four SUs, and two of them believe that the channel is idle while the other two are just the opposite. The sensing result is considered to be the final decision when a channel is only detected by one SU. In the next phase, the SU executes RF energy harvesting or data transmission based on the final decision. Similar to [32, 33], we suppose that sensing duration is small, compared with the PU channel traffic state cycle, so that the PU channel traffic state can be considered unchanged during sensing phases.Figure 2
An intuitional illustration of the time-slot structure.


## 3.1. Energy Based Spectrum Sensing

Spectrum sensing has to be performed before data transmission to detect the channel availability. Many signal techniques have been used for the SUs to sense the activity of the PUs [13]. The energy detection method not only implements simply but also represents intuitively the proportion of the busy channels. Therefore, the energy detection method is accurate and optimal when the SUs have little or no prior knowledge of the PU signal [29], and we consider it as the spectrum sensing algorithm in our proposed policy. The aim of spectrum sensing is to sense the existence of signal in licensed spectrum. Thus, under the two hypotheses, the signal can be expressed as(1)H0:xt=nt,H1:xt=st+nt,where nt is an Additive White Gaussian Noise (AWGN) and st is the signal of PU in target channel. H0 and H1 are the two hypotheses of nonexistence or existence of st. From [30], we have known that the probability of detection can be denoted by Pd with a fixed SNR γ in an AWGN channel, and it can be written as(2)Pdγ,τ,λ=Qλσ2-γ-1τfs2γ+1,where τ is the sensing duration, λ is the sensing threshold, fs is the sampling frequency, σ2 is the variance of the AWGN, and Qx is the tail probability of the normal distribution. Under imperfect sensing, there are two types of sensing errors:miss detection andfalse alarm. Afalse alarm error occurs when the SU observes the channel is busy whereas it is actually idle, and amiss detection error occurs when the SU observes the channel is idle whereas it is actually busy. Hence, thefalse alarm indicates the waste of spectrum access opportunity, whereas themiss detection imposes on the potential interference to PUs. Thefalse alarm probability Pf andmiss detection probability Pm can be expressed as [31](3)Pfτ,λ=Qλσ2-1τfs,Pmγ,τ,λ=1-Qλ/σ2-1+γ1+γ2/τfs,where Pf and Pm are related to the threshold λ and the sensing time τ. Furthermore, Pm is also a function of SNR.


## 3.2. Cooperative Spectrum Sensing

Due to the effects of multipath fading, inside buildings with high penetration loss and local interference, the probability ofmiss detection andfalse alarm will be increased under the conventional noncooperative spectrum sensing method. This phenomenon will lead to packet collision between SUs and PUs in multi-SU and multi-PU CR networks. In order to deal with this problem, cooperative spectrum sensing has been adopted in some studies [15, 17, 23]. We focus on how to collect the spectrum sensing data of SUs for cooperative sensing and combine these sensing results to produce the final decision in this paper.As illustrated in Figure2, we suppose the multi-SU and multi-PU CR network with time slotted (TS), that is, one TS consists of two phases, which are the channel sensing phase (CS) and the data transmission (DT) or energy harvesting (EH) phase, respectively. In the first phase, SUs sense the PU channels to detect the activity of the PUs and exchange the channel usage information with other SUs. Then, each SU will combine its sensing results with others’. At last, two or more of the same results are considered to be the final decision of this channel. In particular, the channel will be redetected until a decision is made when a channel is detected by four SUs, and two of them believe that the channel is idle while the other two are just the opposite. The sensing result is considered to be the final decision when a channel is only detected by one SU. In the next phase, the SU executes RF energy harvesting or data transmission based on the final decision. Similar to [32, 33], we suppose that sensing duration is small, compared with the PU channel traffic state cycle, so that the PU channel traffic state can be considered unchanged during sensing phases.Figure 2
An intuitional illustration of the time-slot structure.


## 4. Channel Selection Policy

In this section, we first propose ahybrid transmission model for single SU and secondly present a channel selection policy for multi-SU based on the competitive set to alleviate the channel competition among SUs.


### 4.1. Hybrid Transmission Model

As shown in Figure3, the arriving data is buffered in the data queue of the SU transmitter, QDi, i=1,2,3,…,N. The maximum capacity of the data queue is Qmax. As mentioned before, the RF energy is stored in the energy queue, QEi, i=1,2,3,…,N, whose maximum size is denoted as Emax.Figure 3
An illustration of thehybrid transmission model.At the beginning, when the data arrives atith SU transmitter, its data queue and energy queue can be represented as QDi≠⌀, QEi=Emax; then the SU can perform data transmission when idle channels are sensed. Let Es be the sensing outcome of ith SU, and we define λO and λU be theOverlay and theUnderlay model energy threshold, respectively. If the channel signal energy is sensed below theOverlay model energy threshold, that is, Es<λO, the SU will transmit data with a higher power from its data queue in theOverlay model. However, if the channel signal energy is above theOverlay model energy threshold but below theUnderlay model energy threshold, that is, λO<Es<λU, it means that the PU does not fully occupy this channel, and the SU can access it with PU at the same time by reducing its transmission power as long as it does not interfere in the PU transmission, that is,Underlay transmission model.To make use of thehybrid transmission model, each SU transmitter is assumed to have perfect knowledge of the CSI. For different channels, their capacity and utilization rate are different. Based on the sensing result of channels, each SU calculates the statisticalOverlay andUnderlay model energy threshold and updates them according to the two types of sensing errors, that is,miss detection andfalse alarm. When the data arrives at a SU transmitter, it compares the current channel sensing results with the knowledge of CSI to obtain the occupancy of PU. The SU estimates the power of the PU based on the transmission distance and antenna gain when the PU does not fully occupy this channel [34]. For theOverlay model, there is no limitation on the transmit power of SUs, and they can transmit data with the initial power. Nevertheless, due to the interference caused by SU towards PU, the SUs need to decrease the transmit power, change the modulation type, and adjust the encoded mode to afford a suitable SNR to accommodate the variation of current channel in theUnderlay model.When the data queue ofith SU is empty and its energy is used in the previous time-slot, that is, QDi=⌀, QEi≠Emax, the SU can harvest RF energy from busy channels for increasing energy reserves. Hence, if a channel is sensed above theUnderlay model energy threshold, the SU may implement energy harvesting from it.In our proposedhybrid transmission model, each SU can determine to implement either the data transmission or the energy harvesting depending on the state of data queue and energy queue. Based on the spectrum sensing results andOverlay/Underlay model energy thresholds, each SU can not only access a channel alone or with the PU simultaneously for data transmission but also harvest the RF energy from the PU occupied channels. The SU decides whether or not to stay in the current channel or switch to a new channel for data transmission or a busy channel for energy harvesting after sensing channels in the next CS phase. The process of selecting the transmission models for each SU is presented in Figure 4.Figure 4
An illustration of the process of selecting the transmission models for each SU.


### 4.2. Overview of Channel Selection Policy

As the mentionedhybrid transmission model, each SU can implement either the data transmission in an idle channel or the energy harvesting from a busy channel. However, for the multi-SU and multi-PU CR network, one of the great challenges of implementing multi-SU channel access successfully is the problem of competition among SUs. We explain the details of the proposed channel selection policy.


#### 4.2.1. Channel Selection Policy for Data Transmission

The SU transmitter sends a RTS packet on the channel to its corresponding SU receiver if an idle channel is detected. Then the SU receiver replies with a CTS packet in the same channel. Notice that the RTS/CTS collision may occur when more than one pair of SUs contends the same target idle channel for data transmissions. Hence, different from the conventional way, the SU pair does not access the idle channel immediately when the CTS packet is successfully received by the SU transmitter. Those SUs who receive CTS packet form a competitive set,SIi, i=1,2,3,…,M, which means that these SUs are competing to access this PU channel. Supposing that the size of SIi isW, we randomly assign them integer labels fromzero to W-1. The SU who obtains thezero label can transmit data in the DT phase. In particular, for the SUs who can sense more than one channel, they can compete for multiple idle channels and obtain multiple labels when the data arrives at their data queue. Furthermore, the SU can access the corresponding channel for data transmission as long as it can obtain thezero label in one competitive set. Similarly, when the channel can only be accessed in theUnderlay model for data transmission, those SUs who receive the CTS packet will form a competitive set, SUi, i=1,2,3,…,M.The SU that transmits data in the previous time-slot will keep data transmission until the channel state is changed when the sensing outcome of the current channel isEs<λO in the next CS phase. All the label values of other SUs are in the same competitive set minus one when the SU withdraws from the current channel. Therefore, the SU whose label value is subtracted to bezero can access this channel. If the present channel is detected satisfy λO<Es<λU in the next CS phase; that is, the PU is not completely occupied in this channel for data transmission, the SU reduces its transmission power to satisfy the interference power constraint of PU that it can continue to transmit data in theUnderlay model, and their corresponding competitive sets will remain in use. However, the transmission of SU will cause interference to the communication of PU if the Es>λU. Then the data transmission of SU will be stopped in the next DT phase, and the competitive set of this channel will be dissolved. The algorithm of our channel selection strategy for data transmission is presented in Algorithm 1.Algorithm 1:The channel selection policy for data transmission.
Input: All PUs channels, ln, n∈1,N, including lm idle channels, m∈1,M, and p SUs, p∈1,P. Output: Channel selection for SUs (1) begin (2)   /∗ For lm idle channels /∗ (3)   if  the data queue of SUs, QDp≠⌀  then (4)     if  lm≥1  then (5)      if  theqSUs receive CTS packet successfully  then (6)        The q SUs form a number of competitive sets, SIi, i=1,…,m; (7)        Randomly assigning them integer labels from zero to w-1, w≤q; (8)        for  erery competitive sets, SIi  do (9)          The SU who obtains the zero label can access the corresponding channel for data transmission, and withdraw from other competitive sets; (10)          Label values of other SUs minus one; (11)        end (12)      end (13)     end (14)     if  lm=0  then (15)       if  thesSUs receive CTS packet successfully  then (16)         if  thetSUs transmit the data in the Underlay model, and their throughput can be satisfied  then (17)          The t SUs form a number of competitive sets, SUi, i=1,…,n; (18)          Randomly assigning them integer labels from zero to v-1, v≤t; (19)          for  erery competitive sets, SUi  do (20)           The SU who obtains the zero label can reduce its transmitting power and access the corresponding channel for data transmission, and then withdraw from other competitive sets; (21)           Label values of other SUs minus one; (22)          end (23)         end (24)       end (25)     end (26)   end (27) endWe illustrate the process of randomly assigning integer labels by Figure5. First, four SUs need to access channels for data transmission, and they sense the current channel availability to obtain a list of available channels. Secondly, the SUs who compete for the same channel form a competitive set; that is, the SUs 1,2,3 can use the channel A. We randomly assign integer labels fromzero for these SUs. Thirdly, the SUs who obtain thezero label can access the channels, and they withdraw from the corresponding competitive sets while the label values of other SUs are minus one. In particular, the SU 2 can use channels A or B. In the next time-slot, the SU 4 can access the channel B.Figure 5
An example of randomly assigning integer labels.


#### 4.2.2. Channel Selection Policy for Energy Harvesting

The SUs that contend for the same target busy channel form a competitive set,SEj, j=1,2,3,…,M, which means that these SUs are competing to access the jth PU channel for energy harvesting. We also assign them integer labels, and the SU that obtains thezero label can harvest energy in the next EH phase. Then these SUs withdraw from the competition sets when the data arrives at the data queue of SUs or their energy queue is full. The algorithm of our channel selection policy for energy harvesting is given in Algorithm 2.Algorithm 2:The channel selection policy for energy harvesting.
Input: All PUs channels, ln, n∈1,N, including lm idle channels, m∈1,M, and p SUs, p∈1,P. Output: Channel selection for SUs (1) begin (2)   /∗ For ln-m busy channels /∗ (3)   if  the data queue of SUs, QDp=⌀  then (4)     if  the energy queue of SUs, QDp′≠Qmax  then (5)       The p′ SUs form a number of competitive sets, SEi, i=1,…,n; (6)       Randomly assigning them integer labels from zero to u-1, u≤p′; (7)       for  erery competitive sets, SEi  do (8)         The SU who obtains the zero laber can access the corresponding busy channel for energy harvesting in the next EH phase, and withdraw from other competitive sets; (9)         Label values of other SUs minus one; (10)       end (11)     end (12)   end (13) endIn the proposed channel selection policy, the SU receiver sends a Decode packet to its transmitter when the current transmission is complete; that is, the data has been accepted successfully. The Channel-Switching (CSW) flag is set when the SU needs to switch to another channel, and then the SU transmitter and receiver pause their current transmission and perform channel handoff [35, 36].Note that the CSMA/CA protocol also uses the RTS/CTS handshake procedures to ensure that the collision does not occur among users and utilizes the exponential-backoff algorithm to decompose collision; that is, each node performs a random delayt when the collision happens, and t obeys the T(0~T) on the bottom of the exponential distribution. In our proposed channel selection policy, we ensure the usage of idle channels through establishing the competitive sets and randomly assigning the integer labels when the collision occurs. Moreover, in order to reduce the average waiting time of SUs, the SUs who access channels withdraw from their competitive sets while other SUs’ label values are minus one.


### 4.3. Performance Analysis of the Channel Selection Policy

In this section, we intend to illustrate the spectrum usage performance of our proposed policy in terms of average throughput, average waiting time, and energy harvesting efficiency of SUs’ three aspects.


#### 4.3.1. Average Throughput of SUs

In our proposed channel selection policy, SU can transmit data in theOverlay orUnderlay model. The service rate of each SU in thehybrid model is described as Rh=Ro+Ru, and Ro can be denoted by Ro0, Ro1, Ro0′, and Ro1′ in theOverlay model [37](4)Ro0=Blog2⁡1+gsPso,Ro1=0,Ro0′=Blog2⁡1+gsPsogpPp+1,Ro1′=0,where Ro0 represents that the PU does not occupy the channel. In contrast, Ro1 represents that the spectrum is being occupied by PU. Ro0′ and Ro1′ are the service rate of each SU underfalse alarm andmiss detection, respectively. Similarly, the Ru can be denoted by Ru0, Ru1 in theUnderlay model(5)Ru0=Blog2⁡1+gsPsu,Ru1=Blog2⁡1+gsPsugpPp+1.The throughput of SU can be described in terms of the outage as [38](6)T=1-pout,where pout is the outage probability. The throughput in channel selection policy, Th, is comprised of To and Tu, respectively. To is given by(7)To=pi1-pf1-pouto+1-pipf1-pouto′,where pi is the channel idle probability. Since the SU transmission will cause interference to PU Underfalse alarm, pouto and pouto′ can be described as(8)pouto=Pr⁡Ro0<Rs,pouto′=Pr⁡Ro0′<Rs,where Rs is the required service rate of SU. Correspondingly, we can obtain Tu, poutu, and poutu′ as follows:(9)Tu=pi1-pf1-poutu+1-pipf1-poutu′,poutu=Pr⁡Ru0<Rs,poutu′=Pr⁡Ru1<Rs.


#### 4.3.2. Average Waiting Time of SUs

Here, we calculate the time elapsed between each SU which receives the RTS signal and implements data transmission, and this elapsed time can reflect the performance of the competitive set. The average waiting time of SUs will be longer than the conventional random access policy if the design of the competitive set is not reasonable. Thus, the average waiting time of SUs,Tw, can be described as(10)Tw=Tt-TRTS,where Tt and TRTS are the time-slots that the SU transmits data to and receives the RTS signal from, respectively.


#### 4.3.3. Energy Harvesting Efficiency

We useeh to express the packets of energy that can be harvested by SUs from busy channels, and it follows Poisson distribution. The energy consumed by SU for data transmission and spectrum sensing are et and es, respectively. We assume that ec represents another energy consumption on circuit and ert denotes the residual energy at the time-slot t. Therefore, the energy harvesting efficiency is described in terms of the residual energy in the next time-slot(11)ert+1=min⁡ert+eh-et+es+ec,Emax.


## 4.1. Hybrid Transmission Model

As shown in Figure3, the arriving data is buffered in the data queue of the SU transmitter, QDi, i=1,2,3,…,N. The maximum capacity of the data queue is Qmax. As mentioned before, the RF energy is stored in the energy queue, QEi, i=1,2,3,…,N, whose maximum size is denoted as Emax.Figure 3
An illustration of thehybrid transmission model.At the beginning, when the data arrives atith SU transmitter, its data queue and energy queue can be represented as QDi≠⌀, QEi=Emax; then the SU can perform data transmission when idle channels are sensed. Let Es be the sensing outcome of ith SU, and we define λO and λU be theOverlay and theUnderlay model energy threshold, respectively. If the channel signal energy is sensed below theOverlay model energy threshold, that is, Es<λO, the SU will transmit data with a higher power from its data queue in theOverlay model. However, if the channel signal energy is above theOverlay model energy threshold but below theUnderlay model energy threshold, that is, λO<Es<λU, it means that the PU does not fully occupy this channel, and the SU can access it with PU at the same time by reducing its transmission power as long as it does not interfere in the PU transmission, that is,Underlay transmission model.To make use of thehybrid transmission model, each SU transmitter is assumed to have perfect knowledge of the CSI. For different channels, their capacity and utilization rate are different. Based on the sensing result of channels, each SU calculates the statisticalOverlay andUnderlay model energy threshold and updates them according to the two types of sensing errors, that is,miss detection andfalse alarm. When the data arrives at a SU transmitter, it compares the current channel sensing results with the knowledge of CSI to obtain the occupancy of PU. The SU estimates the power of the PU based on the transmission distance and antenna gain when the PU does not fully occupy this channel [34]. For theOverlay model, there is no limitation on the transmit power of SUs, and they can transmit data with the initial power. Nevertheless, due to the interference caused by SU towards PU, the SUs need to decrease the transmit power, change the modulation type, and adjust the encoded mode to afford a suitable SNR to accommodate the variation of current channel in theUnderlay model.When the data queue ofith SU is empty and its energy is used in the previous time-slot, that is, QDi=⌀, QEi≠Emax, the SU can harvest RF energy from busy channels for increasing energy reserves. Hence, if a channel is sensed above theUnderlay model energy threshold, the SU may implement energy harvesting from it.In our proposedhybrid transmission model, each SU can determine to implement either the data transmission or the energy harvesting depending on the state of data queue and energy queue. Based on the spectrum sensing results andOverlay/Underlay model energy thresholds, each SU can not only access a channel alone or with the PU simultaneously for data transmission but also harvest the RF energy from the PU occupied channels. The SU decides whether or not to stay in the current channel or switch to a new channel for data transmission or a busy channel for energy harvesting after sensing channels in the next CS phase. The process of selecting the transmission models for each SU is presented in Figure 4.Figure 4
An illustration of the process of selecting the transmission models for each SU.


## 4.2. Overview of Channel Selection Policy

As the mentionedhybrid transmission model, each SU can implement either the data transmission in an idle channel or the energy harvesting from a busy channel. However, for the multi-SU and multi-PU CR network, one of the great challenges of implementing multi-SU channel access successfully is the problem of competition among SUs. We explain the details of the proposed channel selection policy.


### 4.2.1. Channel Selection Policy for Data Transmission

The SU transmitter sends a RTS packet on the channel to its corresponding SU receiver if an idle channel is detected. Then the SU receiver replies with a CTS packet in the same channel. Notice that the RTS/CTS collision may occur when more than one pair of SUs contends the same target idle channel for data transmissions. Hence, different from the conventional way, the SU pair does not access the idle channel immediately when the CTS packet is successfully received by the SU transmitter. Those SUs who receive CTS packet form a competitive set,SIi, i=1,2,3,…,M, which means that these SUs are competing to access this PU channel. Supposing that the size of SIi isW, we randomly assign them integer labels fromzero to W-1. The SU who obtains thezero label can transmit data in the DT phase. In particular, for the SUs who can sense more than one channel, they can compete for multiple idle channels and obtain multiple labels when the data arrives at their data queue. Furthermore, the SU can access the corresponding channel for data transmission as long as it can obtain thezero label in one competitive set. Similarly, when the channel can only be accessed in theUnderlay model for data transmission, those SUs who receive the CTS packet will form a competitive set, SUi, i=1,2,3,…,M.The SU that transmits data in the previous time-slot will keep data transmission until the channel state is changed when the sensing outcome of the current channel isEs<λO in the next CS phase. All the label values of other SUs are in the same competitive set minus one when the SU withdraws from the current channel. Therefore, the SU whose label value is subtracted to bezero can access this channel. If the present channel is detected satisfy λO<Es<λU in the next CS phase; that is, the PU is not completely occupied in this channel for data transmission, the SU reduces its transmission power to satisfy the interference power constraint of PU that it can continue to transmit data in theUnderlay model, and their corresponding competitive sets will remain in use. However, the transmission of SU will cause interference to the communication of PU if the Es>λU. Then the data transmission of SU will be stopped in the next DT phase, and the competitive set of this channel will be dissolved. The algorithm of our channel selection strategy for data transmission is presented in Algorithm 1.Algorithm 1:The channel selection policy for data transmission.
Input: All PUs channels, ln, n∈1,N, including lm idle channels, m∈1,M, and p SUs, p∈1,P. Output: Channel selection for SUs (1) begin (2)   /∗ For lm idle channels /∗ (3)   if  the data queue of SUs, QDp≠⌀  then (4)     if  lm≥1  then (5)      if  theqSUs receive CTS packet successfully  then (6)        The q SUs form a number of competitive sets, SIi, i=1,…,m; (7)        Randomly assigning them integer labels from zero to w-1, w≤q; (8)        for  erery competitive sets, SIi  do (9)          The SU who obtains the zero label can access the corresponding channel for data transmission, and withdraw from other competitive sets; (10)          Label values of other SUs minus one; (11)        end (12)      end (13)     end (14)     if  lm=0  then (15)       if  thesSUs receive CTS packet successfully  then (16)         if  thetSUs transmit the data in the Underlay model, and their throughput can be satisfied  then (17)          The t SUs form a number of competitive sets, SUi, i=1,…,n; (18)          Randomly assigning them integer labels from zero to v-1, v≤t; (19)          for  erery competitive sets, SUi  do (20)           The SU who obtains the zero label can reduce its transmitting power and access the corresponding channel for data transmission, and then withdraw from other competitive sets; (21)           Label values of other SUs minus one; (22)          end (23)         end (24)       end (25)     end (26)   end (27) endWe illustrate the process of randomly assigning integer labels by Figure5. First, four SUs need to access channels for data transmission, and they sense the current channel availability to obtain a list of available channels. Secondly, the SUs who compete for the same channel form a competitive set; that is, the SUs 1,2,3 can use the channel A. We randomly assign integer labels fromzero for these SUs. Thirdly, the SUs who obtain thezero label can access the channels, and they withdraw from the corresponding competitive sets while the label values of other SUs are minus one. In particular, the SU 2 can use channels A or B. In the next time-slot, the SU 4 can access the channel B.Figure 5
An example of randomly assigning integer labels.


### 4.2.2. Channel Selection Policy for Energy Harvesting

The SUs that contend for the same target busy channel form a competitive set,SEj, j=1,2,3,…,M, which means that these SUs are competing to access the jth PU channel for energy harvesting. We also assign them integer labels, and the SU that obtains thezero label can harvest energy in the next EH phase. Then these SUs withdraw from the competition sets when the data arrives at the data queue of SUs or their energy queue is full. The algorithm of our channel selection policy for energy harvesting is given in Algorithm 2.Algorithm 2:The channel selection policy for energy harvesting.
Input: All PUs channels, ln, n∈1,N, including lm idle channels, m∈1,M, and p SUs, p∈1,P. Output: Channel selection for SUs (1) begin (2)   /∗ For ln-m busy channels /∗ (3)   if  the data queue of SUs, QDp=⌀  then (4)     if  the energy queue of SUs, QDp′≠Qmax  then (5)       The p′ SUs form a number of competitive sets, SEi, i=1,…,n; (6)       Randomly assigning them integer labels from zero to u-1, u≤p′; (7)       for  erery competitive sets, SEi  do (8)         The SU who obtains the zero laber can access the corresponding busy channel for energy harvesting in the next EH phase, and withdraw from other competitive sets; (9)         Label values of other SUs minus one; (10)       end (11)     end (12)   end (13) endIn the proposed channel selection policy, the SU receiver sends a Decode packet to its transmitter when the current transmission is complete; that is, the data has been accepted successfully. The Channel-Switching (CSW) flag is set when the SU needs to switch to another channel, and then the SU transmitter and receiver pause their current transmission and perform channel handoff [35, 36].Note that the CSMA/CA protocol also uses the RTS/CTS handshake procedures to ensure that the collision does not occur among users and utilizes the exponential-backoff algorithm to decompose collision; that is, each node performs a random delayt when the collision happens, and t obeys the T(0~T) on the bottom of the exponential distribution. In our proposed channel selection policy, we ensure the usage of idle channels through establishing the competitive sets and randomly assigning the integer labels when the collision occurs. Moreover, in order to reduce the average waiting time of SUs, the SUs who access channels withdraw from their competitive sets while other SUs’ label values are minus one.


## 4.2.1. Channel Selection Policy for Data Transmission

The SU transmitter sends a RTS packet on the channel to its corresponding SU receiver if an idle channel is detected. Then the SU receiver replies with a CTS packet in the same channel. Notice that the RTS/CTS collision may occur when more than one pair of SUs contends the same target idle channel for data transmissions. Hence, different from the conventional way, the SU pair does not access the idle channel immediately when the CTS packet is successfully received by the SU transmitter. Those SUs who receive CTS packet form a competitive set,SIi, i=1,2,3,…,M, which means that these SUs are competing to access this PU channel. Supposing that the size of SIi isW, we randomly assign them integer labels fromzero to W-1. The SU who obtains thezero label can transmit data in the DT phase. In particular, for the SUs who can sense more than one channel, they can compete for multiple idle channels and obtain multiple labels when the data arrives at their data queue. Furthermore, the SU can access the corresponding channel for data transmission as long as it can obtain thezero label in one competitive set. Similarly, when the channel can only be accessed in theUnderlay model for data transmission, those SUs who receive the CTS packet will form a competitive set, SUi, i=1,2,3,…,M.The SU that transmits data in the previous time-slot will keep data transmission until the channel state is changed when the sensing outcome of the current channel isEs<λO in the next CS phase. All the label values of other SUs are in the same competitive set minus one when the SU withdraws from the current channel. Therefore, the SU whose label value is subtracted to bezero can access this channel. If the present channel is detected satisfy λO<Es<λU in the next CS phase; that is, the PU is not completely occupied in this channel for data transmission, the SU reduces its transmission power to satisfy the interference power constraint of PU that it can continue to transmit data in theUnderlay model, and their corresponding competitive sets will remain in use. However, the transmission of SU will cause interference to the communication of PU if the Es>λU. Then the data transmission of SU will be stopped in the next DT phase, and the competitive set of this channel will be dissolved. The algorithm of our channel selection strategy for data transmission is presented in Algorithm 1.Algorithm 1:The channel selection policy for data transmission.
Input: All PUs channels, ln, n∈1,N, including lm idle channels, m∈1,M, and p SUs, p∈1,P. Output: Channel selection for SUs (1) begin (2)   /∗ For lm idle channels /∗ (3)   if  the data queue of SUs, QDp≠⌀  then (4)     if  lm≥1  then (5)      if  theqSUs receive CTS packet successfully  then (6)        The q SUs form a number of competitive sets, SIi, i=1,…,m; (7)        Randomly assigning them integer labels from zero to w-1, w≤q; (8)        for  erery competitive sets, SIi  do (9)          The SU who obtains the zero label can access the corresponding channel for data transmission, and withdraw from other competitive sets; (10)          Label values of other SUs minus one; (11)        end (12)      end (13)     end (14)     if  lm=0  then (15)       if  thesSUs receive CTS packet successfully  then (16)         if  thetSUs transmit the data in the Underlay model, and their throughput can be satisfied  then (17)          The t SUs form a number of competitive sets, SUi, i=1,…,n; (18)          Randomly assigning them integer labels from zero to v-1, v≤t; (19)          for  erery competitive sets, SUi  do (20)           The SU who obtains the zero label can reduce its transmitting power and access the corresponding channel for data transmission, and then withdraw from other competitive sets; (21)           Label values of other SUs minus one; (22)          end (23)         end (24)       end (25)     end (26)   end (27) endWe illustrate the process of randomly assigning integer labels by Figure5. First, four SUs need to access channels for data transmission, and they sense the current channel availability to obtain a list of available channels. Secondly, the SUs who compete for the same channel form a competitive set; that is, the SUs 1,2,3 can use the channel A. We randomly assign integer labels fromzero for these SUs. Thirdly, the SUs who obtain thezero label can access the channels, and they withdraw from the corresponding competitive sets while the label values of other SUs are minus one. In particular, the SU 2 can use channels A or B. In the next time-slot, the SU 4 can access the channel B.Figure 5
An example of randomly assigning integer labels.


## 4.2.2. Channel Selection Policy for Energy Harvesting

The SUs that contend for the same target busy channel form a competitive set,SEj, j=1,2,3,…,M, which means that these SUs are competing to access the jth PU channel for energy harvesting. We also assign them integer labels, and the SU that obtains thezero label can harvest energy in the next EH phase. Then these SUs withdraw from the competition sets when the data arrives at the data queue of SUs or their energy queue is full. The algorithm of our channel selection policy for energy harvesting is given in Algorithm 2.Algorithm 2:The channel selection policy for energy harvesting.
Input: All PUs channels, ln, n∈1,N, including lm idle channels, m∈1,M, and p SUs, p∈1,P. Output: Channel selection for SUs (1) begin (2)   /∗ For ln-m busy channels /∗ (3)   if  the data queue of SUs, QDp=⌀  then (4)     if  the energy queue of SUs, QDp′≠Qmax  then (5)       The p′ SUs form a number of competitive sets, SEi, i=1,…,n; (6)       Randomly assigning them integer labels from zero to u-1, u≤p′; (7)       for  erery competitive sets, SEi  do (8)         The SU who obtains the zero laber can access the corresponding busy channel for energy harvesting in the next EH phase, and withdraw from other competitive sets; (9)         Label values of other SUs minus one; (10)       end (11)     end (12)   end (13) endIn the proposed channel selection policy, the SU receiver sends a Decode packet to its transmitter when the current transmission is complete; that is, the data has been accepted successfully. The Channel-Switching (CSW) flag is set when the SU needs to switch to another channel, and then the SU transmitter and receiver pause their current transmission and perform channel handoff [35, 36].Note that the CSMA/CA protocol also uses the RTS/CTS handshake procedures to ensure that the collision does not occur among users and utilizes the exponential-backoff algorithm to decompose collision; that is, each node performs a random delayt when the collision happens, and t obeys the T(0~T) on the bottom of the exponential distribution. In our proposed channel selection policy, we ensure the usage of idle channels through establishing the competitive sets and randomly assigning the integer labels when the collision occurs. Moreover, in order to reduce the average waiting time of SUs, the SUs who access channels withdraw from their competitive sets while other SUs’ label values are minus one.


## 4.3. Performance Analysis of the Channel Selection Policy

In this section, we intend to illustrate the spectrum usage performance of our proposed policy in terms of average throughput, average waiting time, and energy harvesting efficiency of SUs’ three aspects.


### 4.3.1. Average Throughput of SUs

In our proposed channel selection policy, SU can transmit data in theOverlay orUnderlay model. The service rate of each SU in thehybrid model is described as Rh=Ro+Ru, and Ro can be denoted by Ro0, Ro1, Ro0′, and Ro1′ in theOverlay model [37](4)Ro0=Blog2⁡1+gsPso,Ro1=0,Ro0′=Blog2⁡1+gsPsogpPp+1,Ro1′=0,where Ro0 represents that the PU does not occupy the channel. In contrast, Ro1 represents that the spectrum is being occupied by PU. Ro0′ and Ro1′ are the service rate of each SU underfalse alarm andmiss detection, respectively. Similarly, the Ru can be denoted by Ru0, Ru1 in theUnderlay model(5)Ru0=Blog2⁡1+gsPsu,Ru1=Blog2⁡1+gsPsugpPp+1.The throughput of SU can be described in terms of the outage as [38](6)T=1-pout,where pout is the outage probability. The throughput in channel selection policy, Th, is comprised of To and Tu, respectively. To is given by(7)To=pi1-pf1-pouto+1-pipf1-pouto′,where pi is the channel idle probability. Since the SU transmission will cause interference to PU Underfalse alarm, pouto and pouto′ can be described as(8)pouto=Pr⁡Ro0<Rs,pouto′=Pr⁡Ro0′<Rs,where Rs is the required service rate of SU. Correspondingly, we can obtain Tu, poutu, and poutu′ as follows:(9)Tu=pi1-pf1-poutu+1-pipf1-poutu′,poutu=Pr⁡Ru0<Rs,poutu′=Pr⁡Ru1<Rs.


### 4.3.2. Average Waiting Time of SUs

Here, we calculate the time elapsed between each SU which receives the RTS signal and implements data transmission, and this elapsed time can reflect the performance of the competitive set. The average waiting time of SUs will be longer than the conventional random access policy if the design of the competitive set is not reasonable. Thus, the average waiting time of SUs,Tw, can be described as(10)Tw=Tt-TRTS,where Tt and TRTS are the time-slots that the SU transmits data to and receives the RTS signal from, respectively.


### 4.3.3. Energy Harvesting Efficiency

We useeh to express the packets of energy that can be harvested by SUs from busy channels, and it follows Poisson distribution. The energy consumed by SU for data transmission and spectrum sensing are et and es, respectively. We assume that ec represents another energy consumption on circuit and ert denotes the residual energy at the time-slot t. Therefore, the energy harvesting efficiency is described in terms of the residual energy in the next time-slot(11)ert+1=min⁡ert+eh-et+es+ec,Emax.


## 4.3.1. Average Throughput of SUs

In our proposed channel selection policy, SU can transmit data in theOverlay orUnderlay model. The service rate of each SU in thehybrid model is described as Rh=Ro+Ru, and Ro can be denoted by Ro0, Ro1, Ro0′, and Ro1′ in theOverlay model [37](4)Ro0=Blog2⁡1+gsPso,Ro1=0,Ro0′=Blog2⁡1+gsPsogpPp+1,Ro1′=0,where Ro0 represents that the PU does not occupy the channel. In contrast, Ro1 represents that the spectrum is being occupied by PU. Ro0′ and Ro1′ are the service rate of each SU underfalse alarm andmiss detection, respectively. Similarly, the Ru can be denoted by Ru0, Ru1 in theUnderlay model(5)Ru0=Blog2⁡1+gsPsu,Ru1=Blog2⁡1+gsPsugpPp+1.The throughput of SU can be described in terms of the outage as [38](6)T=1-pout,where pout is the outage probability. The throughput in channel selection policy, Th, is comprised of To and Tu, respectively. To is given by(7)To=pi1-pf1-pouto+1-pipf1-pouto′,where pi is the channel idle probability. Since the SU transmission will cause interference to PU Underfalse alarm, pouto and pouto′ can be described as(8)pouto=Pr⁡Ro0<Rs,pouto′=Pr⁡Ro0′<Rs,where Rs is the required service rate of SU. Correspondingly, we can obtain Tu, poutu, and poutu′ as follows:(9)Tu=pi1-pf1-poutu+1-pipf1-poutu′,poutu=Pr⁡Ru0<Rs,poutu′=Pr⁡Ru1<Rs.


## 4.3.2. Average Waiting Time of SUs

Here, we calculate the time elapsed between each SU which receives the RTS signal and implements data transmission, and this elapsed time can reflect the performance of the competitive set. The average waiting time of SUs will be longer than the conventional random access policy if the design of the competitive set is not reasonable. Thus, the average waiting time of SUs,Tw, can be described as(10)Tw=Tt-TRTS,where Tt and TRTS are the time-slots that the SU transmits data to and receives the RTS signal from, respectively.


## 4.3.3. Energy Harvesting Efficiency

We useeh to express the packets of energy that can be harvested by SUs from busy channels, and it follows Poisson distribution. The energy consumed by SU for data transmission and spectrum sensing are et and es, respectively. We assume that ec represents another energy consumption on circuit and ert denotes the residual energy at the time-slot t. Therefore, the energy harvesting efficiency is described in terms of the residual energy in the next time-slot(11)ert+1=min⁡ert+eh-et+es+ec,Emax.


## 5. Simulations

In this section, we will provide numerical results to demonstrate the performance of the proposed cooperative sensing method and channel selection policy in terms of probability of false alarm, average throughput, average waiting time, and energy harvesting efficiency of SUs. Table1 shows the parameter settings of our simulations, and some parameters are valued based on the previous works on CR networks. We consider a multi-SU and multi-PU CR network with 20 PUs, 20 available PU channels, and 25 pairs of SUs. In particular, several SUs may access the same channel, and one SU may have more than one channel for selection. We set all the spectrum bandwidth to be the same, and the packets lengths of SUs and PUs are fixed in the simulations. However, the interference limitation of PUs is different. We let the path loss constant α=2 and attenuation factor k=0.5, respectively, according to the empirical values to compute the channel gain. Moreover, the white Gaussian noise is 8×10-15.Table 1
Simulation parameters settings.
Parameter Value Pi 0.8 λo 0.3 λu 0.7 Emax 15 Qmax 20 Rs 3 bps Pp 15 dB Time-slot 2 ms RTS packets length 250 bit CTS packets length 220 bit


### 5.1. Performance for Probability of False Alarm

Figure6 illustrates the probability of false alarm in cooperative sensing and conventional noncooperative sensing method under different numbers of SUs. As shown in the figure, the probability of false alarm decreases with the increase of detection probability. For the conventional noncooperative sensing method, there is no interaction on the detection results among multiple SUs. Hence, the increase of users has no impact on the probability of false alarm. For a fixed detection probability, cooperative sensing method can achieve higher detection accuracy. As described in Section 3.2, two or more of the same results are considered to be the final decision of the target channel. Therefore, the probability of false alarm decreases significantly when the cooperative SUs are 2 or 3. Furthermore, the probability of false alarm where the detection probability is 0.85 decreases faster when the number of SUs changes from 3 to 4. Thus, the cooperative sensing method can improve the accuracy of channel sensing in the case of low detection rate. However, more than 4 cooperative SUs have little effect on the probability of false alarm.Figure 6
The probability of false alarm in cooperative sensing and noncooperative sensing methods under different numbers of SUs.


### 5.2. Performance for Average Throughput of SUs

Figure7 shows the average throughput of SUs in the following transmission models: our proposedhybrid model, existinghybrid model [39],Overlay-only model, andUnderlay-only model under different numbers of busy channels. As can be seen from the figure that the average throughput of SUs decreases in theOverlay-only model with the number of busy channels increase. It is due to the fact that the high percentage of busy channels restricts SUs from transmission in theOverlay-only model. However, there is a little impact on the average throughput of SUs, since the SUs can coexist with PUs in theUnderlay-only model. It can be observed from the figure that thehybrid model transmission outperforms theOverlay-only andUnderlay-only model alone. Furthermore, we can see that our proposedhybrid model can achieve higher throughput compared with the existinghybrid model. The reason of this observation can be explained as follows. With the decrease of available idle channels, the opportunities of SUs for data transmission become less. The collision among SUs becomes more intense, since the existinghybrid model is only based on the number of SUs and access probability. However, the concept of competitive set can improve the utilization of the limited idle channels.Figure 7
The effect of transmission models on the average throughput of SUs under different numbers of busy channels.


### 5.3. Performance for Average Waiting Time of SUs

Figure8 shows the average waiting time of SUs in four different models under different numbers of busy channels. It is clear that the average waiting time of SUs greatly increases in theOverlay-only model with the decrease of available idle channels. In contrast, the average waiting time is not significantly increased in theUnderlay-only model, since the number of available idle channels has little effect on the data transmission of SUs. The differentinterference threshold constraint of PUs so that the SUs cannot access some channels is in theUnderlay-only model, which results in the consequence that some SUs need to wait for a long time to access channels. The average waiting time of SUs of our proposedhybrid model is lower than the existinghybrid model but higher than theUnderlay-only model when lots of channels are occupied by PUs. The explanation for this observation is as follows. As described in Section 4, SUs can continue to transmit data in theUnderlay model when the PU accesses its idle channel, and their current competitive sets will remain in use. Furthermore, the SUs that compete more than one channels can wait for accessing opportunities in other competitive sets when the current channel cannot be accessed. Therefore, the average waiting time of SUs will be reduced in our proposedhybrid model. However, since thehybrid model will give priority to whether the channel can be accessed in theOverlay model when the idle channels become less, the average waiting time of SUs in theUnderlay-only model is lower than ours.Figure 8
The effect of transmission models on the average waiting time of SUs under different numbers of busy channels.


### 5.4. Performance for Energy Harvesting Efficiency of SUs

Figure9 shows the average residual energy of SUs in the conventional CR network, existing CR network with energy harvesting [30], and our CR network with energy harvesting versus the simulation time. As shown in the figure, energy harvesting technology can ensure that enough energy is reserved after long time communication. Furthermore, our proposed CR network with energy harvesting outperforms the existing CR network with energy harvesting. This is because as described in Section 3, SUs decide to sense the idle channels for data transmission or busy channels for energy harvesting depending on the state of data queue and energy queue. Hence, SUs can spend less energy for sensing channels. Meanwhile, the SUs may have more opportunities to harvest energy, since the concept of competitive set can reduce the collision among multiple SUs competing for the same busy channel.Figure 9
The average residual energy of SUs in the conventional CR network, existing CR network with energy harvesting, and our CR network with energy harvesting under different simulation time.


## 5.1. Performance for Probability of False Alarm

Figure6 illustrates the probability of false alarm in cooperative sensing and conventional noncooperative sensing method under different numbers of SUs. As shown in the figure, the probability of false alarm decreases with the increase of detection probability. For the conventional noncooperative sensing method, there is no interaction on the detection results among multiple SUs. Hence, the increase of users has no impact on the probability of false alarm. For a fixed detection probability, cooperative sensing method can achieve higher detection accuracy. As described in Section 3.2, two or more of the same results are considered to be the final decision of the target channel. Therefore, the probability of false alarm decreases significantly when the cooperative SUs are 2 or 3. Furthermore, the probability of false alarm where the detection probability is 0.85 decreases faster when the number of SUs changes from 3 to 4. Thus, the cooperative sensing method can improve the accuracy of channel sensing in the case of low detection rate. However, more than 4 cooperative SUs have little effect on the probability of false alarm.Figure 6
The probability of false alarm in cooperative sensing and noncooperative sensing methods under different numbers of SUs.


## 5.2. Performance for Average Throughput of SUs

Figure7 shows the average throughput of SUs in the following transmission models: our proposedhybrid model, existinghybrid model [39],Overlay-only model, andUnderlay-only model under different numbers of busy channels. As can be seen from the figure that the average throughput of SUs decreases in theOverlay-only model with the number of busy channels increase. It is due to the fact that the high percentage of busy channels restricts SUs from transmission in theOverlay-only model. However, there is a little impact on the average throughput of SUs, since the SUs can coexist with PUs in theUnderlay-only model. It can be observed from the figure that thehybrid model transmission outperforms theOverlay-only andUnderlay-only model alone. Furthermore, we can see that our proposedhybrid model can achieve higher throughput compared with the existinghybrid model. The reason of this observation can be explained as follows. With the decrease of available idle channels, the opportunities of SUs for data transmission become less. The collision among SUs becomes more intense, since the existinghybrid model is only based on the number of SUs and access probability. However, the concept of competitive set can improve the utilization of the limited idle channels.Figure 7
The effect of transmission models on the average throughput of SUs under different numbers of busy channels.


## 5.3. Performance for Average Waiting Time of SUs

Figure8 shows the average waiting time of SUs in four different models under different numbers of busy channels. It is clear that the average waiting time of SUs greatly increases in theOverlay-only model with the decrease of available idle channels. In contrast, the average waiting time is not significantly increased in theUnderlay-only model, since the number of available idle channels has little effect on the data transmission of SUs. The differentinterference threshold constraint of PUs so that the SUs cannot access some channels is in theUnderlay-only model, which results in the consequence that some SUs need to wait for a long time to access channels. The average waiting time of SUs of our proposedhybrid model is lower than the existinghybrid model but higher than theUnderlay-only model when lots of channels are occupied by PUs. The explanation for this observation is as follows. As described in Section 4, SUs can continue to transmit data in theUnderlay model when the PU accesses its idle channel, and their current competitive sets will remain in use. Furthermore, the SUs that compete more than one channels can wait for accessing opportunities in other competitive sets when the current channel cannot be accessed. Therefore, the average waiting time of SUs will be reduced in our proposedhybrid model. However, since thehybrid model will give priority to whether the channel can be accessed in theOverlay model when the idle channels become less, the average waiting time of SUs in theUnderlay-only model is lower than ours.Figure 8
The effect of transmission models on the average waiting time of SUs under different numbers of busy channels.


## 5.4. Performance for Energy Harvesting Efficiency of SUs

Figure9 shows the average residual energy of SUs in the conventional CR network, existing CR network with energy harvesting [30], and our CR network with energy harvesting versus the simulation time. As shown in the figure, energy harvesting technology can ensure that enough energy is reserved after long time communication. Furthermore, our proposed CR network with energy harvesting outperforms the existing CR network with energy harvesting. This is because as described in Section 3, SUs decide to sense the idle channels for data transmission or busy channels for energy harvesting depending on the state of data queue and energy queue. Hence, SUs can spend less energy for sensing channels. Meanwhile, the SUs may have more opportunities to harvest energy, since the concept of competitive set can reduce the collision among multiple SUs competing for the same busy channel.Figure 9
The average residual energy of SUs in the conventional CR network, existing CR network with energy harvesting, and our CR network with energy harvesting under different simulation time.


## 6. Conclusion

In this paper, aiming at solving the problem of spectrum scarcity in IoE environment, we consider a multi-SU and multi-PU cognitive radio network in which the SUs are equipped with the RF energy harvesting capability. In this network, the crucial issues are the channel competition among SUs and the packet collision between SUs and PUs. We adopt the cooperative spectrum sensing method to reduce the probability of sensing errors and alleviate the interference to PUs. In order to solve the problem of channel competition among SUs, we first propose ahybrid transmission model for single SU. Each SU can either implement data transmission in an idle channel or energy harvesting from a busy channel given its data queue and energy queue state and sensing result. Additionally, we present a channel selection policy for multi-SU based on competitive set. Our proposed policy can achieve higher throughput compared with the conventional random policy. Furthermore, the collision will never be detected by themselves and may last for a quite long time when several SUs collide with each other in the conventional random policy. Hence, the channel competition among SUs will largely limit the performance of conventional random policy. While SUs will detect the collision in the CS phase and stop transmission in the next DT/EH phase to avoid longer ineffective transmission in our proposed policy. Simulations show that the proposed cooperative sensing method and channel selection policy outperform previous solutions in terms of probability of false alarm, average throughput, average waiting time, and energy harvesting efficiency of SUs.



---

*Source: 6024928-2016-12-21.xml*