Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Management / 管理學院
  3. Information Management / 資訊管理學系
  4. IEEE 802.11 無線網路免競爭期間允入控制之最佳化
 
  • Details

IEEE 802.11 無線網路免競爭期間允入控制之最佳化

Optimization of Call Admission Control in IEEE 802.11 WLAN Contention-Free Periods

Date Issued
2004
Date
2004
Author(s)
Shih, Hsiang-Teng
DOI
en-US
URI
http://ntur.lib.ntu.edu.tw//handle/246246/54256
Abstract
With the rise of the Internet, now many data transfer applications are essential to people’s daily life. In addition, wireless networks can support people’s mobility to access information regardless of where they are. Hence mobile communication has become a popular topic in today’s technology world. Due to the rapid growth of the wireless LAN market, the need of transmitting real-time and multimedia traffic, such as voice, images, video and …, etc, over wireless LAN will gradually increase. Therefore, the relevant Quality of Service (QoS) problem has also become a critical issue. However, as there are some inherent differences between wireless networks and traditional wired networks. So with this pre-determined condition, such as using CSMA/CA in its MAC protocol under IEEE 802.11, we will need more and more effective mechanism to provide QoS assurance. In this thesis, we bring up the concept of slotting the contention-free period in IEEE 802.11 WLAN. In addition, to be compatible with IEEE 802.11e, we consider four data frame types with different priorities. As a result, in the limited wireless spectrum resource, different slot allocation policy will generate results varying in revenue, throughput and QoS of the system. However, there is always a tradeoff between the users’ QoS requirement and the system revenue. Therefore, we hope to provide differentiated service while maximizing the long-term system revenue. We propose two mathematical models to solve the slot allocation problem in this thesis. The goal of our model is to find the best slot allocation policy to maximize the long-term system revenue under the capacity constraint. The main difference is the time type. The first model is continuous-time, while the second one is discrete-time. We apply Markovian Decision Process to deal with our problem due to the problem size and the structure of our model. According to the good computational results, we can successfully find the best slot allocation policy that maximizes the long-term system profit by Markovian Decision Process. Compared with the heuristics that venders often use, the policy we find has great improvement in the system revenue. Therefore, our model can indeed provide good decision for system venders and network planners.
Subjects
DiffServ
IEEE 802.11
服務品質保證
無線區域網路
允入控制
時槽分配
馬可夫決策過程
媒介存取控制協定
CSMA/CA
IEEE 802.11e
Time Slot Allocation
Quality of Service
Call Admission Control
WLAN
MAC Protocol
Markovian Decision Process
Type
other
File(s)
Loading...
Thumbnail Image
Name

ntu-93-R91725007-1.pdf

Size

23.31 KB

Format

Adobe PDF

Checksum

(MD5):5bb57213403313a2efce52b60e44ff9d

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(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