English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90451/105768 (86%)
Visitors : 11003893      Online Users : 451
RC Version 6.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://asiair.asia.edu.tw/ir/handle/310904400/9500

    Title: Throughput analysis of packet reservation multiple access protocol for wireless communications
    Authors: Jyu-Wei Wang
    Keywords: Markov chain;packet reservation multiple access;throughput;wireless communications
    Date: 1998-07
    Issue Date: 2010-05-12 09:11:38 (UTC+8)
    Publisher: Asia University
    Abstract: 封包預約式多重介入規約(PRMA)為一新提議之無線通信規約。此規約利用限制處於靜音狀態的使用者的傳送,以提高系統容量。在文獻上此規約已被分析,此分析是利用所謂的平衡點分析(EPA)方法,然而此種方法在負載高的時候可能產生多個平衡點,使得真正的系統狀態無法被唯一決定。因此我們利用二維馬可夫鏈(MarkovChain)的模型,來分析此規約的流通量(Throughput),在狀態轉變機率值求出之後,系統的平衡機率即可以決定,據此我們可以算出流通量。 It has been shown that the packet reservation multiple access (PRMA) protocol, originally proposedby D.J. Goodman et al. for wireless communications, can improve the user capacity by preventing usersfrom using resources during their silent gaps. In the literature, the protocol has been studied using themethod of equilibrium point analysis (EPA).However, this method may generate multiple equilibriumpoints in high load conditions, so that the exact behavior of the system cannot be determined uniquely.Thus, we introduce a two-dimensional Markov chain model to analyze in an approximate manner the PRMAprotocol. After the steady-state probabilities are found, the channel throughput can be uniquely determined.
    Relation: Proceedings of the NSC-Part A: Physical Science and Engineering 22(4): 497-503
    Appears in Collections:[光電與通訊學系] 期刊論文

    Files in This Item:

    File SizeFormat

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

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