Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Management / 管理學院
  3. Information Management / 資訊管理學系
  4. System throughput maximization subject to delay and time fairness constraints in 802.11 WLANs
 
  • Details

System throughput maximization subject to delay and time fairness constraints in 802.11 WLANs

Resource
Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on
Journal
Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on
Pages
-
Date Issued
2005-07
Date
2005-07
Author(s)
Wen, Yean-Fu
Lin, F.Y.S.
YEONG-SUNG LIN  
DOI
10.1109/ICPADS.2005.273
DOI
1521-9097
URI
http://ntur.lib.ntu.edu.tw//handle/246246/200704191001395
Abstract
It is difficult to achieve a trade off between system throughput fairness and channel access time fairness in 802.11 wireless local area networks (WLANs). The reason is that, under the multiple rate wireless protocol, a lower bit rate host penalizes hosts that use a higher bit rate with throughput fairness. In this paper, we propose a contention-based MAC (media access control) protocol for data communications in WLANs that achieves access time near-fairness and maximizes the aggregate throughput with simultaneous delay bound. Our suggested parameter values would help manufacturers and carriers of protocol configurations improve system throughput. This approach utilizes initial contention windows, packet size, and multiple back-to-back packets as decision variables. To evaluate our approach, we use an extended analytical model, which has been shown to be a non-linear dynamic integer problem. However, the experiment results show that a packet's size and initial contention windows form a simple unimodal distribution to achieve access time near-fairness, which tends to maximize the packet's size and increase the initial contention windows. Thus, we use a simple binary search to determine the composition of the initial contention windows, packet size, and multiple back-to-back packets. The system throughput increases as the number of packets in a block increases, but the delay also monotonically increases. We therefore consider the delay bound in order to limit the number of packets in a block. To evaluate our model, we use NS2 as a simulation tool. The results show that our model is accurate and that system throughput is maximized, subject to delay and time fairness.
SDGs

[SDGs]SDG16

Type
other
File(s)
Loading...
Thumbnail Image
Name

01531211.pdf

Size

285.16 KB

Format

Adobe PDF

Checksum

(MD5):bfdc585dfe72046577ed084de1c60cc1

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science