Matrix-based channel hopping algorithms for cognitive radio networks

NCU Institutional Repository > 資訊電機學院 > 資訊工程學系 > 期刊論文 > Item 987654321/106989

請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/106989

題名:	Matrix-based channel hopping algorithms for cognitive radio networks
作者:	張貴雲;Chang, Guey-Yun;Huang, Jen-Feng;Wang, Yao-Shian
貢獻者:	資訊電機學院資訊工程學系
關鍵詞:	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
日期:	2015-05-01
上傳時間:	2026-04-23 13:52:13 (UTC+8)
出版者:	Institute of Electrical and Electronics Engineers Inc.;New York: IEEE
摘要:	摘要： 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
顯示於類別:	[資訊工程學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	11	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing

資料載入中.....