# Reliable, Efficient, and Power Optimized Control-Channel Selection Scheme for Cognitive Radio Networks

Authors: Saleem Aslam; Adnan Shahid; Kyung Geun Lee
Journal: Mathematical Problems in Engineering
 (2013)

---

## Abstract

This paper presents a centralized control-channel selection scheme for cognitive radio networks (CRNs) by exploiting the variation in the spectrum across capacity, occupancy, and error rate. We address the fundamental challenges in the design of the control-channel for CRNs: (1) random licensed users (LUs) activity and (2) the economical and vulnerability concerns for a dedicated control-channel. We develop a knapsack problem (KP) based reliable, efficient, and power optimized (REPO) control-channel selection scheme with an optimal data rate, bit error rate (BER), and idle time. Moreover, we introduce the concept of the backup channels in the context of control-channel selection, which assists the CRs to quickly move on to the next stable channel in order to cater for the sudden appearance of LUs. Based on the KP and its dynamic programming solution, simulation results show that the proposed scheme is highly adaptable and resilient to random LU activity. The REPO scheme reduces collisions with the LUs, minimizes the alternate channel selection time, and reduces the bit error rate (BER). Moreover, it reduces the power consumed during channel switching and provides a performance, that is, competitive with those schemes that are using a static control-channel for the management of control traffic in CRNs.


---

## Body

## 1. Introduction

In recent years, most researchers and leading communication agencies have decided to adopt the dynamic spectrum management framework for handling the spectrum requirements of upcoming advanced communication systems. Such a shift in the spectrum management paradigm requires a robust communication radio that can meet the stringent demands of the future generation of communication systems. Cognitive radio (CR), or reconfigurable radio, seems to be the best technology for dynamic spectrum access [1–4]. CRs employ the spectrum-sensing scheme to locate empty spots within the radio spectrum band and then utilize the software routines using software-defined radio (SDR) for parameter adjustment. The CR can operate in the vacant portion of the licensed band only if they operate under a tolerable interference limit with LUs [5]. From the perspective of the CR, there are five main functions spectrum sensing: spectrum analysis, spectrum decision, spectrum sharing, and spectrum mobility [2–5]. As an example, the network control systems (NCS) are heavily investigated to manage the packet drop and latency of control-channel [6, 7]. Various methods for evaluating the stability analysis of the NCS are discussed in [8–10]. However, these schemes are focused for NCS rather than the dynamic communication environment like CRNs.To locate and select the best control-channels in terms of availability time and quality, spectrum sensing, analysis, and decision schemes play a crucial role. The spectrum sharing scheme helps in the optimal allocation of the available free channel/spectrum among competing CRs, whereas the spectrum mobility helps the CRs to avoid interference with the LUs by switching the CR to the next available channel. From the perspective of the LU networks, a user has the legitimate right to use the spectrum under the contract of the service provider. To have better coordination and synchronization among different components, the CRs need to exchange significant amount of the control information to make a timely decision about spectrum sensing, sharing, and mobility tasks [11]. Therefore, a stable and better quality control-channel is required to meet the desired efficiency. By selecting a better quality control-channel, the CRNs can provide a better communication environment to its users and can manage the control tasks in an appropriate way to support a wide range of applications including internet chat, voice calls, and live video streaming.A predefined control-channel can be utilized for the management of channel selection and channel allocation tasks [12–17]. However, channel sensing and selection tasks in CRNs depend directly on the relative distance of the CR from the LU. Therefore, the selection of a predefined single channel may experience collisions with LUs. A CORVUS system given in [13] introduces a method for the management of the control information in CRNs. The given scheme employs a dedicated control-channel within the ultrawide band (UWB) to manage the control traffic of CRNs. Similarly, several other schemes [14–17] exploit the UWB based dedicated control-channel for CRNs. Besides the UWB, many authors introduce the concept of utilizing the industrial scientific and medical (ISM) band for the management of the control tasks [12, 18, 19]. Although these schemes provide simpler solutions, these schemes are struggling with interference from other devices and spectrum availability issues. In [20], the authors describe an orthogonal frequency division multiplexing (OFDM) based wide-range transmission of control messages with small bit error rates. However, the scope of such schemes is very limited.Although a dedicated control-channel seems to be a simpler solution, it inherently has two fundamental challenges: (1) the random behavior of the LUs and (2) additional cost and vulnerability concerns. The LUs have legitimate rights to use the spectrum band. Consider a channel where CRs are exchanging control traffic, after a certain interval the LU arrives on that particular channel. In such a situation, the CRs should vacate the current channel and tune them to a new control-channel to avoid possible interference. To detect the LUs arrival activity, many spectrum-sensing schemes are proposed in the literature. The collaborative spectrum-sensing schemes [21–23] combine the observation of individual CRs to make a final decision regarding the presence or absence of an LU over a particular channel. Thus, it is extremely important for the control-channel design scheme to have an accurate estimation regarding the activity of the LUs across the spectrum and time. Secondly, dedicating the control-channel within the ISM band increases the implementation cost of the CRNs, which is also against the fundamental principal of the adaptive CR. Moreover, there are also vulnerability concerns in using the ISM band. The use of unlicensed bands cannot guarantee the reliability of control traffic, which is especially crucial for CRN operation. Another important factor for CRNs is the spectrum heterogeneity. Each CR finds a different set of available channels based upon its geographic location. Due to the heterogeneous nature of the spectrum, it is difficult to locate a common control-channel at a particular time.In spite of the inherent issues and limitations of dedicated control-channels, there are few research efforts in the area of dynamic control-channel design [24–28]. The dynamic model of the control-channel can counter the limitations of the dedicated model by selecting the control-channels in the light of LU dynamics and the varying nature of the radio spectrum. Zhao et al. propose a distributed coordination of CRs via a locally selected control-channel that may vary dynamically in response to the LU’s arrival [26]. The CRN is grouped into different numbers of clusters based on the number of common channels. This scheme can reduce the distinct frequency bands used as control-channels (equal to number of clusters). However, if the LU arrives frequently, the scheme needs to perform reclustering again and again which can degrade the QoS of the CRNs. Similar cluster oriented schemes are also discussed in [27, 28]. However, these schemes cannot provide the mechanism to handle the interference and alternate channel search time. Moreover, these schemes do not provide details regarding the exchange of control information at the intralevel (controlled by a single base station).In [29, 30], the authors introduce sequence based control-channel selection schemes. In such schemes, the CRs tune them to sensed channels on a predefined or pseudorandom sequence until they meet a common channel. The information is exchanged through broadcast messages which contain the list of available channels. Having information from a neighbor, a CR updates its list of common control-channels and hop on to channels on a sequence that may differ from its neighbor. As soon as the CRs exchange the synchronization frames among each other, they agree on a common hopping sequence for data exchange. Although the given schemes provide a usable framework, they have two prime limitations. First, if the CR broadcasts the list of channels without LU effects, it leads to a major question mark on their practical application. Secondly, there is significant time consumption during synchronization, which limits the actual use of the spectrum. In the synopsis, all previously mentioned schemes are proposed on the implicit requirements and assumptions that might limit their applicability to the job of dynamic control-channel assignment.In this paper, we introduce a knapsack problem (KP) based control-channel selection scheme for centralized CRNs and employ a dynamic-programming approach to get the optimal solution of KP. We dynamically select the control-channels over time and manage the random appearance of LUs over different channels by exploiting their prior statistics. The main contributions of the paper are as follows.(1)
We formulate the control-channel selection problem as an optimization problem with the objective of maximizing the capacity and the mean idle time of channels under the constraints of data rate and error rate. Thequality of an item in KP is represented using capacity, error rate, and mean idle time and the KP’s capacity is considered to be three (one main and two backup channels).(2)
We develop a model to compute themean idle time of the channels that predicts availability of the channel to CRs. The busy-state shows the presence of the LU and idle-state indicates the availability of the given channel to CRs for the transmission of their control traffic.(3)
We utilize the concept of backup channels inside the domain of the control-channel selection of CRNs. The backup channels assist the CRs to complete the on-going control data transmission, and it reduces the alternate channel search time. We present a mathematical relationship to compute the hand-off delay using two backup control-channels.(4)
Finally, we evaluate the performance of the REPO scheme with the existing schemes across different important factors such as collision with LUs, hand-off delay, power, and reliability (least BER).The rest of the paper is organized as follows. Section2 describes the system model and proposed framework for REPO scheme. Section 3 covers the mathematical formulation of the problem. Section 4 shows the experimental setup and simulation results. Finally, Section 5 concludes with the findings of the paper.


## 2. System Model

We consider a centralized CRN, where the LUs and CRs are using the spectrum in the same geographical area. The LUs have legitimate rights to use the spectrum according to terms and condition of their service providers. However, the users of CRNs can use the spectrum of the LUs as long as they operate under the tolerable interference limit. The spectrum of the LU can be grouped into a set ofM={m1,m2,…,mp} channels. Each channel mk has a unique data capacity, BER and LU activity index, or idle time. There are total N={n1,n2,…,nq} intra-CRNs and L={l1,l2,…,lr} indicates the number of CRs in different intra-CRNs. Each CR performs spectrum-sensing task and forwards its report to the respective CR base station. Later on, the base station forwards the sensing reports to the central control-channel manager (CCM). The CCM is the main entity that applies a KP based REPO scheme for the selection of the control-channel for the management of the control tasks. For accurate spectrum sensing, we consider that CRs are equipped with cyclostationary feature detection based cognitive sensors. Whenever the LU arrives on the current selected control-channel, the CR immediately vacates the channel and informs the CRBS. Later on, the CRBS reallocates other channels for control tasks after collaboration with CCM.


### 2.1. Nomenclature

The main notations used in the rest of the paper are as follows.N
: Set of cells or intra CRNsM: Set of channelsL: Set of CRp: Total number of channelsq: Total number of cells or intra CRNsr: CRs per celll: Total number of selected control-channelβ1: Weight of data rate objective functionβ2: Weight of idle time objective functionβ3: Weight of BER objective functionCk: Data rate on kth channelγk: Mean idle time on kth channelσj: A sensing vector of CRξji: Sensing reports from a local base stationηk: Interference plus noise contents of kth channel.The main assumptions of the REPO scheme are as follows.(i)
In order to have a common control-channel for initialization of the CRN, the CCM employs a global channel (GC) of bandwidthB Hz in the ISM band to discover the network topology and exchange relevant initial information such as spectrum availability. Once the initial connection is established, the CCM apply REPO scheme for selection of the best quality control-channel.(ii)
We assume that CRs are equipped with a single transceiver and CRs can perform sensing and data transmission tasks based on the designated time for each mode.(iii)
In every intra-CRN, a CR performs the LU detection task on a regular basis and reports the sensing result to the respective CRBS. Moreover, we assume that the CCM is perfectly synchronized with other CRBSs to collect the sensing results and that CRBSs can communicate directly with the CCM.(iv)
The sensing task is repeated after each application round. An application round represents the validity of the current channel selection in terms of the number of time slots.(v)
A CRBS with the maximum number of active CRs can act as CCM.


### 2.2. The Proposed Framework

This section describes the working of the proposed system. The main tasks involved are (1) LUs presence detection, (2) mean idle time prediction, and (3) quality estimation as shown in Figure1.Figure 1
Proposed framework of REPO scheme.


#### 2.2.1. LUs Presence Detection (LPD)

One of the primary tasks in the CRNs is to detect the activity of the LU. It helps to minimize the interference from possible collisions of CRs with LUs. The sensing operation of the CR can be described using the binary hypothesis mentioned in [23] using
(1)H0,ak=Ik,H1,ak=ak·hk+Ik,
where k represents the channel index within the radio spectrum and H0 corresponds to a hypothesis, when the LU is absent and only the noise signal exists over the kth channel. The hypothesis H1 represents a case in which the LU is present over the channels with slight contents of noise. We adopt the cyclostationary feature detection scheme to detect the presence of LU over different channels. A signal s(t) is considered to be second order cyclostationary (in the wide sense) if its autocorrelation function can be represented by the expression
(2)Rs(t,τ)=E{s(t+τ2)s(t-τ2)},
where the signal Rs(t,τ) is periodic and its characteristics can be measured using the autocorrelation function given in [31]:
(3)Rsα(τ)=limΔt→∞1Δt∫-Δt/2Δt/2s(t+τ2)·s(t-τ2)e-i2ƛαtdt,
where α represents the cyclic frequency and measured with interval Δt. The second order cyclostationary signals provides discrete correlation patterns which occur in the signal s(t). The patterns can be expressed using the spectral correlation function [17] and used for the analysis of LUs presence [32]:
(4)Ssα(f)=limΔt→∞limΔf→∞1Δt·Δf∫-Δt/2Δt/2S1Δf(t,f+α2)S1*Δf×(t,f-α2)dt,S1Δf(t,z)=∫-Δt/2Δt/2s(z)e-i2ƛztdz,
where S1 represents the complex envelop of the band pass components of LU’s signal s(t) with centre frequency z and bandwidth Δf. The spectral components of the LU’s signal can be measured in ideal condition using the following [33]:
(5)Spα(f)=limΔf→∞limΔt→∞Ssα(f)Δt.
The decision regarding cyclic frequency is based on the value of the coherence function given in the following [34]:
(6)Dsαi(f)=Ssαi(f)[Ss(f+(αi/2))Ss(f-(αi/2))]1/2.The coherence function is compared with a threshold value. If it provides a higher value than the threshold, then the LU is present over the channel of frequencyf otherwise the LU is considered to be absent.


#### 2.2.2. Mean Idle Time Prediction (MITP)

It is very important for CRNs to select a control-channel with higher stability, that is, longer idle probability. The stable control-channel reduces the collisions with LUs and helps CRs to save a significant amount of retransmission power, which is consumed during reselection of the control-channel.Each reselection consumes power by rerunning of REPO algorithm. Hence, the initial selection should be made perfect under the given condition (availability of sensing information). The spectrum sensing is performed at a regular interval [35] and within each interval the CR forwards its observation to the respective CRBS. The sensing vector of a CR can be represented using
(7)σj={b1,b2,b3,…,bp},
where bk represents the on-off state of the kth channel at jth time slot. Figure 2 explains the idle busy slots and the mechanism to acquire σj.Figure 2
Random LUs activity: 0 represents idle state and 1 represents the busy state of a channel.The base station of a particular intranetwork compares the current states of the channel with the states of previous time slot(j-1). Only the different state values are transmitted to the CCM. This helps to reduce the control information between local base station and the CCM. The sensing report of each local CR base station can be represented using the expression given in
(8)ξji={c1,c2,c3,…,cx}forbj≠bj-1,x≤p,
where ξji indicates the sensing reports from a local CR base station. Usually, the value of x is less than p until there is a rapid change in the arrival pattern of the CR. The CCM maintains the record of LUs activity over different channels for v time slots. The history of the LU can be represented mathematically using
(9)Ηpv=[h11h12…h1vh21h22…h2v⋮⋮⋮⋮hp1hp2…hpv],
where H represents the history matrix for holding the LU activity of p channels over v time slots and each element of the matrix is a binary digit 0 or 1 indicating the presence or absence of the LU during jth time slot on kth channel. After formation of the history of LU activity on different channels, the next prime task is the estimation of the idle time of the channels. For the sake of simplicity, we vertically divide the history into different regions where δ1 represents the most recent and δs is the oldest region as shown in Figure 3.Figure 3
MITP framework.Suppose thatλ={λ1,λ2,λ3,…,λs} represents the consecutive number of idle slots in a row of the history table and w={w1,w2,w3,…,ws} indicates the weights assigned to different regions of the history. The mean idle time of the channels can be predicted using the expression given in
(10)γk=∑l=1swlλl,∀l,
where γk indicates the mean idle time factor of a channel and characterizes the stability of the channel.


#### 2.2.3. Quality of Channels

Existing schemes such as [36] assume control-channels with the same capacity and the same communication range. However, the nature of the channel varies significantly across space and time which makes this assumption impractical. Therefore, we incorporate the quality variations of control-channels. We assume that each CR transmits with the same power Pt. If I(t)={I1,I2,…,Ip} indicates the interference and C={C1,C2,…,Cp} is the achievable data rate, then the capacity of kth channel can be computed as follows:
(11)Ck(t)=Bklog2(1+K-SkIk),
where Bk is the bandwidth of the channel and K- is the limiting factor which varies with the BER and it can be represented as K-=-1.5/log(5×BER).


## 2.1. Nomenclature

The main notations used in the rest of the paper are as follows.N
: Set of cells or intra CRNsM: Set of channelsL: Set of CRp: Total number of channelsq: Total number of cells or intra CRNsr: CRs per celll: Total number of selected control-channelβ1: Weight of data rate objective functionβ2: Weight of idle time objective functionβ3: Weight of BER objective functionCk: Data rate on kth channelγk: Mean idle time on kth channelσj: A sensing vector of CRξji: Sensing reports from a local base stationηk: Interference plus noise contents of kth channel.The main assumptions of the REPO scheme are as follows.(i)
In order to have a common control-channel for initialization of the CRN, the CCM employs a global channel (GC) of bandwidthB Hz in the ISM band to discover the network topology and exchange relevant initial information such as spectrum availability. Once the initial connection is established, the CCM apply REPO scheme for selection of the best quality control-channel.(ii)
We assume that CRs are equipped with a single transceiver and CRs can perform sensing and data transmission tasks based on the designated time for each mode.(iii)
In every intra-CRN, a CR performs the LU detection task on a regular basis and reports the sensing result to the respective CRBS. Moreover, we assume that the CCM is perfectly synchronized with other CRBSs to collect the sensing results and that CRBSs can communicate directly with the CCM.(iv)
The sensing task is repeated after each application round. An application round represents the validity of the current channel selection in terms of the number of time slots.(v)
A CRBS with the maximum number of active CRs can act as CCM.


## 2.2. The Proposed Framework

This section describes the working of the proposed system. The main tasks involved are (1) LUs presence detection, (2) mean idle time prediction, and (3) quality estimation as shown in Figure1.Figure 1
Proposed framework of REPO scheme.


### 2.2.1. LUs Presence Detection (LPD)

One of the primary tasks in the CRNs is to detect the activity of the LU. It helps to minimize the interference from possible collisions of CRs with LUs. The sensing operation of the CR can be described using the binary hypothesis mentioned in [23] using
(1)H0,ak=Ik,H1,ak=ak·hk+Ik,
where k represents the channel index within the radio spectrum and H0 corresponds to a hypothesis, when the LU is absent and only the noise signal exists over the kth channel. The hypothesis H1 represents a case in which the LU is present over the channels with slight contents of noise. We adopt the cyclostationary feature detection scheme to detect the presence of LU over different channels. A signal s(t) is considered to be second order cyclostationary (in the wide sense) if its autocorrelation function can be represented by the expression
(2)Rs(t,τ)=E{s(t+τ2)s(t-τ2)},
where the signal Rs(t,τ) is periodic and its characteristics can be measured using the autocorrelation function given in [31]:
(3)Rsα(τ)=limΔt→∞1Δt∫-Δt/2Δt/2s(t+τ2)·s(t-τ2)e-i2ƛαtdt,
where α represents the cyclic frequency and measured with interval Δt. The second order cyclostationary signals provides discrete correlation patterns which occur in the signal s(t). The patterns can be expressed using the spectral correlation function [17] and used for the analysis of LUs presence [32]:
(4)Ssα(f)=limΔt→∞limΔf→∞1Δt·Δf∫-Δt/2Δt/2S1Δf(t,f+α2)S1*Δf×(t,f-α2)dt,S1Δf(t,z)=∫-Δt/2Δt/2s(z)e-i2ƛztdz,
where S1 represents the complex envelop of the band pass components of LU’s signal s(t) with centre frequency z and bandwidth Δf. The spectral components of the LU’s signal can be measured in ideal condition using the following [33]:
(5)Spα(f)=limΔf→∞limΔt→∞Ssα(f)Δt.
The decision regarding cyclic frequency is based on the value of the coherence function given in the following [34]:
(6)Dsαi(f)=Ssαi(f)[Ss(f+(αi/2))Ss(f-(αi/2))]1/2.The coherence function is compared with a threshold value. If it provides a higher value than the threshold, then the LU is present over the channel of frequencyf otherwise the LU is considered to be absent.


### 2.2.2. Mean Idle Time Prediction (MITP)

It is very important for CRNs to select a control-channel with higher stability, that is, longer idle probability. The stable control-channel reduces the collisions with LUs and helps CRs to save a significant amount of retransmission power, which is consumed during reselection of the control-channel.Each reselection consumes power by rerunning of REPO algorithm. Hence, the initial selection should be made perfect under the given condition (availability of sensing information). The spectrum sensing is performed at a regular interval [35] and within each interval the CR forwards its observation to the respective CRBS. The sensing vector of a CR can be represented using
(7)σj={b1,b2,b3,…,bp},
where bk represents the on-off state of the kth channel at jth time slot. Figure 2 explains the idle busy slots and the mechanism to acquire σj.Figure 2
Random LUs activity: 0 represents idle state and 1 represents the busy state of a channel.The base station of a particular intranetwork compares the current states of the channel with the states of previous time slot(j-1). Only the different state values are transmitted to the CCM. This helps to reduce the control information between local base station and the CCM. The sensing report of each local CR base station can be represented using the expression given in
(8)ξji={c1,c2,c3,…,cx}forbj≠bj-1,x≤p,
where ξji indicates the sensing reports from a local CR base station. Usually, the value of x is less than p until there is a rapid change in the arrival pattern of the CR. The CCM maintains the record of LUs activity over different channels for v time slots. The history of the LU can be represented mathematically using
(9)Ηpv=[h11h12…h1vh21h22…h2v⋮⋮⋮⋮hp1hp2…hpv],
where H represents the history matrix for holding the LU activity of p channels over v time slots and each element of the matrix is a binary digit 0 or 1 indicating the presence or absence of the LU during jth time slot on kth channel. After formation of the history of LU activity on different channels, the next prime task is the estimation of the idle time of the channels. For the sake of simplicity, we vertically divide the history into different regions where δ1 represents the most recent and δs is the oldest region as shown in Figure 3.Figure 3
MITP framework.Suppose thatλ={λ1,λ2,λ3,…,λs} represents the consecutive number of idle slots in a row of the history table and w={w1,w2,w3,…,ws} indicates the weights assigned to different regions of the history. The mean idle time of the channels can be predicted using the expression given in
(10)γk=∑l=1swlλl,∀l,
where γk indicates the mean idle time factor of a channel and characterizes the stability of the channel.


### 2.2.3. Quality of Channels

Existing schemes such as [36] assume control-channels with the same capacity and the same communication range. However, the nature of the channel varies significantly across space and time which makes this assumption impractical. Therefore, we incorporate the quality variations of control-channels. We assume that each CR transmits with the same power Pt. If I(t)={I1,I2,…,Ip} indicates the interference and C={C1,C2,…,Cp} is the achievable data rate, then the capacity of kth channel can be computed as follows:
(11)Ck(t)=Bklog2(1+K-SkIk),
where Bk is the bandwidth of the channel and K- is the limiting factor which varies with the BER and it can be represented as K-=-1.5/log(5×BER).


## 2.2.1. LUs Presence Detection (LPD)

One of the primary tasks in the CRNs is to detect the activity of the LU. It helps to minimize the interference from possible collisions of CRs with LUs. The sensing operation of the CR can be described using the binary hypothesis mentioned in [23] using
(1)H0,ak=Ik,H1,ak=ak·hk+Ik,
where k represents the channel index within the radio spectrum and H0 corresponds to a hypothesis, when the LU is absent and only the noise signal exists over the kth channel. The hypothesis H1 represents a case in which the LU is present over the channels with slight contents of noise. We adopt the cyclostationary feature detection scheme to detect the presence of LU over different channels. A signal s(t) is considered to be second order cyclostationary (in the wide sense) if its autocorrelation function can be represented by the expression
(2)Rs(t,τ)=E{s(t+τ2)s(t-τ2)},
where the signal Rs(t,τ) is periodic and its characteristics can be measured using the autocorrelation function given in [31]:
(3)Rsα(τ)=limΔt→∞1Δt∫-Δt/2Δt/2s(t+τ2)·s(t-τ2)e-i2ƛαtdt,
where α represents the cyclic frequency and measured with interval Δt. The second order cyclostationary signals provides discrete correlation patterns which occur in the signal s(t). The patterns can be expressed using the spectral correlation function [17] and used for the analysis of LUs presence [32]:
(4)Ssα(f)=limΔt→∞limΔf→∞1Δt·Δf∫-Δt/2Δt/2S1Δf(t,f+α2)S1*Δf×(t,f-α2)dt,S1Δf(t,z)=∫-Δt/2Δt/2s(z)e-i2ƛztdz,
where S1 represents the complex envelop of the band pass components of LU’s signal s(t) with centre frequency z and bandwidth Δf. The spectral components of the LU’s signal can be measured in ideal condition using the following [33]:
(5)Spα(f)=limΔf→∞limΔt→∞Ssα(f)Δt.
The decision regarding cyclic frequency is based on the value of the coherence function given in the following [34]:
(6)Dsαi(f)=Ssαi(f)[Ss(f+(αi/2))Ss(f-(αi/2))]1/2.The coherence function is compared with a threshold value. If it provides a higher value than the threshold, then the LU is present over the channel of frequencyf otherwise the LU is considered to be absent.


## 2.2.2. Mean Idle Time Prediction (MITP)

It is very important for CRNs to select a control-channel with higher stability, that is, longer idle probability. The stable control-channel reduces the collisions with LUs and helps CRs to save a significant amount of retransmission power, which is consumed during reselection of the control-channel.Each reselection consumes power by rerunning of REPO algorithm. Hence, the initial selection should be made perfect under the given condition (availability of sensing information). The spectrum sensing is performed at a regular interval [35] and within each interval the CR forwards its observation to the respective CRBS. The sensing vector of a CR can be represented using
(7)σj={b1,b2,b3,…,bp},
where bk represents the on-off state of the kth channel at jth time slot. Figure 2 explains the idle busy slots and the mechanism to acquire σj.Figure 2
Random LUs activity: 0 represents idle state and 1 represents the busy state of a channel.The base station of a particular intranetwork compares the current states of the channel with the states of previous time slot(j-1). Only the different state values are transmitted to the CCM. This helps to reduce the control information between local base station and the CCM. The sensing report of each local CR base station can be represented using the expression given in
(8)ξji={c1,c2,c3,…,cx}forbj≠bj-1,x≤p,
where ξji indicates the sensing reports from a local CR base station. Usually, the value of x is less than p until there is a rapid change in the arrival pattern of the CR. The CCM maintains the record of LUs activity over different channels for v time slots. The history of the LU can be represented mathematically using
(9)Ηpv=[h11h12…h1vh21h22…h2v⋮⋮⋮⋮hp1hp2…hpv],
where H represents the history matrix for holding the LU activity of p channels over v time slots and each element of the matrix is a binary digit 0 or 1 indicating the presence or absence of the LU during jth time slot on kth channel. After formation of the history of LU activity on different channels, the next prime task is the estimation of the idle time of the channels. For the sake of simplicity, we vertically divide the history into different regions where δ1 represents the most recent and δs is the oldest region as shown in Figure 3.Figure 3
MITP framework.Suppose thatλ={λ1,λ2,λ3,…,λs} represents the consecutive number of idle slots in a row of the history table and w={w1,w2,w3,…,ws} indicates the weights assigned to different regions of the history. The mean idle time of the channels can be predicted using the expression given in
(10)γk=∑l=1swlλl,∀l,
where γk indicates the mean idle time factor of a channel and characterizes the stability of the channel.


## 2.2.3. Quality of Channels

Existing schemes such as [36] assume control-channels with the same capacity and the same communication range. However, the nature of the channel varies significantly across space and time which makes this assumption impractical. Therefore, we incorporate the quality variations of control-channels. We assume that each CR transmits with the same power Pt. If I(t)={I1,I2,…,Ip} indicates the interference and C={C1,C2,…,Cp} is the achievable data rate, then the capacity of kth channel can be computed as follows:
(11)Ck(t)=Bklog2(1+K-SkIk),
where Bk is the bandwidth of the channel and K- is the limiting factor which varies with the BER and it can be represented as K-=-1.5/log(5×BER).


## 3. Knapsack Problem Formulation and Algorithm

The control-channel selection problem is formulated using the 0-1 KP. The channel capacity, mean idle time, and BER of the channels are modeled as the value of the knapsack and the weight of the channels are assumed to be constant. Mathematically the knapsack based REPO can be represented as follows:(12)MaxA=∑k=1pQkxk=∑k=1p(β1Ck+β2γk+β3μk)xk,∀k(13)subjectto∑k=1pmkxk≤ℓ,∀k,(14)Ck·xk≥Cmin,∀k(15)BERk·xk≤μk(Ik),∀k(16)xk≡{0,1},∀k,
where
(17)xk={1selection0otherwise∀k.
Without loss of generality, we assume that
(18)maxj{mk}≤ℓ,∀k,Q1m1≥Q2m2≥⋯≥Qpmp,∀k,
where Q represents the utility function or value factor, {μk=1-BER}, and β1,β2, and β3 represent the weight or scaling factors for data capacity, idle time, and BER functions, respectively. The larger the value of the scaling factors, the stricter the priorities of the objective functions. The expression given in (13) illustrates the concept of backup channels in addition to the main control-channel (for current paper ℓ=3, one main and two backup channels). The backup channels can play a crucial role in minimizing the alternate channel search time in the case of the sudden appearance of the LU over the selected control-channel. To further cater the random appearance of the LUs, we provide second alternate control-channel. By having two backup channels, the CRs have better opportunities to manage the control tasks. Equation (14) assures that the selected channel satisfies the minimum capacity for the control traffic. By introducing the capacity constraint, we can reduce the possibility of channel handovers that may occur due to the poor signal to interference ratio. Similarly, (15) assures that the selected control-channel will have higher reliability through the selection of least BER channels. Hence, the REPO scheme offers better quality control-channels with a longer idle time and reliability.


### 3.1. Continuous Relaxation and Upper Bound

We can find the upper bound for 0-1 KP using the continuous relaxation mechanism which can be obtained by replacing (16) with the 0≤xk≤1forallk. In [37], Dantzig has proved that the optimal solution (x*) of the given problem can be obtained by locating the critical item θ that satisfies the following condition
(19)∑k=1θ-1mk≤ℓ≤∑k=1θmk,θ=min{k:∑k2=1kmk2>ℓ},
where θ indicates the first item inserted into knapsack and it does not fit there and we have 1≤θ≤p.Theorem 1.
The optimal solution(x*) of the proposed KP is as follows:
(20)x*=1fork=1,2,…,θ-1,x*=0fork=θ+1,θ+2,…,p,xθ*=ℓ*mθ,
where
(21)ℓ*=ℓ-∑k=1θ-1mk.Proof.
An optimal solution(x*) of KP must be maximal in the sense that ∑k=1pmkxk=ℓ. Based on the assumption given in (18), now, let x∘ represent the optimal solution of the KP. In addition, suppose that xk∘<1 for some k<θ; then there must be xy∘>xy* for at least one item y≥θ. For a sufficiently small δ>0, we could increase the value of xk∘ by δ, and xy∘ can be decreased by δmk/my. Therefore, augmenting the value of the objective function of δ(Qk-Qymk/my)>0 as δ(Qk-Qymk/my)>0 as Qk/mk>Qy/my which is clearly a contradiction to the original assumption. Similarly, we can prove that xk∘>0 for k>θ. Hence, xθ*=ℓ*/mθ using maximality. The optimal solution of the KP can be represented as follows [38]:
(22)A(x*)=∑k=1θ-1mk+⌊ℓ*Qθmθ⌋.
Hence, the valid upper bound of the proposed scheme based on the integrality of Qk and xk is
(23)Ub=∑k=1θ-1mk+⌊ℓ*Qθmθ⌋.


### 3.2. Dynamic Programming Solution for the Knapsack Problem

Dynamic programming (DP) is a powerful tool for solving the optimization problems such as knapsack problems [39]. In DP, there is a need to construct an array Z[k,w], where k and w are integers satisfying 1≤k≤p and 0≤w≤ℓ, respectively. An element ofZ[k,w] can be computed as follows:
(24)Z[k,w]=max(Z[k-1,w],Qk+Z[k-1,w-ℓk])for1≤k≤p,0≤w≤Ω,(25)Z[0,w]=0for0≤w≤Ω,(26)Z[k,w]=-∞forw<0,
where Qk is the utility function associated with the kth channel indicating the quality of the channel in terms and ℓk is the weight kth channel and it is equal to 1. Equation (24) holds only for those channels which can be selected based on their quality and stability. Each element of Z stores the accumulated sum of the utility function for the selected channel, where the total number of channels (main CC and backup CC) is equal to ℓ.


#### 3.2.1. Optimal Substructure Property

Let(x1,x2,x3,…,xk) represent the optimal solution of the proposed KP of REPO scheme depicted in Section 3. And let (x2,x3,…,xk) indicate the optimal solution for the subproblem of the proposed system which can be represented mathematically using (27) [36].Consider the following:(27)MaxA′=∑k1=2pQk1xk1,∀k1subjectto∑k1=2pmk1xk1≤ℓ,∀k1,Ck1·xk1≥Cmin,∀k1,BERk1·xk1≤μk1(Ik1),∀k1,xk1≡{0,1},∀k1.
Now, we also assume that (u2,u3,…,uk) is also an optimal solution to the subproblem (19)–(23) rather than (x2,x3,…,xk). Thus we show that
(28)∑k1=2pQk1xk1<∑k1=2pQk1uk1,∀k1,m1x1+∑k1=2pmk1uk1≤ℓ,∀k1.
Hence the result comes
(29)Q1x1+∑k1=2pQk1uk1>∑k1=2pQk1xk1,∀k1,m1x1+∑k1=2pmk1uk1≤ℓ,∀k1,Ck1·uk1≥Cmin,∀k1,BERk1·uk1≤μk1(Ik1),∀k1,xu1≡{0,1},∀k1.
The given expression suggests that (u2,u3,…,uk) is an optimal solution which proves that the 0-1 KP has substructure property which formulates the recursive formula given in (24).


#### 3.2.2. Space and Time Complexity

The recursive function described in (17) requires the integer weights mk of the selected channels. Based on this condition, the time and space complexity of the proposed scheme is O(kℓ). By adopting the robust programming mechanism, the space complexity can be reduced to O(ℓ). For larger values of ℓ, the time complexity of the proposed scheme increases and the time complexity of the worst-case scenario is O(k2k) when ℓ=2k. However, in [40], the authors propose a combo algorithm to improve the performance of the KP algorithm. They combine the DP with tight bounds to avoid the worst-case scenario and allow the system to reach an optimal solution within an acceptable time. Algorithm 1 explains the steps involved in the programming of the proposed REPO scheme. A keep array is introduced to monitor the quality of the selected channels. Hence, the optimal channels are selected using the DP approach.Algorithm 1:Dynamic programming code for reliable, efficient, and power optimized (REPO) scheme.
(1) Input:  pNumber of available channels.
(2)  ℓMaximum control-channels (Main CC + Backup CC).
(3)  Q1toQPUtility function (capacity, BER and idle time).
(4) for  w=0  toℓ
(5) Z[0,w]← 0
(6)end
(7)fork=1to p
(8) forw=0toℓ
(9)   If  (w[k]≤w)&&(Qk+Z[k-1,w-w[k]]>Z[k-1,w])
(10) {
(11)Z[k,w] = Qk+Z[k-1,w-w[k]]
(12)Keep[k,w] = 1;
(13)       }
(14)else
(15)       {
(16)Z[k,w]=Z[k-1,w]
(17)Keep[k,w]=0;
(18)       }
(19)Y  =ℓ;
(20)fork=pto 1
(21)ifKeep[k,y]=1;
(22){
(23)      Outputk;
(24)y=y-w[k];
(25)}
(26)Output:Z(p,y)
(27)  }


### 3.3. Hand-off Delay

To find the mathematical relationship for estimating the total hand-off delay incurred, suppose thatΔtot is the delay incurred during an application round with certain LU activity to manage the control information for the data transmission of the CRs at a particular time. Let Δwi denote the time span for the smooth operation over the selected control-channel without interruptions from LUs and ϕ is the total occurrences of the LUs for a given application round. The total time transmission delay for the transmission of control information can be computed using
(30)Δtot=Δwi+ϕ1·Δb1+ϕ2·Δb2+Δrf,(31)ϕ=ϕ1+ϕ2,
where ϕ1 and ϕ2 represent the occurrence of the LUs arrival on the main and first backup control-channel, respectively. The term Δrf in (30) indicates the time consumed during the alternate channel search (reselection of the control-channels). It is equal to the time consumed during the channel sensing and channel selection time. Contrary to the second and third factors, Δrf causes more delay, where Δrf≫ϕs·Δbs.


## 3.1. Continuous Relaxation and Upper Bound

We can find the upper bound for 0-1 KP using the continuous relaxation mechanism which can be obtained by replacing (16) with the 0≤xk≤1forallk. In [37], Dantzig has proved that the optimal solution (x*) of the given problem can be obtained by locating the critical item θ that satisfies the following condition
(19)∑k=1θ-1mk≤ℓ≤∑k=1θmk,θ=min{k:∑k2=1kmk2>ℓ},
where θ indicates the first item inserted into knapsack and it does not fit there and we have 1≤θ≤p.Theorem 1.
The optimal solution(x*) of the proposed KP is as follows:
(20)x*=1fork=1,2,…,θ-1,x*=0fork=θ+1,θ+2,…,p,xθ*=ℓ*mθ,
where
(21)ℓ*=ℓ-∑k=1θ-1mk.Proof.
An optimal solution(x*) of KP must be maximal in the sense that ∑k=1pmkxk=ℓ. Based on the assumption given in (18), now, let x∘ represent the optimal solution of the KP. In addition, suppose that xk∘<1 for some k<θ; then there must be xy∘>xy* for at least one item y≥θ. For a sufficiently small δ>0, we could increase the value of xk∘ by δ, and xy∘ can be decreased by δmk/my. Therefore, augmenting the value of the objective function of δ(Qk-Qymk/my)>0 as δ(Qk-Qymk/my)>0 as Qk/mk>Qy/my which is clearly a contradiction to the original assumption. Similarly, we can prove that xk∘>0 for k>θ. Hence, xθ*=ℓ*/mθ using maximality. The optimal solution of the KP can be represented as follows [38]:
(22)A(x*)=∑k=1θ-1mk+⌊ℓ*Qθmθ⌋.
Hence, the valid upper bound of the proposed scheme based on the integrality of Qk and xk is
(23)Ub=∑k=1θ-1mk+⌊ℓ*Qθmθ⌋.


## 3.2. Dynamic Programming Solution for the Knapsack Problem

Dynamic programming (DP) is a powerful tool for solving the optimization problems such as knapsack problems [39]. In DP, there is a need to construct an array Z[k,w], where k and w are integers satisfying 1≤k≤p and 0≤w≤ℓ, respectively. An element ofZ[k,w] can be computed as follows:
(24)Z[k,w]=max(Z[k-1,w],Qk+Z[k-1,w-ℓk])for1≤k≤p,0≤w≤Ω,(25)Z[0,w]=0for0≤w≤Ω,(26)Z[k,w]=-∞forw<0,
where Qk is the utility function associated with the kth channel indicating the quality of the channel in terms and ℓk is the weight kth channel and it is equal to 1. Equation (24) holds only for those channels which can be selected based on their quality and stability. Each element of Z stores the accumulated sum of the utility function for the selected channel, where the total number of channels (main CC and backup CC) is equal to ℓ.


### 3.2.1. Optimal Substructure Property

Let(x1,x2,x3,…,xk) represent the optimal solution of the proposed KP of REPO scheme depicted in Section 3. And let (x2,x3,…,xk) indicate the optimal solution for the subproblem of the proposed system which can be represented mathematically using (27) [36].Consider the following:(27)MaxA′=∑k1=2pQk1xk1,∀k1subjectto∑k1=2pmk1xk1≤ℓ,∀k1,Ck1·xk1≥Cmin,∀k1,BERk1·xk1≤μk1(Ik1),∀k1,xk1≡{0,1},∀k1.
Now, we also assume that (u2,u3,…,uk) is also an optimal solution to the subproblem (19)–(23) rather than (x2,x3,…,xk). Thus we show that
(28)∑k1=2pQk1xk1<∑k1=2pQk1uk1,∀k1,m1x1+∑k1=2pmk1uk1≤ℓ,∀k1.
Hence the result comes
(29)Q1x1+∑k1=2pQk1uk1>∑k1=2pQk1xk1,∀k1,m1x1+∑k1=2pmk1uk1≤ℓ,∀k1,Ck1·uk1≥Cmin,∀k1,BERk1·uk1≤μk1(Ik1),∀k1,xu1≡{0,1},∀k1.
The given expression suggests that (u2,u3,…,uk) is an optimal solution which proves that the 0-1 KP has substructure property which formulates the recursive formula given in (24).


### 3.2.2. Space and Time Complexity

The recursive function described in (17) requires the integer weights mk of the selected channels. Based on this condition, the time and space complexity of the proposed scheme is O(kℓ). By adopting the robust programming mechanism, the space complexity can be reduced to O(ℓ). For larger values of ℓ, the time complexity of the proposed scheme increases and the time complexity of the worst-case scenario is O(k2k) when ℓ=2k. However, in [40], the authors propose a combo algorithm to improve the performance of the KP algorithm. They combine the DP with tight bounds to avoid the worst-case scenario and allow the system to reach an optimal solution within an acceptable time. Algorithm 1 explains the steps involved in the programming of the proposed REPO scheme. A keep array is introduced to monitor the quality of the selected channels. Hence, the optimal channels are selected using the DP approach.Algorithm 1:Dynamic programming code for reliable, efficient, and power optimized (REPO) scheme.
(1) Input:  pNumber of available channels.
(2)  ℓMaximum control-channels (Main CC + Backup CC).
(3)  Q1toQPUtility function (capacity, BER and idle time).
(4) for  w=0  toℓ
(5) Z[0,w]← 0
(6)end
(7)fork=1to p
(8) forw=0toℓ
(9)   If  (w[k]≤w)&&(Qk+Z[k-1,w-w[k]]>Z[k-1,w])
(10) {
(11)Z[k,w] = Qk+Z[k-1,w-w[k]]
(12)Keep[k,w] = 1;
(13)       }
(14)else
(15)       {
(16)Z[k,w]=Z[k-1,w]
(17)Keep[k,w]=0;
(18)       }
(19)Y  =ℓ;
(20)fork=pto 1
(21)ifKeep[k,y]=1;
(22){
(23)      Outputk;
(24)y=y-w[k];
(25)}
(26)Output:Z(p,y)
(27)  }


## 3.2.1. Optimal Substructure Property

Let(x1,x2,x3,…,xk) represent the optimal solution of the proposed KP of REPO scheme depicted in Section 3. And let (x2,x3,…,xk) indicate the optimal solution for the subproblem of the proposed system which can be represented mathematically using (27) [36].Consider the following:(27)MaxA′=∑k1=2pQk1xk1,∀k1subjectto∑k1=2pmk1xk1≤ℓ,∀k1,Ck1·xk1≥Cmin,∀k1,BERk1·xk1≤μk1(Ik1),∀k1,xk1≡{0,1},∀k1.
Now, we also assume that (u2,u3,…,uk) is also an optimal solution to the subproblem (19)–(23) rather than (x2,x3,…,xk). Thus we show that
(28)∑k1=2pQk1xk1<∑k1=2pQk1uk1,∀k1,m1x1+∑k1=2pmk1uk1≤ℓ,∀k1.
Hence the result comes
(29)Q1x1+∑k1=2pQk1uk1>∑k1=2pQk1xk1,∀k1,m1x1+∑k1=2pmk1uk1≤ℓ,∀k1,Ck1·uk1≥Cmin,∀k1,BERk1·uk1≤μk1(Ik1),∀k1,xu1≡{0,1},∀k1.
The given expression suggests that (u2,u3,…,uk) is an optimal solution which proves that the 0-1 KP has substructure property which formulates the recursive formula given in (24).


## 3.2.2. Space and Time Complexity

The recursive function described in (17) requires the integer weights mk of the selected channels. Based on this condition, the time and space complexity of the proposed scheme is O(kℓ). By adopting the robust programming mechanism, the space complexity can be reduced to O(ℓ). For larger values of ℓ, the time complexity of the proposed scheme increases and the time complexity of the worst-case scenario is O(k2k) when ℓ=2k. However, in [40], the authors propose a combo algorithm to improve the performance of the KP algorithm. They combine the DP with tight bounds to avoid the worst-case scenario and allow the system to reach an optimal solution within an acceptable time. Algorithm 1 explains the steps involved in the programming of the proposed REPO scheme. A keep array is introduced to monitor the quality of the selected channels. Hence, the optimal channels are selected using the DP approach.Algorithm 1:Dynamic programming code for reliable, efficient, and power optimized (REPO) scheme.
(1) Input:  pNumber of available channels.
(2)  ℓMaximum control-channels (Main CC + Backup CC).
(3)  Q1toQPUtility function (capacity, BER and idle time).
(4) for  w=0  toℓ
(5) Z[0,w]← 0
(6)end
(7)fork=1to p
(8) forw=0toℓ
(9)   If  (w[k]≤w)&&(Qk+Z[k-1,w-w[k]]>Z[k-1,w])
(10) {
(11)Z[k,w] = Qk+Z[k-1,w-w[k]]
(12)Keep[k,w] = 1;
(13)       }
(14)else
(15)       {
(16)Z[k,w]=Z[k-1,w]
(17)Keep[k,w]=0;
(18)       }
(19)Y  =ℓ;
(20)fork=pto 1
(21)ifKeep[k,y]=1;
(22){
(23)      Outputk;
(24)y=y-w[k];
(25)}
(26)Output:Z(p,y)
(27)  }


## 3.3. Hand-off Delay

To find the mathematical relationship for estimating the total hand-off delay incurred, suppose thatΔtot is the delay incurred during an application round with certain LU activity to manage the control information for the data transmission of the CRs at a particular time. Let Δwi denote the time span for the smooth operation over the selected control-channel without interruptions from LUs and ϕ is the total occurrences of the LUs for a given application round. The total time transmission delay for the transmission of control information can be computed using
(30)Δtot=Δwi+ϕ1·Δb1+ϕ2·Δb2+Δrf,(31)ϕ=ϕ1+ϕ2,
where ϕ1 and ϕ2 represent the occurrence of the LUs arrival on the main and first backup control-channel, respectively. The term Δrf in (30) indicates the time consumed during the alternate channel search (reselection of the control-channels). It is equal to the time consumed during the channel sensing and channel selection time. Contrary to the second and third factors, Δrf causes more delay, where Δrf≫ϕs·Δbs.


## 4. Simulation Results

In this section, we explain the steps used to carry out the experimental results and evaluate the performance of REPO scheme through different comparisons. MATLAB 7.0 is used for simulation results. Although, we have shown the simulation results for specific parameters values, the proposed scheme can perform equally well for more generic cases. To improve the clarity and make the reading easier, we have shown the comparisons across four important parameters: (1) average collision rate, (2) average hand-off delay, (3) average power consumption, and (4) reliability. Table1 presents the different simulation parameters that are used to acquire results.Table 1
Simulation parameters.
Parameters
Value
Transmission power(Pt)
30 dBm
Noise variance (σ2)
0.2~0.7
History slots (v)
100
History samples per region
[
20
20
30
30
]
Channels (p)
100
LU activity
0~50%
[
β
1
,
β
2
,
β
3
]
[0.2, 0.5, 0.3]Table2 presents the outcome of REPO scheme based on predicted idle time of the selected control-channels for four different numbers of available channels. The Monte Carlo Principle is used to simulate the result for 100 iterations and then the mean idle times of the main and two backup channels are presented. The main control-channel can provide up to 10 idle slots for the operation of the CRs with the availability of P≥75.Table 2
Mean idle time of selected channels.
Channel type
Mean idle time of channels (γk)
p
=
25
p
=
50
p
=
75
p
=
100
Main CC
7.76
9.03
9.65
10.60
Backup 1 CC
6.38
7.43
8.01
8.92
Backup 2 CC
5.64
6.57
7.03
7.51


### 4.1. Average Collisions with LUs

In this section, we show the performance gain of our proposed REPO scheme over random channel selection (RCS) and greedy channel selection (GCS) schemes based on the average collision rate with the LUs. We have shown the results by varying different parameters of the simulation and try to highlight the advantages of the proposed scheme. The average values of the LU’s collision rate are computed after performing 100 iterations and then the average values are shown for comparison.Figure4(a) shows a comparison based on the collision rate across different application rounds. An application round represents the validity of the current selection in terms of the number of time slots. Each application round is five slots ahead from the previous application round. There are two key observations in the result. Firstly, for the first two application rounds, the REPO scheme shows [37.2%, 29.3%] less number of collisions as compared to the GCS scheme and the performance of the REPO is 3 times better in comparison with RCS scheme. Secondly, it provides information regarding the optimal application rounds for the operation of the proposed scheme (application rounds ≤3). On the third application round, REPO offers 26.3 and 65.12% less number of collisions with LUs as compared to the GCS and RCS schemes.Comparison based on the collision with LUs (a) for different application rounds, (b) for different available channels, (c) for different percentage of LU activity, and (d) for different LU activity with three different cases of available channels.
(a)
(b)
(c)
(d)Figure4(b) compares the proposed and existing schemes for different numbers of available channels. The REPO scheme offers 2.58 times less number of collisions with the increase of the available channels from 10 to 100. For example, when control-channel is selected from the pool of 50 channels by DCS and RCS schemes, they offer on average 21.39% to 61.17% greater number of collisions as compared to the REPO scheme. This is due to the fact that when CRNs have more channels in the poll (sensing results), the probability to find good channels (in terms of capacity, error rate, and idle time) increases.Figure4(c) illustrates the comparison of the REPO scheme with the existing schemes across different percentages of LU activity for three different application rounds (application round 1 = 5 free slots, application round 2 = 10 free slots, and application round 3 = 15 free slots). The REPO shows better performance for all three application rounds. For example, during application round 3, the REPO shows [16.8%10.89%], [35.48%43.58%] lower collision rate for 20% and 50% LU activity over different channels, respectively. The performance gain of the REPO scheme is also very significant for other percentages of LU activity. Similarly, Figure 4(d) also validates the performance gain of the proposed REPO over existing schemes across different LU activities. We plot the result for three different cases (p=25, p=50 and p=75). Again, the REPO scheme shows better performance than the GCS and RCS schemes for all cases. Hence, the REPO is an effective scheme to cater the random LU activity.


### 4.2. Average Hand-off Delay

In this section, we compare our scheme with the RCS and GCS schemes considering the average channel hand-off time. The performance gain achieved through the use of the backup channels is also presented. The average values of the hand-off delay are plotted after performing 100 iterations. Moreover, we also show a comparison with the two popular hand-off strategies: (1) always stay (AS) and (2) always change (AC). In the AS scheme, the CR stays on the same channel and waits for LU to finish its transmission until the channel becomes available again. However, in the AC scheme, the CR always changes the channel for its remaining transmission.Figure5(a) highlights the advantages of the proposed scheme with the use of the backup channels. The performance of the REPO is equally better for all application rounds. However, the backup channels improve the performance of REPO in an exponential pattern. For example, during application round 3, the REPO shows 26% and 65% lower hand-off delay compared to the GCS and RCS scheme. By using a single backup channel, the delay is reduced 3 times in comparison with GCS and 4 times compared to the RCS scheme. The gain factor is more significant with the use of a second backup control-channel.Hand-off delay based comparison, (a) for different application rounds, (b) for different LU activity, and (c) for AS and AC schemes.
(a)
(b)
(c)Figure5(b) illustrates the advantages of the backup channels across different LU activity. The REPO scheme significantly reduces the hand-off delay as compared to the RCS and GCS scheme. For example, consider the 30% LU activity and the REPO scheme with 2 backup channels; the GCS and RCS schemes offer 4.2 times and 5 times higher hand-off delay as compared to the REPO scheme. Hence, the REPO scheme performs equally better than the GCS and RCS schemes in reducing the hand-off delay time. To further extend the comparison with the existing schemes, we evaluate the REPO scheme with AS and AC scheme as shown in Figure 5(c). The REPO scheme again performs significantly better than these two schemes. For example, when the LU activity is 30%, the REPO scheme shows 4.6 times and 5.4 times less delays compared to the AC and AS hand-off schemes. Hence, the proposed REPO scheme can perform better than many of the existing channel selection schemes.


### 4.3. Average Power Consumption

Figure6 illustrates the performance gain of the REPO scheme over GCS and RCS schemes in terms of power consumption. We simulate the result for two different application rounds and show the bar graph for the 1st and 2nd application round (cases in Figure 5(c)) assuming that 100 mw is consumed for the retransmission of control data in case of collision with the LUs. The REPO scheme performs equally well to save transmission power. For example, consider 30% LU activity and application round 2 where the REPO saves 13.79% and 34.03% power as compared to the GCS and RCS scheme. Therefore, the DCS scheme is also useful for power sensitive application of the CRN such as cognitive radio sensor networks (CRSNs).Comparison based on the power consumption.
(a)
(b)


### 4.4. Reliability

This section shows performance gain based on the reliability factorμ(1-BER). The BER of channels are varied from 10-1 to 10-16 and the normalized average reliability values of the control-channels selected using existing schemes and REPO scheme are plotted in Figure 7. The weight given to the reliability factor in the utility function of (12) assures the selection of highly reliable channels with minimal BER. The comparison is shown for six different iterations. In each iteration, the control-channel is selected 100 times and then the average values of the reliability function are shown in the graph. The value1 represents the BER=10-16 and value 0 corresponds to the BER level 10-1. We divide the boundary between 0 and 1 in 16 levels where each level is 0.0625 ahead from its previous level, that is, 10-15 corresponds to 0.9375. The REPO scheme selects the channels with the reliability range of [0.89 to 0.97], whereas the GCS and RCS schemes select the channels with the reliability range of [0.726 to 0.94] and [0.62 to 0.90], respectively. Hence, the proposed REPO scheme selects channels with the least BER values and offer a better environment for CRs.Figure 7
Comparison based reliability.


## 4.1. Average Collisions with LUs

In this section, we show the performance gain of our proposed REPO scheme over random channel selection (RCS) and greedy channel selection (GCS) schemes based on the average collision rate with the LUs. We have shown the results by varying different parameters of the simulation and try to highlight the advantages of the proposed scheme. The average values of the LU’s collision rate are computed after performing 100 iterations and then the average values are shown for comparison.Figure4(a) shows a comparison based on the collision rate across different application rounds. An application round represents the validity of the current selection in terms of the number of time slots. Each application round is five slots ahead from the previous application round. There are two key observations in the result. Firstly, for the first two application rounds, the REPO scheme shows [37.2%, 29.3%] less number of collisions as compared to the GCS scheme and the performance of the REPO is 3 times better in comparison with RCS scheme. Secondly, it provides information regarding the optimal application rounds for the operation of the proposed scheme (application rounds ≤3). On the third application round, REPO offers 26.3 and 65.12% less number of collisions with LUs as compared to the GCS and RCS schemes.Comparison based on the collision with LUs (a) for different application rounds, (b) for different available channels, (c) for different percentage of LU activity, and (d) for different LU activity with three different cases of available channels.
(a)
(b)
(c)
(d)Figure4(b) compares the proposed and existing schemes for different numbers of available channels. The REPO scheme offers 2.58 times less number of collisions with the increase of the available channels from 10 to 100. For example, when control-channel is selected from the pool of 50 channels by DCS and RCS schemes, they offer on average 21.39% to 61.17% greater number of collisions as compared to the REPO scheme. This is due to the fact that when CRNs have more channels in the poll (sensing results), the probability to find good channels (in terms of capacity, error rate, and idle time) increases.Figure4(c) illustrates the comparison of the REPO scheme with the existing schemes across different percentages of LU activity for three different application rounds (application round 1 = 5 free slots, application round 2 = 10 free slots, and application round 3 = 15 free slots). The REPO shows better performance for all three application rounds. For example, during application round 3, the REPO shows [16.8%10.89%], [35.48%43.58%] lower collision rate for 20% and 50% LU activity over different channels, respectively. The performance gain of the REPO scheme is also very significant for other percentages of LU activity. Similarly, Figure 4(d) also validates the performance gain of the proposed REPO over existing schemes across different LU activities. We plot the result for three different cases (p=25, p=50 and p=75). Again, the REPO scheme shows better performance than the GCS and RCS schemes for all cases. Hence, the REPO is an effective scheme to cater the random LU activity.


## 4.2. Average Hand-off Delay

In this section, we compare our scheme with the RCS and GCS schemes considering the average channel hand-off time. The performance gain achieved through the use of the backup channels is also presented. The average values of the hand-off delay are plotted after performing 100 iterations. Moreover, we also show a comparison with the two popular hand-off strategies: (1) always stay (AS) and (2) always change (AC). In the AS scheme, the CR stays on the same channel and waits for LU to finish its transmission until the channel becomes available again. However, in the AC scheme, the CR always changes the channel for its remaining transmission.Figure5(a) highlights the advantages of the proposed scheme with the use of the backup channels. The performance of the REPO is equally better for all application rounds. However, the backup channels improve the performance of REPO in an exponential pattern. For example, during application round 3, the REPO shows 26% and 65% lower hand-off delay compared to the GCS and RCS scheme. By using a single backup channel, the delay is reduced 3 times in comparison with GCS and 4 times compared to the RCS scheme. The gain factor is more significant with the use of a second backup control-channel.Hand-off delay based comparison, (a) for different application rounds, (b) for different LU activity, and (c) for AS and AC schemes.
(a)
(b)
(c)Figure5(b) illustrates the advantages of the backup channels across different LU activity. The REPO scheme significantly reduces the hand-off delay as compared to the RCS and GCS scheme. For example, consider the 30% LU activity and the REPO scheme with 2 backup channels; the GCS and RCS schemes offer 4.2 times and 5 times higher hand-off delay as compared to the REPO scheme. Hence, the REPO scheme performs equally better than the GCS and RCS schemes in reducing the hand-off delay time. To further extend the comparison with the existing schemes, we evaluate the REPO scheme with AS and AC scheme as shown in Figure 5(c). The REPO scheme again performs significantly better than these two schemes. For example, when the LU activity is 30%, the REPO scheme shows 4.6 times and 5.4 times less delays compared to the AC and AS hand-off schemes. Hence, the proposed REPO scheme can perform better than many of the existing channel selection schemes.


## 4.3. Average Power Consumption

Figure6 illustrates the performance gain of the REPO scheme over GCS and RCS schemes in terms of power consumption. We simulate the result for two different application rounds and show the bar graph for the 1st and 2nd application round (cases in Figure 5(c)) assuming that 100 mw is consumed for the retransmission of control data in case of collision with the LUs. The REPO scheme performs equally well to save transmission power. For example, consider 30% LU activity and application round 2 where the REPO saves 13.79% and 34.03% power as compared to the GCS and RCS scheme. Therefore, the DCS scheme is also useful for power sensitive application of the CRN such as cognitive radio sensor networks (CRSNs).Comparison based on the power consumption.
(a)
(b)


## 4.4. Reliability

This section shows performance gain based on the reliability factorμ(1-BER). The BER of channels are varied from 10-1 to 10-16 and the normalized average reliability values of the control-channels selected using existing schemes and REPO scheme are plotted in Figure 7. The weight given to the reliability factor in the utility function of (12) assures the selection of highly reliable channels with minimal BER. The comparison is shown for six different iterations. In each iteration, the control-channel is selected 100 times and then the average values of the reliability function are shown in the graph. The value1 represents the BER=10-16 and value 0 corresponds to the BER level 10-1. We divide the boundary between 0 and 1 in 16 levels where each level is 0.0625 ahead from its previous level, that is, 10-15 corresponds to 0.9375. The REPO scheme selects the channels with the reliability range of [0.89 to 0.97], whereas the GCS and RCS schemes select the channels with the reliability range of [0.726 to 0.94] and [0.62 to 0.90], respectively. Hence, the proposed REPO scheme selects channels with the least BER values and offer a better environment for CRs.Figure 7
Comparison based reliability.


## 5. Conclusion

The control-channel selection scheme plays a key role in the effective operation of CRNs. However, the variations in the spectrum across capacity and occupancy are the crucial challenges in the design of the control-channel selection scheme. In this paper, we propose a REPO scheme for the effective and optimal management of the control traffic in CRNs. We formulate the control-channel selection problem using the KP and employ the dynamic programming approach to select the most stable and better quality control-channels for the smooth operation of CRs. We incorporate the mean idle time (to cater for the random appearance of the LU), BER, and channel capacity (to counter the variation at the physical layer) as the selection criteria by introducing these three factors inside the KP. To reduce the alternate channel search time, we introduce the concept of backup control-channels and employ two backups to reduce the alternate channel search time.The simulation results show that the proposed REPO scheme provides stable control-channels to the CRs under the desired constraints of capacity and error rate. The REPO scheme reduces collisions with the LUs and minimizes the channel hand-off delay. Moreover, it reduces significant amount of retransmission power when compared to the RCS and GCS schemes. The reliability analysis shows that the REPO scheme selects the channel with the least BER values and offers a better environment under noisy conditions.One of the limitations of the proposed scheme is theinitial selection of the control-channel in the ISM band. Although the proposed system quickly moves on to the dynamic control selection, it relies, to a small extent, on the fixed channel selection. An alternative dynamic control-channel for network initialization can be a good useful subject for future work. Secondly, the computation of the mean idle time requires history of the PUs and storage reduction for the PU history samples seems to be an interesting topic of study. Moreover, a similar concept can be applied to ad hoc networks and time-critical cognitive radio sensor networks (CRSNs).



---

*Source: 567581-2013-12-21.xml*