政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/75327
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 113656/144643 (79%)
造访人次 : 51706789      在线人数 : 546
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻
    政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 >  Item 140.119/75327


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/75327


    题名: Alternate hop-and-wait channel rendezvous method for cognitive radio networks
    作者: Chuang, I.;Wu, H.-Y.;Lee, K.-R.;Kuo, Yau-Hwang
    郭耀煌
    贡献者: 資科系
    关键词: 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
    日期: 2013-04
    上传时间: 2015-05-26 18:28:16 (UTC+8)
    摘要: 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.
    關聯: 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
    数据类型: conference
    DOI 連結: http://dx.doi.org/10.1109/INFCOM.2013.6566861
    DOI: 10.1109/INFCOM.2013.6566861
    显示于类别:[資訊科學系] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML21165检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈