淡江大學機構典藏:Item 987654321/100109
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62805/95882 (66%)
Visitors : 3984813      Online Users : 303
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/100109


    Title: An Optimal Scheduling Algorithm for Maximizing Throughput in WiMAX Mesh Networks
    Authors: Chang, Chih-Yung;Li, Ming-Hsien;Huang, Wen-Chuan;Lee, Shih-Chieh
    Contributors: 淡江大學資訊工程學系
    Keywords: 802.16 mesh networks;Dynamic programming;WiMAX;scheduling;spatial reuse
    Date: 2015-06
    Issue Date: 2015-01-28 11:07:43 (UTC+8)
    Publisher: America: Institute of Electrical and Electronics Engineers
    Abstract: The WiMAX mesh network (WMN) architecture is defined in the IEEE 802.16 standard for increasing network coverage and improving communication performance. In the past few years, several greedy or heuristic algorithms have been proposed to cope with the scheduling problem in WMNs. However, their performance highly depends on the network topology and bandwidth requests, and they do not achieve optimal performance in all cases. This paper proposes an optimal scheduling algorithm called the scheduling algorithm with dynamic programming approach (SADP), which exploits the opportunities of spatial reuse and maximizes the network throughput based on the network topology and the uplink bandwidth requests of each subscriber station. In addition, a heuristic scheduling algorithm (HSA) is proposed to reduce the computing complexity. The performance results were approximate to the optimal results. The simulation study reveals that the proposed SADP provides the WMN with maximal throughput and shortest transmission time, and the proposed HSA likely achieves the optimal results.
    Relation: IEEE Systems Journal 9(2), pp.542 - 555
    DOI: 10.1109/JSYST.2013.2271386
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    An Optimal Scheduling Algorithm for Maximizing Throughput in WiMAX Mesh Networks.pdf2424KbAdobe PDF1View/Open
    index.html0KbHTML298View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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