International Journal of Pure and Applied Mathematics

Volume 120 No. 6 2018, 4467-4476

ISSN: 1314-3395 (on-line version)
url: http://www.acadpubl.eu/hub/
Special Issue
http://www.acadpubl.eu/hub/

DYNAMIC RESOURCE
ALLOCATION BASED ON PRIORITY
SCHEDULING FOR
HETEROGENEOUS COGNITIVE
RADIO NETWORKS WITH
IMPERFECT CHANNEL SENSING
G. Ezra Sastry1 , S.Tamilarasan2 ,
Dr.P.Kumar3 ,
1
Assistant Professor, dept. of CSE
Narasaraopeta Engineering College,
Narasaraopet, Andhra Pradesh, India.
gezrasastry99@gmail.com
2
Research Scholar,
CITE, Manonmaniam Sundaranar University,
Tirunelveli, Tamilnadu, India
stamilarasan74@rediffmail.com
3
Assistant Professor, CITE,
Manonmaniam Sundaranar University,
Tirunelveli, Tamilnadu, India
kumarcite@gmail.com
June 26, 2018

Abstract
Resources in cognitive radio network (CRN) can be
allocated dynamically based on the sensed radio
information. However, the rapid development of wireless

4467
International Journal of Pure and Applied Mathematics Special Issue

communication system meets serious scarcity of spectrum

utilization in the networks. The cognitive radio (CR) is a
rapidly developing a new technology and provides a
greater solution to the serious scarcity problem. Channel
selection and spectrum sensing are plays a vital role in
CRN. Practically, it is extremely difficult for the
secondary-network (SN) to require a great awareness
about a dynamic radio atmosphere in CRNs. In this paper
we formulate dynamic resource allocation based on priority
scheduling in heterogeneous CRN (DRABPSH-CRN).
However, we can focus on optimal resource allocations and
scheduling for primary-user (PU) and secondary-user (SU)
and we should improve the whole performance of the
network and reduces the interference at PU and also to
improve the maximum throughput and reduce the risk of
overlapping the coverage of CRNs. The effectiveness of
DRABPSH-CRN is compared with existing DRA-CRN
and is to be found 26% of improved performance with ns-2
simulation.
Keywords:CRN, DSA, SINR, CQI.

1 INTRODUCTION
Wireless communication technology is a new developing scientific
knowledge of framework but it meets serious scarcity problem of
spectrum utilization. The CR is a smart and emerging technology
which provides greater offers to the serious scarcity spectrum
utilization problem [1]. The CRN have primary networks (PNs)
and secondary networks (SNs). PN consist of PUs and PBS. The
SN consists of SNs and SBS [2]. Cognitive nodes (CNDs) can be
utilize the spectrum opportunistically by monitoring the PUs
(Licensed Users) channel and sensing the idle channels for
effective utilization of the SUs (Unlicensed Users) when the PUs
absent. The detection of PU signals should be accomplished by
spectrum sensing, the use of geolocation database or the
combination of both [1]. They offered cluster aggregation-based
cooperative routing protocol for channel states which was
operated in two class A and B. the class A operation used to
improve the throughput and minimized the power used and class
B operation reduced end to end delay and not used priority

4468
International Journal of Pure and Applied Mathematics Special Issue

scheduling [3]. They proposed two solutions for channel allocation

to SUs; centralized algorithm is used to take decision of power
transmission between all SUs in the given networks. This
algorithm reduced time requirement at SUs. Another solution to
updates the transmission power among the SUs. The forecasting
engine based neural network systems offered to improve the SUs
ability to know the cognitive environment to improve the SUs
performance in the networks [4].
They offered optimal and cooperating algorithm to improve
power allocation among the SUs in the given networks [5]. They
offered the Distributed Consensus Algorithm for starting and
preserving local control planes between cooperative neighbor CRs
[6]. In [7] offered cooperative spectrum sensing algorithm to
achieving accurate spectrum availability in network for effective
utilization. In [8] offered two solutions for dynamic resource
allocation is power-pricing model without game theory and a
non-cooperative game theory to achieve significant power
transmission between cognitive users. In [9] offered preferable
channel list algorithm to select the channels while it playing
dominating role in the CRN. In [10] offered an algorithm to divide
the design problem into three convex sub-problems, and solve
them iteratively until convergence for resource allocation in CRN.

2 PROBLEM IDENTIFICATION
AND SOLUTION
From this survey of related works, we should be decided that no
works based on the hybrid network development like resource
planning to distribution in heterogeneous CRN dynamically. It
should be a great task to replicate varied facility through CRNs to
distribute the resources and dispense the frequency to each node
is located in the available system [11]. Now, we should consider
the SU with the requirement of disparate rate and the
requirements of delay is ignored. While the communication we
can sense the channel using channel quality indicator (CQI) which
must estimate condition of the channel to making well-organized
transmission system [11].
In this paper we can formulate the algorithm of dynamic

4469
International Journal of Pure and Applied Mathematics Special Issue

resource distribution with precedence queue scheduling for

dissimilar service in CRN. The CRN networks generally have PU
and SU with different requirements in a heterogeneous network.
The SBS in the given network is responsible for resource
distribution to distinct current SUs. The SUs can be characterized
like, minimum-rate-guarantee of SUs (SUsMinRaG),
minimum-delay-guarantee of SUs (SUs-MinDeG),
minimum-rate-and-delay-guarantee of SUs (SUs-MinRaDeG) and
best-effort-service of SUs (SUs-BstEfoSer). The objective function
of SU should be satisfied the following constraints while the
resource allocation.

• The total power of all channels transmitted of SUs should

have the required amount of power at SBS.

• SUs-MinRaG, the broadcast rate of SUs should have more

than the boundary of the base-rate

• SUs-MinDeG, the broadcast rate of SUs should have lower

than the target-threshold.

• SUs-MinRaDeG, the degree of transmission should have

larger than the minimum-rate-threshold and the delay of
communication shouldnt precisely the threshold-of-deadline.

• SUs-BstEfoSer, fairness restriction must be fulfilled.

We should have measure the quality of frequency using

channel-quality-indicator (CQI) during the transmission in terms
of the signal-to-interference-plus-noise-ratio (SINR). The proposed
DRABPSH-CRN algorithm measures every incoming packets
priority. The priority of the packets measurements based on the
type of service and queuing delay. The measured and estimated
value of CQI for all incoming streams of packets through
increasing the precedence through the frequency improvement and
stored in descending order. The highest priority standards of the
packet stream are assigned to the SUs-MinRaDeG monitored
through MinRaG and MinDeG. The minimum precedence is
allocated to SUs-BstEfoSer [11].

4470
International Journal of Pure and Applied Mathematics Special Issue

3 PROPOSED SOLUTION
The CRN network consists of PN and SN. The PN and SN in
CRN worked in the method of time-slotted fashion. We considered
that the PN and SN are used the orthogonal frequency-division
multiple access (OFDMA) methodology. The SBS in SN should
claim the frequency sensing information and it will regulate the
resource distribution to SUs in CRN. The frequency band
registered (licensed) to the PN is separated into M sub-channels.
The SN should sense the M sub channels in every time slots and
opportunistically exploits the available sub-channels. The CQI
continuously monitors the channel quality during the idle PUs
channels are utilized by the SUs. The SU in SN can handovers the
channel to the PUs whenever the PUs sensed rapidly. We adopt
that the SBS sanities Num (Num≤M) indolent sub-channels in
every time-slot. The DRABPSH-CRN has lower priority and
higher priority users. Throughout the broadcast, the lower
precedence users should to hand-off when higher precedence users
seemed. Through the hand-off practice, the preempted user has to
be temporarily broken broadcast until a new offered channel is
exposed and formerly, the unnished trafc is effectively transferred
to the new channel. Now waiting time is presented which includes
the hand-off delay and the delay of channel selection.
For all inward streams, the packets precedence is about relying
on the CQI and the delay of queuing system. Formerly, the
subordinate objective function is inevitable for every stream
through increasing the precedence with channel expansion. The
stream of the inward packets are sorted within the dropping
direction for the scheming values, formerly it allotted to the
particular kind of SUs. The packet-stream with uppermost
precedence objective function is assigned to the SUs-MinRaDeG,
charted by SUs-MinRaG and SUs-MinDeG. The packet-stream
with smallest precedence objective function is allotted to
SUs-BstEfoSer.

A. Proposed Algorithm
Step 1: determine the N sub channels (SUK1 and K2)
Step 2: SU in SN generate request to SBS for channel allocation.
SBS included channel sensing algorithm

4471
International Journal of Pure and Applied Mathematics Special Issue

Step 3: SBS checks the channel information from CQI estimated

values and compare with threshold value at SBS
If (CQI≯ Threshold value, then Requested terminated
Step 4: Check the priority value assigned to all SU and the
highest priority node is selected from the queue database at SBS
Step 5: Update the priority values
Step 6: Checks the size of queue
If the queue size ≮ threshold value, then Got step 4
Step 7: The highest priority SUs in SN are received idle channel
and least size of queue
Step 8: Check the energy of communicated streams which is less
than total-energy owed to the channel
Step 9: Then data transmission will take place
Step 10: Distributed-energy will takes place for the SUs selected
through the sub-channel
Step 11: Then data transmission will take place
Step 12: Check CQI at SBS
If CQI is not equal to Threshold rate, then
Step 13: Requested finished
Step 14: Got step 4

B. Existing Algorithm
Step 1: Specify the n sub-channels of SUs K1 and K2
Step 2: Claim the current availability of PU by sensing tools
If the claimed sensing information is true, then handoff
Step 3: Claim the available free channel by sensing information
and make the channel allocation to SU
Step 4: Claim the existence channel of PU by sensing tools
If it is true, then handoff
Step 5: Power allocation will take place to the given SU
Step 6: Intellect the existence of PU
If it is true, then handoff
Step 7: Data broadcast will carry on
Step 8: Intellect the existence of PU
If it is true, then handoff

4472
International Journal of Pure and Applied Mathematics Special Issue

4 SIMULATION RESULT
The proposed system was implemented by using NS2 simulator.
Here we may consider IEEE 802.11 protocol on MAC layer for data
transmission in heterogeneous CRN. The network setup measured
for the simulation is 1000m X 1000m over a flat area and required
simulation time is 70 seconds. Every node should have the equal
range of broadcast is 250 meters. The constant bit rate (CBR) is
used for simulation traffic with a packet size of 512 B.

Figure 1: Channel Vs. Throughput

We gave the correlation investigation of two calculations; the

offered calculation DRABPSH-SRN is having more noteworthy
throughput than DRA-CRN. This accomplishes our proposed
calculation is giving one stage forward answer for the present
situation in CRN. Our proposed arrangement gives the most
extreme throughput over the speed as it increments thusly (Fig
1). In our proposed procedure, throughput in DRABPSH-CRN is
41% more profitable with changing the amount of dormant
channels from 20 occupies to 100 coordinates in the given
framework.

5 CONCLUSION
The proposed DRABPSH-SRN achieves a superior execution with
the sharp reception apparatuses and transmission channels
determination technique which is fulfilled the scholarly properties

4473
International Journal of Pure and Applied Mathematics Special Issue

of systems line reasonableness and postpone limitations. In

recreation result, DRABPSH-SRN has been discovered quicker
throughput than DRA CRN. Proposed calculation limited the
impedance at PU. Henceforth the execution of the whole system
has improved better.

References
[1] Zaheer Khan, Janne J. Lehtomaki, Luiz A. DaSilva, Ekram
Hossain, Matti Latva-Aho, “Opportunistic Channel Selection
by Cognitive Wireless Nodes Under Imperfect Observations
and Limited Memory: A Repeated Game Model”, IEEE
Transactions On Mobile Computing, Vol. 15, NO. 1, January
2016, pp.: 173-187.

[2] S.Tamilarasan, P.Kumar, “Appropriate Dynamic Channel

Allocation based on priority scheduling in heterogeneous
cognitive radio networks”, International Journal of Computer
Sciences and Engineering Vol.-4(12), Dec 2016, pp.: 46-50.

[3] A.Devi.B.E, K.Jayarajan.M.E, A.Sabari.M.Tech, “Improve

the Energy Efficiency in Cognitive Radio Sensor Network using
Spectrum Allocation”, International Journal of Computer
Engineering and Information Technology, VOL. 8, NO. 11,
November 2016, pp. 208212

[4] Ahmed Mohamedou, Aduwati Sali, Borhanuddin Ali,

Mohamed Othman, “Dynamical Spectrum Sharing and
Medium Access Control for Heterogeneous Cognitive Radio
Networks”, International Journal of Distributed Sensor
Networks, Volume 2016, pp. 1-15

[5] Mehdi Ghamari Adian, Mahin Ghamari Adyan, “Optimal

and Suboptimal Resource Allocation in MIMO Cooperative
Cognitive Radio Networks”, Journal of Optimization, Volume
2014, pp.1-14.

[6] Paulo M. R. dos Santos, Mohamed A. Kalil, Oleksandr

Artemenko, Anastasia Lavrenko, Andreas Mitschele-Thiel,
“Self-Organized Common Control Channel Design for

4474
International Journal of Pure and Applied Mathematics Special Issue

Cognitive Radio Ad Hoc Networks”, 2013 IEEE 24th

International Symposium on Personal, Indoor and Mobile
Radio Communications: Mobile and Wireless Networks, pp.
2419-2423.

[7] Uthpala Subodhani Premarathne, Ibrahim Khalil, Mohammed

Atiquzzaman, “Trust based reliable transmission strategies for
smart home energy management in cognitive radio based smart
grid”, Ad Hoc Networks, 2015, pp. 1-15.

[8] Mahmoud Khasawneh, Saed Alrabaee, Anjali Agarwal,

Nishith Goel, Marzia Zaman, “Power trading in cognitive radio
networks”, Journal of Network and Computer Applications,
2016, pp. 1-12.

[9] Minal S. Moon, Veena A. Gulhane, “Preferable channel list

based channel selection in cognitive radio network”, IRACST
International Journal of Computer Networks and Wireless
Communications (IJCNWC), Vol.6, No 2, 2016, pp. 115-119.

[10] Guangchi Zhang, Xueyi Li, Miao Cui, Guangping Li, Yizhi
Tan, “Transceiver design for cognitive multi-user MIMO
multi-relay networks using imperfect CSI”, Int. J. Electron.
Commun. (AE), 2016, pp. 1-14.

[11] R. Xie, F. R. Yu, H. Ji, “Dynamic Resource Allocation for

Heterogeneous Services in Cognitive Radio Networks With
Imperfect Channel Sensing”, IEEE Transactions On Vehicular
Technology, Vol. 61, NO. 2, February 2012, PP: 770-780.

4475
4476