中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/105990
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81686048      Online Users : 3974
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


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


    Title: A fast rendezvous channel-hopping algorithm for cognitive radio networks
    Authors: 張貴雲;CHANG, Guey-Yun;HUANG, Jen-Feng
    Contributors: 資訊電機學院資訊工程學系
    Keywords: Adaptation models;Applied sciences;asynchronous transfer mode;Availability;Cognitive radio;Cognitive science;distributed algorithms;Exact sciences and technology;Indexes;Measurement;Radio networks;Radiocommunication specific techniques;Radiocommunications;Sensors;Systems, networks and services of telecommunications;Telecommunications;Telecommunications and information theory;Transmission and modulation (techniques and equipments)
    Date: 2013-06-17
    Issue Date: 2026-04-23 13:03:00 (UTC+8)
    Publisher: Institute of Electrical and Electronics Engineers Inc.;New York, NY: IEEE
    Abstract: 摘要: Cognitive radio networks (CRNs) have emerged as a critical technique to enhance the utilization of licensed channels. In CRNs, each secondary user (SU) should not interfere the co-locate incumbent networks. For this purpose, before data transmission, SUs should rendezvous on an available channel (i.e., idle and licensed channel) for establishing a link or exchanging control information. However, implementation of rendezvous is challenging since SUs are not aware of the presence of each other before rendezvous and available channels sensed by each SU may be different. In this paper, we proposed a fast rendezvous channel hopping algorithm (FRCH), which can guarantee rendezvous within 2N 2 + N timeslots under asynchronous environments, where N denotes the number of licensed channels in a CRN.
    其他題名: COML
    出版者: New York, NY: IEEE
    出版日期: 2013-07-01
    出處: IEEE communications letters, 2013-07, Vol.17 (7), p.1475-1478
    資源來源: IEEE Electronic Library (IEL)
    版權: 2014 INIST-CNRS
    版權: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2013
    識別號: ISSN: 1089-7798
    識別號: EISSN: 1558-2558
    識別號: DOI: 10.1109/LCOMM.2013.060513.130471
    識別號: CODEN: ICLEF6
    Appears in Collections:[Department of Computer Science and information Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML9View/Open


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

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明