Received February 14, 2020, accepted March 6, 2020, date of publication March 17, 2020, date of current version

April 15, 2020.

Digital Object Identifier 10.1109/ACCESS.2020.2981413

HBLP: A Hybrid Underlay-Interweave Mode CRN

for the Future 5G-Based Internet of Things
ABD ULLAH KHAN 1 , GHULAM ABBAS 2 , (Senior Member, IEEE), ZIAUL HAQ ABBAS 3,

MUHAMMAD TANVEER 1 , SAMI ULLAH 1 , AND ALAMGIR NAUSHAD 1,4

1 Telecommunications and Networking (TeleCoN) Research Laboratory, GIK Institute of Engineering Sciences and Technology, Topi 23640, Pakistan
2 Faculty of Computer Science and Engineering, GIK Institute of Engineering Sciences and Technology, Topi 23640, Pakistan
3 Faculty of Electrical Engineering, GIK Institute of Engineering Sciences and Technology, Topi 23640, Pakistan
4 School of Electrical Engineering and Computer Science (SEECS), National University of Sciences and Technology (NUST), Islamabad 44000, Pakistan

Corresponding author: Abd Ullah Khan (abdullah@giki.edu.pk; akhan.dphd17seecs@seecs.edu.pk)

ABSTRACT Enhancing spectrum utilization efficiency (SUE) to accommodate the multitude of 5G-based
IoT devices within the available scarce spectrum has been a pivotal point of research in the current decade.
Equipped with interweave and underlay modes, cognitive radio networks (CRNs) are envisioned to be the
most promising technology for SUE enhancement. Since the 5G-based IoT is swiftly transforming into
a heterogeneous network, hybrid underlay-interweave mode CRNs appear to be the optimal key for SUE
enhancement. Besides enhancing SUE, ensuring fairness among secondary users (SUs) to equitably utilize
the network’s resources in the wake of primary users’ (PUs) service emergence has been a critical problem in
CRNs. Considering the importance of SUE enhancement, in this paper, we investigate two problems. Firstly,
we precisely analyze, in a novel way, the performance of hybrid underlay-interweave mode of CRNs for SUE
enhancement from the standpoint of SUs. For this purpose, we propose a hybrid underlay-interweave mode
enabled CRN scheme and apply it on a legacy CRN. We model the proposed scheme with continuous time
Markov chain and derive closed form expressions for various SUE-related quality of service parameters. The
analysis is conducted under dynamic reservation of channels for interrupted users, considering the effects of
multi-levels network traffic loads and varying channel failure rates. Secondly, we propose a multi-attribute
based fairness driven algorithm for determination and interruption of SUs’ services to ensure fairness among
services in the network’s resources utilization. We evaluate our proposed scheme under both perfect and
imperfect spectrum sensing scenarios. The obtained results demonstrate that, as compared to the state-of-
the-art, the proposed scheme significantly enhances SUE while the proposed algorithm achieves a noticeable
fairness among SUs’ services.

INDEX TERMS Cognitive radio networks, dynamic spectrum access, dynamic channel reservation, hybrid
underlay-interweave mode, spectrum utilization efficiency.

I. INTRODUCTION constrained [3]. Additionally, a large number of the devices

The Internet of Things (IoT), integrated with 5G networks,
promises to revolutionize the networking paradigm by con-
necting a large number of devices, where the devices are
expected to be of diverse capabilities, functionalities, struc-
tures, and requirements [1]. It is anticipated that the number
of such devices will exceed tens of billions in 2020 [2].
Moreover, it is also expected that most of these devices will
be of miniature dimensions and, accordingly, will be resource
The associate editor coordinating the review of this manuscript and
approving it for publication was Min Jia . studies show that a large part of the licensed spectrum remains
will be sharing the same radio frequency spectrum [4]. These
approximations indicate an increasing necessitation for reli-
able wireless connections for a huge number of devices [5].
Among the many solutions proposed to address the aforemen-
tioned challenges, cognitive radio network (CRN) is of vital
importance [6]. CRN is a networking paradigm where there
are two kinds of users who share the same band of spectrum.
The primary users (PUs) who are licensed to use the band and
the secondary users (SUs) who search for and opportunis-
tically use only idle parts of the band [7]. Certain research

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
VOLUME 8, 2020 63403
 A. U. Khan et al.: HBLP: Hybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT
underutilized. The underutilized part of the licensed spectrum
is also termed as white space [8]. To make efficient utilization
of the white space, CRNs enable SUs to use the idle parts of
the spectrum provided that no interference issues are created
for PUs’ services [8].
Enhancing spectrum utilization efficiency in CRNs is one
of the main objectives of CRNs’ research community in the
current decade. For instance, in [9], PUs’ traffic allocation
is optimized for the division and assignment of bandwidth
in such a way as to maximize spectrum utilization effi-
ciency using interweave mode (IM). In [10], soft cooperative
spectrum sensing is used to enhance spectrum utilization.
For this purpose, the length of SUs’ time slots inside the
time frame is adjusted. The authors in [11] proposed MIMO
based energy and spectrum optimization for 5G using auction
game.
The utility of CRNs lies in dynamic spectrum access
(DSA). DSA allows SUs to use the idle part of the spectrum
dynamically. Various flavors of DSA have been proposed in
the literature. In [12], a Q-learning-based dynamic spectrum
access algorithm is proposed. The algorithm addresses the
problem of imperfect spectrum sensing for idle channel avail-
ability detection in distributed CRNs. In [13], a dynamic spec-
trum access algorithm is developed. The algorithm utilizes
deep multi-user reinforcement leaning. During each time slot,
users compare their current states to the spectrum access
actions obtained from a trained deep-Q network. The objec-
tive is to tackle the problem of network utility maximization
under dynamic spectrum access.
Under DSA, CRNs operate in one of the three modes: inter-
weave, underlay and overlay [14]. In IM, SUs use only the
unused portion of the spectrum. In the underlay mode (UM),
PUs and SUs can use the same part of the spectrum, simulta-
neously, provided the SUs’ transmission power is below the
PUs’ interference threshold level. In overlay mode too, both
PUs and SUs can use the same spectrum, simultaneously.
Certain literature has used hybrid modes [15]–[18]. In [15],
a hybrid underlay-interweave approach is considered wherein
SUs transmit in both the presence and absence of active PUs.
In [16], a hybrid scheme is proposed for channel access and
channel prediction, with the objective of improving network
throughput and transmission delay. The scheme is evaluated
under a high traffic CRN. In [17], the authors compare the
performance of the interweave and underlay modes of CRNs
through a unified network setup. The authors then propose
a hybrid scheme for channel access in order to improve
the network’s throughput and transmission delay. In [18],
a hybrid interweave-underlay spectrum scheme is proposed.
In the scheme, users sense the 5GHz license-exempt spectrum
and reduce performance degradation induced by imperfect
estimation of the interference link parameters.
Though, most of the literature mentioned above addresses
most of the problems associated with dynamic spectrum
access in CRNs, none of them, however, takes fairness
and equality among SUs into account in SUs’ services
interruption happened due to PUs emergence. Moreover,
63404
channel failure has been overlooked in performance evalu-
ation of CRNs.
Another essential aspect of CRNs investigated by several
researchers is to dynamically reserve a certain number of
channels for the support of interrupted or failed services.
In [19], a channel reservation scheme is proposed to ana-
lyze the performance of CRNs under channel failures. It is
found that service retainability can be enhanced through
channel reservation. The authors in [20] proposed a static
channel reservation scheme for PUs. In [21], a channel reser-
vation scheme is proposed to analyze the impact of arrival
and service rates of SUs on their blocking, dropping and
hand off probability. The authors in [22] proposed a low-
complex channel reservation scheme by using one dimen-
sional Markov chain for the enhancement of call level QoS
provisioning.
Another novel and interesting concept in CRNs is licensed
shared access (LSA) [23] wherein the licensed and unlicensed
users can share the spectrum under certain sharing rules
agreed upon by both the users. When a licensed user grants
a part of its spectrum to an unlicensed user for a predeter-
mined amount of time, the licensed user cannot interrupt the
unlicensed user during that period of time [24]–[28]. In this
fashion, channel auction and bidding are avoided in channel
allocation since the licensed user willingly shares a portion
of its spectrum. Consequently, a predictable scale of QoS
satisfaction can be gained by SUs’ services.
An important scheme in this domain is proposed in [28].
The scheme, which, for brevity, is termed as BLP in this
paper, proposes a dynamic channel reservation (DCR) algo-
rithm and evaluates various performance metrics related to
spectrum utilization efficiency. BLP is based on the concept
of LSA and operates in two modes, Mode 1 and Mode 2,
selected by the operator as per his requirements. Mode 1 aims
to enhance service retainability of ongoing services while
Mode 2 aims to reduce blocking probability of new services.
To this end, Mode 1 reserves a large number of channels
under heavy network traffic load and a small number of
channels under low network traffic load. Mode 2, on the other
hand, reserves a large number of channels under low network
traffic load, and a small number of channels under heavy
network traffic load. However, the scheme considers only the
IM for channel access which is, though, simple yet ineffi-
cient because of the fact that pure interweave mode leads
to protraction in service waiting time for users in addition
to enhancing blocking probability and transmission delay.
Moreover, the scheme follows random approach in the selec-
tion of services for interruptions which results in unfairness
among users in the utilization of network’s resources. Besides
this, the scheme assumes all the channels to be of equal capac-
ity which is unrealistic in CRNs partly because, especially in
urban areas, more than one type of networks exist where each
network uses a different band of frequencies. This factor leads
to the realization of diverse frequency channels, with differ-
ent capacity, used by SUs. Lastly, the scheme is analyzed
under perfect spectrum sensing only which is unrealistic in
VOLUME 8, 2020
A. U. Khan et al.: HBLP: ybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT

real-world CRNs. These limitations minify the utility of BLP

for SUE enhancement.
In the light of the aforementioned literature, we pro-
pose a hybrid underlay-interweave mode enabled scheme for
CRNs which is inspired by BLP scheme proposed in [28].
We call our proposed scheme Hybrid BLP (HBLP). By dint
of using the UM in addition to the IM, HBLP makes efficient
use of the spectrum and leads to enhancement in spectrum
utilization efficiency. Moreover, HBLP introduces the con-
cept of diverse-capacity services in the network which is
more realistic in the real-world CRNs. Furthermore, HBLP
is analyzed under the impacts of both perfect and imperfect FIGURE 1. The high-level network architecture of CRN.
spectrum sensing. In addition to this, HBLP utilizes a multi-
attribute based service selection algorithm which determines
the most suitable service for interruption when a service is
• The proposed multi-attribute based fairness driven
required to be interrupted. Lastly, in order for making HBLP
(MAFD) algorithm used for services’ selection and
suitable for comparison with BLP, HBLP utilizes the DCR
interruption is shown to be effective in maintaining
algorithm proposed in [28] for channels’ reservation. Note
fairness among SUs’ services in availing the network’s
that, as stated earlier, the DCR algorithm proposed in [28]
resources in terms of services’ SNIR, services’ capacity
operates in two modes, Mode 1 and Mode 2. Thus, HBLP, like
and services’ utilization time.
BLP, also assumes dual modes of operation. The novelty and
• Handoff probability analysis for the proposed scheme
contributions of the proposed HBLP scheme are discussed
is conducted and insightful information is observed.
next.
Moreover, the effects of perfect and imperfect spectrum
sensing on the proposed scheme are investigated.
A. NOVELTY AND CONTRIBUTIONS • Multiple future research problems are identified.
We comprehensively analyze, from the perspective of SUs, The rest of the paper is organized as follows. Section II
the performance of hybrid underlay-interweave mode of presents the system model. Section III outlines our proposed
CRNs for spectrum utilization efficiency enhancement. For scheme and algorithm. Section IV describes the performance
this purpose, we apply the hybrid mode on a legacy CRN metrics considered in this study. Section V presents results
proposed in [28], and model the system with continuous and discussion, and Section VI concludes the paper. The list
time Markov chain (CTMC). Consequently, we derive closed of notations is given in Table 1.
form expressions for the core SUE-related QoS parameters
including channel availability, service capacity, service
II. SYSTEM MODEL
retainability, network unserviceable probability, and hand-
We consider a centralized CRN where multiple PUs and
off probability. The detailed analyses are conducted under
SUs exist under the control of their respective base stations
dynamic channels reservation made for accommodating
(BS), as shown in Fig. 1. For illustration clarity, the BS
interrupted users, considering multi-level network traffic
of the secondary network is shown only. The BS allocates
loads and channel failure rates. Moreover, the impacts of
channels to users from a total of T number of equal capacity
both perfect and imperfect spectrum sensing scenarios on the
channels where T ∈ Z + and Z + is the set of positive
proposed scheme are investigated. Additionally, we propose
integers. PUs can interrupt ongoing SUs’ services, if idle
a multi-attribute based fairness driven (MAFD) algorithm
channels are unavailable, to accommodate their interruptions.
which serves two objectives. Firstly, the algorithm determines
The detailed description of how the interruption procedure is
the most suitable SUs’ service for interruption in order to
followed by our proposed scheme is given in Algorithm 3,
accommodate those PUs which cannot find idle channels.
Algorithm 4 and Algorithm 5. SUs transmit with normal
Secondly, the algorithm ensures fairness among SUs’ ser-
power using the IM if they find idle channels. Otherwise,
vices in the utilization of network’s resources. In order to
they utilize the UM for their transmissions. The channels are
introduce more realism in our analyses, with respective to
susceptible to various types of failures and interruptions. The
CRNs especially, we assume that the services are operating
system dynamically reserves a number of channels, denoted
with diverse capacity in terms of data rate. Main contributions
by RCH , to accommodate failed or interrupted services in
of this paper are summarized as follows.
order that the services should successfully complete their
• Our proposed scheme, HBLP, exhibits significant sessions. The number of the reserved channels at a particular
improvement in the performance metrics related to instant of time depends on the network traffic load at that
SUE. The metrics include channel availability, service time. Moreover, an upper limit on the number of the reserved
capacity, service retainability, and network unservice- channels, denoted by Rmax , is imposed. The reserved and the
able probability. non reserved bands are denoted by RB and NB, respectively.

VOLUME 8, 2020 63405

 A. U. Khan et al.: HBLP: Hybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT
TABLE 1. The list of key notations.
The PUs’ services operating in the NB and the RB are repre-
sented by PUNB and PURB , respectively. Similarly, the SUs’
services operating in the NB and the RB are represented
by SUNB and SURB , respectively. The system dynamically
assigns channels to new arriving users and handovers or
63406
terminates the interrupted users. A number of assumptions
are made in modeling the system which are given as under.
• PUs and SUs arrive with Poisson process with rates λP
and λS , respectively [29].
• Channel failure may occur to both the idle and active
channels, in both the RB and the NB. Channel failure
rate per channel is λF .
• Channels’ active time (time before a channel failure
occurs) and service time of PUs and SUs are exponen-
tially distributed [28]. The service rates per channel for
PUs and SUs are µP and µS , respectively.
• Multiple failed channels can be repaired or restored
simultaneously with µR restoration rate per channel. The
restoration time is exponentially distributed.
• The latency caused by spectrum sensing, spectrum hand-
off and service switching to the UM is considered to be
negligible.
• In order for making the CTMC modeling tractable, per-
fect spectrum sensing is assumed [19], [28], [30]–[37].
It is worth noting that certain literature has used Pareto
distribution for modeling incoming traffic [38], [39]. How-
ever, modeling incoming traffic in communication networks
with Poisson process is a more realistic assumption. This is
because of the fact that Poisson process is a natural arrival
process, such that the moment of arrival of a service is
random and the probability of admitting two consecutive
services simultaneously can be practically negligible [29].
Furthermore, Poisson distribution has been widely used in the
literature for modeling the users’ arrival process [40]–[45].
III. THE PROPOSED SCHEME
In this section, we present our proposed HBLP scheme. The
scheme uses hybrid underlay-interweave mode of channel
access in CRNs for enhancing spectrum utilization efficiency.
Furthermore, we also present our proposed MAFD algorithm,
which is used to determine services for interruptions. The
algorithm also ensures availability of the optimal channels
for PUs as and when they require in addition to maintaining
fairness among SUs’ services in the network’s resources
utilization. MAFD algorithm is described in Algorithm 1
and elaborated in Subsection III-A. Thereafter, we revisit
the DCR algorithm, as described in Algorithm 2, in Subsec-
tion III-B. The channels’ allocation procedure is presented in
Subsection III-C and the corresponding CTMC modeling is
presented in Subsection III-D.
A. THE MULTI-ATTRIBUTE BASED FAIRNESS DRIVEN
(MAFD) ALGORITHM
Determination of a service for interruption under the
defined criteria is described in Algorithm 1. The nota-
tion fmaxs represents the function used to scan the active
services for finding the service with highest value of signal
to noise plus interference ratio (SNIR), fmaxc represents
the function used to scan the active services for find-
ing the service with the highest value of channel capacity
in bits per second, and fmaxt represents the function
VOLUME 8, 2020
A. U. Khan et al.: HBLP: ybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT

used to scan the active services for finding the service Algorithm 1 Service Determination
with the highest value of active time or service time duration. Input: SUact : Currently active SUs.
Similarly, SUmaxt represents the set of active SUs’ services Output: SUMax : The service to be interrupted.
with the highest values of active time or service time duration, [1] Calculate SUmaxs = fmaxs (SUact )
SUmaxc represents the set of active SUs’ services with the [2] if SUmaxs > 1 then
highest values of channel capacity in bits per second, and [3] Calculate SUmaxc = fmaxc (SUmaxs )
SUmaxs represents the set of active SUs’ services with the [4] if SUmaxc > 1 then
highest values of SNIR. [5] Calculate SUmaxt = fmaxt (SUmaxc )
As can be seen in Algorithm 1, whenever an SU’s service [6] SUMax = SUmaxt
needs to be interrupted, the algorithm analyzes all the ongoing [7] else
SUs’ services and stores in set SUmaxs the SU/SUs’ services [8] SUMax = SUmaxc
with the largest value of SNIR as given below [9] end
[10] else
SUmaxs = max (SUi (γi )), (1)
∀SUi ∈N [11] SUMax = SUmaxs
[12] end
where γi is SNIR of the ith active SU’s service, SUi ,
SUmaxs is the set of active SUs’ services with the high-
est value of SNIR, and N is the total number of
active SUs’ services. We use the free space propagation set SUmaxc and selects the SU’s service with the longest active
model to calculate of SNIR for a service (γ ) as given time or service time duration, as given below.
below [46]
SUmaxt = max (SUi (Tactive )), (7)
∀SUi ∈P
λ 2
   
pn
γ = 10 × log10 × , (2) SUMax = max(SUmaxt ), (8)
I 4πd
where P denotes the total number of SUs’ services in SUmaxt .
where pn is the transmission power of the intended trans-
Active time or service time duration (Tactive ) for a service can
mitted signal on channel n, I is the received interference
be calculated as
from other users, λ is the wavelength of the frequency
used, and d is the distance between a user availing the Tactive = t2 − t1 , (9)
service and base station. Thus, the service with the high-
est value of γ in SUmaxs , as given blow, is selected for where t1 and t2 indicate the starting time instant and the
interruption. current time instant of the service, respectively.
Making selection of services for interruption following
SUMax = max(SUmaxs ). (3) MAFD algorithm, as described above, leads to achieve-
ment of a noticeable level of fairness among SUs’ ser-
The notation SUMax represents the service selected to be vices in the utilization of network’s resources. On the other
interrupted. If multiple SUs’ services have the same value hand, random selection of services for interruption leads to
of γ , the algorithm further analyzes the set SUmaxs and unfairness and irregularity in the utilization of network’s
selects the SU/SUs’ services with the highest value of channel resources.
capacity.

SUmaxc = max (SUi (Ci )),
∀SUi ∈M
where M is the total number of SUs’ services in SUmaxs and
Ci is the capacity of the channel being used by the ith SU’s
service within SUmaxs . The channel capacity is calculated
using Shannon’s formula [47]
C = B log2 1 + γ


(5)
where B is the channel bandwidth and C is the channel
capacity of a service in bits per seconds. So, the service
in SUmaxc with the highest value of channel capacity, as given
below, is selected for interruption.
SUMax = max(SUmaxc ).
If multiple SUs’ services exist in SUmaxs with the same
value of channel capacity, the algorithm further analyzes the
(4) 1) TIME COMPLEXITY ANALYSIS FOR MAFD ALGORITHM
We analyzed MAFD algorithm for time complexity and found
that the time complexity of the algorithm is O(1), as shown
in Table 2.
B. THE DCR ALGORITHM
The DCR algorithm is described in Algorithm 2. The algo-
rithm makes channel reservation based on the current traffic
load, φ. The notation φ is a ratio between the number of
active PUs and SUs’ services, and the number of non-failed
channels in the network. The current traffic load is granulated
into k + 1 levels, where k ∈ Z + . For instance, with k = 3,
the current traffic load is represented by four levels as very
(6) high, high, medium, and low. Initially, φ is calculated on
Line 1 and then a resultant traffic load level is determined.
Mode 1 of the algorithm enhances retainability of current
services by reserving a large number of channels, subject

VOLUME 8, 2020 63407

 A. U. Khan et al.: HBLP: Hybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT

Algorithm 2 The DCR Algorithm TABLE 3. Time complexity analysis for the DCR algorithm.

Input: M: Total number of channels in the whole CRN

Input: an : Total number of channels occupied by PUNB
Input: bn : Total number of channels occupied by SUNB
Input: ar : Total number of channels occupied by PURB
Input: br : Total number of channels occupied by SURB
Input: f : Total number of failed channels in the CRN
Input: Rmax : Total number of reservable channels
Input: ci : ck+1 < ck < .. < ci < .. < c1 < c0 ; 0 < ci <
1, i = 1, ..k; k ∈ Z + ; c0 = 1, ak+1 = 0
Output: RCH : The number of currently reserved channels
[1] Calculate φ = (an + bn + ar + br )/(M − f )
[2] Calculate NAvail = M − (an + bn + ar + br + f )
[3] Calculate NR = ar + br
[4] for i = 0 : 1 : k do
[5] if ci+1 ≤ φ < ci then
[6] traffic_load_level = i
[7] break
[8] end
[9] end
[10] if working mode = 1 then
[11]
0
R = Rmax − traffic_load_level C. CHANNELS’ ALLOCATION PROCEDURE
[12] end Our proposed scheme, HBLP, dynamically allocates channels
[13] if working mode = 2 then to new service arrivals. Moreover, interruption to existing
0
[14] R = Rmax − (k − traffic_load_level) services and subsequent accommodation or termination is
[15] end also handled by the scheme. In the following, the channels’
0 0 0 0
[16] R = max{R , NR }: R ∈ Z + where 0 ≤ R ≤ Rmax allocation procedure followed by HBLP, under various events
0
[17] RCH = min{NAvail + NR , R } occurring in the network, is elaborated.

1) NEW PU ARRIVAL
TABLE 2. Time complexity analysis for MAFD algorithm.
A new PU arrival triggers Algorithm 2 to determine a suitable
number of channels for the RB and NB, and to allocate
the channels to each band accordingly. Thereafter, the new
arriving PU is assigned a channel as described in Algorithm 3.
The arriving PU is assigned an idle channel in the NB if
there is any. Otherwise, an SUNB , determined by Algorithm 1,
is interrupted by the PU. The interrupted SU hands over to the
RB if an idle channel exists there. Otherwise, the interrupted
SU adopts the UM. If the SU is unable to communicate in
the UM, it terminates. Similarly, non-availability of any idle
channel or SUNB results in blockage for the new arriving PU.

to Rmax , under a high value of φ. Mode 2 enhances channel
availability for new services by reserving a small number
of channels under a high value of φ. To prevent spectrum
handover of existing users from the RB to the NB, and to
maintain a positive value for R0 , the DCR algorithm selects
the higher value between R0 and NR , as shown in Line 16. The
notation NR represents the number of existing users in the RB.
In Line 17, the availability of idle channels in the entire
network is examined in order to effectively set the number
of channels in the RB (RCH ) according to the value of R0
obtained in Line 16.
1) TIME COMPLEXITY ANALYSIS FOR DCR ALGORITHM
Time complexity analysis of Algorithm 2 is carried out and
found to be O(n), as shown in Table 3.
2) NEW SU ARRIVAL
A new SU arrival triggers Algorithm 2 to determine a suitable
number of channels for the RB and NB, and to allocate
the channels to each band accordingly. Thereafter, the new
arriving SU is assigned a channel as described in Algorithm 3.
An idle channel in the NB is assigned to the SU. Non-
availability of any idle channel in the NB leads to the initi-
ation of the UM or blockage of the SU.
3) CHANNEL FAILURE
Idle channels, as well as active channels, may fail during the
CRN’s operation. Failure of an idle channel induces no oper-
ation in the network. However, failure of an active channel
brings about several events in the network depending on the
type of the service that fails. In the following, description
of the failures and the resultant events associated with the
various types of services is presented.

63408 VOLUME 8, 2020

A. U. Khan et al.: HBLP: ybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT
• Failure of PUNB : Since PUs’ services have the pre-
empting priority, its failure is compensated by inter-
rupting other services or users if exist. As described
in Algorithm 4, in the first instance, an idle channel
in the NB is used to accommodate a PUNB failure.
Else, an SUNB , determined by Algorithm 1, is inter-
rupted and the resultant vacant channel is assigned to
the failed PU if no idle channel exists in the NB. The
interrupted SU hands over to the RB if an idle channel
exists therein. Otherwise, the SU adopts the UM. The
failed PU’s service is terminated if none of the above
mentioned channels or users exists to accommodate its
failure.
• Failure of PURB : As shown in Algorithm 4, in the first
place, a failed PURB is accommodated by assigning an
idle channel in the RB.
If no idle channel exists in the RB, an idle channel
in the NB is assigned to the failed PU. If no idle
channel exists in the NB too, an SUNB , determined by
Algorithm 1, is interrupted and the resultant vacant chan-
nel is assigned to the failed PU.
In the last, an SURB , determined by Algorithm 1, is inter-
rupted and the resultant vacant channel is assigned to
the failed PU if none of the above three cases exists.
The failed PU is terminated if no channels or users,
as mentioned above, are available to accommodate its
failed service.
• Failure of SUNB : A failed SUNB is initially accommo-
dated by assigning it an idle channel in the NB, as shown
in Algorithm 5. Next, an idle channel in the RB is
assigned to the failed SUNB if no idle channel exists in
the NB. If no idle channel exists in the RB too, the SU
initiates the UM or gets terminated.
• Failure of SURB : A failed SURB is accommodated by
assigning it an idle channel in the RB, as shown in
Algorithm 5. If no idle channel exists in the RB, an idle
channel in the NB is assigned to the failed SURB .
If an idle channel does not exist in the NB too, an SUNB ,
determined by Algorithm 1, is interrupted and the resul-
tant vacant channel is assigned to the failed SURB .
Lastly, a PUNB is interrupted and the resultant vacant
channel is assigned to the failed SURB . Finding none of
the above listed channels or users leads to the initiation
of the UM or termination for failed SURB .
4) TERMINATION OF SUs’ SERVICE OPERATING IN THE UM
The SUs’ services operating in the UM may fail and termi-
nate if transmission in the UM is not possible because of
the degraded received signal quality and hardware failure.
Similarly, if such SUs’ services give rise to interference for
ongoing or new arriving PUs’ services, the SUs’ services are
terminated. In other words, the total transmitted power of
an SU’s service operating in the UM should be below the
maximum interference limit for PUs’ service (ImaxP ) and the
maximum interference limit for SUs’ service (ImaxS ), as given
VOLUME 8, 2020
below
g1n pn < ImaxP ,
g2n pn < ImaxS , (10)
where pn is the transmit power in channel n. g1n is the channel
gain from the SU transmitter, operating in the UM, to the
PU receiver in channel n, and g2n is the channel gain
from the SU transmitter, operating in the UM, to the
SU receiver operating in the IM in channel n. Simi-
larly, the maximum transmitted power constraint is given
by
pn < Pmax , (11)
where Pmax is the predefined maximum total transmit power
at the SU transmitter.
D. CTMC MODELING
Our proposed scheme is modeled using CTMC. Let
S denotes the set of feasible states in the CTMC model,
the corresponding states of HBLP are represented by x =
(an , bn , suum , ar , br , f ). Here, an and bn represent the number
of active PUNB and SUNB services, respectively. Similarly,
ar and br represent the number of active PURB and SURB
services, respectively. The notation suum represents the total
number of active UM connections. The total number of failed
channels in the network is represented by f . The total number
of occupied or active channels in the NB and RB are rep-
resented by An (x) and Ar (x), respectively. This implies that
An (x) = an + bn and Ar (x) = ar + br . The total number of
occupied and failed channels in the whole CRN is represented
by A(x) such that A(x) = Ar (x)+An (x)+f . Hence, the number
of idle channels in state x can be expressed as T − A(x).
Lastly, RCH (x) represents the number of reserved channels
in state x. Table 4 indicates the transitions between vari-
ous states, with transition rates, happened upon the service
arrivals and departures, as well as happened upon channel
failures and restorations.
Let the steady state probability (SSP) of a state x be
denoted by π(x), the SSP of each state can be computed
by
X
π × P = 0, π(x) = 1, (12)
x∈S
where P represents the transition rate matrix derived from
Table 4, π represents SSP vector, and 0 is a row vec-
tor of all zeros. In the next subsection, we formulate
expressions for all the QoS parameters considered in this
study.
IV. PERFORMANCE METRICS
In this study, we consider important QoS parameters in rela-
tion to spectrum utilization efficiency. The parameters are
service capacity, channel availability, service retainability,
handoff and network unserviceable probability (NUP) as
defined below.
63409
 A. U. Khan et al.: HBLP: Hybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT

TABLE 4. State transition table. Source state is assumed to be x = (an , bn , suum , ar , br , f ).

A. SERVICE CAPACITY B. CHANNEL AVAILABILITY

We define capacity to be the average number of services Channel availability for SUs operating in the IM (SUCHA ) and
completed per unit time. Let SUCAP denotes SUs’ capacity. channel availability for SUs operating in the UM (suumCHA )
We have can be respectively expressed as
X
SUCHA = 1 − π(x), x ∈ S, (14)
X
SUCAP = (bn + br + suum ) µS π(x), x ∈ S. (13)
A(x)=T or
An (x)=T −RCH (x)

63410 VOLUME 8, 2020

A. U. Khan et al.: HBLP: ybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT

and and
X
π(x),
X
suum(CHA) = 1 − x ∈ S. (15) suum(RFTP ) = λP π(x), x ∈ S. (22)
A(x)=T or A(x)=T ; sum >0;
An (x)=T −RCH (x) suum =0
Similarly, the rate of forced termination of SUs’ services
The blocking probability is contrary to channel availabil-
operating in the UM, owing to SUs’ services operating in the
ity. The blocking probability for SUs operating in the IM,
IM, is represented by suum(RFTS ) and is expressed as
SUBL , and the blocking probability for SUs operating in the
UM, suumBL , are respectively given by
X
suum(RFTS ) = λS π(x), x ∈ S. (23)
A(x)=T ; sum >0;
X
SUBL = π(x), x ∈ S, (16)
A(x)=T or
An (x)=T −RCH (x) 3) SERVICE RETAINABILITY FORMULATION
and The effective channel assignment rate for a new arriving SU is
X represented by 3S , and is calculated as 3S = λS SUCHA [48].
suum(BL) = π(x), x ∈ S. (17) Hence, the forced termination probability of SUs’ services,
A(x)=T or SUFT , becomes
An (x)=T −RCH (x) suum =0
0
(SURFTC + SURFT )
C. SERVICE RETAINABILITY SUFT = C
. (24)
3S
Retainability of a service can be expressed in terms of the
where SURFTC = SURFT + suum(RFTP ) + suum(RFTS ) and
forced termination probability (FTP) of that service as given 0 0
SURFT = SURFT + su0umRFT . Thus, the service retainability
by C
of SUs’ services can be expressed as
Service retainability = 1 − FTP. (18)
SURET = 1 − SUFT . (25)
The FTP depends on the rate of forced termination of a
service owing to channel failures and high priority service D. NETWORK UNSERVICEABLE PROBABILITY
arrivals, both of which are defined in the following. Network unserviceable probability, NUP, integrates the
impacts of both blocking and forced termination probability.
1) THE RATE OF FORCED TERMINATION OF SUs’ SERVICES Let SUNUP denotes NUP for SUs’ services. For mathematical
OWING TO CHANNEL FAILURES expression of SUNUP , we assume  to be the probability of
The rate of forced termination of SUs’ services, owing to successfully finishing an SU service. Thus, we have
0
channel failure, operating in the IM (SURFT ) is given by
X SUNUP = 1 − 
0
SURFT = λF (T − f ) π(x), x ∈ S. (19) = 1 − (1 − SUBL )(1 − suum(BL) )(1 − SUFT )
A(x)=T
(bn >0 ) or (an =bn =0; br >0) = 1 − SUBL (1 − SUFT − suum(BL)
Similarly, the rate of forced termination of SUs’ services, + SUFT suum(BL) ) − SUFT (1 − suum(BL) )
owing to channel failure, operating in the UM (su0um(RFT ) ) can − suum(BL) . (26)
be expressed as
E. HANDOFF PROBABILITY
X
su0um(RFT ) = λF π(x), x ∈ S. (20)
A(x)=T
We define handoff probability for SUs’ services to be the
suum >0 likelihood that, in the event of SUs’ services interruptions
happened due to channel failures or PUs’ arrivals, at least one
2) THE RATE OF FORCED TERMINATION OF SUs’ SERVICE vacant channel or low priority service is available to be used
OWING TO HIGH PRIORITY SERVICES ARRIVALS for channel handoff. Mathematically,
High priority service arrivals also cause terminations of low X X
priority services. Note that suum services may also face ter- Pr (HO) = λP π(x) + λF π(x)
mination because of the interference limit violation. The An (x)=T −RCH (x);bn >0 An (x)=T −RCH (x);bn >0
Ar (x)<RCH (x) Ar (x)<RCH (x)
interference limit violation arises when an existing or new X
arriving high priority service receives interference of the + λF π(x), x ∈ S. (27)
above-threshold level from a user operating in the UM. The Ar (x)=RCH (x);
An (x)<T −RCH (x) or bn >0 or an >0
rates of forced termination of SUs’ services, operating in
the IM, owing to PUs arrivals, SURFT , and the rates of forced
termination of SUs’ services, operating in the UM, owing to V. RESULTS AND DISCUSSION
PUs arrivals, suum(RFTP ) , are respectively given by In this section, we present the numerical results of our
X proposed scheme, HBLP. For performance comparison,
SURFT = λP π(x), x ∈ S, (21) BLP scheme, as proposed in [28], is considered. The com-
A(x)=T ; bn >0 parison is carried out under various network traffic loads
VOLUME 8, 2020 63411
 A. U. Khan et al.: HBLP: Hybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT

TABLE 5. The list of symbols and their values used in the numerical
results.

and channel failure rates. The results of our analysis are

derived using MATLAB. Core QoS parameters including ser-
vice capacity, channel availability, service retainability, and
network unserviceable probability are used for performance
evaluation. The list of main parameters with their default
values used in the generation of results is given in Table 5.
Unless specifically stated, the default values given in Table 5
should be reckoned to have been used in the generation of
results.

A. CHANNEL AVAILABILITY
Fig. 2a shows channel availability plotted as a function of PU
arrival rate (λP ). As can be seen in the figure, the respective
modes of HBLP outperform their BLP counterparts at all
values of λP . For instance, both Mode 1 and Mode 2 of HBLP FIGURE 2. Channel availability for SUs as a function of λP and λF .
respectively achieve 22% and 17% improvement over their
BLP counterparts at λP = 15. In Fig. 2b, channel availability
is plotted as a function of channel failure rate (λF ) wherein
SURET plotted as a function of λF . Both the modes of HBLP
HBLP outperforms BLP at all values of λF . For instance, both
outperform their BLP counterparts. For instance, at λF =
Mode 1 and Mode 2 of HBLP respectively achieve 13% and
0.25, Mode 1 and Mode 2 of HBLP respectively achieve 6%
14% improvement over their BLP counterparts at λF = 0.6.
and 10% improvement over their BLP counterparts.
B. SERVICE CAPACITY
Fig. 3a shows SUs’ services capacity (SUCAP ) plotted as a D. NETWORK UNSERVICEABLE PROBABILITY
function of λP where both the modes of HBLP outperform Fig. 5a and 5b show SUs’ services NUP (SUNUP ) plotted
their BLP counterparts. For instance, Mode 1 and Mode 2 of as a function of λP and λF , respectively. As can be seen in
HBLP achieve 114% and 107% enhancement over their BLP the figures, both the modes of HBLP outperform their BLP
counterparts at λP = 15. Similarly, Fig. 3b shows SUCAP plot- counterparts. For instance, in Fig. 5a, 38% improvement is
ted as a function of λF wherein HBLP significantly improves achieved by HBLP over BLP in both the modes at λP = 15.
SUCAP . For instance, at λF = 0.6, Mode 1 and Mode 2 of Similarly, in Fig. 5b, Mode 1 and Mode 2 of HBLP achieve
HBLP respectively achieve 49% and 44% enhancement over 30% and 32% improvement, respectively, over their BLP
their BLP counterparts. counterparts, at λF = 0.15.

C. SERVICE RETAINABILITY E. FAIRNESS

Fig. 4a shows SUs’ services retainability (SURET ) plotted
as a function of λP wherein HBLP exhibits enhancement
over BLP. For instance, at λP = 8, Mode 1 and Mode 2 of
HBLP respectively achieve 4% and 7% enhancement over
their BLP counterparts. In the same way, Fig. 4b shows
Fig. 6, 7 and 8 indicate the fairness achieved among SUs’
services, by dint of using Algorithm 1, in the utilization of
service’s time duration, service’s SNIR, and service’s capac-
ity, in bits per second, of the network, respectively. Note that,
for convenience in comparison, the values of service’s SNIR,

63412 VOLUME 8, 2020

A. U. Khan et al.: HBLP: ybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT

Algorithm 3 New Service Arrival

Input: FCHN : Total number of idle channels in NB
Input: FCHR : Total number of idle channels in RB
Input: PUNB(T) : Total number of active PUNB
Input: SUNB(T) : Total number of active SUNB
Input: SUum : Total number of active users in the
UM
Output: ƒ: Channel access
[1] A PU appears
[2] if FCHN > 0 then
[3] PUNB(T) = PUNB(T) + 1
[4] ƒ = 1 (Successful channel access)
[5] else if SUNB(T) > 0 then
[6] Call Algorithm 1
[7] SUNB = SUNB − 1
[8] PUNB(T) = PUNB(T) + 1
[9] ƒ = 1 (Successful channel access)
[10] if FCHR > 0 then
[11] SURB = SURB + 1
[12] end
[13] else
[14] Block the PU
[15] ƒ = 0 (Failed channel access)
[16] end
[17] An SU appears
[18] if FCHN > 0 then
[19] SUNB(T) = SUNB(T) + 1
[20] ƒ = 1 (Successful channel access)
[21] else
[22] Block the SU
[23] SUum = SUum + 1 (Initiate the UM)
FIGURE 3. Capacity for SUs as a function of λP and λF .
[24] end

service’s capacity and service’s active time are normalized to

one.
It can be seen in the figures that Algorithm 1 ensures a
noticeable level of fairness among SUs’ services in utilizing
the network’s resources in terms of service quality and service
utilization time. For instance, in Fig. 6b, services operating on
channel 1, 2, 3 and 7 get almost equal opportunities to avail
themselves of the network’s service time. Similarly, services
operating on channel 4, 5, 6 and 8 get almost equal shares of
the network’s service time. The overall difference among all
the operating services, in availing the network’s service time,
is insignificant in HBLP, as compared to the considerable
difference among services, in availing the network’s service
time, observed in BLP, and depicted in Fig. 6a.
In BLP, due to using random selection of services for
interruption, certain services, such as services operating on
channel 3 and 7, get massive share of the network’s service
time, as shown in Fig. 6a. On the other hand, services oper-
ating on channel 4 and 5 get extremely low share of the
network’s service time. Similarly, in Fig. 7 and 8, a substantial
level of fairness can be observed among services in HBLP as
compared to BLP.
Thus, HBLP, by dint of using Algorithm 1, facilitates
maintaining nearly equal values of service’s SNIR, service’s
capacity and service’s activity time among services. Contrar-
ily, BLP follows random interruption of services which leads
to unpredictable network performance and unfairness among
services in availing the network’s resources.
F. HANDOFF PROBABILITY ANALYSIS
Fig. 9 shows handoff probability of SUs’ services (Pr (HO))
plotted as functions of λP and λF . As can be seen in Fig. 9a,
Pr (HO) is plotted as a function of λP , for both Mode 1 and
Mode 2. In Mode 1, Pr (HO) remains at low level, initially,
and increases exponentially thereafter. After λP > 10,
Pr (HO) slows down. The reason for this type of exhibition
of Pr (HO) in Mode 1 is that, a higher number of channels are
assigned to the RB as traffic load goes on increasing. This
implicitly indicates that a higher number of SURB can be con-
tained by the network. Since SURB is prone to be interrupted
only by PURB or channel failure, not by PUNB , SUNB or any
new service arrivals, its Pr (HO) is low. This low Pr (HO) of
SURB contributes to the overall reduction in Pr (HO) under

VOLUME 8, 2020 63413

 A. U. Khan et al.: HBLP: Hybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT

Algorithm 4 PU Failure Algorithm 5 SU Failure

Input: FCHN , FCHR , SUNB(T) , SUum , PUNB(T) Input: FCHN , FCHR , SUNB(T) , SURB(T) , PUNB(T) ,
Input: SURB(T) = Total number of active SURB SUum
Input: PURB(T) : Total number of active PURB Output: X : The service to be terminated
Output: X : The service to be terminated [1] An SURB service failed
[1] A PUNB service failed [2] SURB(T) = SURB(T) −1
[2] PUNB(T) = PUNB(T) − 1 [3] if FCHR > 0 then
[3] if FCHN > 0 then [4] SURB(T) = SURB(T) + 1
[4] PUNB(T) = PUNB(T) + 1 [5] else if FCHN > 0 then
[5] else if SUNB(T) > 0 then [6] SUNB(T) = SUNB(T) + 1
[6] Call Algorithm 1 [7] else if SUNB(T) > 0 then
[7] SUNB(T) = SUNB(T) − 1 [8] Call Algorithm 1
[8] PUNB(T) = PUNB(T) + 1 [9] Terminate the selected SUNB
[9] if FCHR > 0 then [10] SUNB(T) = SUNB(T) − 1
[10] SURB(T) = SURB(T) + 1 [11] SUum = SUum + 1 (Initiate the UM)
[11] else [12] Replace the SUNB
[12] SUum = SUum + 1 (Initiate the UM) [13] SUNB(T) = SUNB(T) + 1
[13] end [14] else if PUNB(T) > 0 then
[14] else [15] PUNB(T) = PUNB(T) − 1
[15] X = PUNB (Terminate the failed PUNB service) [16] SUNB(T) = SUNB(T) + 1
[16] end [17] X = PUNB
[17] A PURB service failed [18] else
[18] PURB(T) = PURB(T) − 1 [19] SUum = SUum + 1 (Initiate the UM)
[19] if FCHR > 0 then [20] end
[20] PURB(T) = PURB(T) + 1 [21] An SUNB failed
[21] else if FCHN > 0 then [22] SUNB(T) = SUNB(T) −1
[22] PUNB(T) = PUNB(T) + 1 [23] if FCHN > 0 then
[23] else if SUNB(T) > 0 then [24] SUNB(T) = SUNB(T) + 1
[24] Call Algorithm 1 [25] else if FCHR > 0 then
[25] PUNB(T) = PUNB(T) + 1 [26] SURB(T) = SURB(T) + 1
[26] SUNB(T) = SUNB(T) − 1 [27] else
[27] SUum = SUum + 1 (Initiate the UM) [28] SUum = SUum + 1 (Initiate the UM)
[28] else if SURB(T) > 0 then [29] end
[29] Call Algorithm 1
[30] PURB = PURB + 1
[31] SURB(T) = SURB(T) − 1
[32] SUum = SUum + 1 (Initiate the UM) number of channels are kept reserved in Mode 2. Keeping
[33] else a low number of reserved channels implies that there can
[34] X = PURB (Terminate the failed PURB service) be fewer SUs’ services contained in the RB. This factor
[35] end lowers Pr (HO) since the likelihood of termination of SUs’
services in the NB goes on increasing with increase in λP ,
when a small number of channels are reserved. All these
factors contribute to the decrease in Pr (HO), in Mode 2, with
high λP . At low λP , however, Pr (HO) exponentially increases increase in λP .
with increase in λP . This is because Mode 1 reserves a fewer Similarly, in Fig. 9b, Pr (HO) is plotted as a function of λF .
number of channels under low traffic load, and increases the Initially, Mode 2 exhibits a slight decrease in Pr (HO) as
number of reserved channels with increase in traffic load compared to Mode 1. However, at λF = 0.11, both the
which raises the likelihood of handoff for interrupted users. modes share nearly the same value of Pr (HO). After λF >
When operating in Mode 2, Pr (HO) rapidly increases in the 0.11, Pr (HO) gains higher values in Mode 2 as compared
beginning and outvalues the Pr (HO) observed in Mode 1 at to Mode 1. At λF > 0.14, however, again Pr (HO) in
the same value of λP . However, after λP > 4, Pr (HO) Mode 2 assumes lower values as compared to the Pr (HO)
slows down. The reason for such demonstration of Pr (HO) observed in Mode 1.
in Mode 2 is that, in Mode 2, a large number of channels The reason for this type of exhibition of Pr (HO) is that,
are reserved under low traffic load. However, as λP goes a high number of channels are assigned to the RB in Mode 1,
on increasing, the number of reserved channels keeps on as compared to Mode 2, under higher traffic load and channel
decreasing. This implies that, under high traffic load, a fewer failure rate. This suggests that SUs can find a larger share of

63414 VOLUME 8, 2020

A. U. Khan et al.: HBLP: ybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT
FIGURE 4. Retainability for SUs as a function of λP and λF .
the network’s services, in Mode 1, because any interruption
to SUNB leads the interrupted SUNB to make handoff to the
RB, where SURB , because of its priority level, can access any
idle channel available in the network if handoff is required.
Furthermore, SURB can interrupt active PUNB or SUNB when
handoff is required. All these factors lead to the rapid increase
in Pr (HO) with increase in λF in Mode 1.
The reason for the initial quick rise of Pr (HO) in Mode 2 is
that, in Mode 2, a large number of channels are reserved in
the RB, under low traffic load. However, as the arrival rate of
PUs’ services increases, Mode 2 initiates reserving a fewer
number of channels. Since SUNB are prone to interruptions
under new PUs’ arrivals, they are more likely to be terminated
instead of handoff in the face of PUs’ arrivals and channel
failures, given that fewer channels are assigned to the RB. The
only significant contribution for Pr (HO) is made by channel
failures happened to SURB . However, as fewer SURB can be
contained in the network when operating in Mode 2, their
contribution to Pr (HO) is of low level.
It is worth noting that the Pr (HO) analysis made for
Mode 1 and Mode 2, as depicted in Fig. 9, is equally appli-
cable to both BLP and HBLP. It is because of the fact that
VOLUME 8, 2020
FIGURE 5. Network unserviceable probability as a function of λP and λF .
both BLP and HBLP follow the same procedure for channel
reservation and the same hierarchy of service priorities in
channel assignment and interruption or termination.
G. PERFORMANCE EVALUATION UNDER IMPERFECT
SPECTRUM SENSING
In the preceding scenario of the proposed scheme, perfect
spectrum sensing was assumed. However, results achieved
under perfect spectrum sensing do not always coincide
with the results achieved under imperfect spectrum sensing
because of the anomalies in the network functionalities intro-
duced by the latter type of sensing. In this section, we intro-
duce the imperfect spectrum sensing in our model for making
the model more realistic.
In imperfect spectrum sensing, an SU is unable to correctly
detect an ongoing or new arriving PU on the same channel
the particular SU is using. This leads to loss of transmission
power and data in addition to interference generation for
the PU. To formulate this mathematically, we assume that
PUs’ transmission intensity can be characterized by binary
stochastic hypotheses, such that the active and idle channels
are represented by 1 and 0, respectively [49]. Thus, the idle
63415
 A. U. Khan et al.: HBLP: Hybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT

FIGURE 6. Fairness among SUs in the utilization of service time. FIGURE 7. Fairness among SUs in service’s SNIR.

and active state probability of a channel is given by P(H1 ) =

τ/υ and P(H0 ) = (υ − τ )/λ, respectively. The notations The notations λ, N and Erfc(.) indicate threshold value, num-
H0 and H1 represent binary hypothesis for the absence and ber of samples and error function, respectively, whereas σn2
presence of PU, respectively, and are calculated as given and γp indicate noise variance and received PU’s SNR value,
in [50], whereas υ and τ represent the arrival and service time respectively. The received signal X (n) at SU is represented by
of users, respectively, which are modeled using Poisson and (
W (n) : H0
exponential distribution, respectively [51]. X (n) = (32)
The probability that a channel is detected as occupied h.S(n) + W (n) : H1 .
whereas the channel is essentially idle is termed as false The notations W (n), S(n), and h represent the additive white
alarm probability. Similarly, the probability that a channel is Gaussian noise (AWGN), transmitted signal and channel gain
detected as idle whereas the channel is actually in occupied coefficient, respectively. In the following, we illustrate and
stated is termed as miss detection probability. Opposite to discuss the simulation results. It is worth noting that for simu-
the miss detection probability is the detection probability. lation environment, we use the parameters specified by IEEE
Both the probability can be formulated as per the following 802.22 WRAN standard [53], [54]. Moreover, two scenarios,
expressions [52]. perfect spectrum sensing, indicated by zero miss detection
1

υ − N σn2
 probability (Pm = 0), and imperfect spectrum sensing, indi-
Pf = Erfc p . (28) cated by 0.1 probability of miss detection (Pm = 0.1), are
2 2N σn4 analyzed.
υ − N σn2 (1 + γp )
 
1 Fig. 10 indicates channel availability for SUs plotted as
Pd = Erfc q . (29)
2 a function of PU arrival rate under the effects of imperfect
2N σ 4 (1 + γ )2
n p
spectrum sensing. It is shown in the figure that with increase
Pm = 1 − Pd . (30) in the probability of miss detection Pm , channel availability
Pe = Pf + Pm . (31) increases for both Mode 1 and Mode 2. This is because of

63416 VOLUME 8, 2020

A. U. Khan et al.: HBLP: ybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT

FIGURE 8. Fairness among SUs in the utilization of service’s FIGURE 9. Handoff probability as a function of λP and λF .
capacity (bps).

the fact that in the case of miss detections, SUs assume that
the channel under consideration is idle and start using that
channel. Though, after occupation of such channel, and hav-
ing used the channel for a short and specified time duration,
the occupant SU is terminated. Yet this factor adds to the
overall enhancement of channel availability.
Fig. 11 indicates the service capacity of SUs plotted as
a function of PU arrival rates assuming imperfect spectrum
sensing. As shown in the figure, the service capacity is not
significantly changed according to the increase in Pm . The
reason for this is that service capacity indicates the average
number of services completed per unit time. Though high
values of Pm ensure enhancement in channel availability, FIGURE 10. Channel availability vs PU arrival rate under imperfect
the number of services completed per unit time still do not get sensing.
enhanced. It is worth noting that an SU after commencement
of transmission on an already occupied channel is shortly
terminated. Thus, the number of services completed per Pm decreases retainability of services. The reason is
unit time still remains unchanged even under high values that retainability signifies interruptibility, which decreases
of Pm . because of miss detection. Note that once an SU occupies a
Fig. 12 indicates service retainability of SUs plotted as channel under miss detection, such that the channel is being
a function of PU arrival rate, assuming imperfect spec- used by another PU, the SU is shortly interrupted. This factor
trum sensing. It is observed in the figure that increase in leads to decrement in service retainability level.

VOLUME 8, 2020 63417

 A. U. Khan et al.: HBLP: Hybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT
FIGURE 11. Service capacity vs PU arrival rate under imperfect sensing.
FIGURE 12. Service retainability vs PU arrival rate under imperfect
sensing.
FIGURE 13. NUP vs PU arrival rate under imperfect sensing.
Fig. 13 shows NUP for SUs plotted as a function of PU
arrival rate, considering the effects of imperfect spectrum
sensing. As can be seen in the figure, NUP does not signif-
icantly change with increase in Pm . The reason is that NUP
is dominantly the sum of forced termination probability and
blocking probability. Though blocking probability is reduced
63418
as a result of miss detection, forced termination probability
is accordingly increased as an SU using an already occu-
pied channel is shortly terminated. This leads to virtually no
change in NUP even under high values of Pm .
H. CRITICAL DISCUSSION
In this paper, we have proposed a hybrid underlay-interweave
mode enabled scheme to enhance SUE in CRNs. The scheme
utilizes dynamic reservation of channels in order to accom-
modate interrupted users, and allows SUs to switch to the UM
when idle channels are unavailable. The scheme is modeled
using CTMC, and evaluated under various network traffic
loads and channel failure rates. For performance evalua-
tion, essential SUE-related performance metrics including
channel availability, service capacity, service retainability,
handoff and network unserviceable probability are consid-
ered from the perspective of SUs. Moreover, the scheme
is evaluated under the impacts of perfect and imperfect
spectrum sensing. In addition, we have proposed a multi-
attribute based fairness-driven algorithm which facilitates
fairness among SUs’ services in the utilization of network’s
resources in terms of services’ SNIR, services’ capacity
and services’ utilization time. For performance comparison,
BLP scheme [28] is considered.
The numerical results confirm the effectiveness of our
proposed scheme. For instance, a maximum of 22% enhance-
ment is achieved by our proposed scheme in channel avail-
ability. Similarly, service capacity is doubly increased by
our proposed scheme. A reasonable enhancement of 10% is
observed in service retainability. In network unserviceable
probability, as high as 38% improvement is noted. Further-
more, the scheme ably achieves fairness among SUs in the
utilization of network’s resources.
The scheme is ideal for deployment in the 5G-based IoT
where resource constrained devices can take advantage of
the UM of CRN for energy efficiency enhancement. Fur-
thermore, it enables device-to-device communication in a
congested environment where devices need to transmit their
data regularly.
Nonetheless, our proposed scheme bears certain limita-
tions. For instance, the UM is considered for SUs only and,
thus, performance evaluation is made from the standpoint of
SUs. Moreover, only three parameters, such that services’
SNIR, services’ capacity, and service time duration, are used
in the evaluation and selection of services for interruption.
Lastly, the PUs’ services performance enhancement brought
about by Algorithm 1 has not been considered. These limi-
tations are easily addressable and are the focus of our future
work.
VI. CONCLUSION
In this paper, we proposed a hybrid underlay-interweave
mode enabled spectrum efficient scheme for CRNs. The
proposed scheme aims at enhancing spectrum utilization
efficiency for resource constrained secondary users’ devices
to be fitting in applications of the 5G-based IoT. To attain
VOLUME 8, 2020
A. U. Khan et al.: HBLP: ybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT
this objective, the scheme dynamically reserves a number
of channels for accommodating the interrupted services, and
allocates channels to users in a dynamic, efficient and pri-
oritized fashion. Furthermore, we proposed a multi-attribute
based fairness driven algorithm for the selection and inter-
ruption of SUs’ services which maintains fairness among
SUs’ services in the utilization of network’s resources. The
scheme is modeled using CTMC and evaluated for various
spectrum utilization efficiency related QoS parameters under
the effects of various network traffic loads and channel failure
rates. Additionally, the scheme is evaluated under the impacts
of perfect and imperfect spectrum sensing. The numerical
results demonstrate that the proposed scheme significantly
improves all the considered parameters.
In future, the scheme can be further analyzed to character-
ize the performance enhancement of PUs’ services resulting
from the multi-attribute based service selection and inter-
ruption approach of our proposed algorithm. Besides this,
the UM can also be considered for PUs’ services, and mul-
tiple parameters can be included in the service evaluation for
selection and interruption. Lastly, probability of false alarm,
in addition to miss detection probability, can also be incorpo-
rated in spectrum sensing analysis to extend the scheme for
gaining more insightful observations.
REFERENCES
[1] Y. B. Zikria, S. W. Kim, O. Hahm, M. K. Afzal, and M. Y. Aalsalem,
‘‘Internet of Things (IoT) operating systems management: Opportunities,
challenges, and solution,’’ Sensors, vol. 19, no. 8, p. 1793, Apr. 2019.
[2] Y. Xiao, M. Krunz, and T. Shu, ‘‘Multi-operator network sharing for
massive IoT,’’ IEEE Commun. Mag., vol. 57, no. 4, pp. 96–101, Apr. 2019.
[3] Y. Wang, Y. Wang, F. Zhou, Y. Wu, and H. Zhou, ‘‘Resource allocation in
wireless powered cognitive radio networks based on a practical non-linear
energy harvesting model,’’ IEEE Access, vol. 5, pp. 17618–17626, 2017.
[4] F. Hu, B. Chen, and K. Zhu, ‘‘Full spectrum sharing in cognitive radio
networks toward 5G: A survey,’’ IEEE Access, vol. 6, pp. 15754–15776,
2018.
[5] Z. Na, Z. Pan, M. Xiong, X. Liu, W. Lu, Y. Wang, and L. Fan, ‘‘Turbo
receiver channel estimation for GFDM-based cognitive radio networks,’’
IEEE Access, vol. 6, pp. 9926–9935, 2018.
[6] D. Wang, B. Song, D. Chen, and X. Du, ‘‘Intelligent cognitive radio in
5G: AI-based hierarchical cognitive cellular networks,’’ IEEE Wireless
Commun., vol. 26, no. 3, pp. 54–61, Jun. 2019.
[7] X. Zhang, X. Zhang, L. Han, and R. Xing, ‘‘Utilization-oriented spectrum
allocation in an underlay cognitive radio network,’’ IEEE Access, vol. 6,
pp. 12905–12912, 2018.
[8] A. Ali, L. Abbas, M. Shafiq, A. K. Bashir, M. K. Afzal, H. B. Liaqat,
M. H. Siddiqi, and K. S. Kwak, ‘‘Hybrid fuzzy logic scheme for efficient
channel utilization in cognitive radio networks,’’ IEEE Access, vol. 7,
pp. 24463–24476, 2019.
[9] S. Huang, D. Yuan, and A. Ephremides, ‘‘Bandwidth partition and allo-
cation for efficient spectrum utilization in cognitive communications,’’
J. Commun. Netw., vol. 21, no. 4, pp. 353–364, Aug. 2019.
[10] M. Ali and H. Nam, ‘‘Optimization of spectrum utilization in cooperative
spectrum sensing,’’ Sensors, vol. 19, no. 8, p. 1922, 2019.
[11] S. Ghosh, D. De, and P. Deb, ‘‘Energy and spectrum optimization for 5G
massive MIMO cognitive Femtocell based mobile network using auction
game theory,’’ Wireless Pers. Commun., vol. 106, no. 2, pp. 555–576,
May 2019.
[12] F. Li, K.-Y. Lam, Z. Sheng, X. Zhang, K. Zhao, and L. Wang, ‘‘Q-learning-
based dynamic spectrum access in cognitive industrial Internet of Things,’’
Mobile Netw. Appl., vol. 23, no. 6, pp. 1636–1644, 2018.
[13] O. Naparstek and K. Cohen, ‘‘Deep multi-user reinforcement learning for
distributed dynamic spectrum access,’’ IEEE Trans. Wireless Commun.,
vol. 18, no. 1, pp. 310–323, Jan. 2019.
VOLUME 8, 2020
[14] S. Kusaladharma and C. Tellambura, An Overview of Cognitive Radio
Networks. Atlanta, GA, USA: American Cancer Society, 2017, pp. 1–17.
[15] H. Mokhtarzadeh, A. Taherpour, A. Taherpour, and S. Gazor, ‘‘Throughput
maximization in energy limited full-duplex cognitive radio networks,’’
IEEE Trans. Commun., vol. 67, no. 8, pp. 5287–5296, Aug. 2019.
[16] P. Thakur, A. Kumar, S. Pandit, G. Singh, and S. N. Satashia, ‘‘Performance
analysis of high-traffic cognitive radio communication system using hybrid
spectrum access, prediction and monitoring techniques,’’ Wireless Netw.,
vol. 24, no. 6, pp. 2005–2015, Aug. 2018.
[17] F. Mehmeti and T. Spyropoulos, ‘‘Performance analysis, comparison, and
optimization of interweave and underlay spectrum access in cognitive
radio networks,’’ IEEE Trans. Veh. Technol., vol. 67, no. 8, pp. 7143–7157,
Aug. 2018.
[18] P. Zuo, T. Peng, W. Linghu, and W. Wang, ‘‘Optimal resource allocation
for hybrid interweave-underlay cognitive SatCom uplink,’’ in Proc. IEEE
Wireless Commun. Netw. Conf. (WCNC), Apr. 2018, pp. 1–6.
[19] I. A. M. Balapuwaduge, F. Y. Li, and V. Pla, ‘‘Significance of channel
failures on network performance in CRNs with reserved spectrum,’’ in
Proc. IEEE Int. Conf. Commun. (ICC), May 2016, pp. 1–6.
[20] T. Chakraborty and I. S. Misra, ‘‘Design and analysis of channel reserva-
tion scheme in cognitive radio networks,’’ Comput. Electr. Eng., vol. 42,
pp. 148–167, Feb. 2015.
[21] N. M. El Azaly, E. F. Badran, M. R. M. Rizk, and M. A. Mokhtar,
‘‘Performance enhancement of steady-state Markov analysis for cognitive
radio networks via channel reservation,’’ Alexandria Eng. J., vol. 56, no. 4,
pp. 469–475, Dec. 2017.
[22] J. Wang and A. Huang, ‘‘Low-complexity channel reservation design
scheme in cognitive radio networks,’’ in Proc. Int. Conf. Wireless Commun.
Signal Process. (WCSP), Oct. 2012, pp. 1–5.
[23] E. Markova, I. Gudkova, A. Ometov, I. Dzantiev, S. Andreev,
Y. Koucheryavy, and K. Samouylov, ‘‘Flexible spectrum management in a
smart city within licensed shared access framework,’’ IEEE Access, vol. 5,
pp. 22252–22261, 2017.
[24] ECC Report 205. (Feb. 2014). Licensed Shared Access (LSA).
[Online]. Available: https://www.ecodocdb.dk/download/baa4087d-
e404/ECCREP205.PDF
[25] M. Mustonen, M. Matinmikko, M. Palola, S. Yrjölä, and K. Horneman,
‘‘An evolution toward cognitive cellular systems: Licensed shared access
for network optimization,’’ IEEE Commun. Mag., vol. 53, no. 5, pp. 68–74,
May 2015.
[26] A. Ponomarenko-Timofeev, A. Pyattaev, S. Andreev, Y. Koucheryavy,
M. Mueck, and I. Karls, ‘‘Highly dynamic spectrum management within
licensed shared access regulatory framework,’’ IEEE Commun. Mag.,
vol. 54, no. 3, pp. 100–109, Mar. 2016.
[27] A. Chouayakh, A. Bechler, I. Amigo, L. Nuaymi, and P. Maillé, ‘‘Auc-
tion mechanisms for licensed shared access: Reserve prices and revenue-
fairness trade offs,’’ ACM SIGMETRICS Perform. Eval. Rev., vol. 46, no. 3,
pp. 43–48, Jan. 2019.
[28] I. A. M. Balapuwaduge, F. Y. Li, and V. Pla, ‘‘Dynamic spectrum reser-
vation for CR networks in the presence of channel failures: Channel allo-
cation and reliability analysis,’’ IEEE Trans. Wireless Commun., vol. 17,
no. 2, pp. 882–898, Feb. 2018.
[29] F. Gebali, Analysis of Computer Networks, 2nd ed. Cham, Switzerland:
Springer, 2015.
[30] K. Zheng, L. Zhao, J. Mei, B. Shao, W. Xiang, and L. Hanzo, ‘‘Survey of
large-scale MIMO systems,’’ IEEE Commun. Surveys Tuts., vol. 17, no. 3,
pp. 1738–1760, 3rd Quart., 2015.
[31] Y. Xu, A. Anpalagan, Q. Wu, L. Shen, Z. Gao, and J. Wang, ‘‘Decision-
theoretic distributed channel selection for opportunistic spectrum access:
Strategies, challenges and solutions,’’ IEEE Commun. Surveys Tuts.,
vol. 15, no. 4, pp. 1689–1713, 4th Quart., 2013.
[32] C. Altay, H. B. Yilmaz, and T. Tugcu, ‘‘Cooperative sensing analysis under
imperfect reporting channel,’’ in Proc. IEEE Symp. Comput. Commun.
(ISCC), Jul. 2012, pp. 770–775.
[33] T. Yucek and H. Arslan, ‘‘A survey of spectrum sensing algorithms for
cognitive radio applications,’’ IEEE Commun. Surveys Tuts., vol. 11, no. 1,
pp. 116–130, 1st Quart., 2009.
[34] X. Li, Q. Zhao, X. Guan, and L. Tong, ‘‘Optimal cognitive access of
Markovian channels under tight collision constraints,’’ IEEE J. Sel. Areas
Commun., vol. 29, no. 4, pp. 746–756, Apr. 2011.
[35] D. Niyato, E. Hossain, and P. Wang, ‘‘Optimal channel access management
with QoS support for cognitive vehicular networks,’’ IEEE Trans. Mobile
Comput., vol. 10, no. 4, pp. 573–591, Apr. 2011.
63419
 A. U. Khan et al.: HBLP: Hybrid Underlay-Interweave Mode CRN for the Future 5G-Based IoT
[36] Z. Hasan, H. Boostanimehr, and V. K. Bhargava, ‘‘Green cellular networks:
A survey, some research issues and challenges,’’ IEEE Commun. Surveys
Tuts., vol. 13, no. 4, pp. 524–540, 4th Quart., 2011.
[37] Q. Zhao, S. Geirhofer, L. Tong, and B. M. Sadler, ‘‘Opportunistic spectrum
access via periodic channel sensing,’’ IEEE Trans. Signal Process., vol. 56,
no. 2, pp. 785–796, Feb. 2008.
[38] R. N. Yadav, R. Misra, and S. Bhagat, ‘‘Spectrum access in cognitive smart-
grid communication system with prioritized traffic,’’ Ad Hoc Netw., vol. 65,
pp. 38–54, Oct. 2017.
[39] W. Ahmed, J. Gao, and M. Faulkner, ‘‘Performance evaluation of a cogni-
tive radio network with exponential and truncated usage models,’’ in Proc.
4th Int. Symp. Wireless Pervas. Comput., Feb. 2009, pp. 1–5.
[40] S. L. Castellanos-Lopez, F. A. Cruz-Pérez, and G. Hernandez-Valdez,
‘‘Performance of cognitive radio networks under ON/OFF and Poisson
primary arrival models,’’ in Proc. IEEE 22nd Int. Symp. Pers., Indoor
Mobile Radio Commun., Sep. 2011, pp. 609–613.
[41] T. M. C. Chu, H. Phan, and H. Zepernick, ‘‘On the performance of
underlay cognitive radio networks using M/G/1/K queueing model,’’ IEEE
Commun. Lett., vol. 17, no. 5, pp. 876–879, May 2013.
[42] Y. Gao and Y. Jiang, ‘‘Performance analysis of a cognitive radio network
with imperfect spectrum sensing,’’ in Proc. IEEE Conf. Comput. Commun.
Workshops (INFOCOM), Mar. 2010, pp. 1–6.
[43] E. W. M. Wong and C. Foh, ‘‘Analysis of cognitive radio spectrum
access with finite user population,’’ IEEE Commun. Lett., vol. 13, no. 5,
pp. 294–296, May 2009.
[44] T. Jiang, H. Wang, M. Daneshmand, and D. Wu, ‘‘Cognitive radio-based
smart grid traffic scheduling with binary exponential backoff,’’ IEEE Inter-
net Things J., vol. 4, no. 6, pp. 2038–2046, Dec. 2017.
[45] K. A. Mehr, J. M. Niya, and N. Akar, ‘‘Queue management for two-
user cognitive radio with delay-constrained primary user,’’ Comput. Netw.,
vol. 142, pp. 1–12, Sep. 2018.
[46] F.-H. Tseng, L.-D. Chou, H.-C. Chao, and J. Wang, ‘‘Ultra-dense small
cell planning using cognitive radio network toward 5G,’’ IEEE Wireless
Commun., vol. 22, no. 6, pp. 76–83, Dec. 2015.
[47] S. Jing, D. N. C. Tse, J. B. Soriaga, J. Hou, J. E. Smee, and R. Padovani,
‘‘Multicell downlink capacity with coordinated processing,’’ EURASIP J.
Wireless Commun. Netw., vol. 2008, no. 1, Dec. 2008, Art. no. 586878.
[48] L. Jiao, I. A. M. Balapuwaduge, F. Y. Li, and V. Pla, ‘‘On the performance
of channel assembling and fragmentation in cognitive radio networks,’’
IEEE Trans. Wireless Commun., vol. 13, no. 10, pp. 5661–5675, Oct. 2014.
[49] M. T. Masonta, M. Mzyece, and N. Ntlatlapa, ‘‘Spectrum decision in
cognitive radio networks: A survey,’’ IEEE Commun. Surveys Tuts., vol. 15,
no. 3, pp. 1088–1107, 3rd Quart., 2013.
[50] Y.-C. Liang, Y. Zeng, E. C. Y. Peh, and A. T. Hoang, ‘‘Sensing-throughput
tradeoff for cognitive radio networks,’’ IEEE Trans. Wireless Commun.,
vol. 7, no. 4, pp. 1326–1337, Apr. 2008.
[51] S. M. Kay, Fundamentals of Statistical Signal Processing.
Upper Saddle River, NJ, USA: Prentice-Hall, 1993.
[52] S. Atapattu, C. Tellambura, and H. Jiang, ‘‘Spectrum sensing via energy
detector in low SNR,’’ in Proc. IEEE Int. Conf. Commun. (ICC), Jun. 2011,
pp. 1–5.
[53] A. Kumar, P. Thakur, S. Pandit, and G. Singh, ‘‘Analysis of optimal thresh-
old selection for spectrum sensing in a cognitive radio network: An energy
detection approach,’’ Wireless Netw., vol. 25, no. 7, pp. 3917–3931,
Oct. 2019.
[54] P. Thakur, A. Kumar, S. Pandit, G. Singh, and S. Satashia, ‘‘Analysis of
high-traffic cognitive radio network with imperfect spectrum monitoring
technique,’’ Comput. Netw., vol. 147, pp. 27–37, Dec. 2018.
ABD ULLAH KHAN received the B.S. degree
(Hons.) in telecommunication from the University
of Science & Technology Bannu, in 2013, and the
M.S. degree in electrical engineering from COM-
SATS University Islamabad, Pakistan, in 2016. He
is currently pursuing the Ph.D. degree from the
GIK Institute of Engineering Sciences and Tech-
nology, Pakistan. Part of his Ph.D. degree is from
the National University of Science of Sciences and
Technology, Islamabad. He is currently an Active
Member with the Telecommunications and Networking (TeleCoN) Research
Laboratory, GIK Institute of Engineering Sciences and Technology. His
research interests include wireless sensor networks, body area networks,
cognitive radio networks, and vehicular ad hoc networks.
63420
GHULAM ABBAS (Senior Member, IEEE)
received the B.S. degree in computer science from
the University of Peshawar, Pakistan, in 2003,
and the M.S. degree in distributed systems and
the Ph.D. degree in computer networks from the
University of Liverpool, U.K., in 2005 and 2010,
respectively. He was a Research Associate with
Liverpool Hope University, U.K. Since 2011, he
has been with the Faculty of Computer Sciences
and Engineering, GIK Institute of Engineering
Sciences and Technology, Pakistan. He is currently working as an Associate
Professor and the Director of the Huawei ICT Academy, GIK Institute of
Engineering Sciences and Technology. He is a Co-Founding Member of the
Telecommunications and Networking (TeleCoN) Research Laboratory, GIK
Institute of Engineering Sciences and Technology. His research interests
include computer networks, and wireless and mobile communications. He
is a Fellow of the Institute of Science and Technology, U.K. and the British
Computer Society.
ZIAUL HAQ ABBAS received the M.Phil. degree
in electronics from Quaid-e-Azam University,
Pakistan, in 2001, and the Ph.D. degree from the
Agder Mobility Laboratory, Department of Infor-
mation and Communication Technology, Univer-
sity of Agder, Norway, in 2012. He was a Visiting
Researcher with the Department of Electrical and
Computer Engineering, University of Minnesota,
USA. He is currently an Associate Professor with
the Faculty of Electrical Engineering and a Co-
Founding Member of the Telecommunications and Networking (TeleCoN)
Research Laboratory, GIK Institute of Engineering Sciences and Technology.
His research interests include energy efficiency in hybrid mobile and wireless
communication, 5G mobile systems, ad hoc networks, traffic engineering in
wireless networks, performance evaluation of communication protocols and
networks by analysis and simulation, and cognitive radio.
MUHAMMAD TANVEER received the M.S.
degree in computer science, in 2017. He is
currently pursuing the Ph.D. degree in computer
science from the GIK Institute of Engineering Sci-
ences and Technology, Pakistan. He is a mem-
ber of the Telecommunications and Networking
(TeleCoN) Research Laboratory, GIK Institute
of Engineering Sciences and Technology. His
research interests include communication net-
works and network security.
SAMI ULLAH received the M.S. degree in
computer science from the IBMS, The Univer-
sity of Agriculture, Peshawar, Pakistan. He is
currently pursuing the Ph.D. degree in com-
puter Science with the Ghulam Ishaq Khan
Institute of Engineering Sciences and Technol-
ogy (GIKI), Topi, Pakistan. He is also a Lec-
turer with Shaheed Benazir Bhutto University,
Sheringal, Pakistan. He is a member of the
Telecommunications and Networking (TeleCoN)
Research Laboratory, GIK Institute of Engineering Sciences and Technology.
ALAMGIR NAUSHAD received the B.S. degree
in computer systems engineering from the Uni-
versity of Engineering and Technology, Peshawar,
Pakistan, in 2011, and the M.S. and Ph.D. degrees
in computer system engineering from the GIK
Institute of Engineering Sciences and Technology,
Pakistan, in 2014 and 2019, respectively. He is
currently an Assistant Professor with the National
University of Sciences and Technology, Quetta,
Pakistan, and a member of the Telecommunica-
tions and Networking (TeleCoN) Research Laboratory, GIK Institute of
Engineering Sciences and Technology. His research interests include mobile
ad hoc and cellular networks.
VOLUME 8, 2020