Chia Nan University of Pharmacy & Science Institutional Repository:Item 310902800/28487
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 16999/19305 (88%)
Visitors : 9749720      Online Users : 1267
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:

    Title: A multi-hop resource scheduling algorithm for IEEE 802.16j relay networks
    Authors: Liu, I-Hsien
    Liu, Chuan-Gang
    Lu, Chien-Tung
    Kuo, Yi-Tsen
    Li, Jung-Shian
    Contributors: 資訊多媒體應用系
    Keywords: EEE 802.16j
    Non-transparent relay
    Resource scheduling
    Zone boundary adjustment
    Date: 2014-07
    Issue Date: 2015-05-06 21:18:04 (UTC+8)
    Publisher: Elsevier Science Bv
    Abstract: The IEEE 802.16j standard defines both transparent and non-transparent relay transmission mode. The present study formulates and optimizes the relay resource scheduling problem for the case of a non-transparent relay network. It is shown that the resource scheduling problem is NP-Complete. A method is proposed for optimizing the position of the zone boundary adaptively during the resource scheduling process in order to maximize the system throughput. In addition, a low time complexity algorithm designated as MRRS (multi-hop relay resource scheduling) is proposed to obtain an approximate solution for the NP-Complete scheduling problem. In the proposed algorithm, the zone boundary is adjusted adaptively in accordance with the user distribution and the channel state information in such a way as to improve the utilization of the available slots. The simulation results show that MRRS achieves a higher throughput than existing relay resource scheduling algorithms (GenArgMax and Eliminate-Repeat) with no significant loss in fairness. In addition, it is shown that the performance improvement provided by MRRS increases as the hop-count is increased. (C) 2014 Elsevier B.V. All rights reserved.
    Appears in Collections:[Dept. of Applide Informatics & Multimedia] Periodical Articles

    Files in This Item:

    File Description SizeFormat

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

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback