Matrix-based channel hopping algorithms for cognitive radio networks

NCUIR > College of Electrical Engineering & Computer Science > Department of Computer Science and information Engineering > journal & Dissertation > Item 987654321/106989

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/106989

Title:	Matrix-based channel hopping algorithms for cognitive radio networks
Authors:	張貴雲;Chang, Guey-Yun;Huang, Jen-Feng;Wang, Yao-Shian
Contributors:	資訊電機學院資訊工程學系
Keywords:	Algorithms;Asynchronous;Availability;Channel hopping;Channel models;Channels;Cognitive radio;Data communication;Distributed algorithms;Indexes;Licenses;Loading;Networks;Radio networks;Rendezvous;Shortages;Synchronization;Time synchronization;Wireless communication
Date:	2015-05-01
Issue Date:	2026-04-23 13:52:13 (UTC+8)
Publisher:	Institute of Electrical and Electronics Engineers Inc.;New York: IEEE
Abstract:	摘要： Cognitive radio networks (CRNs) have emerged as a critical technique for solving spectrum shortage problems and enhancing the utilization of licensed channels. To prevent interference with the co-locate incumbent networks, before data transmission, nodes in CRNs should rendezvous on an available channel (i.e., idle licensed channel) for establishing a link or exchanging control information. However, implementing rendezvous is challenging because the availability of channels is time-varying and position-varying. For reducing rendezvous failure and increasing throughput, a node pair in CRN should be able to rendezvous on every licensed channels (i.e., maximizing rendezvous diversity) and rendezvous on an available channel as soon as possible (i.e., minimizing maximum conditional time to rendezvous (MCTTR)). Besides, to take full advantage of the frequency diversity of multi-channel medium access, rendezvous should be spread out in time and channel (i.e., minimizing channel loading). In this paper, we propose two rendezvous channel hopping algorithms, T-CH and D-CH, which can be used without time synchronization and role pre-assignment (each node has a pre-assigned role as either a sender or a receiver). D-CH requires that SUs in CRNs should have a unique ID (identifier), while T-CH does not. Both our T-CH and D-CH have maximum rendezvous diversity and minimum channel loading, and outperform in terms of MCTTR. 其他題名： TWC 出版者： New York: IEEE 出版日期： 2015-05 出處： IEEE transactions on wireless communications, 2015-05, Vol.14 (5), p.2755-2768 資源來源： IEEE Electronic Library (IEL) 版權： Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) May 2015 識別號： ISSN: 1536-1276 識別號： EISSN: 1558-2248 識別號： DOI: 10.1109/TWC.2015.2392121 識別號： CODEN: ITWCAX
Appears in Collections:	[Department of Computer Science and information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	11	View/Open

社群 sharing

Loading...