English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69561/69561 (100%)
Visitors : 23100470      Online Users : 434
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: http://ir.lib.ncu.edu.tw/handle/987654321/29126

    Title: Multirate Throughput Optimization With Fairness Constraints in Wireless Local Area Networks
    Authors: Kuo,YL;Lai,KW;Lin,FYS;Wen,YF;Wu,EHK;Chen,GH
    Contributors: 資訊工程研究所
    Date: 2009
    Issue Date: 2010-06-29 20:14:20 (UTC+8)
    Publisher: 中央大學
    Abstract: In 802.11-based wireless local area networks (WLANs), it is difficult to simultaneously attain both high throughput and fairness for multirate traffic. There is a performance anomaly when there are stations whose data rates are much lower than the other stations, in which the aggregate throughput of the high-rate stations drastically degrades. The problem of maximizing the total throughput while maintaining time fairness among the competing stations was studied previously by the same authors. However, our previous solution sacrificed the throughput of low-rate stations. In this paper, we extend our previous work by solving the same optimization problem while maintaining both time fairness and throughput fairness. The optimization problem is formulated as a mixed-integer nonlinear programming problem. The two fairness constraints are maintained by means of changing the channel access probability and transmission time among the competing stations, which can be realized by adjusting their minimum contention window sizes and medium access control (MAC) frame sizes, respectively. A penalty function accompanied with a gradient-based approach is used to solve the problem, and its effectiveness is verified by computational experiments. The proposed solution is also compared with our previous solution in terms of convergence speed and total throughput.
    Appears in Collections:[資訊工程研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    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 ©   - Feedback  - 隱私權政策聲明