A Cluster-based Link Recovery Mechanism for Spectrum Aware On-demand Routing in Cognitive Radio Ad Hoc Networks

碩士 === 國立成功大學 === 電腦與通信工程研究所 === 100 === In cognitive radio ad hoc networks (CRAHNs), link failures among secondary users (SUs) primarily result from sudden appearance of primary users (PUs). Many researches about routing protocols in CRAHNs apply on-demand routing protocols. They usually adopt the...

Full description

Bibliographic Details
Main Authors: Chih-ChiehTang, 湯智傑
Other Authors: Kuo-Feng Ssu
Format: Others
Language:en_US
Published: 2012
Online Access:http://ndltd.ncl.edu.tw/handle/73131919527336284561
id ndltd-TW-100NCKU5652050
record_format oai_dc
spelling ndltd-TW-100NCKU56520502015-10-13T21:38:02Z http://ndltd.ncl.edu.tw/handle/73131919527336284561 A Cluster-based Link Recovery Mechanism for Spectrum Aware On-demand Routing in Cognitive Radio Ad Hoc Networks 在感知無線隨意網路中針對頻譜認知按需路由的叢集式鏈結修復機制 Chih-ChiehTang 湯智傑 碩士 國立成功大學 電腦與通信工程研究所 100 In cognitive radio ad hoc networks (CRAHNs), link failures among secondary users (SUs) primarily result from sudden appearance of primary users (PUs). Many researches about routing protocols in CRAHNs apply on-demand routing protocols. They usually adopt the route recovery process of traditional on-demand routing protocols without modification in CRAHNs. In traditional route recovery process, nodes with link failure drops data packets and sends route error packets (RERRs) to source nodes to find new routes. Much packet loss occurs until the routes are recovered. And traditional on-demand routing protocols are proposed for mobile ad hoc networks (MANETs). There can be some improvement in route recovery mechanism in CRAHNs. This thesis proposes a cluster-based link recovery mechanism (CLR) for AODV in CRAHNs. Different from the traditional method of route reestablishment, CLR recovers failed links locally and the original routes do not change. Because the original routes do not change, the data packets can be cached in the buffer. After the links are recovered, data packets can be sent. The amount of packet loss decreases. Furthermore, this thesis observes that if there is an intersection area of all PUs' radio coverage in the network, and there are some SUs in the area. No matter what channels these SUs choose, links between these SUs are apt to break. CLR can recover all link failures by using clustering method and effectively increases end-to-end throughput and successful packet delivery fraction. Kuo-Feng Ssu 斯國峰 2012 學位論文 ; thesis 35 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 國立成功大學 === 電腦與通信工程研究所 === 100 === In cognitive radio ad hoc networks (CRAHNs), link failures among secondary users (SUs) primarily result from sudden appearance of primary users (PUs). Many researches about routing protocols in CRAHNs apply on-demand routing protocols. They usually adopt the route recovery process of traditional on-demand routing protocols without modification in CRAHNs. In traditional route recovery process, nodes with link failure drops data packets and sends route error packets (RERRs) to source nodes to find new routes. Much packet loss occurs until the routes are recovered. And traditional on-demand routing protocols are proposed for mobile ad hoc networks (MANETs). There can be some improvement in route recovery mechanism in CRAHNs. This thesis proposes a cluster-based link recovery mechanism (CLR) for AODV in CRAHNs. Different from the traditional method of route reestablishment, CLR recovers failed links locally and the original routes do not change. Because the original routes do not change, the data packets can be cached in the buffer. After the links are recovered, data packets can be sent. The amount of packet loss decreases. Furthermore, this thesis observes that if there is an intersection area of all PUs' radio coverage in the network, and there are some SUs in the area. No matter what channels these SUs choose, links between these SUs are apt to break. CLR can recover all link failures by using clustering method and effectively increases end-to-end throughput and successful packet delivery fraction.
author2 Kuo-Feng Ssu
author_facet Kuo-Feng Ssu
Chih-ChiehTang
湯智傑
author Chih-ChiehTang
湯智傑
spellingShingle Chih-ChiehTang
湯智傑
A Cluster-based Link Recovery Mechanism for Spectrum Aware On-demand Routing in Cognitive Radio Ad Hoc Networks
author_sort Chih-ChiehTang
title A Cluster-based Link Recovery Mechanism for Spectrum Aware On-demand Routing in Cognitive Radio Ad Hoc Networks
title_short A Cluster-based Link Recovery Mechanism for Spectrum Aware On-demand Routing in Cognitive Radio Ad Hoc Networks
title_full A Cluster-based Link Recovery Mechanism for Spectrum Aware On-demand Routing in Cognitive Radio Ad Hoc Networks
title_fullStr A Cluster-based Link Recovery Mechanism for Spectrum Aware On-demand Routing in Cognitive Radio Ad Hoc Networks
title_full_unstemmed A Cluster-based Link Recovery Mechanism for Spectrum Aware On-demand Routing in Cognitive Radio Ad Hoc Networks
title_sort cluster-based link recovery mechanism for spectrum aware on-demand routing in cognitive radio ad hoc networks
publishDate 2012
url http://ndltd.ncl.edu.tw/handle/73131919527336284561
work_keys_str_mv AT chihchiehtang aclusterbasedlinkrecoverymechanismforspectrumawareondemandroutingincognitiveradioadhocnetworks
AT tāngzhìjié aclusterbasedlinkrecoverymechanismforspectrumawareondemandroutingincognitiveradioadhocnetworks
AT chihchiehtang zàigǎnzhīwúxiànsuíyìwǎnglùzhōngzhēnduìpínpǔrènzhīànxūlùyóudecóngjíshìliànjiéxiūfùjīzhì
AT tāngzhìjié zàigǎnzhīwúxiànsuíyìwǎnglùzhōngzhēnduìpínpǔrènzhīànxūlùyóudecóngjíshìliànjiéxiūfùjīzhì
AT chihchiehtang clusterbasedlinkrecoverymechanismforspectrumawareondemandroutingincognitiveradioadhocnetworks
AT tāngzhìjié clusterbasedlinkrecoverymechanismforspectrumawareondemandroutingincognitiveradioadhocnetworks
_version_ 1718067182780284928