Channel availability and queuing aware earliest deadline first scheduling alogrithm in cognitive radio network

Cognitive Radio Networks (CRNs) provide a solution for the spectrum scarcity problem facing modern wireless communications. However, compared with the traditional networks, cognitive radio networks exhibit some distinct features, which result in necessity of further research in the resource allocati...

Full description

Saved in:

Bibliographic Details
Main Author:	Sheikh Ahmed, Burhan Omar
Format:	Thesis
Language:	English
Published:	2013
Subjects:	TK Electrical engineering Electronics Nuclear engineering
Online Access:	http://eprints.utm.my/id/eprint/33769/5/BurhanOmarSheikhAhmedMFKE2013.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.33769
record_format	uketd_dc
spelling	my-utm-ep.337692017-09-17T03:56:17Z Channel availability and queuing aware earliest deadline first scheduling alogrithm in cognitive radio network 2013-01 Sheikh Ahmed, Burhan Omar TK Electrical engineering. Electronics Nuclear engineering Cognitive Radio Networks (CRNs) provide a solution for the spectrum scarcity problem facing modern wireless communications. However, compared with the traditional networks, cognitive radio networks exhibit some distinct features, which result in necessity of further research in the resource allocation and scheduling that have been solved for the traditional networks. The basic concept of CRNs relies on utilizing the unused spectrum of a primary network, without interfering with the activity of primary users (PUs). Therefore, an effective scheduling algorithm is needed in order to manage the opportunistically available resources and provide the necessary Quality of Service (QoS) for different traffic classes for secondary users. In this work, we focus on link queue aware earliest deadline first scheduling in a single cell cognitive radio system. The purpose of this work is to investigate how CAQA-EDF algorithm satisfies the QoS for various secondary user traffic. A buffer selection criterion is introduced together with the channel availability to adjust the priority of different cognitive radio user traffic to be selected for service. Extensive simulations have been carried out and important performance metrics are investigated in the simulation, such as the system throughput, fairness and sevice delay time and are quantified by the impact of PU channel availability. Simulation result shows that all traffics are scheduled before missing their deadline, despite giving rtPS default scheduling, nrtPS and BE are served before their deadline. In terms of throughput, PU activity effect the overall throughput, the result shows that lower PU active period and high probability of detection with lower false alarm increases the throughput. Finally, fairness is achieved for all traffic and no starvation happened during packet transmission. 2013-01 Thesis http://eprints.utm.my/id/eprint/33769/ http://eprints.utm.my/id/eprint/33769/5/BurhanOmarSheikhAhmedMFKE2013.pdf application/pdf en public masters Universiti Teknologi Malaysia, Faculty of Electrical Engineering Faculty of Electrical Engineering
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	TK Electrical engineering Electronics Nuclear engineering
spellingShingle	TK Electrical engineering Electronics Nuclear engineering Sheikh Ahmed, Burhan Omar Channel availability and queuing aware earliest deadline first scheduling alogrithm in cognitive radio network
description	Cognitive Radio Networks (CRNs) provide a solution for the spectrum scarcity problem facing modern wireless communications. However, compared with the traditional networks, cognitive radio networks exhibit some distinct features, which result in necessity of further research in the resource allocation and scheduling that have been solved for the traditional networks. The basic concept of CRNs relies on utilizing the unused spectrum of a primary network, without interfering with the activity of primary users (PUs). Therefore, an effective scheduling algorithm is needed in order to manage the opportunistically available resources and provide the necessary Quality of Service (QoS) for different traffic classes for secondary users. In this work, we focus on link queue aware earliest deadline first scheduling in a single cell cognitive radio system. The purpose of this work is to investigate how CAQA-EDF algorithm satisfies the QoS for various secondary user traffic. A buffer selection criterion is introduced together with the channel availability to adjust the priority of different cognitive radio user traffic to be selected for service. Extensive simulations have been carried out and important performance metrics are investigated in the simulation, such as the system throughput, fairness and sevice delay time and are quantified by the impact of PU channel availability. Simulation result shows that all traffics are scheduled before missing their deadline, despite giving rtPS default scheduling, nrtPS and BE are served before their deadline. In terms of throughput, PU activity effect the overall throughput, the result shows that lower PU active period and high probability of detection with lower false alarm increases the throughput. Finally, fairness is achieved for all traffic and no starvation happened during packet transmission.
format	Thesis
qualification_level	Master's degree
author	Sheikh Ahmed, Burhan Omar
author_facet	Sheikh Ahmed, Burhan Omar
author_sort	Sheikh Ahmed, Burhan Omar
title	Channel availability and queuing aware earliest deadline first scheduling alogrithm in cognitive radio network
title_short	Channel availability and queuing aware earliest deadline first scheduling alogrithm in cognitive radio network
title_full	Channel availability and queuing aware earliest deadline first scheduling alogrithm in cognitive radio network
title_fullStr	Channel availability and queuing aware earliest deadline first scheduling alogrithm in cognitive radio network
title_full_unstemmed	Channel availability and queuing aware earliest deadline first scheduling alogrithm in cognitive radio network
title_sort	channel availability and queuing aware earliest deadline first scheduling alogrithm in cognitive radio network
granting_institution	Universiti Teknologi Malaysia, Faculty of Electrical Engineering
granting_department	Faculty of Electrical Engineering
publishDate	2013
url	http://eprints.utm.my/id/eprint/33769/5/BurhanOmarSheikhAhmedMFKE2013.pdf
_version_	1747816180621508608

Channel availability and queuing aware earliest deadline first scheduling alogrithm in cognitive radio network

Similar Items