English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26994/38795
Visitors : 2386718      Online Users : 30
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/43988

Title: Ratio Adjustable Channel Hopping Enhancement for Heterogeneous Cognitive Radio Networks
Authors: Chih-Min Chao
Chia-Tsun Chen
Contributors: 國立臺灣海洋大學:資訊工程學系
NTOU:Department of Computer Science and Engineering
Keywords: Heterogeneous Cognitive Radio Networks
Rendezvous Problem
Channel Hopping
Date: 2017-05
Issue Date: 2017-11-09T01:46:24Z
Publisher: 5th IEEE International Workshop on Smart Communication Protocols and Algorithms (SCPA 2017)
Abstract: Abstract:In a cognitive radio network (CRN), a premise for two nodes to communicate is having a rendezvous which means that they switch to the same channel simultaneously. Most existing channel hopping solutions for the rendezvous problem is for a homogeneous CRN where nodes have the same type of cognitive radio and thus can sense the same spectrum. In reality, nodes have different types of cognitive radios and hence the spectrums being sensed are different. In such a heterogeneous CRN, designing a channel hopping mechanism to provide rendezvous guarantee is challenging. Besides, while determining the channel hopping sequences, existing channel hopping protocols enable nodes to switch to different channels with predefined channel hopping sequences. Such mechanisms are suboptimal since they do not consider different channel conditions. In this paper, we propose a ratio adjustable channel hopping protocol (RACH) for heterogeneous CRNs. RACH provides rendezvous guarantee between any pair of nodes and enables a node to dynamically adjust the ratio of each channel being used. Nodes running RACH use three consecutive odd numbers to determine the schedule for a particular channel. Utilizing the property that two different sets of three consecutive odd numbers are relatively primes, RACH provides rendezvous guarantee for two nodes on each channel. RACH allows nodes to change the set of consecutive odd numbers to adjust the ratio of a channel being switched to. Such a mechanism enables a node to tune to a better channel more frequently to enhance its rendezvous probability to other nodes. Simulation results verify that RACH improves network performance in terms of time to rendezvous and throughput when compared with an existing channel hopping protocol for heterogeneous CRNs.
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/43988
Appears in Collections:[資訊工程學系] 演講及研討會

Files in This Item:

File Description SizeFormat
index.html0KbHTML40View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback