Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks

Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks

Bibliographic Details
Main Author: Swami, Sameer
Language:English
Published: University of Cincinnati / OhioLINK 2008
Subjects:
Computer Science
Cognitive radios
channel allocation
greedy priority optimization
Online Access:http://rave.ohiolink.edu/etdc/view?acc_num=ucin1223916863
id ndltd-OhioLink-oai-etd.ohiolink.edu-ucin1223916863
record_format oai_dc
spelling ndltd-OhioLink-oai-etd.ohiolink.edu-ucin12239168632021-08-03T06:12:52Z Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks Swami, Sameer Computer Science Cognitive radios channel allocation greedy priority optimization <p>In this thesis work, we focus on the design of a new channel allocation mechanism for the Cognitive Radio based xG networks, based on graph theory. We propose division of the users as well as the channels on the basis of the quality of service constraints. We then analyze the performance of our mechanism incrementally in two steps: (a) Channel allocation in a static environment. (b) Channel allocation in a dynamic environment. In the first scenario, we assume a static channel configuration, wherein the primary users' behavior has been strictly defined according to a schedule. We analyze the performance of our scheme in such an environment taking into account the various performance measures like packet drop rate. We compare our scheme against the bare bones scheme where no priorities are taken into account while allocating channels. </p><p>In the second part of our work, we simulate the performance of our algorithm in a dynamic environment, where the behavior of the primary users is arbitrary. In such a scenario, the algorithm must adapt to take into account the changing channel qualities which directly impact the users. We again compare our scheme based on graph theory, against the bare bones scheme where the priorities aren't taken into account as well as against the greedy scheme which simply serves the users based upon their priorities. We show that our approach delivers vast improvements in packet drop rates compared to the random channel allocation scheme.</p> 2008 English text University of Cincinnati / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=ucin1223916863 http://rave.ohiolink.edu/etdc/view?acc_num=ucin1223916863 unrestricted This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws.
collection NDLTD
language English
sources NDLTD
topic Computer Science
Cognitive radios
channel allocation
greedy priority optimization
spellingShingle Computer Science
Cognitive radios
channel allocation
greedy priority optimization
Swami, Sameer
Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks
author Swami, Sameer
author_facet Swami, Sameer
author_sort Swami, Sameer
title Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks
title_short Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks
title_full Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks
title_fullStr Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks
title_full_unstemmed Graph Theoretic Approach to QoS Guaranteed Spectrum Allocation in Cognitive Radio Networks
title_sort graph theoretic approach to qos guaranteed spectrum allocation in cognitive radio networks
publisher University of Cincinnati / OhioLINK
publishDate 2008
url http://rave.ohiolink.edu/etdc/view?acc_num=ucin1223916863
work_keys_str_mv AT swamisameer graphtheoreticapproachtoqosguaranteedspectrumallocationincognitiveradionetworks
_version_ 1719432877579436032

Similar Items