Loading...
|
Please use this identifier to cite or link to this item:
https://nccur.lib.nccu.edu.tw/handle/140.119/75327
|
| Title: | Alternate hop-and-wait channel rendezvous method for cognitive radio networks |
| Authors: | Chuang, I.;Wu, H.-Y.;Lee, K.-R.;Kuo, Yau-Hwang
郭耀煌 |
| Contributors: | 資科系 |
| Keywords: | Alternating sequences;Asynchronous rendezvous;Blind rendezvous;Channel hopping;Cognitive radio network;Cognitive radio networks (CRNs);Common control channels;Emerging technologies;Cognitive radio;Radio systems;Problem solving |
| Date: | 2013-04 |
| Issue Date: | 2015-05-26 18:28:16 (UTC+8) |
| Abstract: | Cognitive Radio (CR) is an emerging technology developed to improve the utilization of licensed spectra, and a promising solution to alleviate the spectrum shortage problem. In cognitive radio networks (CRNs), if users want to establish communication links with neighbors, they need to rendezvous on an available channel. However, it is infeasible to employ a common control channel (CCC) in a licensed spectrum, because the CCC will be congested by primary users and degrade the performance of CRNs by the single point of failure problem. Therefore, the channel hopping (CH) based methods without CCC support are usually adopted to establish rendezvous in CRNs. This kind of rendezvous is called blind rendezvous and generally estimated by the following criteria: 1) asynchronous rendezvous support, 2) guaranteed rendezvous, 3) asymmetric model support, 4) multi-user/multi-hop scenario support, and 5) short time-to-rendezvous (TTR). Most existing blind rendezvous methods fail to fully satisfy these criteria or have considerable TTR which is significantly increased with the number of available channels. In this paper, the alternate hop-and-wait CH method is proposed to solve these problems. Furthermore, each user has a unique alternating sequence of HOP and WAIT modes. The theoretical analysis results have confirmed that the proposed method satisfies all evaluation criteria mentioned above and provides shorter TTR. According to simulation results, the performance of the proposed method even is two times better than Jump-Stay algorithm (JS), which is the most efficient blind rendezvous method as we know, under the asymmetric model which is much critical for CRNs. © 2013 IEEE. |
| Relation: | Proceedings - IEEE INFOCOM, 2013, 論文編號 6566861, 746-754, 32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013; Turin; Italy; 14 April 2013 到 19 April 2013; 類別編號CFP13INF-ART; 代碼 98902 |
| Data Type: | conference |
| DOI 連結: | http://dx.doi.org/10.1109/INFCOM.2013.6566861 |
| DOI: | 10.1109/INFCOM.2013.6566861 |
| Appears in Collections: | [資訊科學系] 會議論文
|
Files in This Item:
| File |
Description |
Size | Format | |
|---|
| index.html | | 0Kb | HTML2 | 1147 | View/Open |
|
All items in 政大典藏 are protected by copyright, with all rights reserved.
|
