中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/106135
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81688103      Online Users : 3814
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/106135


    Title: Unified Opportunistic Scheduling for Layered Multicast over Cognitive Radio Networks
    Authors: 黃志煒;Polacek, Pavol;Huang, Chih-Wei;Chiang, Jia-Wei
    Contributors: 資訊電機學院通訊工程學系
    Keywords: Algorithms;Bandwidth;Cognitive radio;cross-layer optimization;Efficiency;Indexes;layered multicast;Mobile computing;Mud;Multicast;Multimedia communication;Multiuser detection;multiuser diversity;Networks;opportunistic multicasting;Scheduling;Signal to noise ratio;Throughput;Utilities
    Date: 2016-10-01
    Issue Date: 2026-04-23 13:09:52 (UTC+8)
    Publisher: Institute of Electrical and Electronics Engineers Inc.;Los Alamitos: IEEE
    Abstract: 摘要: We investigate the multicast of layered multimedia content in single hop cognitive radio (CR) networks and ways of improving the subscriber utility. The proposed unified opportunistic scheduling (UOS) aggressively utilizes diversity potential present in CR by exploiting two types of multiuser diversity (MUD), one between multicast groups and another between data stream subscribers in a group. As a result, the resource usage efficiency is significantly increased, and better utility can be achieved. According to derived effective average subscriber throughput under unified MUD, a scheduling algorithm is designed to approach the theoretical throughput improvement. We specifically introduce controlled competition between multicast groups to balance the increasing resource efficiency and the risk of overstretching the limited available spectrum. The algorithm combines prioritization, rateless coding, and data fragmentation to inherently cope with dynamic spectrum availability in CR. The presented simulation results show improved performance in various situations in comparison to other schemes not taking full advantage of the present MUD potential.
    其他題名: TMC
    出版者: Los Alamitos: IEEE
    出版日期: 2016-10-01
    出處: IEEE transactions on mobile computing, 2016-10, Vol.15 (10), p.2627-2639
    資源來源: IEEE Electronic Library (IEL)
    版權: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
    識別號: ISSN: 1536-1233
    識別號: EISSN: 1558-0660
    識別號: DOI: 10.1109/TMC.2015.2499188
    識別號: CODEN: ITMCCJ
    Appears in Collections:[Department of Communication Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML32View/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 ©   - 隱私權政策聲明